A provably convergent dynamic window approach to obstacle avoidance

Petter Ögren, Naomi E. Leonard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

The dynamic window approach is a well known navigation scheme developed in Fox et al. (1997) and extended in Brock and Khatib (1999). It is safe by construction and has been shown to perform very efficiently in experimental setups. However, one can construct examples where the proposed scheme fails to attain the goal configuration. What has been lacking is a theoretical treatment of the algorithm's convergence properties. Here we present such a treatment. Furthermore, we highlight the similarity between the Dynamic Window Approach and the Control Lyapunov Function and Receding Horizon Control synthesis put forth by Primbs et al. (1999). Inspired by these similarities we propose a version of the Dynamic Window Approach that is provably convergent.

Original languageEnglish (US)
Title of host publicationIFAC Proceedings Volumes (IFAC-PapersOnline)
EditorsGabriel Ferrate, Eduardo F. Camacho, Luis Basanez, Juan. A. de la Puente
PublisherIFAC Secretariat
Pages115-120
Number of pages6
Edition1
ISBN (Print)9783902661746
DOIs
StatePublished - 2002
Externally publishedYes
Event15th World Congress of the International Federation of Automatic Control, 2002 - Barcelona, Spain
Duration: Jul 21 2002Jul 26 2002

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1
Volume15
ISSN (Print)1474-6670

Other

Other15th World Congress of the International Federation of Automatic Control, 2002
Country/TerritorySpain
CityBarcelona
Period7/21/027/26/02

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Keywords

  • Lyapunov function
  • Mobile robots
  • Obstacle avoidance
  • Predictive control

Fingerprint

Dive into the research topics of 'A provably convergent dynamic window approach to obstacle avoidance'. Together they form a unique fingerprint.

Cite this