Weighted \(A^*\) search - unifying view and application
From MaRDI portal
Publication:840833
DOI10.1016/j.artint.2009.06.004zbMath1194.68207OpenAlexW2016820997WikidataQ59242697 ScholiaQ59242697MaRDI QIDQ840833
Rolf Drechsler, Rüdiger Ebendt
Publication date: 14 September 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2009.06.004
Related Items (3)
Goal distance estimation for automated planning using neural networks and support vector machines ⋮ A framework for analysing state-abstraction methods ⋮ A pipe routing hybrid approach based on A-star search and linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Worst case examples for operations on OBDDs
- Linear-space best-first search
- Conformant planning via symbolic model checking and heuristic search
- The \((n^ 2-1)\)-puzzle and related relocation problems
- Heuristic search in restricted memory
- A complete anytime algorithm for number partitioning
- Reduction of OBDDs in linear time
- KBFS: K-Best-First Search
- The nonapproximability of OBDD minimization
- Anytime search in dynamic graphs
- Heuristic search viewed as path finding in a graph
- Frontier search
- Graph-Based Algorithms for Boolean Function Manipulation
- Generalized best-first search strategies and the optimality of A*
- Studies in Semi-Admissible Heuristics
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Improving the variable ordering of OBDDs is NP-complete
- AI 2003: Advances in Artificial Intelligence
- Finding the optimal variable ordering for binary decision diagrams
- Planning as heuristic search
This page was built for publication: Weighted \(A^*\) search - unifying view and application
