Macros, Reactive Plans and Compact Representations
2012 (English)In: ECAI 2012. 20th European Conference on Artificial Intelligence 27-31 August 2+12, Montpellier, France / [ed] Luc De Raedt, Christian Bessiere, Didier Dubois, Patrick Doherty, Paolo Frasconi, Fredrik Heintz, Peter Lucas, 2012, 85-90 p.Conference paper (Refereed)
The use and study of compact representations of objects is widespread in computer science. AI planning can be viewed as the problem of finding a path in a graph that is implicitly described by a compact representation in a planning language. However, compact representations of the path itself (the plan) have not received much attention in the literature. Although both macro plans and reactive plans can be considered as such compact representations, little emphasis has been placed on this aspect in earlier work. There are also compact plan representations that are defined by their access properties, for instance, that they have efficient random access or efficient sequential access. We formally compare two such concepts with macro plans and reactive plans, viewed as compact representations, and provide a complete map of the relationships between them.
Place, publisher, year, edition, pages
2012. 85-90 p.
, Frontiers in Artificial Intelligence and Applications, ISSN 0922-6390 ; 242
IdentifiersURN: urn:nbn:se:liu:diva-79510DOI: 10.3233/978-1-61499-098-7-85ISBN: 978-1-61499-097-0ISBN: 978-1-61499-098-7OAI: oai:DiVA.org:liu-79510DiVA: diva2:543166
20th European Conference on Artificial Intelligence (ECAI-2012), 27-31 August, Montpellier, France