Hybrid A* Planner
|
![]() ![]() | The namespace that wraps constants.h |
![]() ![]() | The namespace that wraps helper.h |
![]() ![]() | The namespace that wraps the entire project |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | A structure describing the relative position of the occupied cell based on the center of the vehicle |
![]() ![]() ![]() ![]() | A structure capturing the lookup for each theta configuration |
![]() ![]() ![]() ![]() | A structure to express colors in RGB values |
![]() ![]() ![]() | A class that encompasses the functions central to the search |
![]() ![]() ![]() | Priority queue for integer coordinates with squared distances as priority |
![]() ![]() ![]() | Determines whether a given configuration q of the robot will result in a collision with the environment |
![]() ![]() ![]() | A DynamicVoronoi object computes and updates a distance map and Voronoi diagram |
![]() ![]() ![]() ![]() | |
![]() ![]() ![]() | A color gradient class for visualizing the cost of nodes |
![]() ![]() ![]() ![]() | |
![]() ![]() ![]() | A two dimensional node class used for the holonomic with obstacles heuristic |
![]() ![]() ![]() | A three dimensional node class that is at the heart of the algorithm |
![]() ![]() ![]() | A class for tracing and visualizing the path generated by the Planner |
![]() ![]() ![]() | A class that creates the interface for the hybrid A* algorithm |
![]() ![]() ![]() | |
![]() ![]() ![]() | This class takes a path object and smoothes the nodes of the path |
![]() ![]() ![]() | A class describing a simple 2D vector |
![]() ![]() ![]() | A class for visualizing the hybrid A* search |
![]() ![]() | A structure to sort nodes in a heap structure |