Admissible Pruning Strategies based on plan minimality for Plan-Space Planning
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Planning. Pages 1627-1634.
Abstract
Although plan-space planners have been shown to be flexible and efficient in plan generation. they do suffer from the problem of "looping" -- that is, they may spend an inordinate amount of time doing locally seemingly useful but globally useless refinements. In this paper. I review the anatomy of looping and argue that looping is intimately tied to the production of non-minimal solutions. I then propose two classes of admissible pruning techniques based on the notion of plan minimality. I show that the first one is admissible for planners which do not protect their establishments. but allow a precondition to be reestablished any number of times. The second one is admissible for planners which protect their establishments through causal links. I also discuss the complexity of the proposed pruning strategies, and their potential applications.
@inproceedings{ijcai1995p210,
title = {Admissible Pruning Strategies based on plan minimality for Plan-Space Planning},
author = {Kambhampati, Subbarao},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1627--1634},
year = {1995},
note = {Planning},
url = {https://ijcai.org/proceedings/1995/210},
}
TY - CPAPER TI - Admissible Pruning Strategies based on plan minimality for Plan-Space Planning AU - Kambhampati, Subbarao T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1627 EP - 1634 UR - https://ijcai.org/proceedings/1995/210 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
