Principled Communication for Dynamic Multi-Robot Task Allocation
In the pursuit of an efficient cooperative multi-robot system, the researcher must eventually answer the question “how should robots communicate?”; a natural way to attack this question is to decompose it into three simpler corollaries: “what should robots communicate?”, “when should they communicate?” and “with whom should they communicate?”. In this paper, we propose answers to these questions in the form of a general framework for inter-robot communication and, more specifically, advocate its use in dynamic task allocation for teams of cooperative mobile robots. We base our communication model on publish/subscribe messaging and validate our system by using it in a tightly-coupled multi-robot manipulaion task and a loosely-coupled long-term experiment involving many robots concurrently executing different tasks.
Unable to display preview. Download preview PDF.
- Milind Tambe. Agent architectures for flexible, practical teamwork. In Proceedings of the Natl. Conf. on Artificial Intelligence (AAAI), Providence, Rhode Island, July 1997.Google Scholar
- Lynne E. Parker. Alliance: An architecture for fault-tolerant multi-robot cooperation. IEEE Transactions on Robotics and Automation, 14(2), 1998.Google Scholar
- Barry Brian Werger and Maja J Matarić. Broadcast of local eligibilty for multi-target observation. In Proceedings of the Intl. Symp. on Distributed Autonomous Robotic Systems (DARS), Knoxville, Tennessee, October 2000.Google Scholar
- Daniel D. Corkill. Blackboard systems. AI Expert, 6(9):40–47, September 1991.Google Scholar
- William E. Walsh and Michael P. Wellman. A market protocol for decentralized task allocation. In Proceedings of the Intl. Conf. on Multi Agent Systems (ICMAS), Paris, Prance, July 1998.Google Scholar
- Steven McCanne. Scalable multimedia communication with internet multicast, light-weight sessions, and the mbone. Technical Report CSD 981002, UC Berkeley, March 1998.Google Scholar
- Arvola Chan. Transactional publish/subscribe: The proactive multicast of database changes. In Proceedings of ACM SIGMOD Conf. of Management of Data, Seattle, WA, June 1998.Google Scholar
- Guruduth Banavar et al. An efficient multicast protocol for content-based publish-subscribe systems. In Proceedings of the Intl. Conf. on Distributed Computing Systems, Austin, Texas, June 1999.Google Scholar
- Marcos K. Aguilera et al. Matching events in a content-based subscription system. In Proceedings of the ACM Symposium on Principles of Distributed Computing, Atlanta, Georgia, May 1999.Google Scholar
- Kutluhan Erol, James Hendler, and Dana S. Nau. HTN planning: Complexity and expressivity. In Proceedings of the Natl. Conf. on Artificial Intelligence (AAAI), Seattle, WA, July 1994.Google Scholar
- Kutluhan Erol, James Hendler, and Dana S. Nau. UCMP: A sound and complete procedure for hierarchical task-network planning. In Proceedings of the Intl. Conf. on Artificial Intelligence Planning Systems, Chicago, IL, June 1994.Google Scholar
- Ronald C. Arkin. Behavior-Based Robotics. MIT Press, Cambridge, MA, 1998.Google Scholar
- Brian P. Gerkey, Kasper Støy, and Richard T. Vaughan. Player robot server. Technical Report IRIS-00-392, Institute for Robotics and Intelligent Systems, School of Engineering, University of Southern California, November 2000.Google Scholar