The interdisciplinary study of coordination
ACM Computing Surveys (CSUR)
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Coordinating Mutually Exclusive Resources using GPGP
Autonomous Agents and Multi-Agent Systems
A Market Protocol for Decentralized Task Allocation
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
Production Scheduling in an Agile Agent-Based Production Grid
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Hi-index | 0.00 |
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-agent) plan repair systems. In our system agents can exchange goals and subgoals through an auction, using their own (planning) heuristics and utility functions to determine when to auction and what to bid. Some experimental results for a logistics domain show that this system can be used to support the coordination of self-interested agents.