{"type":"ScholarlyArticle","title":"Efficient Budgeted Graph Search","authors":[{"name":"Jasmeet Kaur","slug":"jasmeet-kaur","given":"Jasmeet","family":"Kaur","affiliation":"Department of Computing Science , University of Alberta , Canada"},{"name":"Nathan R. Sturtevant","slug":"nathan-r-sturtevant","given":"Nathan R.","family":"Sturtevant","affiliation":"Department of Computing Science , University of Alberta , Canada; Alberta Machine Intelligence Institute (Amii)"}],"abstract":"Iterative Budgeted Exponential Search (IBEX) is a general search algorithm that can limit the number of re-expansions performed in common problems like iterative-deepening tree search and search with inconsistent heuristics. IBEX has been adapted into a specific tree algorithm, Budgeted Tree Search (BTS), which behaves like IDA* when the problem instance is well-behaved but keeps the worst-case guarantees when problems are not well-behaved. The analogous algorithms on graphs, Budgeted Graph Search (BGS), do not have these same properties. This paper reformulates BGS into Efficient Budgeted Graph Search (BGSe), showing how to implement the algorithm so that it behaves identically to A* when problems are well-behaved, and retains the best-case performance otherwise. Experimental results validate the performance of BGSe on a range of theoretical and practical problem instances.","doi":"10.24963/ijcai.2022/660","url":"https://ijcai.org/proceedings/2022/660","pdf":"https://ijcai.org/proceedings/2022/0660.pdf","markdown":"https://ijcai.org/proceedings/2022/660.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/660","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Search","track":"Main Track","number":660,"pages":{"first":4761,"last":4768},"keywords":["Search: Heuristic Search"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986842","length_sec":91,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984985","length_sec":360,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Bagchi and Mahanti, 1983] Amitava Bagchi and Ambuj Mahanti. Search algorithms under different kinds of heuristics-a comparative study. Journal of the ACM (JACM), 30(1):1-21, 1983.","title":"Search algorithms under different kinds of heuristics-a comparative study","authors":"Amitava Bagchi, Ambuj Mahanti","year":"1983","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bentley and Yao, 1976] Jon Louis Bentley and Andrew Chi-Chih Yao. An almost optimal algorithm for un- bounded searching. Information processing letters, 5(SLAC-PUB-1679), 1976.","title":"An almost optimal algorithm for unbounded searching","authors":"Yao Bentley, Jon, Louis Bentley, Andrew Chi-Chih Yao","year":"1976","venue":"Information processing letters","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dechter and Pearl, 1985] Rina Dechter and Judea Pearl. Generalized best-first search strategies and the optimality of A*. Journal of the ACM (JACM), 32(3):505-536, 1985.","title":"Generalized best-first search strategies and the optimality of A*","authors":"Rina Dechter, Judea Pearl","year":"1985","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Eckerle et al., 2017] Jürgen Eckerle, Jingwei Chen, Nathan Sturtevant, Sandra Zilles, and Robert Holte. Sufficient conditions for node expansion in bidirectional heuristic search. In International Conference on Automated Plan- ning and Scheduling (ICAPS), 2017.","title":"Sufficient conditions for node expansion in bidirectional heuristic search","authors":"Jürgen Eckerle, Jingwei Chen, Nathan Sturtevant, Sandra Zilles, Robert Holte","year":"2017","venue":"International Conference on Automated Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Felner et al., 2011] Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, and Zhifu Zhang. Inconsistent heuristics in theory and practice. Artificial Intelligence, 175(9-10):1570-1603, 2011.","title":"Inconsistent heuristics in theory and practice","authors":"Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Geisberger et al., 2008] Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. Contraction hi- erarchies: Faster and simpler hierarchical routing in road networks. In International Workshop on Experimental and Efficient Algorithms, pages 319-333. Springer, 2008.","title":"Contraction hierarchies: Faster and simpler hierarchical routing in road networks","authors":"Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling","year":"2008","venue":"International Workshop on Experimental and Efficient Algorithms","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Goldberg and Harrelson, 2005] Andrew V Goldberg and Chris Harrelson. Computing the shortest path: A search meets graph theory. In SODA, volume 5, pages 156-165.","title":"Computing the shortest path: A search meets graph theory","authors":"V Andrew, Chris Goldberg, Harrelson","year":null,"venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Goldenberg et al., 2011] Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, and Jonathan Schaeffer. The compressed differential heuristic. In AAAI Conference on Artificial Intelligence, pages 24-29, 2011.","title":"The compressed differential heuristic","authors":"Meir Goldenberg, Nathan R Sturtevant, Ariel Felner, Jonathan Schaeffer","year":"2011","venue":"AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Goldenberg et al., 2017] Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan Sturtevant, and Jonathan Schaef- fer. The compressed differential heuristic. AI Communi- cations, 30(6):393-418, 2017.","title":"The compressed differential heuristic","authors":"Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan Sturtevant, Jonathan Schaeffer","year":"2017","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hart et al., 1968] Peter E Hart, Nils J Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Sci- ence and Cybernetics, 4(2):100-107, 1968.","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"Nils J Peter E Hart, Bertram Nilsson, Raphael","year":"1968","venue":"IEEE transactions on Systems Science and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Helmert et al., 2019] Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, and Nathan R. Sturtevant. It- erative budgeted exponential search. International Joint Conference on Artificial Intelligence (IJCAI), 2019.","title":"Iterative budgeted exponential search","authors":"Malte Helmert, Tor Lattimore, H S Levi, Laurent Lelis, Nathan R Orseau, Sturtevant","year":"2019","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2019/174"},{"position":12,"raw":"[Kwa, 1989] James BH Kwa. Bs: An admissible bidirec- tional staged heuristic search algorithm. Artificial Intelli- gence, 38(1):95-109, 1989.","title":"Bs: An admissible bidirectional staged heuristic search algorithm","authors":"B H James, Kwa","year":"1989","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Martelli, 1977] Alberto Martelli. On the complexity of ad- missible search algorithms. Artificial Intelligence, 8(1):1- 13, 1977.","title":"On the complexity of admissible search algorithms","authors":"Alberto Martelli","year":"1977","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Mero, 1984] Laszlo Mero. A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 23(1):13- 27, 1984.","title":"A heuristic search algorithm with modifiable estimate","authors":"Laszlo Mero","year":"1984","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Sturtevant et al., 2009] N. R. Sturtevant, A. Felner, M. Barer, J. Schaeffer, and N. Burch. Memory-based heuristics for explicit state spaces. International Joint Conference on Artificial Intelligence (IJCAI), pages 609-614, 2009.","title":"Memory-based heuristics for explicit state spaces","authors":"N R Sturtevant, A Felner, M Barer, J Schaeffer, N Burch","year":"2009","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2009/107"},{"position":16,"raw":"[Sturtevant, 2012] Nathan R. Sturtevant. Benchmarks for grid-based pathfinding. Transactions on Computational Intelligence and AI in Games, 4(2):144-148, 2012.","title":"Benchmarks for grid-based pathfinding","authors":"Nathan R Sturtevant","year":"2012","venue":"Transactions on Computational Intelligence and AI in Games","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Zhang et al., 2009] Zhifu Zhang, Nathan R Sturtevant, Robert Holte, Jonathan Schaeffer, and Ariel Felner. A* search with inconsistent heuristics. In Twenty-First Inter- national Joint Conference on Artificial Intelligence, 2009.","title":"A* search with inconsistent heuristics","authors":"Zhang","year":"2009","venue":"Twenty-First International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2009/111"},{"position":18,"raw":"[Zhou and Hansen, 2006] Rong Zhou and Eric A Hansen. Breadth-first heuristic search. Artificial Intelligence, 170(4-5):385-408, 2006.","title":"Breadth-first heuristic search","authors":"Rong Zhou, Eric A Hansen","year":"2006","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}