Deadlines, Travel Time, and Robot Problem Solving
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Planning and Search. 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.
@inproceedings{ijcai1985p213,
title = {Deadlines, Travel Time, and Robot Problem Solving},
author = {Miller, David P. and Firby, R. James and Dean, Thomas},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {1052--1053},
year = {1985},
note = {Planning and Search},
url = {https://ijcai.org/proceedings/1985/213},
}
TY - CPAPER TI - Deadlines, Travel Time, and Robot Problem Solving AU - Miller, David P. AU - Firby, R. James AU - Dean, Thomas T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 1052 EP - 1053 UR - https://ijcai.org/proceedings/1985/213 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
