{"type":"ScholarlyArticle","title":"Admissible Pruning Strategies based on plan minimality for Plan-Space Planning","authors":[{"name":"Subbarao Kambhampati","slug":"subbarao-kambhampati","given":"Subbarao","family":"Kambhampati","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1995/210","pdf":"https://ijcai.org/proceedings/1995/0210.pdf","markdown":"https://ijcai.org/proceedings/1995/210.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/210","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning","track":"Planning","number":210,"pages":{"first":1627,"last":1634},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}