2013arXiv (Cornell University)Open access

Approximately Optimal Monitoring of Plan Preconditions

Craig Boutilier

Open full text 0 citations

Abstract

Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, monitoring is generally costly, and some precondition failures have a very small impact on plan quality. We formulate a model for optimal precondition monitoring, using partially-observable Markov decisions processes, and describe methods for solving this model effectively, though approximately. Specifically, we show that the single-precondition monitoring problem is generally tractable, and the multiple-precondition monitoring policies can be effectively approximated using single-precondition solutions. 1 Introduction Uncertainty in planning problems is often handled by modeling the problem deterministically---enabling classical planning techniques to be used---but using methods for execution monitoring and replanning to handle situations that arise when the plan fails (e.g., when a precondition...

About this research paper

What this paper is about

Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, monitoring is generally costly, and some precondition failures have a very small impact on plan quality. We formulate a model for optimal precondition monitoring, using partially-observable Markov decisions processes, and describe methods for solving this model effectively, though approximately. Specifically, we show that the single-precondition monitoring problem is generally tractable, and the multiple-precondition monitoring policies can be effectively approximated using single-precondition solutions. 1 Introduction Uncertainty in planning problems is often handled by modeling the problem deterministically---enabling classical planning techniques to be used---but using methods for execution monitoring and replanning to handle situations that arise when the plan fails (e.g., when a precondition...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, monitoring is generally costly, and some precondition failures have a very small impact on plan quality. We formulate a model for optimal precondition monitoring, using partially-observable Markov decisions processes, and describe methods for solving this model effectively, though approximately. Specifically, we show that the single-precondition monitoring problem is generally tractable, and the multiple-precondition monitoring policies can be effectively approximated using single-precondition solutions. 1 Introduction Uncertainty in planning problems is often handled by modeling the problem deterministically---enabling classical planning techniques to be used---but using methods for execution monitoring and replanning to handle situations that arise when the plan fails (e.g., when a precondition...

Key concepts: Precondition, Plan (archaeology), Computer science, Predicate transformer semantics, Point (geometry), Markov process, Risk analysis (engineering), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Approximately Optimal Monitoring of Plan Preconditions — Research Paper | ScholarLens