810 search results - page 17 / 162 » Solving Time-Dependent Planning Problems |
FLAIRS
2008
13 years 11 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
ECAI
2010
Springer
13 years 10 months ago
2010
Springer
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...