Cooperative search and rescue with a team of mobile robots

We present an implemented algorithm for a distributed team of autonomous mobile robots to search for an object. When one robot Ends it, they all gather around it, and then manipulate (''rescue'') it. The algorithm exploits parallelism, with all robots searching concurretly, and also teamwork, because Me manipulation is performed cooperatively. Our algorithm is fully distributed; the robots communicate with each other, and Mere is no central server or supervisor. Applications include hazardous waste cleanup, bomb detection and removal, materials delivery, and eventually the rescue of survivors of accidents or disasters. The search and rescue program was written using MOVER, a programming system far distributed tasks. MOVER is quite general, allowing arbitrary synchronization of tasks among workstations and robots. The system provides high-level programming constructs for task distribution across robots. Finally, MOVER encourages code re-use because the task distribution mechanism can synchronize any set of procedures (without rewriting), allowing Me programmer of a distributed task to access libraries of robot software written for single-robot tasks.