Weighted \(A^*\) search - unifying view and application
type: Item
instance of: scholarly article
title: Weighted \(A^*\) search - unifying view and application
zbMATH Open document ID: 1194.68207
author: Rüdiger Ebendt
author: Rolf Drechsler
published in: Artificial Intelligence
publication date: 2009-09-14T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5603693
zbMATH Keywords: planning
zbMATH Keywords: search
zbMATH Keywords: heuristic search
zbMATH Keywords: \(A^{*}\)
zbMATH Keywords: weighted \(A^{*}\)
zbMATH Keywords: BDD
zbMATH Keywords: STRIPS
describes a project that uses: Graphviz
describes a project that uses: Walksat
describes a project that uses: CUDD
describes a project that uses: STAN
describes a project that uses: Algorithm 360
MaRDI profile type: Publication
full work available at URL: j.artint.2009.06.004
OpenAlex ID: W2016820997
Wikidata QID: Q59242697
cites work: Conformant planning via symbolic model checking and heuristic search
cites work: Improving the variable ordering of OBDDs is NP-complete
cites work: Planning as heuristic search
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4012204
cites work: Heuristic search in restricted memory
cites work: Generalized best-first search strategies and the optimality of A*
cites work: A note on two problems in connexion with graphs
cites work: KBFS: K-Best-First Search
cites work: Finding the optimal variable ordering for binary decision diagrams
cites work: Q4198056
cites work: Q3624053
cites work: Q4737581
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Q4386972
cites work: Linear-space best-first search
cites work: A complete anytime algorithm for number partitioning
cites work: Frontier search
cites work: Anytime search in dynamic graphs
cites work: Q4242054
cites work: Q3856120
cites work: Studies in Semi-Admissible Heuristics
cites work: Heuristic search viewed as path finding in a graph
cites work: AI 2003: Advances in Artificial Intelligence
cites work: The \((n^ 2-1)\)-puzzle and related relocation problems
cites work: Q4493879
cites work: Q5715704
cites work: The nonapproximability of OBDD minimization
cites work: Reduction of OBDDs in linear time
cites work: Worst case examples for operations on OBDDs
DOI: 10.1016/J.ARTINT.2009.06.004
DBLP publication ID: journals/ai/EbendtD09
Recommended article: Weighted heuristic anytime search: new schemes for optimization over graphical models
Recommended article: Weighted Multidimensional Search and Its Application to Convex Optimization
Recommended article: A unifying approach to heuristic search
Recommended article: Weighted heuristic search in networks
Recommended article: Approximate search strategies for weighted trees
Recommended article: Q3782798
Recommended article: Incorporating weights into real-time heuristic search
Recommended article: A new approach for weighted constraint satisfaction
Recommended article: Multiobjective A * search with consistent heuristics
Recommended article: Q4216482
description: scientific article; zbMATH DE number 5603693