All PSPACE-complete Planning Problems are Equal but some are more Equal than Others
2011 (English)In: Proceedings, The Fourth International Symposium on Combinatorial Search (SoCS-2011) / [ed] Daniel Borrajo, Maxim Likhachev, Carlos Linares Lopez, AAAI Press, 2011, 10-17 p.Conference paper (Refereed)
Complexity analysis of planning is problematic. Even very simple planning languages are PSPACE-complete, yet cannot model many simple problems naturally. Many languages with much more powerful features are also PSPACE-complete. It is thus difficult to separate planning languages in a useful way and to get complexity figures that better reflect reality.This paper introduces new methods for complexity analysis of planning and similar combinatorial search problems, in order to achieve more precision and complexity separations than standard methods allow. Padding instances with the solution size yields a complexity measure that is immune to this factor and reveals other causes of hardness, that are otherwise hidden. Further combining this method with limited nondeterminism improves the precision, making even finer separations possible. We demonstrate with examples how these methods can narrow the gap between theory and practice.
Place, publisher, year, edition, pages
AAAI Press, 2011. 10-17 p.
IdentifiersURN: urn:nbn:se:liu:diva-74505ISBN: 978-1-57735-537-3 (Print)ISBN: 978-1-57735-538-0 (CD)OAI: oai:DiVA.org:liu-74505DiVA: diva2:486162
Fourth Annual Symposium on Combinatorial Search (SoCS-2011), July 15–16, Barcelona, Spain