Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Bidirectional Lao* Algorithm (A Faster Approach To Solve Goal-Directed Mdps), Venkata Deepti Kiran Bhuma
Bidirectional Lao* Algorithm (A Faster Approach To Solve Goal-Directed Mdps), Venkata Deepti Kiran Bhuma
University of Kentucky Master's Theses
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 starting state of the system is known.
In this thesis we present an extension to LAO*, called BLAO*. BLAO* is an extension of the LAO* algorithm to a bidirectional search. We show that BLAO* finds optimal or E-optimal solutions for goal-directed MDPs without necessarily evaluating the entire state space. BLAO* …