Analysis of Planning Instances Without Search
The European Journal on Artificial Intelligence · 2025
DOI: 10.1177/09217126251323880 ↗Kurz gefasst
Fachartikel in der Zeitschrift The European Journal on Artificial Intelligence, 2025. Verfasst von Arnaud Lequen und 1 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben.
Abstract (Originalsprache)
In order to prove classical planning instances unsolvable, state-of-the-art planners resort to a state space search. However, we show here that an incomplete, yet computationally efficient criterion is sometimes sufficient to immediately identify as unsolvable a wide range of planning instances. Based on linear and integer programming, we show in this paper how it can be leveraged, should it fail at first. This criterion is the keystone of various techniques we propose to rewrite and enhance the STRIPS model, so as to gather new information about it. If the newly found bits of information is not sufficient to identify the instance as unsolvable, they still constitute human-readable bits of information that can provide additional insight on the planning instance.
Zitieren
APA
Lequen, A., & Cooper, M. C. (2025). Analysis of Planning Instances Without Search. The European Journal on Artificial Intelligence. https://doi.org/10.1177/09217126251323880
Vancouver
Lequen A, Cooper MC. Analysis of Planning Instances Without Search. The European Journal on Artificial Intelligence. 2025. doi:10.1177/09217126251323880
BibTeX
@article{Lequen2025,
author = {Lequen, Arnaud and Cooper, Martin C.},
title = {Analysis of Planning Instances Without Search},
journal = {The European Journal on Artificial Intelligence},
year = {2025},
doi = {10.1177/09217126251323880}
}
EUVIMED