A convergent dynamic window approach to obstacle avoidance

Petter Ögren, Naomi Ehrich Leonard

Research output: Contribution to journalArticlepeer-review

184 Scopus citations

Abstract

The dynamic window approach (DWA) is a well-known navigation scheme developed by Fox et al. and extended by Brock and Khatib. 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 by merging the ideas of the DWA with the convergent, but less performance-oriented, scheme suggested by Rimon and Koditschek. Viewing the DWA as a model predictive control (MPC) method and using the control Lyapunov function (CLF) framework of Rimon and Koditschek, we draw inspiration from an MPC/CLF framework put forth by Primbs to propose a version of the DWA that is tractable and convergent.

Original languageEnglish (US)
Pages (from-to)188-195
Number of pages8
JournalIEEE Transactions on Robotics
Volume21
Issue number2
DOIs
StatePublished - Apr 1 2005

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Keywords

  • Lyapunov function
  • Mobile robots
  • Model predictive control (MPC)
  • Navigation function (NF)
  • Obstacle avoidance
  • Receding horizon control (RHC)
  • Robot control

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

Cite this