LAO*: A heuristic search algorithm that finds solutions with loops
From MaRDI portal
Publication:5941311
DOI10.1016/S0004-3702(01)00106-0zbMath0971.68036OpenAlexW2105757562MaRDI QIDQ5941311
No author found.
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00106-0
Related Items
Automatic workflow verification and generation, Probabilistic planning with clear preferences on missing information, The factored policy-gradient planner, Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm, Avoiding Negative Side Effects of Autonomous Systems in the Open World, An anytime algorithm for constrained stochastic shortest path problems with deterministic policies, GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory, Depth-based short-sighted stochastic shortest path problems, Plan aggregation for strong cyclic planning in nondeterministic domains, Robust topological policy iteration for infinite horizon bounded Markov decision processes, Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization, Strong planning under partial observability, Discovering hidden structure in factored MDPs, Conformant plans and beyond: principles and complexity, An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization, Planning under uncertainty as G<scp>OLOG</scp>programs, Influence of modeling structure in probabilistic sequential decision problems, Accelerating the convergence of value iteration by using partial transition functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic search algorithm with modifiable estimate
- Admissibility of \(AO^ *\) when heuristics overestimate
- An efficient algorithm for searching implicit AND/OR graphs with cycles
- Real-time heuristic search
- Application of heuristic search and information theory to sequential fault diagnosis
- Generalized best-first search strategies and the optimality of A*
- Optimizing decision trees through heuristically guided search
