Skip to Main content Skip to Navigation
Journal articles

Reliable robust path planning

Abstract : This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for nonholonomic path planning in robotics.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00374571
Contributor : Michel Kieffer <>
Submitted on : Thursday, April 9, 2009 - 9:27:45 AM
Last modification on : Wednesday, April 8, 2020 - 3:24:30 PM
Document(s) archivé(s) le : Thursday, June 10, 2010 - 6:18:15 PM

File

ACMS_PKW08.pdf
Files produced by the author(s)

Identifiers

Citation

R. Pepy, Michel Kieffer, E. Walter. Reliable robust path planning. International Journal of Applied Mathematics and Computer Science, University of Zielona Góra 2009, 19 (3), pp.413-424. ⟨10.2478/v10006-009-0034-2⟩. ⟨hal-00374571⟩

Share

Metrics

Record views

313

Files downloads

209