Sciweavers

49 search results - page 1 / 10
» Coordinating Non Cooperative Planning Agents: Complexity Res...
Sort
View
89
Voted
IAT
2005
IEEE
15 years 3 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
91
Voted
MAICS
2003
14 years 11 months ago
A Distributed Planning Approach Using Multiagent Goal Transformations
A multiagent goal transformation is defined as a directed alteration of goals by the agents in a multiagent system in order to adjust for lack of resources and/or lack of capabili...
Michael T. Cox, Mohammad M. Elahi, Kevin Cleereman
85
Voted
JAIR
2000
96views more  JAIR 2000»
14 years 10 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
AAAI
2012
13 years 17 days ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
ATAL
2008
Springer
15 years 6 days ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant