Use of relaxation methods in sampling-based algorithms for optimal motion planning

Several variants of incremental sampling-based algorithms have been recently proposed in order to optimally solve motion planning problems. Popular examples include the RRT* and the PRM* algorithms. These algorithms are asymptotically optimal and thus provide high quality solutions. However, the con...

Celý popis

Podrobná bibliografia

Vydané v:	2013 IEEE International Conference on Robotics and Automation s. 2421 - 2428
Hlavní autori:	Arslan, Oktay, Tsiotras, Panagiotis
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2013
Predmet:	Boundary conditions Classification algorithms Convergence Costs Directed graphs Heuristic algorithms Planning Relaxation methods Robots Space exploration
ISBN:	1467356417, 9781467356411
ISSN:	1050-4729
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!