Planning in Dynamic Environments: The DIPART System

Many current and potential AI applications are intended to operate in dynamic environments, including those with multiple agents. As a result, standard AI plan-generation technology must be augmented with mechanisms for managing changing information, for focusing attention when multiple events occur, and for coordinating with other planning processes. The DIPART testbed (Distributed, Interactive Planner’s Assistant for Real-tlme Transportation pIanning) was developed to serve as an experimental platform for analyzing a variety of such mechanisms. In this paper, we present an overview both of the DIPART system and of some of the methods for planning in dynamic environments that we have been investigating using DIPAI~T. Many of these methods derive from theoretical work in real-time AI and in related fields, such as real-tlme operating systems.

[1]  Mark A. Peot,et al.  Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.

[2]  Michael E. Bratman,et al.  Intention, Plans, and Practical Reason , 1991 .

[3]  Thomas Dean,et al.  Solving Time-critical Decision-making Problems with Predictable Computational Demands , 1994, AIPS.

[4]  Raghavan Srinivasan,et al.  Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner , 1995, IJCAI.

[5]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[6]  Willy Zwaenepoel,et al.  Distributed process groups in the V Kernel , 1985, TOCS.

[7]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[8]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[9]  Michael P. Georgeff,et al.  Commitment and Effectiveness of Situated Agents , 1991, IJCAI.

[10]  Mark S. Boddy,et al.  Solving Time-Dependent Planning Problems , 1989, IJCAI.

[11]  Lenhart K. Schubert,et al.  Accelerating partial order planners by improving plan and goal choices , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[12]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[13]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[14]  Daniel Mossé,et al.  Value-density algorithms for the deliberation-scheduling problem , 1996, SGAR.

[15]  Grattan StreetCarlton,et al.  Commitment and Eeectiveness of Situated Agents , 1991 .

[16]  Eithan Ephrati,et al.  ¯ Exploitation of Decision Theory Techniques in Multi-Agent Planning (Preliminary Report) , 1994 .

[17]  Eithan Ephrati,et al.  Deriving Multi-Agent Coordination through Filtering Strategies , 1995, IJCAI.

[18]  David J. Israel,et al.  Plans and resource‐bounded practical reasoning , 1988, Comput. Intell..

[19]  Martha E. Pollack,et al.  Passive and active decision postponement in plan generation , 1996 .

[20]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[21]  Martha E. Pollack,et al.  Introducing the Tileworld: Experimentally Evaluating Agent Architectures , 1990, AAAI.

[22]  Eithan Ephrati,et al.  Experimental Investigation Of An Agent Commitment Strategy , 1994 .

[23]  Eithan Ephrati,et al.  Divide and Conquer in Multi-Agent Planning , 1994, AAAI.

[24]  Taieb Znati,et al.  Comparative evaluation of cooperative plan execution strategies in multiagent environments , 1995, Proceedings of Simulation Symposium.

[25]  Eithan Ephrati,et al.  A Tractable Heuristic that Maximizes Global Utility through Local Plan Combination , 1995, ICMAS.

[26]  Martha E. Pollack,et al.  The Uses of Plans , 1992, Artif. Intell..

[27]  David Jo n,et al.  Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning , 1994 .

[28]  Shlomo Zilberstein,et al.  Optimal Composition of Real-Time Systems , 1996, Artif. Intell..