Planning by rewriting

Authors:
José Luis Ambite;Craig A. Knoblock
Affiliations:
Information Sciences Institute and Department of Computer Science, University of Southern California, Marina del Rey, CA;Information Sciences Institute and Department of Computer Science, University of Southern California, Marina del Rey, CA
Venue:
Journal of Artificial Intelligence Research
Year:
2001

Citing 54
Cited 9

Distributed query processing

ACM Computing Surveys (CSUR)
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Local optimization and the traveling salesman problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Measuring the complexity of join enumeration in query optimization

Proceedings of the sixteenth international conference on Very large databases
A validation-structure-based theory of plan modification and reuse

Artificial Intelligence
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Theory and algorithms for plan merging

Artificial Intelligence
On the complexity of blocks-world planning

Artificial Intelligence
Acquiring search-control knowledge via static analysis

Artificial Intelligence
A softbot-based interface to the Internet

Communications of the ACM
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
Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Special volume on planning and scheduling
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning

Artificial Intelligence - Special volume on planning and scheduling
Plan reuse versus plan generation: a theoretical and empirical analysis

Artificial Intelligence - Special volume on planning and scheduling
Rule languages and internal algebras for rule-based optimizers

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The sciences of the artificial (3rd ed.)

The sciences of the artificial (3rd ed.)
Fast planning through planning graph analysis

Artificial Intelligence
Lazy Incremental Learning of Control Knowledge for EfficientlyObtaining Quality Plans

Artificial Intelligence Review - Special issue on lazy learning
Changing the rules: transformations for rule-based optimizers

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Programmed graph replacement systems

Handbook of graph grammars and computing by graph transformation
Term rewriting and all that

Term rewriting and all that
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Inferring state constraints for domain-independent planning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning

Artificial Intelligence
Flexible and scalable cost-based query planning in mediators: a transformational approach

Artificial Intelligence - Special issue on Intelligent internet systems
Efficient Graph Rewriting and Its Implementation

Efficient Graph Rewriting and Its Implementation
Planning and Learning by Analogical Reasoning

Planning and Learning by Analogical Reasoning
Learning Search Control Knowledge: An Explanation-Based Approach

Learning Search Control Knowledge: An Explanation-Based Approach
A Computer Model of Skill Acquisition

A Computer Model of Skill Acquisition
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Database Systems Concepts

Database Systems Concepts
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
An Iterative Algorithm for Synthesizing Invariants

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Extending Planning Graphs to an ADL Subset

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Information Gathering Plans With Sensing Actions

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning as Heuristic Search: New Results

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Learning effective search control knowledge: an explanation-based approach

Learning effective search control knowledge: an explanation-based approach
Planning by rewriting

Planning by rewriting
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm

Journal of Artificial Intelligence Research
Learning to improve both efficiency and quality of planning

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The automatic inference of state invariants in TIM

Journal of Artificial Intelligence Research
A domain-independent algorithm for plan adaptation

Journal of Artificial Intelligence Research
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
AI planning versus manufacturing-operation planning: a case study

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning executing sensing and replanning for information gathering

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
Linear time near-optimal planning in the blocks world

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Planning by rewriting: efficiently generating high-quality plans

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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

Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs

Constraints
Planning in highly dynamic environments: an anytime approach for planning under time constraints

Applied Intelligence
Learning Control Knowledge for Forward Search Planning

The Journal of Machine Learning Research
An anytime approach for on-line planning

Proceedings of the 2005 conference on Artificial Intelligence Research and Development
Deploying information agents on the web

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An agent specific planning algorithm

Expert Systems with Applications: An International Journal
An on-line approach for planning in time-limited situations

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Case adaptation by segment replanning for case-based planning systems

ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Plan quality optimisation via block decomposition

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more dificult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning. PbR exploits declarative plan-rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. In addition to addressing the issues of planning efficiency and plan quality, this framework offers a new anytime planning algorithm. We have implemented this planner and applied it to several existing domains. The experimental results show that the PbR approach provides significant savings in planning effort while generating high-quality plans.