The Robotics Institute
Search the site
RI | Publications | Coordinating very large groups of wide area search munitions

Text only version of this site

Coordinating very large groups of wide area search munitions
P. Scerri, E. Liao, Y. Xu, M. Lewis, G. Lai, and K. Sycara
Theory and Algorithms for Cooperative Systems, 2005.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [425 KB]

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.

Abstract

Coordinating hundreds or thousands of unmanned aerial vehicles (UAVs), presents a variety of new exciting challenges, over and above the challenges of building single UAVs and small teams of UAVs. We are specifically interested in coordinating large groups of Wide Area Search Munitions (WASMs), which are part UAV and part munition. We are developing a "flat", distributed organization to provide the robustness and flexibility required by a group where team members will frequently leave. Building on established teamwork theory and infrastructure we are able to build large teams that can achieve complex goals using completely distributed intelligence. However, as the size of the team is increased, new issues arise that require novel algorithms. Specifically, key algorithms that work well for relatively small teams, fail to scale up to very large teams. We have developed novel algorithms meeting the requirements of large teams for the tasks of instantiating plans, sharing information and allocating roles. We have implemented these algorithms in reusable software proxies using the novel design abstraction of a coordination agent that encapsulates a piece of coordination protocol. We illustrate the effectiveness of the approach with 200 WASMs coordinating to find and destroy ground based targets in support of a manned aircraft.

Notes

Associated center: CIMDS
Associated lab/group: Intelligent Software Agents

Number of pages: 31

Note: forthcoming

Text Reference

P. Scerri, E. Liao, Y. Xu, M. Lewis, G. Lai, and K. Sycara, "Coordinating very large groups of wide area search munitions," Theory and Algorithms for Cooperative Systems, 2005.

BibTeX Reference

@article{Scerri_2005_4891,
   author = "Paul Scerri and Elizabeth Liao and Y. Xu and Michael Lewis and G. Lai and Katia Sycara",
   title = "Coordinating very large groups of wide area search munitions",
   journal = "Theory and Algorithms for Cooperative Systems",
   year = "2005",
   note = "forthcoming"
}


The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu