MM: A bidirectional search algorithm that is guaranteed to meet in the middle

, , , &
Artificial Intelligence 252 (C):232-266 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2017.05.004

Links

PhilArchive



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

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

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.
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
Duality in permutation state spaces and the dual search algorithm.Uzi Zahavi, Ariel Felner, Robert C. Holte & Jonathan Schaeffer - 2008 - Artificial Intelligence 172 (4-5):514-540.
BS∗: An admissible bidirectional staged heuristic search algorithm.James B. H. Kwa - 1989 - Artificial Intelligence 38 (1):95-109.
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.
Semantic search in scholarly discourse.Martin Schulz - 2013 - Dictionary of Arguments.
Variable Search Space Converging Genetic Algorithm for Solving System of Non-linear Equations.Deepak Mishra & Venkatesh Ss - 2020 - Journal of Intelligent Systems 30 (1):142-164.
Inconsistent heuristics in theory and practice.Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant & Zhifu Zhang - 2011 - Artificial Intelligence 175 (9-10):1570-1603.
Maximizing over multiple pattern databases speeds up heuristic search.Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam & David Furcy - 2006 - Artificial Intelligence 170 (16-17):1123-1136.
A Hybrid Cuckoo Search and Simulated Annealing Algorithm.Faisal Alkhateeb & Bilal H. Abed-Alguni - 2019 - Journal of Intelligent Systems 28 (4):683-698.
Automated Test Data Generation Using Cuckoo Search and Tabu Search (CSTS) Algorithm.Suhas Santebennur Ranganatha, Sanjay Kumar, Shobhit Khandelwal, Rahul Khandelwal & Praveen Ranjan Srivastava - 2012 - Journal of Intelligent Systems 21 (2):195-224.
A Modified Salp Swarm Algorithm Based on the Perturbation Weight for Global Optimization Problems.Yuqi Fan, Junpeng Shao, Guitao Sun & Xuan Shao - 2020 - Complexity 2020:1-17.
A genetic algorithm with local search strategy for improved detection of community structure.Shuzhuo Li, Yinghui Chen, Haifeng Du & Marcus W. Feldman - 2010 - Complexity 15 (4):NA-NA.
A PC-Style Markov Blanket for High Dimensional Datasets.Joe Ramsey - unknown
Dynamically improved bounds bidirectional search.E. C. Sewell & S. H. Jacobson - 2021 - Artificial Intelligence 291 (C):103405.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,287,956)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Dynamically improved bounds bidirectional search.E. C. Sewell & S. H. Jacobson - 2021 - Artificial Intelligence 291 (C):103405.

Add more citations

References found in this work

On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
BIDA∗: an improved perimeter search algorithm.Giovanni Manzini - 1995 - Artificial Intelligence 75 (2):347-360.
Perimeter search.John F. Dillenburg & Peter C. Nelson - 1994 - Artificial Intelligence 65 (1):165-178.

Add more references