---
title: "Solving Time-Dependent Planning Problems"
authors:
  - "Mark S. Boddy"
  - "Thomas L. Dean"
doi: ""
url: "https://ijcai.org/proceedings/1989/157"
pdf: "https://ijcai.org/proceedings/1989/0157.pdf"
venue: "Proceedings of the Eleventh International Joint Conference on Artificial Intelligence"
year: 1989
pages: "979-983"
track: "Planning, Scheduling, Reasoning About Actions"
keywords:
---

# Solving Time-Dependent Planning Problems

Mark S. Boddy, Thomas L. Dean

*Proceedings of the Eleventh International Joint Conference on Artificial Intelligence*, pages 979-983.

## Abstract

A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance . In [Dean and Boddy, 1988], we define a framework for constructing solutions to time-dependent planning problems, called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a mobile robot, as a way of exploring a methodology for applying expectation-driven iterative refinement . The fact that we construct a solution to the proposed problem without appealing to luck or extraordinary inspiration provides evidence that expectation-driven iterative refinement is an appropriate framework for solving time-dependent planning problems.