Advertisement

TALplanner: A temporal logic based forward chaining planner

  • Jonas Kvarnström
  • Patrick Doherty
Article

Abstract

We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented as formulas in the Temporal Action Logic (TAL). TAL is a narrative based linear metric time logic used for reasoning about action and change in incompletely specified dynamic environments. TAL is used as the formal semantic basis for TALplanner, where a TAL goal narrative with control formulas is input to TALplanner which then generates a TAL narrative that entails the goal and control formulas. The sequential version of TALplanner is presented. The expressivity of plan operators is then extended to deal with an interesting class of resource types. An algorithm for generating concurrent plans, where operators have varying durations and internal state, is also presented. All versions of TALplanner have been implemented. The potential of these techniques is demonstrated by applying TALplanner to a number of standard planning benchmarks in the literature.

planning temporal logics action and change knowledge representation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    AIPS-1998, Artificial Intelligence Planning Systems: 1998 Planning Competition, http://ftp.cs.yale. edu/pub/mcdermott/aipscomp-results.html (1998).Google Scholar
  2. [2]
    AIPS-2000, Artificial Intelligence Planning Systems: 2000 Planning Competition, http://www.cs. toronto.edu/aips2000 (2000).Google Scholar
  3. [3]
    R. Alur, T. Feder and T.A. Henzinger, The benefits of relaxing punctuality, in: Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing (PODC'91), Montréal, Canada (August 1991) pp. 139-152; available at http://www.cis.upenn.edu/~alur/Podc91.ps.gz.Google Scholar
  4. [4]
    R. Alur and T.A. Henzinger, Back to the future: Towards a theory of timed regular languages, in: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, October 1992 (IEEE Computer Society Press, 1992) pp. 177-186; updated version available at http://www-cad. eecs.berkeley.edu/~tah/Publications/back_to_the_future.ps.Google Scholar
  5. [5]
    J.L. Ambite, Planning by rewriting, Ph.D. dissertation, University of Southern California (1998); available at http://www.isi.edu/~ambite/thesis.ps.gz.Google Scholar
  6. [6]
    J.L. Ambite, C.A. Knoblock and S. Minton, Learning plan rewriting rules, in: Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems (AIPS-2000), eds. S. Chien, S. Kambhampati and C.A. Knoblock, Breckenridge, CO, April 2000 (AAAI Press, Menlo Park, CA, 2000) pp. 3-12; available at http://www.isi.edu/~ambite/2000-aips.ps.Google Scholar
  7. [7]
    F. Bacchus and M. Ady, Precondition control (1999); available at ftp://newlogos.uwaterloo.ca/pub/ bacchus/BApre.ps.gz.Google Scholar
  8. [8]
    F. Bacchus and F. Kabanza, Planning for temporally extended goals, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), Portland, OR, August 1996 (AAAI Press/The MIT Press, 1996) pp. 1215-1222; available at ftp://newlogos.uwaterloo.ca/pub/bacchus/ BKAAAI96.ps.gz.Google Scholar
  9. [9]
    F. Bacchus and F. Kabanza, Using temporal logic to control search in a forward chaining planner, in: New Directions in AI Planning, eds. M. Ghallab and A. Milani (IOS Press, 1996) 141-153; available at ftp://newlogos.uwaterloo.ca/pub/bacchus/BKEWSP96.ps.gz.Google Scholar
  10. [10]
    F. Bacchus and F. Kabanza, Planning for temporally extended goals, Annals of Mathematics and Artificial Intelligence 22 (1998) 5-27; available at ftp://newlogos.uwaterloo.ca/pub/bacchus/BKAMAI98.ps.gz.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [11]
    F. Bacchus and F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence 116 (2000) 123-191; available at ftp://newlogos.uwaterloo.ca/pub/bacchus/BKTlplan.ps.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    B. Bonet and H. Geffner, HSP: Heuristic search planner (1998); available at http://www.ldc.usb.ve/~hector/.Google Scholar
  13. [13]
    P. Doherty, Reasoning about action and change using occlusion, in: Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI'94), ed. A.G. Cohn, Amsterdam, The Netherlands, August 1994 (Wiley, 1994) pp. 401-405; available at ftp://ftp.ida.liu.se/pub/labs/kplab/people/patdo/ ecai94.ps.gz.Google Scholar
  14. [14]
    P. Doherty, J. Gustafsson, L. Karlsson and J. Kvarnström, TAL: Temporal Action Logics-language specification and tutorial, Linköping Electronic Articles in Computer and Information Science 3(15) (1998); available at http://www.ep.liu.se/ea/cis/1998/015.Google Scholar
  15. [15]
    P. Doherty and J. Kvarnström, TALplanner: An empirical investigation of a temporal logic-based for-ward chaining planner, in: Proceedings of the Sixth International Workshop on Temporal Representa-tion and Reasoning (TIME'99), eds. C. Dixon and M. Fisher, Orlando, FL, May 1999 (IEEE Computer Society Press, 1999) pp. 47-54; available at ftp://ftp.ida.liu.se/pub/labs/kplab/people/patdo/time99-final.ps.gz.Google Scholar
  16. [16]
    P. Doherty and W. £ukaszewicz, Circumscribing features and fluents: A fluent logic for reasoning about action and change, in: Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS'94), eds. Z.W. Ras and M. Zemankova, Charlotte, NC (1994) pp. 521-530.Google Scholar
  17. [17]
    E.A. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science,ed.J. van Leeuwen, Vol. B (MIT Press, 1990) chapter 16, pp. 997-1072.Google Scholar
  18. [18]
    M. Fox and D. Long, The detection and exploitation of symmetry in planning problems, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), ed. T. Dean, Stockholm, Sweden, 1999 (Morgan Kaufmann, San Francisco, CA, 1999) pp. 956-961; available at http://www.dur.ac.uk/~dcs0www/research/stanstuff/symm.ps.gz.Google Scholar
  19. [19]
    J. Gustafsson and P. Doherty, Embracing occlusion in specifying the indirect effects of actions, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), eds. L.C. Aiello, J. Doyle and S. Shapiro (Morgan Kaufmann, San Francisco, CA, 1996) pp. 87-98; available at ftp://ftp.ida.liu.se/pub/labs/kplab/people/patdo/final-kr96.ps.gz.Google Scholar
  20. [20]
    J. Hoffmann, Fast-Forward home page, http://www.informatik.uni-freiburg.de/~hoffmann/ff.html.Google Scholar
  21. [21]
    J. Hoffmann and B. Nebel, The FF planning system: Fast planning generation through heuristic search, Journal of Artificial Intelligence Research, submitted; available at http://www.informatik.uni-freiburg.de/~hoffmann/papers/jair2000b.ps.gz.Google Scholar
  22. [22]
    F. Kabanza, M. Barbeau and R. St-Denis, Planning control rules for reactive agents, Artificial Intelligence 95 (1997) 67-113.zbMATHCrossRefGoogle Scholar
  23. [23]
    L. Karlsson and J. Gustafsson, Reasoning about concurrent interaction, Journal of Logic and Computation 9(5) (1999) 623-650.zbMATHMathSciNetCrossRefGoogle Scholar
  24. [24]
    L. Karlsson, J. Gustafsson and P. Doherty, Delayed effects of actions, in: Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI'98), ed. H. Prade, Brighton, UK, August 1998 (Wiley, 1998) pp. 542-546; available at ftp://ftp.ida.liu.se/pub/labs/kplab/people/patdo/ecai98.ps.gz.Google Scholar
  25. [25]
    H. Kautz and B. Selman, Blackbox: A new approach to the application of theorem proving to problem solving, http://www.research.att.com/~kautz.Google Scholar
  26. [26]
    D. Kibler and P. Morris, Don't be stupid, in: Proceedings of the Seventh International Joint Conference on Artificial Intelligence (IJCAI-81), ed. A. Drinan, Vancouver, BC, Canada (August 1981) pp. 345-347.Google Scholar
  27. [27]
    J. Koehler, Miconic 10 elevator domain home page, http://www.informatik.uni-freiburg.de/~koehler/ elev/elev.html.Google Scholar
  28. [28]
    J. Koehler, B. Nebel, J. Hoffmann and Y. Dimopoulos, Extending planning graphs to an ADL subset, in: Proceedings of the Fourth European Conference on Planning (ECP'97), ed. S. Steel, Toulouse, France, September 1997 (Springer, 1997) pp. 273-285; available at http://www.informatik.uni-freiburg. de/~hoffmann/papers/ecp97.ps.gz.Google Scholar
  29. [29]
    J. Kvarnström and P. Doherty, Tackling the qualification problem using fluent dependency constraints, Computational Intelligence 16(2) (2000) 169-209.MathSciNetCrossRefGoogle Scholar
  30. [30]
    J. Kvarnström, P. Doherty and P. Haslum, Extending TALplanner with concurrency and resources, in: Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI-2000),ed. W. Horn, Berlin, Germany, August 2000 (IOS Press, Amsterdam, 2000) pp. 501-505; available at ftp://ftp.ida.liu.se/pub/labs/kplab/people/patdo/www-ecai.ps.gz.Google Scholar
  31. [31]
    V. Lifschitz, Computing circumscription, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), Los Angeles, CA, August 1985 (Morgan Kaufmann, Los Altos, CA, 1985) pp. 121-127.Google Scholar
  32. [32]
    F. Lin, A planner called R, AI Magazine, submitted available at http://www.cs.ust.hk/faculty/flin/papers/r-aim.ps.Google Scholar
  33. [33]
    J. McCarthy, Circumscription-a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27-39; available at http://www-formal.stanford.edu/jmc/circumscription.ps.zbMATHMathSciNetCrossRefGoogle Scholar
  34. [34]
    D. Nau, Y. Cau, A. Lotem and H. Muños-Avila, SHOP: Simple hierarchical ordered planner, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), ed. T. Dean, Stockholm, Sweden, 1999 (Morgan Kaufmann, San Francisco, CA, 1999) pp. 968-973; available at http://www.cs.umd.edu/~nau/papers/shop-ijcai99.pdf.Google Scholar
  35. [35]
    E.P.D. Pednault, ADL: Exploring the middle ground between STRIPS and the Situation Calculus, in: Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), eds. R.J. Brachman, H.J. Levesque and R. Reiter, Toronto, Ontario, Canada, 1989 (Morgan Kaufmann, San Mateo, CA, 1989) pp. 324-332.Google Scholar
  36. [36]
    E. Sandewall, Features and Fluents: A Systematic Approach to the Representation of Knowledge about Dynamical Systems (Oxford University Press, 1994).Google Scholar
  37. [37]
    H.-P. Störr, BDDPlan home page, http://pikas.inf.tu-dresden.de/~stoerr/bddplan.html.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Jonas Kvarnström
    • 1
  • Patrick Doherty
    • 2
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden E-mail
  2. 2.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden E-mail

Personalised recommendations