论文信息 - Efficient Memory-Limited Graph Search

Efficient Memory-Limited Graph Search

In this paper we present a heuristic search algorithm, DBIDA*, which uses a given, bounded memory of size m. Previously published algorithms like IDA*, IDA*-CR, MA*, SMA*, etc. expand up to Ω(n2) nodes, where n is the number of nodes expanded by A*, or suffers from an high overhead per node expansion which limits their applicability to practical problems.

Sven Schuierer | Jürgen Eckerle | S. Schuierer | J. Eckerle

[1] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[2] Dana S. Nau,et al. Performance of IDA on Trees and Graphs , 1992, AAAI.

[3] Stuart J. Russell. Efficient Memory-Bounded Search Methods , 1992, ECAI.

[4] Hermann Kaindl,et al. Memory-Bounded Bidirectional Search , 1994, AAAI.

[5] P. P. Chakrabarti,et al. Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds , 1991, Artif. Intell..

[6] Ambuj Mahanti,et al. Bidirectional Heuristic Search with Limited Resources , 1991, Inf. Process. Lett..

[7] Alexander Reinefeld,et al. Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA , 1993, IJCAI.

[8] P. P. Chakrabarti,et al. Heuristic Search in Restricted Memory , 1989, Artif. Intell..

[9] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..

[10] Amitava Bagchi,et al. Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory , 1989, IJCAI.

[11] Dana S. Nau,et al. ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm , 1994, AAAI.

[12] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .

[13] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.