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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,248

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

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.
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.
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.
Incremental measurement of structural entropy for dynamic graphs.Runze Yang, Hao Peng, Chunyang Liu & Angsheng Li - 2024 - Artificial Intelligence 334 (C):104175.
Using regression-match graphs to control search in planning.Drew McDermott - 1999 - Artificial Intelligence 109 (1-2):111-159.
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
Average-case analysis of best-first search in two representative directed acyclic graphs.Anup K. Sen, Amitava Bagchi & Weixiong Zhang - 2004 - Artificial Intelligence 155 (1-2):183-206.
Measuring universal intelligence: Towards an anytime intelligence test.José Hernández-Orallo & David L. Dowe - 2010 - Artificial Intelligence 174 (18):1508-1539.

Analytics

Added to PP
2020-12-22

Downloads
21 (#1,148,792)

6 months
9 (#543,708)

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.

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