914 search results - page 61 / 183 » The Computational Complexity of Probabilistic Planning |
WADS
1997
Springer
14 years 2 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
AIPS
2008
14 years 1 months ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
TVCG
2008
13 years 10 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
ARGMAS
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...