Pages that link to "Item:Q5941311"
From MaRDI portal
The following pages link to LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311):
Displaying 10 items.
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm (Q300040) (← links)
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization (Q545555) (← links)
- Probabilistic planning with clear preferences on missing information (Q835829) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- Robust topological policy iteration for infinite horizon bounded Markov decision processes (Q1726357) (← links)
- Discovering hidden structure in factored MDPs (Q1761300) (← links)
- Strong planning under partial observability (Q2457630) (← links)
