Abstract
We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Büchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by finite transition systems; incomplete information on the initial situation is allowed; and states are only partially observable. We prove that the techniques proposed are optimal wrt the worst case complexity of the problem. Thanks to the scalability of the nonemptiness algorithms, the techniques presented here promise to be applicable to fairly large systems, notwithstanding the intrinsic complexity of the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacchus, F., Boutilier, C., Grove, A.: Structured solution methods for non markovian decision processes. In: Proc. of AAAI 1997, pp. 112–117 (1997)
Bacchus, F., Kabanza, F.: Planning for temporally extended goals. Ann. Of Math. and AI 22, 5–27 (1998)
Backstrom, C.: Equivalence and tractability results for SAS+ planning. In: Proc. of KR 1992 (1992)
Barbeau, M., Kabanza, F., St-Denis, R.: Synthesizing plant controllers using real-time goals. In: Proc. of IJCAI 1995, pp. 791–798 (1995)
Blum, A., Furst, M.: Fast planning through planning graph analysis. Artif. Intell. 90(1-2), 281–300 (1997)
Bryant, R.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1992)
Bylander, T.: Tractability and artificial intelligence. J. of Experimental and Theoretical Computer Science 3, 171–178 (1991)
Cimatti, A., Giunchiglia, E., Giunchiglia, F., Traverso, P.: Planning via model checking. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348. Springer, Heidelberg (1997)
Cimatti, A., Roveri, M., Traverso, P.: Automatic OBDD-based generation of universal plans in non-deterministic domains. In: Proc. of AAAI 1998, pp. 875–881 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)
Daniele, M., Vardi, P.T.M.Y.: Strong cyclic planning revisited (1999) (submitted)
De Giacomo, G., Iocchi, L., Nardi, D., Rosati, R.: Moving a robot: the KR&R approach at work. In: Proc. of KR 1996 (1996)
Deshpande, A., Varaiya, P.: Sementic tableau for control of PLTL formulae. In: Proc. of the 35th Conf. on Decision and Control, pp. 2243–2248. IEEE, Los Alamitos (1996)
Drummond, M.: Situated control rules. In: Proc. of KR 1989, pp. 103–113 (1989)
Emerson, E.: Temporal and modal logic. Handbook of Theoretical Computer Science, 997–1072 (1990)
Etzioni, O., Hanks, S., Weld, D., Draper, D., Lesh, N., Williamson, M.: An approach to planning with incomplete information. In: Proc. of KR 1992 (1992)
Fikes, R., Nilsson, N.J.: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3/4) (1971)
Garey, M.R., Johnson, D.S.: Computers and Intractability - A guide to NP- completeness. W. H. Freeman and Company, San Francisco (1979)
Geffner, H.: Classical, probabilistic and contingent planning: Three models, one algorithm. In: Proc. AIPS 1998 Work. on Planning as Combinatorial Search (1998)
Geffner, H., Bonet, B.: High-level planning and control with incomplete information using POMDPs. In: Proc. AIPS 1998 Work. on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments (1998)
Gelfond, M., Lifschitz, V.: Action languages. Linköping Electronic Articles in Computer and Information Science 3(16) (1998)
Golden, K., Weld, D.S.: Representing sensing actions: The middle ground revisited. In: Proc. of KR 1996, pp. 174–185 (1996)
Hardin, R., Har’el, Z., Kurshan, R.: COSPAN. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 423–427. Springer, Heidelberg (1996)
Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concur- rent transition systems. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 258–272. Springer, Heidelberg (1997)
Holtzmann, G.: Tutorial: proving correctness of concurrent systems with spin. In: Proc. 6th Int’l Conf. on Concurrency Theory, pp. 453–455. Springer, Heidelberg (1995)
Kabanza, F., Barbeau, M., St-Denis, R.: Planning control rules for reactive agents. Artif. Intell. 95(1), 67–113 (1997)
Kaelbling, L., Littman, M.L., Cassandra, A.R.: Planning and acting in partially observable stochastic domains. Artif. Intell. 101, 99–134 (1998)
Kautz, H., McAllester, D., Selman, B.: Encoding plans in propositional logic. In: Proc. of KR 1996 (1996)
Kupferman, O., Vardi, M.Y.: Synthesis with incomplete informatio. In: 2nd Int’l Conf. on Temporal Logic, Manchester, July 1997, pp. 91–106. Kluwer Academic Publishers, Dordrecht (1997)
Kurshan, R.: Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, Princeton (1994)
Levesque, H.J.: What is planning in presence of sensing? In: Proc. of AAAI 1996, pp. 1139–1149. AAAI Press/The MIT Press (1996)
Manna, Z., Waldinger, R.J.: How to clear a block: A theory of plans. J. of Automated Reasoning 3(4) (1987)
McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)
McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
Pednault, E.: ADL: exploring the middle ground between STRIPS and the situation calculus. In: Proc. of KR 1989, pp. 324–332 (1989)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, Austin (January 1989)
Ramadge, P., Wonham, W.: The control of discrete event systems. Proc. of IEEE 77(1), 81–98 (1989)
Reiter, R.: Knowledge in Action: Logical Foundation for Describing and Implementing Dynamical Systems (1998) (in preparation)
Rosenschein, S.J.: Plan synthesis: A logical perspective. In: Proc. of IJCAI 1981, pp. 331–337 (1981)
Sandewall, E.: Features and Fluents. The Representation of Knowledge about Dynamical Systems, vol. I. Oxford University Press, Oxford (1994)
Shanahan, M.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. The MIT Press, Cambridge (1997)
Vardi, M.Y.: An automata-theoretic approach to fair realizability and synthesis. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 267–292. Springer, Heidelberg (1995)
Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency: Structure versus Automata, LNCS, vol. 1043, pp. 238–266. Springer, Berlin (1996)
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st Symp. on Logic in Computer Science, Cambridge, June 1986, pp. 322–331 (1986)
Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1–37 (1994)
Weld, D.S., Etzioni, O.: The first law of robotics (a call to arms). In: Proc. Of AAAI 1994, pp. 1042–1047 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Giacomo, G., Vardi, M.Y. (2000). Automata-Theoretic Approach to Planning for Temporally Extended Goals. In: Biundo, S., Fox, M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science(), vol 1809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720246_18
Download citation
DOI: https://doi.org/10.1007/10720246_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67866-3
Online ISBN: 978-3-540-44657-6
eBook Packages: Springer Book Archive