A framework is proposed for the investigation of planning systems that must deal with bounded uncertainty. A definition of this new class of contingency planners is given. A general, complete contingency planning algorithm is described. The algorithm is suitable to many incomplete information games as well as planning situations where the initial state is only partially known. A rich domain is identified for the application and evaluation of contingency planners. Preliminary results from applying our complete contingency planner to a portion of this domain are encouraging and match expert level performance.
Cookie Settings
eScholarship uses cookies to ensure you have the best experience on our website. You can manage which cookies you want us to use.
Our Privacy Statement includes more details on the cookies we use and how we protect your privacy.
