Tie-breaking strategies for cost-optimal best first search

DOI10.1613/JAIR.5249zbMATH Open1401.68284OpenAlexW2572082325WikidataQ129489211 ScholiaQ129489211MaRDI QIDQ2956545FDOQ2956545

Authors: Masataro Asai, Alex Fukunaga 

Publication date: 18 January 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5249

Recommendations

• Generalized best-first search strategies and the optimality of A*
• Linear-space best-first search
• A solution to the GHI problem for best-first search
• Breadth-first heuristic search
• Generalized best first search using single and multiple heuristics

zbMATH Keywords

planningheuristic search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (3)

• Heuristic search for one-to-many shortest path queries
• KBFS: K-Best-First Search
• A solution to the GHI problem for best-first search

This page was built for publication: Tie-breaking strategies for cost-optimal best first search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956545)