Making Locally Optimal Decisions on Graphs with Cycles


We present two new algorithms, LCM and IBFS, that make locally optimal incre-mental planning decisions for the task of nding a path to a goal state in a problem space that contains cycles. Earlier work (RTA* 10]) only solves this locally optimal decision problem when the problem space is tree structured. We precisely characterize the time and space… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics