Dynamic decentralized area partitioning for cooperating cleaning robots

Proceedings-IEEE International Conference on Robotics and Automation

Volumn 4, Issue , 2002, Pages 3577-3582

  Jäger, Markus ^a   Nebel, Bernhard ^b  

^a SIEMENS AG   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DECENTRALIZED CONTROL; MOTION PLANNING; NONLINEAR CONTROL SYSTEMS; ROBOT PROGRAMMING;

COOPERATING CLEANING ROBOTS; DYNAMIC DECENTRALIZED AREA PARTITIONING;

MOBILE ROBOTS;

EID: 0036057432     PISSN: 10504729     EISSN: None     Source Type: Journal    
DOI: 10.1109/ROBOT.2002.1014264     Document Type: Article

References (16)

1. Field test of a navigation system: Autonomous cleaning in supermarkets
2. Polygon area decomposition for multiple-robot workspace division
3. The area partitioning problem
4. Linear-size nonobtuse triangulation of polygons
5. Optimal equi-partition of rectangular domains for parallel computation
6. Distributed genetic algorithms for partitioning uniform grids
7. Minimum perimeter domain assignment
8. Multiple robot motion planning = parallel processing + geometry
9. Territorial multi-robot task division
10. A decentralized approach for cooperative sweeping by multiple mobile robots
11. Path planning and guidance techniques for an autonomous mobile cleaning robot
12. Path planning for robotic demining and development of a test platform
13. Decentralized collision avoidance, deadlock detection, and deadlock resolution for multiple mobile robots
14. Robot motion plannig
15. An improved algorithm for decentralized extrema-finding in circular configurations of processes
16. The contract net protocol: High-level communication and control in a distributed problem solver