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

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

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

Original languageEnglish
Title of host publicationJoint 41st International Symposium on Robotics and 6th German Conference on Robotics 2010, ISR/ROBOTIK 2010
Pages452-458
Number of pages7
Publication statusPublished - 2010
Peer-reviewedYes

Publication series

SeriesInternational Symposium on Robotics and German Conference on Robotics (ISR/ROBOTIK)
Volume1

Conference

TitleJoint 41st International Symposium on Robotics, ISR 2010 and 6th German Conference on Robotics 2010, ROBOTIK 2010
Duration7 - 9 June 2010
CityMunich
CountryGermany

External IDs

Scopus 84881427906

Keywords

Keywords

  • path planning