Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

, &
Artificial Intelligence 135 (1-2):73-123 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(01)00158-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

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

Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP.Minh Binh Do & Subbarao Kambhampati - 2001 - Artificial Intelligence 132 (2):151-182.
Some logical conundrums for decision-theoretic contingency planning.John Pollock - manuscript
Parsing Heuristic and Forward Search in First‐Graders' Game‐Play Behavior.Luciano Paz, Andrea P. Goldin, Carlos Diuk & Mariano Sigman - 2015 - Cognitive Science 39 (5):944-971.
An Easy “Hard Problem” for Decision-Theoretic Planning.John L. Pollock - unknown
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
Sequential Monte Carlo in reachability heuristics for probabilistic planning.Daniel Bryce, Subbarao Kambhampati & David E. Smith - 2008 - Artificial Intelligence 172 (6-7):685-715.
Policy Stable States in the Graph Model for Conflict Resolution.Dao-Zhi Zeng, Liping Fang, Keith W. Hipel & D. Marc Kilgour - 2004 - Theory and Decision 57 (4):345-365.
Rational deployment of multiple heuristics in optimal state-space search.Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin & Ariel Felner - 2018 - Artificial Intelligence 256 (C):181-210.
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning.Daniel Bryce, William Cushing & Subbarao Kambhampati - 2011 - Artificial Intelligence 175 (3-4):848-889.
Bootstrapping the PC and CPC Algorithms to Improve Search Accuracy.Joseph Ramsey - unknown
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
Deriving General Schemes for Classes of Graph Algorithms.Martin Russling - 1996
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.Marcel Steinmetz & Jörg Hoffmann - 2017 - Artificial Intelligence 245 (C):1-37.
Linear temporal logic as an executable semantics for planning languages.Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini & Valentina Poggioni - 2006 - Journal of Logic, Language and Information 16 (1):63-89.
Can We Plan Science?: (Semantics and Pitfalls.Michael J. Moravcsik - 1984 - Bulletin of Science, Technology and Society 4 (4):361-378.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,540,694)

6 months
4 (#790,347)

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.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
Using regression-match graphs to control search in planning.Drew McDermott - 1999 - Artificial Intelligence 109 (1-2):111-159.

Add more references