Generalized best-first search strategies and the optimality of A*
From MaRDI portal
Publication:3768428
DOI10.1145/3828.3830zbMath0631.68075OpenAlexW2134634502WikidataQ56115196 ScholiaQ56115196MaRDI QIDQ3768428
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Balanced multi-perspective checking of process conformance, Heuristic search for one-to-many shortest path queries, AStarix: Fast and Optimal Sequence-to-Graph Alignment, Weighted \(A^*\) search - unifying view and application, Utility of pathmax in partial order heuristic search, An upper bound on the time complexity of iterative-deepening-\(A^*\), Admissibility of \(AO^ *\) when heuristics overestimate, Conflict-directed \(A^{*}\) and its role in model-based embedded systems, Merge-and-Shrink Abstraction, Reducing the solution space of optimal task scheduling, Anytime search in dynamic graphs, Intelligent transportation systems -- Enabling technologies, \(BS^*:\) An admissible bidirectional staged heuristic search algorithm, Increasing search efficiency using multiple heuristics, Efficiently Listing Bounded Length st-Paths, Bounds for the Quantifier Depth in Finite-Variable Logics, A survey of motion planning algorithms from the perspective of autonomous UAV guidance, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, A numerical study of the bottom-up and top-down inference processes in and-or graphs, Conflict-tolerant and conflict-free multi-agent meeting, K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths, Probabilistic CEGAR, Computing alignments with maximum synchronous moves via replay in coordinate planes, Lower bound sets for biobjective shortest path problems, Information-theoretic approaches to branching in search, A comparison of heuristic best-first algorithms for bicriterion shortest path problems, Inconsistent heuristics in theory and practice, Sparse reconstruction for bioluminescence tomography based on the semigreedy method, An online multi-agent co-operative learning algorithm in POMDPs, Breadth-first heuristic search, Waveprint: Efficient wavelet-based audio fingerprinting, Dynamically improved bounds bidirectional search, Automated theorem proving in Euler diagram systems, A new result on the complexity of heuristic estimates for the \(A^*\) algorithm, Rational deployment of multiple heuristics in optimal state-space search, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Effective use of memory in iterative deepening search, Linear-space best-first search, Remarks on the \(\mathrm A^{\ast\ast}\) algorithm, A genetic algorithm for the zen puzzle garden game, LAO*: A heuristic search algorithm that finds solutions with loops, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions, Evaluating the impact of AND/OR search on 0-1 integer linear programming, IDB-ADOPT: A Depth-First Search DCOP Algorithm, Finding optimal solutions to the graph partitioning problem with heuristic search, 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, Learning for efficient search, Performance of linear-space search algorithms, Survey on Directed Model Checking, Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm, Performance of linear-space search algorithms, Computation of the optimal value function in time-dependent networks, Some new perspectives for solving 0--1 integer programming problems using balas method, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, A framework for analysing state-abstraction methods, Memory intensive AND/OR search for combinatorial optimization in graphical models, Conflict-based search for optimal multi-agent pathfinding, Heuristic allocation based on a dynamic programming state-space representation, Solving the Watchman Route Problem with Heuristic Search, PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE, Average-case analysis of best-first search in two representative directed acyclic graphs
