127 search results - page 16 / 26 » Directed Search for Generalized Plans Using Classical Planne... |
AIPS
2000
15 years 1 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
AIPS
2010
15 years 2 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...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
AIPS
2006
15 years 1 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...