An Analysis of Time-Dependent Planning

This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex. Our analysis of time-dependent planning suggests an approach based on a class of algorithms that we call anytime algorithms. Anytime algorithms can be interrupted at any point during computation to return a result whose utility is a function of computation time. We explore methods for solving time-dependent planning problems based on the properties of anytime algorithms.

[1]  E. F. Codd,et al.  Cellular automata , 1968 .

[2]  C. Tompkins,et al.  Elementary numerical analysis , 1971 .

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[5]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[6]  Geoffrey E. Hinton,et al.  OPTIMAL PERCEPTUAL INFERENCE , 1983 .

[7]  Victor R. Lesser,et al.  The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks , 1983, AI Mag..

[8]  Stephen F. Smith,et al.  ISIS—a knowledge‐based system for factory scheduling , 1984 .

[9]  Karl G. Kempf,et al.  Opportunistic scheduling for robotic assembly , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[10]  David H. Jameson,et al.  A Real-Time Juggling Robot , 1986, RTSS.

[11]  François Robert,et al.  Discrete iterations - a metric study , 1986, Springer series in computational mathematics.

[12]  Edmund H. Durfee,et al.  A unified approach to dynamic coordination: planning actions and interactions in a distributed problem solving network , 1987 .

[13]  Jen-Yao Chung,et al.  Scheduling periodic jobs using imprecise results , 1987 .

[14]  Edmund H. Durfee.  A Unified Approach to Dynamic Coordinatio: Planning Actions and , 1987 .

[15]  Eric Horvitz,et al.  Reasoning about beliefs and actions under computational resource constraints , 1987, Int. J. Approx. Reason..

[16]  Thomas Dean,et al.  INTRACTABILITY AND TIME-DEPENDENT PLANNING , 1987 .