scientific article; zbMATH DE number 4162303

MaRDI QIDQ3489496zbMATH OpenFDO

Authors Anup K. Sen, Amitava Bagchi

Publication date 1989

zbMATH Keywords

AND/OR graphs with loopsheuristic searchiterative deepening \(A^ *\)recursive search algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Heuristic search in restricted memory
• A faster alternative to \(SSS^*\) with extension to variable memory
• Effective use of memory in iterative deepening search
• Breadth-first heuristic search
• On the asymptotic performance of IDA

Cited in

(16)

• Improving the efficiency of depth-first search by cycle elimination
• Heuristic search in restricted memory
• On the asymptotic performance of IDA
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Improving search efficiency using possible subgoals
• Accelerating backtrack search with a best-first-search strategy
• Finding optimal solutions to the graph partitioning problem with heuristic search
• Enhanced partial expansion A^*
• Performance of linear-space search algorithms
• Performance of linear-space search algorithms
• Planning as heuristic search
• Planning and control in artificial intelligence: A unifying perspective
• Heuristic search strategies for multiobjective state space search
• Heuristically ordered search in state graphs
• Linear-space best-first search
• A faster alternative to \(SSS^*\) with extension to variable memory

This page was built for publication:

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