169 search results - page 1 / 34 » Tractability of Planning with Loops |
AIPS
2006
13 years 6 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. Howev...
AIPS
2008
13 years 7 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
AIPS
2007
13 years 7 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
AIPS
2010
13 years 7 months ago
2010
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...