Survey of Robot 3D Path Planning Algorithms

Table 3

Analysis of node based optimal algorithms.

Method type	Shortcoming		Advantages
	Shortcomings	Improvement
Dijkstra’s algorithm	High time complexity	[22, 23, 48–52]	Easy to implement for various environments
	Static threat only	[23, 52]
A	Heavy time burden	[48, 50, 51]	Fast searching ability, enabling implementation on-line
	Nonsmoothness	[50, 53]
	Static threat only	[23, 52, 54]
D	Unrealistic distance	[55, 56]	Fast searching ability, dealing with dynamic environments