#include <queue>#include <vector>#include "marray.h"#include "planner.h"#include "tree.h"#include "vector.h"#include "defs.h"#include "mslio.h"Go to the source code of this file.
Compounds | |
| class | FDP |
| A dynamic programming approach to nonholonomic planning, as proposed by Barraquand, Latombe, Algorithmica 10:6, pp. 121-155, 1993. More... | |
| class | FDPBestFirst |
| Best first search variant, using the Metric in Problem. More... | |
| class | FDPBi |
| A bidirectional version of forward dynamic programming. More... | |
| class | FDPStar |
| An A-Star search variant. The Metric in Problem is used as the cost. More... | |
Defines | |
| #define | UNVISITED 0 |
| #define | VISITED 1 |
| #define | COLLISION 2 |
| #define | VISITED2 3 |
| #define | GOAL 4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|