Heuristic search viewed as path finding in a graph

DOI10.1016/0004-3702(70)90007-XzbMath0206.22603OpenAlexW2035601288MaRDI QIDQ2542693

I. Pohl

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1016/0004-3702(70)90007-x

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Weighted \(A^*\) search - unifying view and application, An upper bound on the time complexity of iterative-deepening-\(A^*\), Iterative Deepening Dynamically Improved Bounds Bidirectional Search, HEURISTIC SEARCH UNDER CONTRACT, Incorporating weights into real-time heuristic search, Local branching relaxation heuristics for integer linear programs, A method for computing heuristics in problem solving, Unnamed Item, Extended beam search for non-exhaustive state space analysis, Weighted heuristic anytime search: new schemes for optimization over graphical models, Linear-space best-first search, Potential-based bounded-cost search and anytime non-parametric A*, On the complexity of admissible search algorithms, On the optimality of A, Problem representations and formal properties of heuristic search, Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots, An integrated model of problem solver, Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm, Heuristically guided search and chromosome matching, Heuristic search viewed as path finding in a graph, Anytime pack search, Candidate Sets for Alternative Routes in Road Networks, Probably bounded suboptimal heuristic search, The heuristic search under conditions of error, A heuristic search algorithm with modifiable estimate, Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization, Truncated incremental search, Controlling the learning process of real-time heuristic search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic search viewed as path finding in a graph
• Heuristic search
• Branch-and-Bound Methods: A Survey
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• An Appraisal of Some Shortest-Path Algorithms
• A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees
• ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
• Sufficient Conditions for the Success of GPS
• A Formal Deductive Problem-Solving System