Sciweavers

914 search results - page 61 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
14 years 2 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
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. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
AIPS
2008
14 years 1 months ago
Multiagent Planning Under Uncertainty with Stochastic Communication Delays
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
Matthijs T. J. Spaan, Frans A. Oliehoek, Nikos A. ...
TVCG
2008
138views more  TVCG 2008»
13 years 10 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
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...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
CONCUR
2010
Springer
13 years 11 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
ARGMAS
2006
Springer
14 years 2 months ago
Specification and Complexity of Strategic-Based Reasoning Using Argumentation
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...
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin