Anytime search in dynamic graphs

, , , &
Artificial Intelligence 172 (14):1613-1643 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2007.11.009

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

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

Reasoning With Causal Cycles.Bob Rehder - 2017 - Cognitive Science 41 (S5):944-1002.
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
Monitoring and control of anytime algorithms: A dynamic programming approach.Eric A. Hansen & Shlomo Zilberstein - 2001 - Artificial Intelligence 126 (1-2):139-157.
Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.
Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm.Matthias Horn, Günther Raidl & Christian Blum - 2019 - Artificial Intelligence 277 (C):103173.
Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
Dynamic Imagery: A Computational Model of Motion and Visual Analogy.David Croft & Paul Thagard - unknown
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables.Jiji Zhang & Peter Spirtes - unknown
Peirce's Logical Graphs for Boolean Algebras and Distributive Lattices.Minghui Ma - 2018 - Transactions of the Charles S. Peirce Society 54 (3):320.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Remarks on the iconicity and interpretation of existential graphs.Risto Hilpinen - 2011 - Semiotica 2011 (186):169-187.
Relational treatment of term graphs with bound variables.W. Kahl - 1998 - Logic Journal of the IGPL 6 (2):259-303.
Using regression-match graphs to control search in planning.Drew McDermott - 1999 - Artificial Intelligence 109 (1-2):111-159.
Probabilistic planning with clear preferences on missing information.Maxim Likhachev & Anthony Stentz - 2009 - Artificial Intelligence 173 (5-6):696-721.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,324,759)

6 months
7 (#441,834)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Truncated incremental search.Sandip Aine & Maxim Likhachev - 2016 - Artificial Intelligence 234 (C):49-77.
WeightedA∗search – unifying view and application.Rüdiger Ebendt & Rolf Drechsler - 2009 - Artificial Intelligence 173 (14):1310-1342.

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Adaptive Planning.Richard Alterman - 1988 - Cognitive Science 12 (3):393-421.
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.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.

View all 8 references / Add more references