Truncated incremental search
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2038901 (Why is no real title available?)
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Anytime heuristic search
- Anytime search in dynamic graphs
- Heuristic search for the generalized minimum spanning tree problem
- Heuristic search viewed as path finding in a graph
- Learning optimal Bayesian networks: a shortest path perspective
- Lifelong planning \(\text{A}^*\)
- Planning as heuristic search
- Potential-based bounded-cost search and anytime non-parametric A*
- Real-time heuristic search
- Solving constraint optimization problems from CLP-style specifications using heuristic search techniques
- Studies in Semi-Admissible Heuristics
- Three approaches to heuristic search in networks
- Using interpolation to improve path planning: The Field D* algorithm
Cited in
(6)
This page was built for publication: Truncated incremental search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q253972)