A set-based global dynamic window algorithm for robust and safe mobile robot path planning

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Beitragende

Abstract

In recent papers we proposed a novel approach for mobile robot localization based on set theoretic methods. In this paper we complete this set-based approach by introducing a novel set-based mobile robot path planning algorithm, which can handle the outputs of the set-based localization. In opposite to most known path planning algorithms the approach considers not only kinematic and dynamic constraints of the robot but also noisy measurements from its employed sensors. Realistic simulation experiments validate the effectiveness of the proposed approach.

Details

OriginalspracheEnglisch
TitelJoint 41st International Symposium on Robotics and 6th German Conference on Robotics 2010, ISR/ROBOTIK 2010
Seiten452-458
Seitenumfang7
PublikationsstatusVeröffentlicht - 2010
Peer-Review-StatusJa

Publikationsreihe

ReiheInternational Symposium on Robotics and German Conference on Robotics (ISR/ROBOTIK)
Band1

Konferenz

TitelJoint 41st International Symposium on Robotics, ISR 2010 and 6th German Conference on Robotics 2010, ROBOTIK 2010
Dauer7 - 9 Juni 2010
StadtMunich
LandDeutschland

Externe IDs

Scopus 84881427906

Schlagworte

Schlagwörter

  • path planning