Change search
ReferencesLink to record
Permanent link

Direct link
Path planning using probabilistic cell decomposition
KTH, Superseded Departments, Signals, Sensors and Systems.
2004 (English)In: 2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, 467-472 p.Conference paper (Refereed)
Abstract [en]

In this paper we present a new approach to path planning in high-dimensional static configuration spaces. The concept of cell decomposition is combined with probabilistic sampling to obtain a method called Probabilistic Cell Decomposition (PCD). The use of lazy evaluation techniques and supervised sampling in important areas leads to a very competitive path planning method. It is shown that PCD is probabilistic complete. PCD is easily scalable and applicable to many different kinds of problems. Experimental results show that PCD performs well under various conditions. Rigid body movements, maze like problems as well as path planning problems for chain-like robotic platforms have been solved successfully using the proposed algorithm.

Place, publisher, year, edition, pages
2004. 467-472 p.
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-44358DOI: 10.1109/ROBOT.2004.1307193ISI: 000221794800074ScopusID: 2-s2.0-3042619149ISBN: 0-7803-8232-3OAI: diva2:450895
IEEE International Conference on Robotics and Automation Location: New Orleans, LA Date: APR 26-MAY 01, 2004
QC 20111024Available from: 2011-10-24 Created: 2011-10-20 Last updated: 2011-10-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lingelbach, Frank
By organisation
Signals, Sensors and Systems
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 20 hits
ReferencesLink to record
Permanent link

Direct link