Planning for Temporally Extended

Introduction One of the features that distinguishes intelligent agents is their flexibility: generally they have the ability to accomplish a task in a variety of ways. Such flexibility is necessary if the agent is to be able to accomplish a variety of tasks under a range of conditions. Yet this flexibility also poses a problem: how do we communicate to such an agent the task we want accomplished in a sufficiently precise manner so that it does what we really want. In the areaof planning, methods and algorithms are studied by which, given information about the current situation, an intelligent agent can compose its primitive abilities so as to accomplish a desired task or goal. The afore mentioned problem then becomes the problem of designing sufficiently expressive and precise ways of specifying goals. Much of the work in planning has dealt with goals specified as conditions on a final state. For example, we might specify

[1]  Mark Drummond,et al.  Situated Control Rules , 1989, KR.

[2]  Fahiem Bacchus,et al.  Using temporal logic to control search in a forward chaining planner , 1996 .

[3]  Henry A. Kautz,et al.  Reasoning about plans , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[5]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[6]  Michel Barbeau,et al.  Synthesizing Plant Controllers Using Real-time Goals , 1995, IJCAI.

[7]  Oren Etzioni,et al.  The First Law of Robotics (A Call to Arms) , 1994, AAAI.

[8]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[9]  Patrice Godefroid,et al.  An Efficient Reactive Planner for Synthesizing Reactive Plans , 1991, AAAI.

[10]  Steven A. Vere,et al.  Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[12]  Froduald Kabanza,et al.  Synthesis of Reactive Plans for Multi-Path Environments , 1990, AAAI.

[13]  Peter Haddawy,et al.  Utility Models for Goal‐Directed, Decision‐Theoretic Planners , 1998, Comput. Intell..

[14]  Oren Etzioni,et al.  Tractable Closed World Reasoning with Updates , 1994, KR.

[15]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[17]  Daniel S. Weld,et al.  Temporal Planning with Continuous Change , 1994, AAAI.

[18]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.