Change search
ReferencesLink to record
Permanent link

Direct link
A tractable convergent dynamic window approach to obstacle avoidance
KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.ORCID iD: 0000-0002-7714-928X
2002 (English)Conference paper (Refereed)
Abstract [en]

The dynamic window approach is a well known navigation scheme developed by Fox et. al. [1] and extended by Brock and Khatib [2]. 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. A first step towards such a treatment was presented in [4]. Here we continue that work with a computationally tractable algorithm resulting from a careful discretization of the optimal control problem of the previous paper and a way to construct a continuous Navigation Function. Inspired by the similarities between the Dynamic Window Approach and the Control Lyapunov Function and Receding Horizon Control synthesis put forth by Primbs et. al. [3] we propose a version of the Dynamic Window Approach that is tractable and provably convergent.

Place, publisher, year, edition, pages
2002. 595-600 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-90559OAI: diva2:505873
IEEE/RSJ International Conference on Intelligent Robots and Systems
NR 20140805Available from: 2012-02-26 Created: 2012-02-26Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Ögren, Petter
By organisation
Computer Vision and Active Perception, CVAP
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 10 hits
ReferencesLink to record
Permanent link

Direct link