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/12/1
Y1 - 1993/12/1
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
AN - SCOPUS:0027705491
SN - 0262510715
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 514
EP - 519
BT - Proceedings of the National Conference on Artificial Intelligence
PB - Publ by AAAI
T2 - Proceedings of the 11th National Conference on Artificial Intelligence
Y2 - 11 July 1993 through 15 July 1993
ER -