Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning

Subbarao Kambhampati, Jengchin Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential advantages into those related to storage compaction, and those related to the ability to exploit stored plans. We observe that the storage compactions provided by partially ordered partially instantiated plans can, to a large extent, be exploited regardless of the underlying planner. We argue that it is in the ability to exploit stored plans during planning that partial ordering planners have some distinct advantages. In particular, to be able to flexibly reuse and extend the retrieved plans, a planner needs the ability to arbitrarily and efficiently 'splice in' new steps and sub-plans into the retrieved plan. This is where partial ordering planners, with their least-commitment strategy, and flexible plan representations, score significantly over state-based planners as well as planners that search in the space of totally ordered plans. We will clarify and support this hypothesis through an empirical study of three planners and two reuse strategies.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Place of PublicationMenlo Park, CA, United States
PublisherPubl by AAAI
Pages514-519
Number of pages6
ISBN (Print)0262510715
StatePublished - 1993
EventProceedings of the 11th National Conference on Artificial Intelligence - Washington, DC, USA
Duration: Jul 11 1993Jul 15 1993

Other

OtherProceedings of the 11th National Conference on Artificial Intelligence
CityWashington, DC, USA
Period7/11/937/15/93

Fingerprint

Compaction
Planning

ASJC Scopus subject areas

  • Software

Cite this

Kambhampati, S., & Chen, J. (1993). Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning. In Proceedings of the National Conference on Artificial Intelligence (pp. 514-519). Menlo Park, CA, United States: Publ by AAAI.

Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning. / Kambhampati, Subbarao; Chen, Jengchin.

Proceedings of the National Conference on Artificial Intelligence. Menlo Park, CA, United States : Publ by AAAI, 1993. p. 514-519.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kambhampati, S & Chen, J 1993, Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning. in Proceedings of the National Conference on Artificial Intelligence. Publ by AAAI, Menlo Park, CA, United States, pp. 514-519, Proceedings of the 11th National Conference on Artificial Intelligence, Washington, DC, USA, 7/11/93.
Kambhampati S, Chen J. Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning. In Proceedings of the National Conference on Artificial Intelligence. Menlo Park, CA, United States: Publ by AAAI. 1993. p. 514-519
Kambhampati, Subbarao ; Chen, Jengchin. / Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning. Proceedings of the National Conference on Artificial Intelligence. Menlo Park, CA, United States : Publ by AAAI, 1993. pp. 514-519
@inproceedings{8383f4098c604b62a5ce63eb91c1df20,
title = "Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning",
abstract = "This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential advantages into those related to storage compaction, and those related to the ability to exploit stored plans. We observe that the storage compactions provided by partially ordered partially instantiated plans can, to a large extent, be exploited regardless of the underlying planner. We argue that it is in the ability to exploit stored plans during planning that partial ordering planners have some distinct advantages. In particular, to be able to flexibly reuse and extend the retrieved plans, a planner needs the ability to arbitrarily and efficiently 'splice in' new steps and sub-plans into the retrieved plan. This is where partial ordering planners, with their least-commitment strategy, and flexible plan representations, score significantly over state-based planners as well as planners that search in the space of totally ordered plans. We will clarify and support this hypothesis through an empirical study of three planners and two reuse strategies.",
author = "Subbarao Kambhampati and Jengchin Chen",
year = "1993",
language = "English (US)",
isbn = "0262510715",
pages = "514--519",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "Publ by AAAI",

}

TY - GEN

T1 - Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning

AU - Kambhampati, Subbarao

AU - Chen, Jengchin

PY - 1993

Y1 - 1993

N2 - This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential advantages into those related to storage compaction, and those related to the ability to exploit stored plans. We observe that the storage compactions provided by partially ordered partially instantiated plans can, to a large extent, be exploited regardless of the underlying planner. We argue that it is in the ability to exploit stored plans during planning that partial ordering planners have some distinct advantages. In particular, to be able to flexibly reuse and extend the retrieved plans, a planner needs the ability to arbitrarily and efficiently 'splice in' new steps and sub-plans into the retrieved plan. This is where partial ordering planners, with their least-commitment strategy, and flexible plan representations, score significantly over state-based planners as well as planners that search in the space of totally ordered plans. We will clarify and support this hypothesis through an empirical study of three planners and two reuse strategies.

AB - This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential advantages into those related to storage compaction, and those related to the ability to exploit stored plans. We observe that the storage compactions provided by partially ordered partially instantiated plans can, to a large extent, be exploited regardless of the underlying planner. We argue that it is in the ability to exploit stored plans during planning that partial ordering planners have some distinct advantages. In particular, to be able to flexibly reuse and extend the retrieved plans, a planner needs the ability to arbitrarily and efficiently 'splice in' new steps and sub-plans into the retrieved plan. This is where partial ordering planners, with their least-commitment strategy, and flexible plan representations, score significantly over state-based planners as well as planners that search in the space of totally ordered plans. We will clarify and support this hypothesis through an empirical study of three planners and two reuse strategies.

UR - http://www.scopus.com/inward/record.url?scp=0027705491&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027705491&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0262510715

SP - 514

EP - 519

BT - Proceedings of the National Conference on Artificial Intelligence

PB - Publ by AAAI

CY - Menlo Park, CA, United States

ER -