Red–black planning: A new systematic approach to partial delete relaxation

, &
Artificial Intelligence 221 (C):73-114 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.12.008

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

Partial-order planning.Anthony Barrett & Daniel S. Weld - 1994 - Artificial Intelligence 67 (1):71-112.
Strong planning under partial observability.Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri & Paolo Traverso - 2006 - Artificial Intelligence 170 (4-5):337-384.
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
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.
Conformant planning via heuristic forward search: A new approach.Jörg Hoffmann & Ronen I. Brafman - 2006 - Artificial Intelligence 170 (6-7):507-541.
Partial order bounding: A new approach to evaluation in game tree search.Martin Müller - 2001 - Artificial Intelligence 129 (1-2):279-311.
Intelligent planning: A decomposition and abstraction based approach to classical planning.Fausto Giunchiglia & Luca Spalazzi - 1999 - Artificial Intelligence 111 (1-2):329-338.
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.
Motion planning with uncertainty: a landmark approach.Anthony Lazanas & Jean-Claude Latombe - 1995 - Artificial Intelligence 76 (1-2):287-317.
Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs.Mohan Sridharan, Jeremy Wyatt & Richard Dearden - 2010 - Artificial Intelligence 174 (11):704-725.

Analytics

Added to PP
2020-12-22

Downloads
16 (#1,190,190)

6 months
5 (#1,038,502)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Star-topology decoupled state space search.Daniel Gnad & Jörg Hoffmann - 2018 - Artificial Intelligence 257 (C):24-60.

Add more citations

References found in this work

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.
Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
Concise finite-domain representations for PDDL planning tasks.Malte Helmert - 2009 - Artificial Intelligence 173 (5-6):503-535.
Using regression-match graphs to control search in planning.Drew McDermott - 1999 - Artificial Intelligence 109 (1-2):111-159.

View all 6 references / Add more references