Are multiagent algorithms relevant for real hardware?

Paul Scerri, Jay Modi, Wei-Min Shen, Milind Tambe
2003 Proceedings of the 2003 ACM symposium on Applied computing - SAC '03  
Researchers building multi-agent algorithms typically work with problems 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 algorithm, developed on an abstract problem, in a real application. In this paper, we report on what was required to apply a particular distributed resource allocation algorithm developed for an abstract coordination problem in a real hardware
more » ... ation. 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.
doi:10.1145/952532.952543 dblp:conf/sac/ScerriMST03 fatcat:p66tjbnswvhspl7dy3e5tmgqka