Bidirectional heuristic search with limited resources

DOI10.1016/0020-0190(91)90203-TzbMath0741.68090OpenAlexW1993477777MaRDI QIDQ1183503

Ambuj Mahanti, Subrata Ghosh

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90203-t

zbMATH Keywords

Heuristic search strategies

Mathematics Subject Classification ID

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

Related Items (3)

Perimeter search in restricted memory ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Bidirectional Heuristic Search Again
• An Improved Bidirectional Heuristic Search Algorithm

This page was built for publication: Bidirectional heuristic search with limited resources