路径规划算法总览

* 持续更新中

	算法	时间	详解
Search-based Planning	Breadth-First Searching (BFS)
	Depth-Firrst Searching (DFS)
	Best-First Searching		Best-First Searching
	Dijkstra	1959	Dijkstra
	A*	1968	A*
	Bidirectional A*		Bidirectional A*
	Anytime Repairing A*		Anytime Repairing A*
	Learning Real-time A* (LRTA*)
	Real-time Adaptive A* (RTAA*)
	Lifelong Planning A* (LPA*)
	Dynamic A* (D*)
	D* Lite
	Anytime D*
Sampling-based Planning	RRT
	RRT-Connect
	Extended-RRT
	Dynamic-RRT
	RRT*
	Informed RRT*
	RRT* Smart
	Anytime RRT*
	Closed-Loop RRT*
	Spline-RRT*
	Fast Matching Trees (FMT*)
	Batch Informed Trees (BIT*)

参考 ：路径规划算法图例