Real-Time Obstacle Avoidance for Polygonal Robots with a Reduced Dynamic Window

In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model stage accounts for robot shape and dynamics using a reduced dynamic window. The planning stage produces collision-free local paths with a velocity profile. We present an analytical solution to the distance to collision problem for polygonal robots, avoiding thus the use of look-up tables. The approach has been tested in simulation and on two non-holonomic rectangular robots where a cycle time of 10 Hz was reached under full CPU load. During a longterm experiment over 5 km travel distance, the method demonstrated its practicability.

Presented at:
None, Washington DC, USA, May 11 - 15

 Record created 2006-12-07, last modified 2018-01-27

External links:
Download fulltextConference Web Site
Download fulltextn/a
Rate this document:

Rate this document:
(Not yet reviewed)