914 search results - page 5 / 183 » The Computational Complexity of Probabilistic Planning |
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
JAIR
2007
13 years 7 months ago
2007
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
ICRA
2002
IEEE
14 years 16 days ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...