Generalized best-first search strategies and the optimality of A*
From MaRDI portal
Publication:3768428
DOI10.1145/3828.3830zbMATH Open0631.68075OpenAlexW2134634502WikidataQ56115196 ScholiaQ56115196MaRDI QIDQ3768428FDOQ3768428
Authors: Judea Pearl, Rina Dechter 
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3828.3830
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (84)
- Heuristic search for one-to-many shortest path queries
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- Effective heuristics for suboptimal best-first search
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Performance of linear-space search algorithms
- Breadth-first heuristic search
- Computation of the optimal value function in time-dependent networks
- Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
- A numerical study of the bottom-up and top-down inference processes in and-or graphs
- Balanced multi-perspective checking of process conformance
- Survey on Directed Model Checking
- An upper bound on the time complexity of iterative-deepening-\(A^*\)
- Conflict-based search for optimal multi-agent pathfinding
- Enhanced partial expansion A\(^*\)
- Tie-breaking strategies for cost-optimal best first search
- Information-theoretic approaches to branching in search
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method
- Learning for efficient search
- Weighted \(A^*\) search - unifying view and application
- Rational deployment of multiple heuristics in optimal state-space search
- Increasing search efficiency using multiple heuristics
- Merge-and-Shrink Abstraction
- AI*IA 2005: Advances in Artificial Intelligence
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- Efficiently listing bounded length \(st\)-paths
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Intelligent transportation systems -- Enabling technologies
- The generalized A* architecture
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance
- Title not available (Why is that?)
- Potential-based bounded-cost search and anytime non-parametric A*
- LAO*: A heuristic search algorithm that finds solutions with loops
- Anytime search in dynamic graphs
- IDB-ADOPT: A Depth-First Search DCOP Algorithm
- Reducing the solution space of optimal task scheduling
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
- Automated theorem proving in Euler diagram systems
- A general best first search algorithm in AND/OR graphs
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Lower bound sets for biobjective shortest path problems
- Probabilistic CEGAR
- KBFS: K-Best-First Search
- Linear-space best-first search
- Generalized best first search using single and multiple heuristics
- A comparative study of task assignment and path planning methods for multi-UGV missions
- Inconsistent heuristics in theory and practice
- A new result on the complexity of heuristic estimates for the \(A^*\) algorithm
- Heuristic allocation based on a dynamic programming state-space representation
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- Effective use of memory in iterative deepening search
- Utility of pathmax in partial order heuristic search
- Title not available (Why is that?)
- A genetic algorithm for the zen puzzle garden game
- Dynamically improved bounds bidirectional search
- On the Optimality of Randomized $\alpha$-$\beta$ Search
- Solving the Watchman Route Problem with Heuristic Search
- \textsc{AStarix}: fast and optimal sequence-to-graph alignment
- Completeness and admissibility for general heuristic search algorithms -- a theoretical study: Basic concepts and proofs
- Waveprint: Efficient wavelet-based audio fingerprinting
- Average-case analysis of best-first search in two representative directed acyclic graphs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Finding optimal solutions to the graph partitioning problem with heuristic search
- A solution to the GHI problem for best-first search
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Admissibility of \(AO^ *\) when heuristics overestimate
- Conflict-tolerant and conflict-free multi-agent meeting
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- A more effective version of algorithm A
- Title not available (Why is that?)
- Heuristically ordered search in state graphs
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
- Heuristic search strategies for multiobjective state space search
- Augmenting bi-objective branch and bound by scalarization-based information
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- Computing alignments with maximum synchronous moves via replay in coordinate planes
- A family of admissible heuristics for \(\mathrm{A}^*\) to perform inference in probabilistic classifier chains
- An online multi-agent co-operative learning algorithm in POMDPs
- Performance of linear-space search algorithms
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Bounds for the quantifier depth in finite-variable logics: alternation hierarchy
- A framework for analysing state-abstraction methods
- Comparision of 3 implementations of the \(A^*\) algorithm
This page was built for publication: Generalized best-first search strategies and the optimality of A*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768428)
