Schematic Invariants by Reduction to Ground Invariants

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Researchers

Research units

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.

Details

Original languageEnglish
Title of host publicationProceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)
Publication statusPublished - 2017
MoE publication typeA4 Article in a conference publication
EventAAAI Conference on Artificial Intelligence - San Francisco, United States
Duration: 4 Feb 20179 Feb 2017
Conference number: 31

Publication series

NameProceedings of the AAAI Conference on Artificial Intelligence
PublisherAAAI
ISSN (Print)2159-5399
ISSN (Electronic)2374-3468

Conference

ConferenceAAAI Conference on Artificial Intelligence
Abbreviated titleAAAI
CountryUnited States
CitySan Francisco
Period04/02/201709/02/2017

Download statistics

No data available

ID: 13097308