Bidirectional LAO* Algorithm (A Faster Approach to Solve Goal-directed MDPs)
Uncertainty is a feature of many AI applications. While there are polynomial-time algorithms for planning in stochastic systems, planning is still slow, in part because most algorithms plan for all eventualities. Algorithms such as LAO* are able to find good or optimal policies more quickly when the...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2004
|
| Subjects: | |
| Online Access: | http://uknowledge.uky.edu/gradschool_theses/225 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1227&context=gradschool_theses |