122 search results - page 4 / 25 » An Algorithm for Probabilistic Least-Commitment Planning |
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
UAI
2000
14 years 11 months ago
2000
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
75
Voted
AAAI
2010
14 years 11 months ago
2010
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
JAIR
2007
14 years 9 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 ...