---

fdp.h File Reference

#include <queue>
#include <vector.h>
#include "marray.h"
#include "planner.h"
#include "tree.h"
#include "util.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

---

Define Documentation

#define COLLISION   2

#define GOAL   4

#define UNVISITED   0

#define VISITED   1

#define VISITED2   3

---

Web page maintained by Steve LaValle
Partial support provided by NSF CAREER Award IRI-970228 (LaValle), Honda Research.
Contributors: Anna Atramentov, Peng Cheng, James Kuffner, Steve LaValle, and Libo Yang.