By Topic

Dynamic decentralized area partitioning for cooperating cleaning robots

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
$31 $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

2 Author(s)
Jager, M. ; Corporate Technol., Siemens AG, Munich, Germany ; Nebel, B.

If multiple cleaning robots are used to cooperatively clean a larger room, e.g. an airport, the room must be partitioned among the robots. The paper describes a dynamic and decentralized method to partition a certain area among multiple robots. The area is divided into polygons, which are allocated by the robots. After a robot has been allocated a certain polygon, it is responsible for cleaning the polygon. The method described in the paper does not need any global synchronization and does not require a global communication network.

Published in:

Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on  (Volume:4 )

Date of Conference: