Heuristic search viewed as path finding in a graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3451443 (Why is no real title available?)
- scientific article; zbMATH DE number 3347627 (Why is no real title available?)
- scientific article; zbMATH DE number 3351222 (Why is no real title available?)
- scientific article; zbMATH DE number 3351223 (Why is no real title available?)
- A Formal Deductive Problem-Solving System
- A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees
- An Appraisal of Some Shortest-Path Algorithms
- Branch-and-Bound Methods: A Survey
- Experiments With a Multipurpose, Theorem-Proving Heuristic Program
- Heuristic search
- Heuristic search viewed as path finding in a graph
- ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
- Sufficient Conditions for the Success of GPS
Cited in
(31)- Truncated incremental search
- Heuristically guided search and chromosome matching
- Incorporating weights into real-time heuristic search
- Candidate sets for alternative routes in road networks
- An upper bound on the time complexity of iterative-deepening-\(A^*\)
- Weighted \(A^*\) search - unifying view and application
- Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots
- Anytime pack search
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- A heuristic search algorithm with modifiable estimate
- Controlling the learning process of real-time heuristic search
- Planning in artificial intelligence
- Potential-based bounded-cost search and anytime non-parametric A*
- An integrated model of problem solver
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- Heuristic search viewed as path finding in a graph
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search
- The heuristic search under conditions of error
- Heuristic search under contract
- Linear-space best-first search
- A method for computing heuristics in problem solving
- On the optimality of A
- Local branching relaxation heuristics for integer linear programs
- Problem representations and formal properties of heuristic search
- A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees
- Extended beam search for non-exhaustive state space analysis
- Probably bounded suboptimal heuristic search
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- Generative models for grid-based and image-based pathfinding
- On the complexity of admissible search algorithms
This page was built for publication: Heuristic search viewed as path finding in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2542693)
