State space search nogood learning: Online refinement of critical-path dead-end detectors in planning

&
Artificial Intelligence 245 (C):1-37 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2016.12.002

Links

PhilArchive



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

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 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.
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search.XuanLong Nguyen, Subbarao Kambhampati & Romeo S. Nigenda - 2002 - Artificial Intelligence 135 (1-2):73-123.
Inductive learning of search control rules for planning.Christopher Leckie & Ingrid Zukerman - 1998 - Artificial Intelligence 101 (1-2):63-98.
Multiobjective heuristic state-space planning.Ioannis Refanidis & Ioannis Vlahavas - 2003 - Artificial Intelligence 145 (1-2):1-32.
CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement.Alban Grastien & Enrico Scala - 2020 - Artificial Intelligence 284 (C):103271.
Time-efficient state space search.Alexander Reinefeld & Peter Ridinger - 1994 - Artificial Intelligence 71 (2):397-408.
Star-topology decoupled state space search.Daniel Gnad & Jörg Hoffmann - 2018 - Artificial Intelligence 257 (C):24-60.
Path-length analysis for grid-based path planning.James P. Bailey, Alex Nash, Craig A. Tovey & Sven Koenig - 2021 - Artificial Intelligence 301 (C):103560.
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.
Probabilistic Nogood Store as a Heuristic.Andrei Missine & William S. Havens - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), Pricai 2008: Trends in Artificial Intelligence. Springer. pp. 768--777.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,020,370)

6 months
11 (#272,000)

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

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.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.

View all 16 references / Add more references