Linear-space best-first search
From MaRDI portal
Publication:685539
DOI10.1016/0004-3702(93)90045-DzbMath0778.68079WikidataQ88963605 ScholiaQ88963605MaRDI QIDQ685539
Publication date: 13 January 1994
Published in: Artificial Intelligence (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (42)
Memory-limited model-based diagnosis ⋮ Agent searching in a tree and the optimality of iterative deepening ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Duality in permutation state spaces and the dual search algorithm ⋮ Anytime search in dynamic graphs ⋮ Best-first minimax search ⋮ Underconstrained knowledge-intensive constraint satisfaction search ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Tree search and quantum computation ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Parallelizing simulated annealing algorithms based on high-performance computer ⋮ Breadth-first heuristic search ⋮ WHIRL: A word-based information representation language ⋮ Subproblem ordering heuristics for AND/OR best-first search ⋮ A Tutorial on Learning with Bayesian Networks ⋮ Batch repair actions for automated troubleshooting ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Planning as heuristic search ⋮ A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) ⋮ Minimax real-time heuristic search ⋮ Sokoban: Enhancing general single-agent search methods using domain knowledge ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ IDB-ADOPT: A Depth-First Search DCOP Algorithm ⋮ A New Proof-Number Calculation Technique for Proof-Number Search ⋮ Weak Proof-Number Search ⋮ Heuristic search strategies for multiobjective state space search ⋮ Games solved: Now and in the future ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms ⋮ Probably bounded suboptimal heuristic search ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm ⋮ Subdimensional expansion for multirobot path planning ⋮ Unifying single-agent and two-player search ⋮ Heuristic allocation based on a dynamic programming state-space representation ⋮ Controlling the learning process of real-time heuristic search
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Depth-first iterative-deepening: An optimal admissible tree search
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Heuristic search in restricted memory
- An upper bound on the time complexity of iterative-deepening-\(A^*\)
- Heuristic search viewed as path finding in a graph
- Real-time heuristic search
- Generalized best-first search strategies and the optimality of A*
This page was built for publication: Linear-space best-first search
