Permissive planning: extending classical planning to uncertain task domains

&
Artificial Intelligence 89 (1-2):173-217 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(96)00031-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Robot task planning and explanation in open and uncertain worlds.Marc Hanheide, Moritz Göbelbecker, Graham S. Horn, Andrzej Pronobis, Kristoffer Sjöö, Alper Aydemir, Patric Jensfelt, Charles Gretton, Richard Dearden, Miroslav Janicek, Hendrik Zender, Geert-Jan Kruijff, Nick Hawes & Jeremy L. Wyatt - 2017 - Artificial Intelligence 247 (C):119-150.
Planning routes through uncertain territory.Drew McDermott & Ernest Davis - 1984 - Artificial Intelligence 22 (2):107-156.
Domain-independent planning for services in uncertain and dynamic environments.Eirini Kaldeli, Alexander Lazovik & Marco Aiello - 2016 - Artificial Intelligence 236 (C):30-64.
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.
Planning under time constraints in stochastic domains.Thomas Dean, Leslie Pack Kaelbling, Jak Kirman & Ann Nicholson - 1995 - Artificial Intelligence 76 (1-2):35-74.
Complexity results for standard benchmark domains in planning.Malte Helmert - 2003 - Artificial Intelligence 143 (2):219-262.
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.
Automated composition of Web services via planning in asynchronous domains.Piergiorgio Bertoli, Marco Pistore & Paolo Traverso - 2010 - Artificial Intelligence 174 (3-4):316-361.
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.Claudio Castellini, Enrico Giunchiglia & Armando Tacchella - 2003 - Artificial Intelligence 147 (1-2):85-117.

Analytics

Added to PP
2020-12-22

Downloads
3 (#1,728,269)

6 months
1 (#1,516,001)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Planning for conjunctive goals.David Chapman - 1987 - Artificial Intelligence 32 (3):333-377.
Generalization as search.Tom M. Mitchell - 1982 - Artificial Intelligence 18 (2):203-226.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.

View all 9 references / Add more references