Complexity results for standard benchmark domains in planning

Artificial Intelligence 143 (2):219-262 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00364-8

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
Permissive planning: extending classical planning to uncertain task domains.Gerald F. DeJong & Scott W. Bennett - 1997 - Artificial Intelligence 89 (1-2):173-217.
Learning action strategies for planning domains.Roni Khardon - 1999 - Artificial Intelligence 113 (1-2):125-148.
Planning and acting in partially observable stochastic domains.Leslie Pack Kaelbling, Michael L. Littman & Anthony R. Cassandra - 1998 - Artificial Intelligence 101 (1-2):99-134.
Computational complexity of planning and approximate planning in the presence of incompleteness.Chitta Baral, Vladik Kreinovich & Raúl Trejo - 2000 - Artificial Intelligence 122 (1-2):241-267.
Planning under time constraints in stochastic domains.Thomas Dean, Leslie Pack Kaelbling, Jak Kirman & Ann Nicholson - 1995 - Artificial Intelligence 76 (1-2):35-74.
Plan aggregation for strong cyclic planning in nondeterministic domains.Ron Alford, Ugur Kuter, Dana Nau & Robert P. Goldman - 2014 - Artificial Intelligence 216 (C):206-232.
On the complexity of planning for agent teams and its implications for single agent planning.Ronen I. Brafman & Carmel Domshlak - 2013 - Artificial Intelligence 198 (C):52-71.
On the complexity of blocks-world planning.Naresh Gupta & Dana S. Nau - 1992 - Artificial Intelligence 56 (2-3):223-254.
The influence of k-dependence on the complexity of planning.Omer Giménez & Anders Jonsson - 2012 - Artificial Intelligence 177-179 (C):25-45.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,309,843)

6 months
4 (#1,232,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Learning from planner performance.Mark Roberts & Adele Howe - 2009 - Artificial Intelligence 173 (5-6):536-561.

Add more citations

References found in this work

Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
On the complexity of blocks-world planning.Naresh Gupta & Dana S. Nau - 1992 - Artificial Intelligence 56 (2-3):223-254.
Blocks World revisited.John Slaney & Sylvie Thiébaux - 2001 - Artificial Intelligence 125 (1-2):119-153.

Add more references