49 search results - page 5 / 10 » Coordinating Non Cooperative Planning Agents: Complexity Res... |
AI
2007
Springer
14 years 1 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
AIPS
2008
13 years 9 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
AIPS
2009
13 years 8 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
AROBOTS
2011
13 years 2 months ago
2011
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
AAAI
1997
13 years 8 months ago
1997
Teamwork in complex, dynamic, multi-agent domains mandates highly flexible coordination and communication. Simply fitting individual agents with precomputed coordination plans w...