Admissible Criteria for Loop Control in Planning
Abstract
We introduce methods for identifying operator preconditions that need not be expanded further. The methods are proved to be admissible, that is, they will not cause a solution to be missed when one exists. In certain cases, the methods also identify operator reformulations that increase the number of nonexpandable preconditions. This approach provides effective loop control in common situations. Moreover, the computation required can be performed during a precompilation of the operators in a domain; thus, there is no significant additional run-time overhead during planning.
Cite
Text
Feldman and Morris. "Admissible Criteria for Loop Control in Planning." AAAI Conference on Artificial Intelligence, 1990.Markdown
[Feldman and Morris. "Admissible Criteria for Loop Control in Planning." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/feldman1990aaai-admissible/)BibTeX
@inproceedings{feldman1990aaai-admissible,
title = {{Admissible Criteria for Loop Control in Planning}},
author = {Feldman, Roy and Morris, Paul},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1990},
pages = {151-157},
url = {https://mlanthology.org/aaai/1990/feldman1990aaai-admissible/}
}