Potential-based bounded-cost search and Anytime Non-Parametric A ⁎

, , , , &
Artificial Intelligence 214 (C):1-25 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.05.002

Links

PhilArchive



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

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

The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
Herbrandizing search problems in Bounded Arithmetic.Jiří Hanika - 2004 - Mathematical Logic Quarterly 50 (6):577-586.
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
Ordinal notations and well-orderings in bounded arithmetic.Arnold Beckmann, Chris Pollett & Samuel R. Buss - 2003 - Annals of Pure and Applied Logic 120 (1-3):197-223.
Ordinal notations and well-orderings in bounded arithmetic (vol 120, pg 197, 2003).Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291-291.
Probably bounded suboptimal heuristic search.Roni Stern, Gal Dreiman & Richard Valenzano - 2019 - Artificial Intelligence 267 (C):39-57.
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.
The provably total NP search problems of weak second order bounded arithmetic.Leszek Aleksander Kołodziejczyk, Phuong Nguyen & Neil Thapen - 2011 - Annals of Pure and Applied Logic 162 (6):419-446.
Anytime, Anywhere.Marc Steinberg - 2009 - Theory, Culture and Society 26 (2-3):113-138.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
NP Search Problems in Low Fragments of Bounded Arithmetic.Jan Krajíček, Alan Skelley & Neil Thapen - 2007 - Journal of Symbolic Logic 72 (2):649 - 672.
Herbert Simon’s Silent Revolution.Werner Callebaut - 2007 - Biological Theory 2 (1):76-86.
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner & Robert C. Holte - 2016 - Artificial Intelligence 230 (C):51-73.
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,010,467)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

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.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
Heuristic search viewed as path finding in a graph.Ira Pohl - 1970 - Artificial Intelligence 1 (3-4):193-204.
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.

View all 9 references / Add more references