Sapa is a domain-independent heuristic forward chaining planner that can handle durative ac-tions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning-graph based methods for deriving heuristics that are sensitive to both cost and makespan (ii) techniques for adjusting the heuristic estimates to take action interactions and metric resource limitations into account and (iii) a linear time greedy post-processing technique to improve exe-cution flexibility of the solution plans. An implementation of Sapa using many of the techniques presented in this paper was one of the best domain independent planners...
AbstractA key feature of modern optimal planners such as graphplan and blackbox is their ability to ...
Recently, the areas of planning and scheduling in artificial intelligence (AI) have witnessed a big ...
We present ZENO, an implemented, partial-order planner that handles simultaneous ac-tions occurring ...
Sapa is a domain-independent heuristic forward chaining planner that can handle durative ac-tions, m...
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, me...
Most of current works on planning community assume the completeness of the physical dynamics or the ...
In this paper we address the problem of post-processing posi-tion constrained plans, output by many ...
Planning for and controlling a network of interacting devices requires a planner that accounts for t...
Temporal logics have been used in autonomous planning to represent and reason about temporal plannin...
Recent advances in constraint satisfaction and heuristic search have made it possible to solve class...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
The last eight years have seen dramatic progress in tempo-ral planning as highlighted by the tempora...
Recently tremendous advances have been made in the performance of AI planning systems. However incre...
Many planning domains have to deal with temporal features that can be expressed using durations that...
Recently tremendous advances have been made in the performance of AI planning systems. However incre...
AbstractA key feature of modern optimal planners such as graphplan and blackbox is their ability to ...
Recently, the areas of planning and scheduling in artificial intelligence (AI) have witnessed a big ...
We present ZENO, an implemented, partial-order planner that handles simultaneous ac-tions occurring ...
Sapa is a domain-independent heuristic forward chaining planner that can handle durative ac-tions, m...
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, me...
Most of current works on planning community assume the completeness of the physical dynamics or the ...
In this paper we address the problem of post-processing posi-tion constrained plans, output by many ...
Planning for and controlling a network of interacting devices requires a planner that accounts for t...
Temporal logics have been used in autonomous planning to represent and reason about temporal plannin...
Recent advances in constraint satisfaction and heuristic search have made it possible to solve class...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
The last eight years have seen dramatic progress in tempo-ral planning as highlighted by the tempora...
Recently tremendous advances have been made in the performance of AI planning systems. However incre...
Many planning domains have to deal with temporal features that can be expressed using durations that...
Recently tremendous advances have been made in the performance of AI planning systems. However incre...
AbstractA key feature of modern optimal planners such as graphplan and blackbox is their ability to ...
Recently, the areas of planning and scheduling in artificial intelligence (AI) have witnessed a big ...
We present ZENO, an implemented, partial-order planner that handles simultaneous ac-tions occurring ...