z-logo
open-access-imgOpen Access
Refinement Planning as a Unifying Framework for Plan Synthesis
Author(s) -
Kambhampati Subbarao
Publication year - 1997
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v18i2.1295
Planning—the ability to synthesize a course of action to achieve desired goals—is an important part of intelligent agency and has thus received significant attention within AI for more than 30 years. Work on efficient planning algorithms still continues to be a hot topic for research in AI and has led to several exciting developments in the past few years. This article provides a tutorial introduction to all the algorithms and approaches to the planning problem in AI. To fulfill this ambitious objective, I introduce a generalized approach to plan synthesis called refinement planning and show that in its various guises, refinement planning subsumes most of the algorithms that have been, or are being, developed. It is hoped that this unifying overview provides the reader with a brand‐name–free appreciation of the essential issues in planning.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here