---
title: "Deadlines, Travel Time, and Robot Problem Solving"
authors:
  - "David P. Miller"
  - "R. James Firby"
  - "Thomas Dean"
doi: ""
url: "https://ijcai.org/proceedings/1985/213"
pdf: "https://ijcai.org/proceedings/1985/0213.pdf"
venue: "Proceedings of the Ninth International Joint Conference on Artificial Intelligence"
year: 1985
pages: "1052-1053"
track: "Planning and Search"
keywords:
---

# Deadlines, Travel Time, and Robot Problem Solving

David P. Miller, R. James Firby, Thomas Dean

*Proceedings of the Ninth International Joint Conference on Artificial Intelligence*, pages 1052-1053.

## Abstract

This paper describes some extensions to the reductionist planning par adigm typified by Sacerdoti's NOAH program. Certain inadequacies of the partial ordering scheme used in NOAH are pointed out and a new architecture is detailed which circumvents these problems. An example from the semi-automated factory domain is used to illustrate features of the new planner. Techniques for eliminating unnecessary travel time by the robot and avoiding backtracking due to deadline failures are discussed and their incorporation in the planner is described.