Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms

Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigations of new algorithms. However, a key question is how to apply algoeveloped on an abstract problem, in a real application. In this paper, we report on what was required to apply a particular ted resource allocation algorithm developed for an abstract coordination problem in a real hardware application. A probabilistic representation of resources and tasks was used to deal with uncertainty and dynamics and local reasoning was used to deal with delays in the distributed resource allocation algorithm. The probabilistic representation and local reasoning enabled the use of the multi-agent algorithm which, in turn, improved the overall performance of the system.

• Type: Conference
• Year: 2003
• Where: SAC
• Authors: Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe
• Keywords: Abstracted Problem Instances, Applied Computing, Multi-agent Algorithm, Resource Allocation Algorithm, SAC 2003