Skip to content
/ WPN Public

A novel hybrid planning algorithm with competitive results against A*, as well as other ML approaches.

Notifications You must be signed in to change notification settings

h2jaafar/WPN

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

61 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Waypoint Planning Networks (WPN)

coverage report

Introduction - WPN

Waypoint Planning Networks (WPN) is a hybrid planning algorithm, submitted to the CRV2021 conference. WPN, a hybrid algorithm based on LSTMs with a local kernel—a classic algorithm such as A*, and a global kernel using a learned algorithm. WPN produces a more computationally efficient and robust solution. Experimental results outline the benefits of WPN, both in efficiency and generalization. It is shown that WPN’s search space is considerably less than A*, while being able to generate near optimal results. Additionally, WPN works on partial maps, unlike A* which needs the full map in advance. This repository is a combination of WPN algorithm, it's varients, and PathBench, a benchmarking framework with support for machine learning algorithms.


You can watch the submission video here (Right click, and open in new tab):

Hardware

It is recommended that you have a capable system with a GPU. For the paper, the following hardware was used:

For Table 1

Intel Core i7-6500U CPU @ 2.50GHz × 4 w/ 12GB RAM
Nvidia GeForce 940M GPU

For Table 2
Intel Silver 4216 Cascade Lake @ 2.1GHz x 32 cores w/ 128GB RAM
Nvidia V100 Volta GPU

PathBench

PathBench is a motion planning platform used to develop, assess, compare and visualise the performance and behaviour of path planners. The platform is split into four main components: Simulator, Generator, Trainer and Analyzer.

The current PathBench version implemented with WPN is an older one. Feel free to check out the newer version of PathBench here: PathBench 3D.

That repo also contains an updated WPN model, trained on 45k maps.

CNPP and VIN

Two algorithms, CNPP and VIN, compared in the paper against WPN are not present in this repo. To access those implementations, please see: CNPP VIN

Further PathBench architecture is described below the quick start guide.

Quick Start Guide

To test WPN for yourself, simply follow these instructions.

  1. Clone this repository, using
    git clone https://github.com/husseinalijaafar/WPN.
  2. cd to WPN/ and run
    pip install -r requirements.txt
  3. cd to WPN/src/ and run: python3 main_gui.py
  4. Select from the simulator dropdowns the algorithm, maps, and debug level you require. Then simply run, and the simulator window will pop up.

If you encounter any issues, please feel free to email me at, husseinali.jaafar@ryerson.ca.

For more commands and common, see below.

Simulator

This section is responsible for environment interactions and algorithm visualisation. It provides custom collision detection systems and a graphics framework for rendering the internal state of the algorithms. Additionally, the platform provides a ROS real-time extension for interacting with a real-world robot through PathBench.

The simulator has a custom GUI that can be used to modify the master launch configuration.

PathBench Simulator Configuration

To run the simulator from the GUI, cd into src/, and execute the following command in a terminal window:

python3 main_gui.py

Simulator Commands

Key Action
escape Exit the simulator
c Find the path between the agent and goal
mouse left click Moves agent to mouse location
mouse right click Moves goal to mouse location
s Stop trace animation (animations required)
r Resume trace animation,(animations required)
mouse hover Displays hovered cell coordinates (debug level >= Medium)
p Take screenshot (the screenshot is placed in resources directory)
up arrow Moves agent up (depends on agent speed)
left arrow Moves agent left (depends on agent speed)
down arrow Moves agent down (depends on agent speed)
right arrow Moves agent right (depends on agent speed)
m Toggle map between Sparse and Dense

Trainer This section is responsible for generating and labelling the training data used to train the Machine Learning models. To run the trainer, use the runtrainer.py script in src. Modify the required hyperparameters (sim_start,gen_start,train_start), the algorithm you want to train, and the training_data you want to generate. The training pipeline is dependant on training data generated from the generator. Note, you must also create a folder named cache in src>resources in order for the trainer to function correctly.

Generator This section is a class wrapper over the third party Machine Learning libraries. It provides a generic training pipeline based on the holdout method and standardised access to the training data.

Analyzer Analyzer. The final section manages the statistical measures used in the practical assessment of the algorithms. Custom metrics can be defined as well as graphical displays for visual interpretations.

ROS Real-time Extension. The extension provides real-time support for visualisation, coordination and interaction with a physical robot. The ros extension subscribes to odom readings from the robot, and will publish velocity commands. More complete simulations will be provided at a later date.

Example Real Trajectory

Trajectory Start

Trajectory Finish

Architecture High Overiew

Platform Architecture

Infrasturcture

The MainRunner component is the main entry point of the platform and it coordinates all other sections. The MainRunner takes a master Configuration component as input which represents the main inflexion point of the platform. It describes which section (Simulator, Generator, Trainer, Analyser) should be used and how.

