Macro-operators: a weak method for learning
Artificial Intelligence - Lecture notes in computer science 178
Planning for conjunctive goals
Artificial Intelligence
Planning as search: a quantitative approach
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Nonmonotonic logic and temporal projection
Artificial Intelligence
A theoretical analysis of conjunctive-goal problems
Artificial Intelligence
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Automatically generating abstractions for problem solving
Automatically generating abstractions for problem solving
Acquiring search-control knowledge via static analysis
Artificial Intelligence
On the computational complexity of temporal projection, planning, and plan validation
Artificial Intelligence
Partial-order planning: evaluating possible efficiency gains
Artificial Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Downward refinement and the efficiency of hierarchical problem solving
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Analyzing external conditions to improve the efficiency of HTN planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Journal of the ACM (JACM)
Towards efficient universal planning: a randomized approach
Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Prodigy Planning Algorithm
Handling of Conditional Effects and Negative Goals in IPP
Handling of Conditional Effects and Negative Goals in IPP
Planning with Goal Agendas
A reactive planner for a model-based executive
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Flaw selection strategies for partial-order planning
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Admissible pruning strategies based on plan minimality for plan-space planning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Computing abstraction hierarchies by numerical simulation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A Heuristic for Planning Based on Action Evaluation
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
A logical measure of progress for planning
Eighteenth national conference on Artificial intelligence
Decomposition of planning problems
AI Communications
Learning from planner performance
Artificial Intelligence
Simultaneous heuristic search for conjunctive subgoals
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Fast planning by search in domain transition graph
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Engineering a conformant probabilistic planner
Journal of Artificial Intelligence Research
Temporal planning using subgoal partitioning and resolution in SGPlan
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Moving containers in small terminal as STRIPS planning problem
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
A weighted CSP approach to cost-optimal planning
AI Communications
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
ICS'10 Proceedings of the 14th WSEAS international conference on Systems: part of the 14th WSEAS CSCC multiconference - Volume II
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Using the relaxed plan heuristic to select goals in oversubscription planning problems
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
An efficient hybrid strategy for temporal planning
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Divide-and-Evolve: a new memetic scheme for domain-independent temporal planning
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Revisiting regression in planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The paper addresses the problem of computing goal orderings, which is one of the longstanding issues in AI planning. It makes two new contributions. First, it formally defines and discusses two different goal orderings, which are called the reasonable and the forced ordering. Both orderings are defined for simple STRIPS operators as well as for more complex ADL operators supporting negation and conditional effects. The complexity of these orderings is investigated and their practical relevance is discussed. Secondly, two different methods to compute reasonable goal orderings are developed. One of them is based on planning graphs, while the other investigates the set of actions directly. Finally, it is shown how the ordering relations, which have been derived for a given set of goals G, can be used to compute a so-called goal agenda that divides G into an ordered set of subgoals. Any planner can then, in principle, use the goal agenda to plan for increasing sets of subgoals. This can lead to an exponential complexity reduction, as the solution to a complex planning problem is found by solving easier subproblems. Since only a polynomial overhead is caused by the goal agenda computation, a potential exists to dramatically speed up planning algorithms as we demonstrate in the empirical evaluation, where we use this method in the IPP planner.