\(\text{BIDA}^*\): An improved perimeter search algorithm

DOI10.1016/0004-3702(95)00017-9zbMath1013.68546OpenAlexW1975532906MaRDI QIDQ1855228

Giovanni Manzini

Publication date: 4 February 2003

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

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00017-9

Mathematics Subject Classification ID

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

Related Items (9)

Perimeter search in restricted memory ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Maximizing over multiple pattern databases speeds up heuristic search ⋮ Sokoban: Enhancing general single-agent search methods using domain knowledge ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation ⋮ Unifying single-agent and two-player search ⋮ Heuristics as Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Bidirectional heuristic search with limited resources
• Group graphs and computational symmetry on massively parallel architecture
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Effective use of memory in iterative deepening search
• Heuristic search in restricted memory
• Bidirectional Heuristic Search Again
• An Improved Bidirectional Heuristic Search Algorithm

This page was built for publication: \(\text{BIDA}^*\): An improved perimeter search algorithm