The Services component is a bag of Service components which is injected into all platform classes in order to maintain global access to the core libraries1. A Service component is created for most external libraries to encapsulate their APIs and provide useful helper functions2. Moreover, by making use of the Adapter Pattern we can easily switch third party libraries, if needed, and the code becomes more test friendly. Finnaly, the Services container can be mocked together with all its Service components, thus avoiding rendering, file writing and useless printing.

The Simulator was build by following the Model-View-Controller (MVC) pattern. The Model represents the logic part, the View renders the Model and the Controller handles the input from the keyboard and mouse, and calls the appropriate functions from the associated Model.

The EventManager component is a communication service which allows the Model to update the View as there is no direct connection between them (from Model to View, the other way is).

The Debug component is a printing service which augments printing messages with different decorators such as time-stamp and routes the messages to a specified IO stream or standard out. It also provides a range of debugging/printing modes: None (no information), Basic (only basic information), Low (somewhat verbose), Medium (quite verbose), High (all information). The RenderingEngine component is a wrapper around the pygame library and all rendering is routed through it.

The Torch service is not an actual wrapper around pytorch, but instead it defines some constants such as the initial random seed and the training device (CPU/CUDA).

The Resources service is the persistent storage system. It is a container of Directory components which represent an interface over the actual filesystem directories. It provides safe interaction with the filesystem and a range of utility directories: Cache (temporary storage used for speeding second runs), Screenshots, Maps (stores all user defined and generated maps), Images (stores images which can be converted to internal maps), Algorithms (stores trained machine learning models), Training Data (stores training data for machine learning models). The main serialisation tool is dill which is a wrapper around pickle with lambda serialisation capabilities, but custom serialisation is allowed such as tensor serialisation provided by pytorch or image saving by pygame.

The AlgorithmRunner manages the algorithm session which contains the Algorithm, BasicTesting and Map. The AlgorithmRunner launches a separate daemon thread that is controlled by a condition variable. When writing an Algorithm, special key frames can be defined (e.g. when the trace is produced) to create animations. Key frames release the synchronisation variable for a brief period and then acquire it again, thus querying new rendering jobs.

The Utilities section provides a series of helper methods and classes: Maps (holds in-memory user defined Map components), Point, Size, Progress (progress bar), Timer, MapProcessing (feature extractor used mainly in ML sections).

Master Load Configuration

Configuration Field Type Description
load_simulator bool If the simulator should be loaded
clear_cache bool If the cache should be deleted after the simulator is finished
simulator_graphics bool If graphics should be used or not; evaluation is always done without graphics
simulator_grid_display bool The map can be visualised as a plain image or a grid; the window size is defined based on the choice
simulator_initial_map Map The map used in AlgorithmRunner service
simulator_algorithm_type Type[Algorithm] The algorithm type used in AlgorithmRunner service
simulator_algorithm_parameters Tuple[List[Any], Dict[str, Any]] The algorithm parametrs in the form of *args and **kwargs which are used in AlgorithmRunner service
simulator_testing_type Type[BasicTesting] The testing type used in AlgorithmRunner service
simulator_key_frame_speed int The refresh rate interval during each key frame; a value of 0 disables the key frames
simulator_key_frame_skip int How many key frames are skipped at a time; used to speed up the animation when frames per second are low
simulator_write_debug_level DebugLevel The debugging level (None, Basic, Low, Medium, High)
generator bool If the generator should be loaded
generator_gen_type str Generation type; can choose between "uniform_random_fill", "block_map" and "house"
generator_nr_of_examples int How many maps should be generated; 0 does not trigger generation
generator_labelling_atlases List[str] Which Map Atlases should be converted to training data
generator_labelling_features List[str] Which sequential features should be extracted for training conversion
generator_labelling_labels List[str] Which sequential labels should be extracted for training conversion
generator_single_labelling_features List[str] Which single features should be extracted for training conversion
generator_single_labelling_labels List[str] Which single labels should be extracted for training conversion
generator_aug_labelling_features List[str] Which sequential features should be augmented for training data defined by generator_labelling_atlases
generator_aug_labelling_labels List[str] Which sequential labels should be augmented for training data defined by generator_labelling_atlases
generator_aug_single_labelling_features List[str] Which single features should be augmented for training data defined by generator_labelling_atlases
generator_aug_single_labelling_labels List[str] Which single labels should be augmented for training data defined by generator_labelling_atlases
generator_modify Callable[[Map], Map] Modifies the given map using the custom function
trainer bool If the trainer should be loaded
trainer_model Type[MLModel] The model which will be trained
trainer_custom_config Dict[str, Any] If a custom configuration should augment the MLModel configuration
trainer_pre_process_data_only bool If the trainer should only pre-process data and save it; it does not overwrite cache
trainer_bypass_and_replace_pre_processed_cache bool If pre-processed data cache should be bypassed and re-computed

About

A novel hybrid planning algorithm with competitive results against A*, as well as other ML approaches.

Resources

Stars

Watchers

Forks

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages