Switch to: References

Add citations

You must login to add citations.
  1. 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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • A crossword solving system based on Monte Carlo tree search.Jingping Liu, Lihan Chen, Sihang Jiang, Chao Wang, Sheng Zhang, Jiaqing Liang, Yanghua Xiao & Rui Song - 2024 - Artificial Intelligence 335 (C):104192.
    Download  
     
    Export citation  
     
    Bookmark  
  • Truncated incremental search.Sandip Aine & Maxim Likhachev - 2016 - Artificial Intelligence 234 (C):49-77.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Speeding up problem solving by abstraction: a graph oriented approach.R. C. Holte, T. Mkadmi, R. M. Zimmer & A. J. MacDonald - 1996 - Artificial Intelligence 85 (1-2):321-361.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Generative models for grid-based and image-based pathfinding.Daniil Kirilenko, Anton Andreychuk, Aleksandr I. Panov & Konstantin Yakovlev - 2025 - Artificial Intelligence 338 (C):104238.
    Download  
     
    Export citation  
     
    Bookmark  
  • WeightedA∗search – unifying view and application.Rüdiger Ebendt & Rolf Drechsler - 2009 - Artificial Intelligence 173 (14):1310-1342.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Incorporating weights into real-time heuristic search.Nicolás Rivera, Jorge A. Baier & Carlos Hernández - 2015 - Artificial Intelligence 225 (C):1-23.
    Download  
     
    Export citation  
     
    Bookmark  
  • A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees.Xiaoyu He, Xueyan Tang, Wentong Cai & Jingning Li - 2024 - Artificial Intelligence 329 (C):104084.
    Download  
     
    Export citation  
     
    Bookmark  
  • Distributed extended beam search for quantitative model checking.Anton J. Wijs & Bert Lisser - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 166--184.
    Download  
     
    Export citation  
     
    Bookmark  
  • Probably bounded suboptimal heuristic search.Roni Stern, Gal Dreiman & Richard Valenzano - 2019 - Artificial Intelligence 267 (C):39-57.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The heuristic search under conditions of error.Larry R. Harris - 1974 - Artificial Intelligence 5 (3):217-234.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Controlling the learning process of real-time heuristic search.Masashi Shimbo & Toru Ishida - 2003 - Artificial Intelligence 146 (1):1-41.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A heuristic search algorithm with modifiable estimate.László Mérõ - 1984 - Artificial Intelligence 23 (1):13-27.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark