Non-Holonomic Path Planning Using a Quasi-Random PRM Approach - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2002

Non-Holonomic Path Planning Using a Quasi-Random PRM Approach

Abstract

The aim of this article is to compare experimentally the use of quasi-random sampling techniques for nonholonomic path planning. The experiments are evaluated in the context of the probabilistic roadmap methods (PRM). Two quasi-random variants of PRM-based planners are proposed: (1) a classical PRM with quasi-random sampling, and (2) a quasi-random lazy-PRM. Both have been implemented for car-like robots, and are shown through experimental results to offer some performance advantages in comparison to their randomized counterparts.

Domains

Automatic
No file

Dates and versions

lirmm-00268562 , version 1 (01-04-2008)

Identifiers

Cite

Abraham Sánchez Lopez, Abraham Arenas B., René Zapata. Non-Holonomic Path Planning Using a Quasi-Random PRM Approach. IROS: Intelligent Robots and Systems, 2002, Lausanne, Switzerland. pp.2305-2310, ⟨10.1109/IRDS.2002.1041611⟩. ⟨lirmm-00268562⟩
66 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More