Schematic Invariants by Reduction to Ground Invariants
Abstract
Computation of invariants, which are approximate reachability information for state-space search problems such as AI planning, has been considered to be more scalable when using a schematic representation of actions/events rather than an instantiated/ground representation. A disadvantage of schematic algorithms, however, is their complexity, which also leads to high runtimes when the number of schematic events/actions is high. We propose algorithms that reduce the problem of finding schematic invariants to solving a smaller ground problem.
Cite
Text
Rintanen. "Schematic Invariants by Reduction to Ground Invariants." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.11030Markdown
[Rintanen. "Schematic Invariants by Reduction to Ground Invariants." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/rintanen2017aaai-schematic/) doi:10.1609/AAAI.V31I1.11030BibTeX
@inproceedings{rintanen2017aaai-schematic,
title = {{Schematic Invariants by Reduction to Ground Invariants}},
author = {Rintanen, Jussi},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2017},
pages = {3644-3650},
doi = {10.1609/AAAI.V31I1.11030},
url = {https://mlanthology.org/aaai/2017/rintanen2017aaai-schematic/}
}