SYNASC
2006
IEEE
14 years 5 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
ICRA
2006
IEEE
14 years 5 months ago
2006
IEEE
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
MATES
2007
Springer
14 years 5 months ago
2007
Springer
In real-life multi-agent planning problems, long-term plans will often be invalidated by changes in the environment during or after the planning process. When this happens, short-t...
SARA
2009
Springer
14 years 6 months ago
2009
Springer
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...