Skip to main content
SpringerLink
Log in

Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We present a temporal reasoning mechanism for an individual agent situated in a dynamic environment such as the web and collaborating with other agents while interleaving planning and acting. Building a collaborative agent that can flexibly achieve its goals in changing environments requires a blending of real-time computing and AI technologies. Therefore, our mechanism consists of an Artificial Intelligence (AI) planning subsystem and a Real-Time (RT) scheduling subsystem. The AI planning subsystem is based on a model for collaborative planning. The AI planning subsystem generates a partial order plan dynamically. During the planning it sends the RT scheduling subsystem basic actions and time constraints. The RT scheduling subsystem receives the dynamic basic actions set with associated temporal constraints and inserts these actions into the agent's schedule of activities in such a way that the resulting schedule is feasible and satisfies the temporal constraints. Our mechanism allows the agent to construct its individual schedule independently. The mechanism handles various types of temporal constraints arising from individual activities and its collaborators. In contrast to other works on scheduling in planning systems which are either not appropriate for uncertain and dynamic environments or cannot be expanded for use in multi-agent systems, our mechanism enables the individual agent to determine the time of its activities in uncertain situations and to easily integrate its activities with the activities of other agents. We have proved that under certain conditions temporal reasoning mechanism of the AI planning subsystem is sound and complete. We show the results of several experiments on the system. The results demonstrate that interleave planning and acting in our environment is crucial.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM 26 (1983) 832–843.

    Google Scholar 

  2. J. Allen, Towards a general theory of action and time, Artificial Intelligence 23(2) (1984) 123–144.

    Google Scholar 

  3. C. Anderson, D. Weld and D. Smith, Extending graphplan to handle uncertainty and sensing actions, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-98) (1998) pp. 897–904.

  4. R.C. Arkin, Integrating behavioal, perceptual, and world knowledge in reactive navigation, Robotics Autonomous Systems 6 (1990) 105–222.

    Google Scholar 

  5. R. Arthur and J. Stillman, Tachyon: A model and environment for temporal reasoning, M.S. Thesis, Rensselaer Polytechnic Institute, Troy, NY (1992).

    Google Scholar 

  6. G.C. Buttazzo, Hard Real-Time Computing Systems (Kluwer Academic, Dordrecht, 1997).

    Google Scholar 

  7. A. Cawsey, Artificial Intelligence (Prentice-Hall, London, 1998).

    Google Scholar 

  8. S. Chien, G. Rabideau, J.Willis and T. Mann, Automating planning and scheduling of shuttle payload operations, Artificial Intelligence Journal 114 (1999) 239–255.

    Google Scholar 

  9. W.W. Chu and K.K. Leung, Task response time for real-time distributed systems with resource contentions, IEEE Transactions on Software Engineering 17(10) (1991) 1076–1092.

    Google Scholar 

  10. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, London, 1990).

    Google Scholar 

  11. K. Currie and A. Tate, O-plan: the open planning architecture, Artificial Intelligence 52 (1991) 49–86.

    Google Scholar 

  12. T.L. Dean and D.V. McDermott, Temporal data base management, Artificial Intelligence 32 (1987) 1–55.

    Google Scholar 

  13. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence 49 (1991) 61–95.

    Google Scholar 

  14. J. Dorn, M. Girsch, G. Skele and W. Slany, Comparison of iterative improvement techniques for schedule optimization, European Journal on Operations Research (1996) 349–361.

  15. A. El-Kholy and B. Richards, Temporal and resource reasoning in planning: the parcPlan approach, in: 12th European Conference on Artifical Intelligence (ECAI' 96) (1996) pp. 614–618.

  16. R.E. Fikes, P.E. Hart and N.J. Nilsson, Learning and executing generalized robot plans, Artificial Intelligence 3(4) (1972) 251–288.

    Google Scholar 

  17. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, CA, 1979).

    Google Scholar 

  18. K. Golden, O. Etzioni and D. Weld, Planning with execution and incomplete information. Technical report, University of Washington (1996).

  19. M.C. Golumbic, Reasoning about time, Mathematical Aspects of Artificial Intelligance 55 (1998) 19–53.

    Google Scholar 

  20. M. Graham and M. Florian, On scheduling with ready times and due dates to minimize maximum lateness, Operations Research 23(3) (1975).

  21. B. Grosz and S. Kraus, Collaborative plans for group activities, in: Proceedings of the 1993 International Joint Conference on Artificial Intelligence (IJCAI-93), ed. R. Bajcsy (Morgan Kaufmann, San Mateo, CA, 1993) pp. 367–373.

    Google Scholar 

  22. B.J. Grosz and S. Kraus, Collaborative plans for complex group action, Artificial Intelligence 86(2) (1996) 269–357.

    Google Scholar 

  23. M. Hadad, Combining cooperative planning and temporal reasoning in dynamic multi agent systems, Ph.D. Dissertation, Bar-Ilan University, Ramat Gan, Israel (2002).

    Google Scholar 

  24. B. Hamidzadeh and S. Shekhar, Specification and analysis of real-time problem solvers, IEEE Transactions on Computers 19(8) (1993) 788–803.

    Google Scholar 

  25. K.J. Hammond, Chef: A model case-based planning, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-86) (1986) pp. 267–271.

  26. J. Hendler, K. Erol and D. Nau, HTN planning: Complexity and expressivity, in: Proceedings of the Annual Conference of the American Association for Artificial Intelligence (AAAI-94) (1994) pp. 1123–1128.

  27. N.R. Jennings, Controlling cooperative problem solving in industrial multi-agent systems using joint intentions, Artificial Intelligence 75(2) (1995) 1–46.

    Google Scholar 

  28. N.I. Karacapilidis, Planning under uncertainty: A qualitative approach, Lecture Notes in Computer Science, Vol. 990 (Springer, Berlin, 1995) pp. 285–296.

    Google Scholar 

  29. D. Kinny, M. Ljungberg, A.S. Rao, E. Sonenberg, G. Tidhar and E. Werner, Planned team activity, in: Artificial Social Systems, eds. C. Castelfranchi and E. Werner, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1994).

    Google Scholar 

  30. C.A. Knoblock, Building a planner for information gathering: A report from the trenches, in: Third International Conference on Artificial Intelligence Planning Systems (1996).

  31. C.H. Kristensen and N. Drejer, Evaluating distributed timing constraints implementing run-time mechnisms, in: Proc. of 2nd IEEE Workshop on Real-Time Applications, Washington, DC (1994) pp. 157–162.

  32. J.E. Laird, A. Newell and P.S. Rosenbloom, Soar: An architecture for general intelligence. Artificial Intelligence 33 (1987) 1–64.

    Google Scholar 

  33. J. Lever and B. Richards, parcPlan: a planning architecture with parallel actions, resources and constraints, in: Lecture Notes in Computer Science, Vol. 896 (Springer, Berlin, 1994) 213–222.

    Google Scholar 

  34. H. Levesque, P. Cohen and J. Nunes, On acting together, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-90) (1990) pp. 94–99.

  35. K. Lochbaum, Using collaborative plans to model the intentional structure of discourse, Ph.D. Thesis, Harvard University (1994). Available as Technical Report TR-25-94.

  36. K. Lochbaum, B. Grosz and C. Sidner, Models of plans to support communication: An initial report, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-90) (1990) pp. 485–490.

  37. J. Malik and T.O. Biford, Reasonning in time and space, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-83) (1983) pp. 343–345.

  38. Gr. Mcmahon and M. Florian, On scheduling with ready times and due dates to minimize maximum lateness, Operations Research 23(3) (1975) 475–482.

    Google Scholar 

  39. P. Michael, Scheduling (Prentice-Hall, Englewood Clifts, NJ, 1995).

    Google Scholar 

  40. D.P. Miller and E. Gat, Exploiting known topologies to navigate with low-computation sensing, in: SPIE Sensor Fusion Conference (November 1990).

  41. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Information Sciences 7 (1974) 95–132.

    Google Scholar 

  42. L. Morgenstern, Knowledge preconditions for actions and plans, in: Proceedings of IJACAI-87 (Morgan Kaufman, Los Altos, CA, 1987) pp. 867–874.

    Google Scholar 

  43. D.J. Musliner, E.H. Dufree and K.G. Shin, Circa: A cooperative intelligent real-time control architecture, IEEE Transactions on Computers 23(6) (1993) 1561–1574.

    Google Scholar 

  44. D.J. Musliner, E.H. Dufree and K.G. Shin, World modeling for dynamic construction of real-time control plans, Artificial Intelligence 74(1) (1995) 83–127.

    Google Scholar 

  45. D.J. Musliner, J.A. Hendler, A.K. Agrawala, E.H. Dufree, J.K. Strosnider and C.J. Paul, The challenges of real-time AI, IEEE Transactions on Computers 28(1) (1994) 58–66.

    Google Scholar 

  46. A. Nareyek, A planning model for agents in dynamic and uncertain real-time environments, in: AIPS Workshop on Integrating Planning (1998) pp. 7–14.

  47. A. Nareyek, Open World Planning as scsp, Technical Report WS-00-02 (AAAI Press, Menlo Park, CA, 2000).

    Google Scholar 

  48. D. Nau, Y. Cao, A. Lotem and H. Munoz-Avila, Shop and m-shop planning with ordered task decomposition, Technical report, University of Maryland (2000).

  49. N.J. Nilsson, Principles of Artificial Intelligence (Tioga Publishing Company, 1980), chapters 7 and 8.

  50. J.S. Penberthy and D. Weld, Temporal planning with continuous change, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-94) (1994) pp. 1010–1015.

  51. M.E. Pollack, Plans as complex mental attitudes, in: Intentions in Communication, eds. P.N. Cohen, J.L. Morgan and M.E. Pollack (Bradford Books, MIT Press, 1990).

  52. K. Ramamritham and J.A. Stankovicand, Dynamic task scheduling in hard real-time distributed systems, IEEE Software 1(3) (1984) 65–75.

    Google Scholar 

  53. E. Rich and K. Knight, Artificial Intelligence, 2nd Edition (McGraw-Hill, 1991).

  54. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach (Prentice-Hall, Englewood Cliffs, NJ, 1995).

    Google Scholar 

  55. T. Shepard and J.A. Martin Gagne, A pre-run-time scheduling algorithm for hard real-time systems, IEEE Transactions on Software Engineering 17(7) (1991) 669–677.

    Google Scholar 

  56. R. Simmons, An architecture for coordinating planning, sensing and action, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling, Contr. (November 1990) pp. 292–297.

  57. H. Singh and T. Instrument, Scheduling techniques for real-time applications consisting of periodic task sets, in: Proc. of 2nd IEEE Workshop on Real-Time Applications, Washington, DC (1994) pp. 12–15.

  58. E. Sonenberg, G. Tidhar, E. Werner, D. Kinny, M. Ljungberg and A. Rao, Planned team activity, Technical Report 26, Australian Artificial Intelligence Institute, Australia (1992).

    Google Scholar 

  59. B. Srivastava, RealPlan: Decoupling causal and resource reasoning in planning, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-00) (2000) pp. 812–818.

  60. J.A. Stankovic and K. Ramamritham, The spring kernal: a new paradigm for real-time systems, IEEE Software (1991) 62–72.

  61. J.A. Stankovic, K. Ramamritham and S. Cheng, Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems, IEEE Transactions on Computers 34(12) (1985) 1130–1143.

    Google Scholar 

  62. J.A. Stankovic, M. Spuri, M. Di Natale and G. Buttazzo, Implications of classical scheduling results for real-time syatems, IEEE Computer 28(6) (1995) 16–25.

    Google Scholar 

  63. R.S. Sutton, Integrated architectures for learning, planning, and reacting based on approximating dynamic programming, in: Proceedings of the Seventh International Conference on Machine Learning (1990).

  64. M. Tambe, Toward flexible teamwork, Journal of AI Research 7 (1997) 83–124.

    Google Scholar 

  65. P. Van Beek, Reasoning about qualitative temporal information, Artificial Intelligence 58 (1992) 297–326.

    Google Scholar 

  66. S.A. Vere, Planning in time: Windows and durations for activities and goals, in: Readings in Planning, eds. J. Allen et al. (Springer, Berlin, 1990) pp. 297–318.

    Google Scholar 

  67. T. Vidal and M. Ghallab, Dealing with uncertain durations in temporal constraint networks dedicated to planning, in: Proc. of 12th European Conference on Artifical Intelligence (ECAI' 96) (1996) pp. 48–52.

  68. M. Vilain and H.A. Kautz, Constraint propagation algorithms for temporal reasoning, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-86) (1986) pp. 132–144.

  69. D. Wilkins, Using pattern and plans in chess, Artificial Intelligence 14(2) (1983) 165–203.

    Google Scholar 

  70. D.E. Wilkins, K.L. Myers, J.D. Lowrance and L.P. Wesley, Planning and reacting in uncertain and dynamic environments, Journal of Experimental and Theoretical AI 7(1) (1995) 197–227.

    Google Scholar 

  71. J. Xu, Multiprocessor scheduling of process with release times, deadlines, precedence, and exclusion relations, IEEE Transactions on Software Engineering 19(2) (1993) 139–154.

    Google Scholar 

  72. J. Xu and D. Lorge Parnas, Scheduling processes with release times, deadlines, precedence and exclusion relations, IEEE Transactions on Software Engineering 16(3) (1990) 360–369.

    Google Scholar 

  73. J. Xu and D. Lorge Parnas, On satisfying timing constraints in hard-real-time systems, IEEE Transactions on Software Engineering 19(1) (1993) 70–84.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, 52900, Israel

    Meirav Hadad, Sarit Kraus & Raz Lin

  2. Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, USA

    Sarit Kraus

  3. Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA

    Yakov Gal

Authors
  1. Meirav Hadad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarit Kraus
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yakov Gal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raz Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hadad, M., Kraus, S., Gal, Y. et al. Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment. Annals of Mathematics and Artificial Intelligence 37, 331–379 (2003). https://doi.org/10.1023/A:1021512627215

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021512627215

Keywords

Search

Navigation