914 search results - page 61 / 183 » The Computational Complexity of Probabilistic Planning |
135
click to vote
WADS
1997
Springer
15 years 10 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. ...
157
click to vote
AIPS
2008
15 years 8 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...
195
click to vote
TVCG
2008
15 years 6 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...
179
click to vote
CONCUR
2010
Springer
15 years 6 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...
184
click to vote
ARGMAS
2006
Springer
15 years 10 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...