Plan Optimization by Plan Rewriting

Plan Optimization by Plan Rewriting

José Luis Ambite (University of Southern California, USA), Craig A. Knoblock (University of Southern California, USA) and Steven Minton (Fetch Technologies, USA)
Copyright: © 2005 |Pages: 41
DOI: 10.4018/978-1-59140-450-7.ch004
OnDemand PDF Download:
$37.50

Abstract

Planning by Rewriting (PbR) is a paradigm for efficient high-quality planning that 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 planning efficiency and plan quality, PbR offers a new anytime planning algorithm. The plan rewriting rules can be either specified by a domain expert or automatically learned. We describe a learning approach based on comparing initial and optimal plans that produce rules competitive with manually specified ones. PbR is fully implemented and has been applied to several existing domains. The experimental results show that the PbR approach provides significant savings in planning effort while generating high-quality plans.

Complete Chapter List

Search this Book:
Reset
Table of Contents
Preface
Ioannis Vlahavas, Dimitris Vrakas
Acknowledgments
Chapter 1
Thomas Eiter, Wolfgang Faber, Gerald Pfeifer, Axel Polleres
This chapter introduces planning and knowledge representation in the declarative action language K. Rooted in the area of Knowledge Representation &... Sample PDF
Declarative Planning and Knowledge Representation in an Action Language
$37.50
Chapter 2
Max Garagnani
This chapter describes a model and an underlying theoretical framework for hybrid planning. Modern planning domain description languages are based... Sample PDF
A Framework for Hybrid and Analogical Planning
$37.50
Chapter 3
Dimitris Vrakas, Grigorios Tsoumakas, Nick Bassiliakes, Ioannis Vlahavas
This chapter is concerned with the enhancement of planning systems using techniques from Machine Learning in order to automatically configure their... Sample PDF
Machine Learning for Adaptive Planning
$37.50
Chapter 4
José Luis Ambite, Craig A. Knoblock, Steven Minton
Planning by Rewriting (PbR) is a paradigm for efficient high-quality planning that exploits declarative plan rewriting rules and efficient local... Sample PDF
Plan Optimization by Plan Rewriting
$37.50
Chapter 5
Nikos Avradinis, Themis Panayiotopoulos
This chapter discusses the application of intelligent planning techniques to virtual agent environments as a mechanism to control and generate... Sample PDF
Continuous Planning for Virtual Environments
$37.50
Chapter 6
Jeroen Valk, Mathijs de Weerdt, Cees Witteveen
Multi-agent planning comprises planning in an environment with multiple autonomous actors. Techniques for multi-agent planning differ from... Sample PDF
Coordination in Multi-Agent Planning with an Application in Logistics
$37.50
Chapter 7
Catherine C. Marinagi, Themis Panayiotopoulos, Constantine D. Spyropoulos
This chapter provides an overview of complementary research in the active research areas: AI planning technology and intelligent agents technology.... Sample PDF
AI Planning and Intelligent Agents
$37.50
Chapter 8
Amedeo Cesta, Simone Fratini, Angelo Oddi
This chapter proposes to model a planning problem (e.g., the control of a satellite system) by identifying a set of relevant components in the... Sample PDF
Planning with Concurrency, Time and Resources: A CSP-Based Approach
$37.50
Chapter 9
Martha E. Pollack, Ioannis Tsamardinos
The Simple Temporal Problem (STP) formalism was developed to encode flexible quantitative temporal constraints, and it has been adopted as a... Sample PDF
Efficiently Dispatching Plans Encoded as Simple Temporal Problems
$37.50
Chapter 10
Roman Bartak
As the current planning and scheduling technologies are coming together by assuming time and resource constraints in planning or by allowing... Sample PDF
Constraint Satisfaction for Planning and Scheduling
$37.50
About the Authors