Carnegie Mellon University
Team-aware Multirobot Strategy for Cooperative Path Clearing

Gita Sukthankar
AAAI-2000, July, 2000.

  • Adobe portable document format (pdf) (16KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

In this paper, we present a simulated version of a potential demining problem in which robotic minesweepers clear a battle area of anti-tank mines to enable troops to breach the field. The demining problem is modeled as a distributed optimization problem in which the robots strive to minimize an abstract cost function. Robots were simulated using the Java based simulator TeamBots (

multirobot systems, simulation

Associated Center(s) / Consortia: Center for Integrated Manfacturing Decision Systems
Associated Lab(s) / Group(s): Advanced Agent - Robotics Technology Lab

Text Reference
Gita Sukthankar, "Team-aware Multirobot Strategy for Cooperative Path Clearing," AAAI-2000, July, 2000.

BibTeX Reference
   author = "Gita Sukthankar",
   title = "Team-aware Multirobot Strategy for Cooperative Path Clearing",
   booktitle = "AAAI-2000",
   month = "July",
   year = "2000",