Referenced Items are not available for this document.
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: 2002
- Page(s):
- 3577 - 3582 vol.4
- Print ISBN:
- 0-7803-7272-7
- INSPEC Accession Number:
- 7387813
- Digital Object Identifier :
- 10.1109/ROBOT.2002.1014264
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
