By Topic

Local path re-planning for unforeseen obstacle avoidance by an autonomous sweeping robot

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Kurabayashi, D. ; RIKEN, Inst. of Phys. & Chem. Res., Saitama, Japan ; Koga, S. ; Arai, T. ; Ota, J.
more authors

We propose an algorithm for unforeseen obstacle avoidance by an autonomous sweeping robot. Sweeping means a motion that a robot covers a 2-dimensional area. When a mobile robot finds an unforeseen obstacle, it not only has to avoid collision but also sweep whole area including around the obstacle. In the proposed algorithm, a robot determines local area where path for sweeping should be arranged according to its limited sensing ability. By connecting the paths inside and outside the local area, the robot obtains a new total path. The local path re-planning saves heavy calculation to generate whole path again at online

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:4 )

Date of Conference:

16-20 May 1998