Weighted A^* search - unifying view and application
From MaRDI portal
(Redirected from Publication:840833)
Recommendations
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- Weighted Multidimensional Search and Its Application to Convex Optimization
- A unifying approach to heuristic search
- Weighted heuristic search in networks
- Approximate search strategies for weighted trees
- scientific article; zbMATH DE number 4045171
- Incorporating weights into real-time heuristic search
- A new approach for weighted constraint satisfaction
- Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
- scientific article; zbMATH DE number 1215044
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 67474 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- scientific article; zbMATH DE number 1487475 (Why is no real title available?)
- scientific article; zbMATH DE number 2086969 (Why is no real title available?)
- scientific article; zbMATH DE number 2243390 (Why is no real title available?)
- A complete anytime algorithm for number partitioning
- A note on two problems in connexion with graphs
- AI 2003: Advances in Artificial Intelligence
- Anytime heuristic search
- Anytime search in dynamic graphs
- Conformant planning via symbolic model checking and heuristic search
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Finding the optimal variable ordering for binary decision diagrams
- Frontier search
- Generalized best-first search strategies and the optimality of A*
- Graph-Based Algorithms for Boolean Function Manipulation
- Heuristic search in restricted memory
- Heuristic search viewed as path finding in a graph
- Improving the variable ordering of OBDDs is NP-complete
- KBFS: K-Best-First Search
- Linear-space best-first search
- Planning as heuristic search
- Reduction of OBDDs in linear time
- Studies in Semi-Admissible Heuristics
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The nonapproximability of OBDD minimization
- Worst case examples for operations on OBDDs
Cited in
(9)- AI 2003: Advances in Artificial Intelligence
- Effective heuristics for suboptimal best-first search
- Goal distance estimation for automated planning using neural networks and support vector machines
- State-set branching: leveraging BDDs for heuristic search
- Incorporating weights into real-time heuristic search
- A pipe routing hybrid approach based on A-star search and linear programming
- A framework for analysing state-abstraction methods
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
This page was built for publication: Weighted \(A^*\) search - unifying view and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840833)
