A concise introduction to models and methods for automated planning

Synthesis Lectures on Artificial Intelligence and Machine Learning

Volumn 22, Issue , 2013, Pages 1-141

  Geffner, Hector ^a   Bonet, Blai ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

action selection; autonomous behavior; belief tracking; domain independent problem solving; MDP and POMDP planning; model based control; plan generation and recognition; planning; planning with incomplete information and sensing

Indexed keywords

ACTION SELECTION; AUTONOMOUS BEHAVIORS; MODEL-BASED CONTROL; PLAN GENERATION; PLANNING WITH INCOMPLETE INFORMATION;

CHEMISTRY; PLANNING; SOFTWARE ENGINEERING; SPEECH SYNTHESIS;

ARTIFICIAL INTELLIGENCE;

EID: 84880083926     PISSN: 19394608     EISSN: 19394616     Source Type: Book Series    
DOI: 10.2200/S00513ED1V01Y201306AIM022     Document Type: Article

References (240)

1. P. E. Agre and D. Chapman. Pengi: An implementation of a theory of activity. In Proc. 6th Nat. Conf. on Artificial Intelligence, pages 268-272, 1987.
2. A. Albarghouthi, J. A. Baier, and S. A. McIlraith. On the use of planning technology for verification. In Proc. ICAPS'09 Workshop VV&PS, 2009.
3. A. Albore, H. Palacios, and H. Geffner. A translation-based approach to contingent planning. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 1623-1628, 2009.
4. A. Albore, M. Ramírez, and H. Geffner. Effective heuristics and belief tracking for planning with incomplete information. In Proc. 21st Int. Conf. on Automated Planning and Scheduling, pages 2-9, 2011.
5. C. Amato, D. S. Bernstein, and S. Zilberstein. Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs. Journal of Autonomous Agents and Multi-Agent Systems, 21(3):293-320, 2010. DOI: 10.1007/s10458-009-9103-z 108
6. E. Amir and B. Engelhardt. Factored planning. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, 2003.
7. K. Astrom. Optimal control of Markov Decision Processes with incomplete state estimation. Journal of Mathematical Analysis and Applications, 10:174-205, 1965.
8. H. Attias. Planning by probabilistic inference. In Proc. 9th Int. Workshop on Artificial Intelligence and Statistics, 2003.
9. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, 2002. DOI: 10.1023/A:1013689704352
10. F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116:123-191, 2000. DOI: 10.1016/S0004-3702(99)00071-5
11. F. Bacchus and Q. Yang. Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71:43-100, 1994. DOI: 10.1016/0004-3702(94)90062-0
12. C. Bäckström and B. Nebel. Complexity results for SAS+ planning. Computational Intelligence, 11(4):625-655, 1995. DOI: 10.1111/j.1467-8640.1995.tb00052.x
13. J. A. Baier, F. Bacchus, and S. A. McIlraith. A heuristic search approach to planning with temporally extended preferences. Artificial Intelligence, 173(5-6):593-618, 2009. DOI: 10.1016/j.artint.2008.11.011
14. C. L. Baker, R. Saxe, and J. B. Tenenbaum. Action understanding as inverse planning. Cognition, 113(3):329-349, 2009. DOI: 10.1016/j.cognition. 2009.07.005
15. R. K. Balla and A. Fern. UCT for tactical assault planning in real-time strategy games. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 40-45, 2009.
16. D. Ballard, M. Hayhoe, P. Pook, and R. Rao. Deictic codes for the embodiment of cognition. Behavioral and Brain Sciences, 20(4):723-742, 1997. DOI: 10.1017/S0140525X97001611 10
17. A. Barto, S. Bradtke, and S. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72:81-138, 1995. DOI: 10.1016/0004-3702(94)00011-O 72, 86, 90
18. A. Bauer and P. Haslum. LTL goal specifications revisited. In Proc. 19th European Conf. on Artificial Intelligence, pages 881-886, 2010. DOI: 10.3233/978-1-60750-606-5-881
19. R. Bellman. Dynamic Programming. Princeton University Press, 1957. 70
20. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. ?e complexity of decentralized control of markov decision processes. Mathematics of Operations Research, 27(4):819-840, 2002. DOI: 10.1287/moor.27.4.819.297 108
21. P. Bertoli and A. Cimatti. Improving heuristics for planning as search in belief space. In Proc. 6th Int. Conf. on Artificial Intelligence Planning Systems, pages 143-152, 2002.
22. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso. Planning in nondeterministic domains under partial observability via symbolic model checking. In Proc. 17th Int. Joint Conf. on Artificial Intelligence, pages 473-478, 2001.
23. P. Bertoli, A. Cimatti, M. Pistore, and P. Traverso. A framework for planning with extended goals under partial observability. In Proc. 13th Int. Conf. on Automated Planning and Scheduling, pages 215-225, 2003.
24. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
25. D. P. Bertsekas and J. N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996. 96
26. D. P. Bertsekas. Dynamic Programming and Optimal Control, Vols 1 and 2. Athena Scientific, 1995. 6, 31, 70, 76, 79, 81, 82, 84
27. A. Biere, M. Heule, H. Van Maaren, and T. Walsh, editors. Handbook of Satisfiability: Frontiers in Artificial Intelligence and Applications. IOS Press, 2012. 45
28. A. Blum and M. Furst. Fast planning through planning graph analysis. In Proc. 14th Int. Joint Conf. on Artificial Intelligence, pages 1636-1642, 1995. DOI: 10.1016/S0004-3702(96)00047-1 13, 31, 45
29. B. Bonet and H. Geffner. Planning as heuristic search: New results. In Proc. 5th European Conf. on Planning, pages 359-371, 1999. DOI: 10.1007/10720246-28 44
30. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. 5th Int. Conf. on Artificial Intelligence Planning Systems, pages 52-61, 2000. 55, 71
31. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001. DOI: 10.1016/S0004-3702(01)00108-4 27, 30, 31
32. B. Bonet and H. Geffner. Faster heuristic search algorithms for planning with uncertainty and full feedback. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, pages 1233-1238, 2003. 88, 89
33. B. Bonet and H. Geffner. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Proc. 13th Int. Conf. on Automated Planning and Scheduling, pages 12-31, 2003.
34. B. Bonet and H. Geffner. mGPT: A probabilistic planner based on heuristic search. Journal of Artificial Intelligence Research, 24:933-944, 2005. DOI: 10.1613/jair.1688
35. B. Bonet and H. Geffner. Solving POMDPs: RTDP-Bel vs. point-based algorithms. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 1641-1646, 2009. 83, 99, 104
36. B. Bonet and H. Geffner. Planning under partial observability by classical replanning: Theory and experiments. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 1936-1941, 2011. DOI: 10.5591/978-1-57735-516-8/ IJCAI11-324 57
37. B. Bonet and H. Geffner. Action selection for MDPs: Anytime AO versus UCT. In Proc. 26nd Conf. on Artificial Intelligence, pages 1749-1755, 2012. 73
38. B. Bonet and H. Geffner. Width and complexity of belief tracking in non-deterministic conformant and contingent planning. In Proc. 26nd Conf. on Artificial Intelligence, pages 1756-1762, 2012.
39. B. Bonet and H. Geffner. Causal belief decomposition for planning with sensing: Completeness and practical approximation. In Proc. 23rd Int. Joint Conf. on Artificial Intelligence, 2013. 75
40. B. Bonet and M. Helmert. Strengthening landmark heuristics via hitting sets. In Proc. 19th European Conf. on Artificial Intelligence, pages 329-334, 2010.
41. B. Bonet, G. Loerincs, and H. Geffner. A robust and fast action selection mechanism for planning. In Proc. 14th Nat. Conf. on Artificial Intelligence, pages 714-719, 1997. 13, 24
42. B. Bonet, H. Palacios, and H. Geffner. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proc. 19th Int. Conf. on Automated Planning and Scheduling, pages 34-41, 2009. 10, 60, 61
43. B. Bonet. Conformant plans and beyond: Principles and complexity. Artificial Intelligence, 174:245-269, 2010. DOI: 10.1016/j.artint.2009.11.001
44. M. Botvinick and J. An. Goal-directed decision making in the prefrontal cortex: a computational framework. In Proc. 22nd Annual Conf. on Advances in Neural Information Processing Systems, pages 169-176, 2008.
45. C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 1:1-93, 1999. DOI: 10.1613/jair.575
46. C. Boutilier, R. Reiter, and B. Price. Symbolic dynamic programming for first-order MDPs. In Proc. 17th Int. Joint Conf. on Artificial Intelligence, pages 690-700, 2001.
47. M. Bowling, R. Jensen, and M. Veloso. A formalization of equilibria for multiagent planning. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, pages 1460-1462, 2003.
48. R. I. Brafman and C. Domshlak. Factored planning: How, when, and when not. In Proc. 21st Nat. Conf. on Artificial Intelligence, pages 809-814, 2006.
49. R. I. Brafman and G. Shani. A multi-path compilation approach to contingent planning. In Proc. 26nd Conf. on Artificial Intelligence, pages 1868-1874, 2012.
50. R. I. Brafman and G. Shani. Replanning in domains with partial information and sensing actions. Journal of Artificial Intelligence Research, 1(45):565-600, 2012. DOI: 10.1613/jair.3711 55, 57
51. R. I. Brafman and M. Tennenholtz. R-max-a general polynomial time algorithm for nearoptimal reinforcement learning. Journal of Machine Learning Research, 3:213-231, 2003. DOI: 10.1162/153244303765208377
52. R. I. Brafman, C. Domshlak, Y. Engel, and M. Tennenholtz. Planning games. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 73-78, 2009.
53. D. Bryce, S. Kambhampati, and D. E. Smith. Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research, 26:35-99, 2006. DOI: 10.1613/jair.1869 55, 71
54. M. Buckland. Programming Game AI by Example. Wordware Publishing, Inc., 2004.
55. T. Bylander. ?e computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:165-204, 1994. DOI: 10.1016/0004-3702(94) 90081-7 8, 16, 34
56. P. P. Chakrabarti, S. Ghose, and S. C. De Sarkar. Best first search in AND/OR graphs. In Proc. 16th Annual ACM Conf. on Computer Science, pages 256-261, 1988. DOI: 10.1145/322609.322650
57. D. Chapman. Penguins can make cake. AI Magazine, 10(4):45-50, 1989. 10, 12
58. G. M. J. Chaslot, M. H. M. Winands, H. Herik, J. Uiterwijk, and B. Bouzy. Progressive strategies for Monte-Carlo tree search. New Mathematics and Natural Computation, 4(3):343-357, 2008. DOI: 10.1142/S1793005708001094
59. H. Chen and O. Giménez. Act local, think global: Width notions for tractable planning. In Proc. 17th Int. Conf. on Automated Planning and Scheduling, pages 73-80, 2007.
60. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1):35-84, 2003. DOI: 10.1016/S0004-3702(02)00374-0 76
61. A. Cimatti, M. Roveri, and P. Bertoli. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence, 159:127-206, 2004. DOI: 10.1016/j.artint.2004.05.003 55
62. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
63. A. J. Coles, A. Coles, M. Fox, and D. Long. Temporal planning in domains with linear processes. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 1671-1676, 2009.
64. A. J. Coles, A. Coles, A. García Olaya, S. Jiménez, C. Linares López, S. Sanner, and S. Yoon. A survey of the seventh international planning competition. AI Magazine, 33(1):83-88, 2012. 34
65. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 3rd edition, 2009. 6, 16, 17
66. S. Cresswell and A. M. Coddington. Compilation of LTL goal formulas into PDDL. In Proc. 16th European Conf. on Artificial Intelligence, pages 985-986, 2004.
67. J. Culberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998. DOI: 10.1111/0824-7935.00065
68. W. Cushing, S. Kambhampati, Mausam, and D. S. Weld. When is temporal planning really temporal? In Proc. 20th Int. Joint Conf. on Artificial Intelligence, pages 1852-1859, 2007.
69. M. Daniele, P. Traverso, and M. Y. Vardi. Strong cyclic planning revisited. In Proc. 5th European Conf. on Planning, pages 35-48, 1999. DOI: 10.1007/10720246-3 65, 76
70. G. de Giacomo and M. Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. 5th European Conf. on Planning, pages 226-238, 1999. DOI: 10.1007/10720246-18
71. T. Dean, L. P. Kaelbling, J. Kirman, and A. Nicholson. Planning with deadlines in stochastic domains. In Proc. 11th Nat. Conf. on Artificial Intelligence, pages 574-579, 1993.
72. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61-95, 1991. DOI: 10.1016/0004-3702(91)90006-6
73. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003. 35
74. D. C. Dennett. Kinds of minds. Basic Books New York, 1996.
75. E. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269-271, 1959. DOI: 10.1007/BF01386390
76. M. B. Do and S. Kambhampati. Solving the planning-graph by compiling it into CSP. In Proc. 5th Int. Conf. on Artificial Intelligence Planning Systems, pages 82-91, 2000.
77. M. B. Do and S. Kambhampati. Sapa: A domain-independent heuristic metric temporal planner. In Proc. 6th European Conf. on Planning, pages 82-91, 2001. 30
78. A. Doucet, N. de Freitas, K. Murphy, and S. Russell. Rao-blackwellised particle filtering for dynamic bayesian networks. In Proc. 16th Conf. on Uncertainty on Artificial Intelligence, pages 176-183, 2000.
79. S. Edelkamp and S. Schrödl. Heuristic Search-?eory and Applications. Academic Press, 2012. 17, 19, 23
80. S. Edelkamp. Planning with pattern databases. In Proc. 6th European Conf. on Planning, 2001.
81. S. Edelkamp. On the compilation of plan constraints and preferences. In Proc. 16th Int. Conf. on Automated Planning and Scheduling, pages 374-377, 2006. 48
82. K. Erol, J. Hendler, and D. S. Nau. HTN planning: Complexity and expressivity. In Proc. 12th Nat. Conf. on Artificial Intelligence, pages 1123-1123, 1994. 11
83. P. Eyerich, T. Keller, and M. Helmert. High-quality policies for the canadian traveler's problem. In Proc. 24th Conf. on Artificial Intelligence, pages 51-58, 2010.
84. Z. Feng and E. A. Hansen. Symbolic heuristic search for factored Markov decision processes. In Proc. 16th Nat. Conf. on Artificial Intelligence, pages 455-460, 1999.
85. Z. Feng, E. A. Hansen, and S. Zilberstein. Symbolic generalization for on-line planning. In Proc. 18th Conf. on Uncertainty on Artificial Intelligence, pages 209-216, 2002.
86. A. Fern, S. Yoon, and R. Givan. Approximate policy iteration with a policy language bias. In Proc. 17th Annual Conf. on Advances in Neural Information Processing Systems, 2003. DOI: 10.1613/jair.1700 12
87. R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 1:27-120, 1971. DOI: 10.1016/0004-3702(71)90010-5 12
88. H. Finnsson and Y. Björnsson. Simulation-based approach to general game playing. In Proc. 23th Conf. on Artificial Intelligence, pages 259-264, 2008.
89. M. Fox and D. Long. PDDL 2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20:61-124, 2003.
90. E. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24-32, 1982. DOI: 10.1145/322290.322292
91. J. Fu, V. Ng, F. Bastani, and I. Yen. Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 1949-1954, 2011. DOI: 10.5591/978-1-57735-516-8/IJCAI11-326
92. B. Gazen and C. Knoblock. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Proc. 4th European Conf. on Planning, pages 221-233, 1997. 26
93. H. Geffner and B. Bonet. Solving large POMDPs using real time dynamic programming, 1998. AAAI Fall Symposium on POMDPs.
94. H. Geffner. Heuristics, planning, cognition. In R. Dechter, H. Geffner, and J. Y. Halpern, editors, Heuristics, Probability and Causality. A Tribute to Judea Pearl. College Publications, 2010.
95. H. Geffner. Artificial Intelligence: From Programs to Solvers. AI Communications, 2013. DOI: 10.3233/978-1-58603-925-7-4
96. H. Geffner. Computational models of planning. Wiley Interdisciplinary Reviews: Cognitive Science, 2, 2013. DOI: 10.1002/wcs.1233
97. C. W. Geib and R. P. Goldman. A probabilistic plan recognition algorithm based on plan tree grammars. Artificial Intelligence, 173(11):1101-1132, 2009. DOI: 10.1016/j.artint.2009.01.003
98. S. Gelly and D. Silver. Combining online and offline knowledge in UCT. In Proc. 24th Int. Conf. on Machine Learning, pages 273-280, 2007. DOI: 10.1145/1273496.1273531
99. A. E. Gerevini, A. Saetti, and I. Serina. An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artificial Intelligence, 172(8):899-944, 2008. DOI: 10.1016/j.artint.2008.01.002
100. A. E. Gerevini, P. Haslum, D. Long, A. Saetti, and Y. Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artificial Intelligence, 173(5-6):619-668, 2009. DOI: 10.1016/j.artint.2008.10.012 25
101. R. Gerth, D. A. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. Int. Symposium on Protocol Specification, Testing and Verification, pages 3-18, 1995.
102. M. Ghallab, D. Nau, and P. Traverso. Automated Planning: theory and practice. Morgan Kaufmann, 2004. xi, 13, 46
103. G. Gigerenzer. Gut feelings: ?e intelligence of the unconscious. Viking Books, 2007.
104. M. L. Ginsberg. Universal planning: An (almost) universally bad idea. AI Magazine, 10(4):40-44, 1989.
105. R. P. Goldman and M. S. Boddy. Expressive planning and explicit knowledge. In Proc. 3rd Int. Conf. on Artificial Intelligence Planning Systems, pages 110-117, 1996.
106. A. Gopnik, C. Glymour, D. Sobel, L. Schulz, T. Kushnir, and D. Danks. A theory of causal learning in children: Causal maps and bayes nets. Psychological Review, 111(1):3-31, 2004. DOI: 10.1037/0033-295X.111.1.3
107. E. A. Hansen and R. Zhou. Anytime heuristic search. Journal of Artificial Intelligence Research, 28:267-297, 2007. DOI: 10.1613/jair.2096
108. E. A. Hansen and S. Zilberstein. LAO: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129:35-62, 2001. DOI: 10.1016/S0004-3702(01)00106-0 72
109. E. A. Hansen. Solving POMDPs by searching in policy space. In Proc. 14th Conf. on Uncertainty on Artificial Intelligence, pages 211-219, 1998.
110. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems Science and Cybernetics, 4:100-107, 1968. DOI: 10.1109/TSSC.1968.300136
111. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In Proc. 5th Int. Conf. on Artificial Intelligence Planning Systems, pages 70-82, 2000. 13, 33
112. P. Haslum and P. Jonsson. Some results on the complexity of planning with incomplete information. In Proc. 5th European Conf. on Planning, pages 308-318, 1999. DOI: 10.1007/10720246-24
113. P. Haslum, A. Botea, M. Helmert, B. Bonet, and S. Koenig. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. 22nd Conf. on Artificial Intelligence, pages 1007-1012, 2007.
114. R. Hassin, J. Uleman, and J. Bargh. ?e New Unconscious. Oxford University Press, 2005.
115. M. Helmert and C. Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. 19th Int. Conf. on Automated Planning and Scheduling, pages 162-169, 2009. 41
116. M. Helmert, P. Haslum, and J. Hoffmann. Flexible abstraction heuristics for optimal sequential planning. In Proc. 17th Int. Conf. on Automated Planning and Scheduling, pages 176-183, 2007.
117. M. Helmert, M. B. Do, I. Refanidis. IPC Deterministic planning competition. In 6th Int. Planning Competition Booklet (ICAPS 2008), 2008.
118. M. Helmert. ? Fast Downward planning system. Journal of Artificial Intelligence Research, 26:191-246, 2006. DOI: 10.1613/jair.1705 33, 38
119. M. Helmert. Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence, 173(5):503-535, 2009. DOI: 10.1016/j.artint. 2008.10.013
120. J. Hoey, R. St-Aubin, A. Hu, and C. Boutilier. SPUDD: Stochastic planning using decision diagrams. In Proc. 15th Conf. on Uncertainty on Artificial Intelligence, pages 279-288, 1999.
121. J. Hoffmann and R. I. Brafman. Contingent planning via heuristic forward search with implicit belief states. In Proc. 15th Int. Conf. on Automated Planning and Scheduling, pages 71-80, 2005.
122. J. Hoffmann and R. I. Brafman. Conformant planning via heuristic forward search: A new approach. Artificial Intelligence, 170:507-541, 2006. DOI: 10.1016/j.artint.2006.01.003 55
123. J. Hoffmann and B. Nebel. ?e FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001. DOI: 10.1613/jair.855 13, 31, 37
124. J. Hoffmann, J. Porteous, and L. Sebastia. Ordered landmarks in planning. Journal of Artificial Intelligence Research, 22:215-278, 2004. DOI: 10.1613/jair.1492 13, 38
125. J. Hoffmann, C. Gomes, B. Selman, and H. A. Kautz. SAT encodings of state-space reachability problems in numeric domains. In Proc. 20th Int. Joint Conf. on Artificial Intelligence, pages 1918-1923, 2007. 34
126. J. Hoffmann. Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research, 20:291-341, 2003. DOI: 10.1613/jair.1144
127. J. Hoffmann. Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24:685-758, 2005. DOI: 10.1613/jair.1747
128. J. Hoffmann. Analyzing search topology without running any search: On the connection between causal graphs and hC. Journal of Artificial Intelligence Research, 41:155-229, 2011. DOI: 10.1613/jair.3276
129. J. Hopcroft and J. Ullman. Introduction to Automata ?eory, Languages, and Computation. Addison-Wesley, 1979.
130. R. Howard. Dynamic Probabilistic Systems-Volume I: Markov Models. Wiley, 1971.
131. Y. Hu and G. de Giacomo. Generalized planning: Synthesizing plans that work for multiple environments. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 918-923, 2011. DOI: 10.5591/978-1-57735-516-8/IJCAI11-159
132. P. Jonsson and C. Bäckström. Tractable planning with state variables by exploiting structural restrictions. In Proc. 12th Nat. Conf. on Artificial Intelligence, pages 998-1003, 1994.
133. A. Jonsson. Role of macros in tractable planning over causal graphs. In Proc. 20th Int. Joint Conf. on Artificial Intelligence, pages 1936-1941, 2007.
134. A. Junghanns and J. Schaeffer. Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1):219-251, 2001. DOI: 10.1016/S0004-3702(01)00109-6
135. F. Kabanza and S. baux. Search control in planning for temporally extended goals. In Proc. 15th Int. Conf. on Automated Planning and Scheduling, pages 130-139, 2005.
136. L. P. Kaelbling, M. L. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998. DOI: 10.1016/S0004-3702(98)00023-X 6, 13, 101, 107 Daniel Kahneman. ?inking, fast and slow. Farrar, Straus and Giroux, 2011.
137. S. Kambhampati, C. Knoblock, and Q. Yang. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence, 76(1-2):167-238, 1995. DOI: 10.1016/0004-3702(94)00076- D
138. E. Karpas and C. Domshlak. Cost-optimal planning with landmarks. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 1728-1733, 2009.
139. M. Katz and C. Domshlak. Optimal additive composition of abstraction-based admissible heuristics. In Proc. 18th Int. Conf. on Automated Planning and Scheduling, pages 174-181, 2008. DOI: 10.1016/j.artint.2010.04.021
140. M. Katz and C. Domshlak. Structural patterns heuristics via fork decomposition. In Proc. 18th Int. Conf. on Automated Planning and Scheduling, pages 182-189, 2008.
141. H. A. Kautz and J. F. Allen. Generalized plan recognition. In Proc. 5th Nat. Conf. on Artificial Intelligence, pages 32-37, 1986.
142. H. A. Kautz and B. Selman. Planning as satisfiability. In Proc. 10th European Conf. on Artificial Intelligence, pages 359-363, 1992.
143. H. A. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. 13th Nat. Conf. on Artificial Intelligence, pages 1194-1201, 1996. 13, 45
144. H. A. Kautz and B. Selman. Unifying SAT-based and graph-based planning. In Proc. 16th Int. Joint Conf. on Artificial Intelligence, pages 318-327, 1999. 45
145. T. Keller and P. Eyerich. PROST: Probabilistic planning based on UCT. In Proc. 22nd Int. Conf. on Automated Planning and Scheduling, pages 119-127, 2012.
146. E. Keyder and H. Geffner. Heuristics for planning with action costs revisited. In Proc. 18th European Conf. on Artificial Intelligence, pages 588-592, 2008. DOI: 10.3233/978-1-58603-891-5-588
147. E. Keyder and H. Geffner. ?e HMDPP planner for planning with probabilities. In 6th Int. Planning Competition Booklet (ICAPS 2008), 2008.
148. E. Keyder and H. Geffner. Soft goals can be compiled away. Journal of Artificial Intelligence Research, 36:547-556, 2009. DOI: 10.1613/jair.2857 52
149. E. Keyder, S. Richter, and M. Helmert. Sound and complete landmarks for And/Or graphs. In Proc. 19th European Conf. on Artificial Intelligence, pages 335-340, 2010.
150. C. A. Knoblock. Learning abstraction hierarchies for problem solving. In Proc. 8th Nat. Conf. on Artificial Intelligence, pages 923-928, 1990.
151. L. Kocsis and C. Szepesvári. Bandit based Monte-Carlo planning. In Proc. 17th European Conf. on Machine Learning, pages 282-293, 2006. DOI: 10.1007/11871842-29
152. S. Koenig and X. Sun. Comparing real-time and incremental heuristic search for real-time situated agents. Journal of Autonomous Agents and Multi-Agent Systems, 18(3):313-341, 2009. DOI: 10.1007/s10458-008-9061-x
153. A. Kolobov, P. Dai, Mausam, and D. S. Weld. Reverse iterative deepening for finite-horizon MDPs with large branching factors. In Proc. 22nd Int. Conf. on Automated Planning and Scheduling, pages 146-154, 2012.
154. A. Kolobov, Mausam, and D. S. Weld. LRTDP versus UCT for online probabilistic planning. In Proc. 26nd Conf. on Artificial Intelligence, pages 1786-1792, 2012.
155. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985. DOI: 10.1016/0004-3702(85) 90084-0
156. R. E. Korf. Planning as search: A quantitative approach. Artificial Intelligence, 33(1):65-88, 1987. DOI: 10.1016/0004-3702(87)90051-8 34
157. R. E. Korf. Real-time heuristic search. Artificial Intelligence, 42:189-211, 1990. DOI: 10.1016/0004-3702(90)90054-4 21
158. U. Kuter, D. S. Nau, E. Reisner, and R. P. Goldman. Using classical planners to solve nondeterministic planning problems. In Proc. 18th Int. Conf. on Automated Planning and Scheduling, pages 190-197, 2008.
159. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, 1985. 23
160. N. Lipovetzky and H. Geffner. Searching for plans with carefully designed probes. In Proc. 21st Int. Conf. on Automated Planning and Scheduling, pages 154-161, 2011.
161. N. Lipovetzky and H. Geffner. Width and serialization of classical planning problems. In Proc. 20th European Conf. on Artificial Intelligence, pages 540-545, 2012. DOI: 10.3233/978-1-61499-098-7-540 35
162. M. L. Littman, J. Goldsmith, and M. Mundhenk. computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1-36, 1998. DOI: 10.1613/jair.505
163. M. L. Littman. Memoryless policies: ?eoretical limitations and practical results. In D. Cliff, editor, From Animals to Animats 3. MIT Press, 1994.
164. Y. Liu, S. Koenig, and D. Furcy. Speeding up the calculation of heuristics for heuristic search-based planning. In Proc. 18th Nat. Conf. on Artificial Intelligence, pages 484-491, 2002.
165. B. Marthi, S. J. Russell, and J. Wolfe. Angelic semantics for high-level actions. In Proc. 17th Int. Conf. on Automated Planning and Scheduling, pages 232-239, 2007.
166. M. Martin and H. Geffner. Learning generalized policies in planning using concept languages. In Proc. 7th Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 667-677, 2000.
167. M. J. Mataric. Robotics Primer. MIT Press, 2007.
168. Mausam and A. Kolobov. Planning with Markov Decision Processes: An AI Perspective. Morgan & Claypool, 2012. DOI: 10.2200/S00426ED1V01Y201206AIM017 92
169. D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In Proc. 9th Nat. Conf. on Artificial Intelligence, pages 634-639, 1991. 13
170. D. V. McDermott, M. Ghallab, A. Howe, C. Knoblock, A. Ram, M. Veloso, D. S. Weld, and D. Wilkins. PDDL-e Planning Domain Definition Language. Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, New Haven, CT, 1998.
171. D. V. McDermott. A heuristic estimator for means-ends analysis in planning. In Proc. 3rd Int. Conf. on Artificial Intelligence Planning Systems, pages 142-149, 1996. 13
172. D. V. McDermott. Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2):111-159, 1999. DOI: 10.1016/S0004-3702(99)00010-7 27
173. S. A. McIlraith and R. Fadel. Planning with complex actions. In Proc. 9th Int. Workshop on Non-Monotonic Reasoning, pages 356-364, 2002.
174. M. Minsky. Steps toward artificial intelligence. Proceedings of the IRE, 49(1):8-30, 1961. DOI: 10.1109/JRPROC.1961.287775
175. C. Muise, S. A. McIlraith, and J. C. Beck. Improved non-deterministic planning by exploiting state relevance. In Proc. 22nd Int. Conf. on Automated Planning and Scheduling, pages 172-180, 2012.
176. R. R. Murphy. An Introduction to AI Robotics. MIT Press, 2000.
177. B. Nebel. On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research, 12:271-315, 2000. DOI: 10.1613/jair.735
178. A. Newell and H. A. Simon. GPS, a program that simulates human thought. In H. Billing, editor, Lernende Automaten, pages 109-124. R. Oldenbourg, 1961.
179. A. Newell, J. C. Shaw, and H. A. Simon. Report on a general problem-solving program. In Proc. of the Int. Conf. on Information Processing, pages 256-264, 1959. 11
180. X. L. Nguyen and S. Kambhampati. Reviving partial order planning. In Proc. 17th Int. Joint Conf. on Artificial Intelligence, pages 459-466, 2001. 13
181. N. Nilsson. Principles of Artificial Intelligence. Tioga, 1980. 44, 71
182. H. Palacios and H. Geffner. Compiling uncertainty away in conformant planning problems with bounded width. Journal of Artificial Intelligence Research, 35:623-675, 2009. DOI: 10.1613/jair.2708 54, 55, 57, 73
183. F. Patrizi, N. Lipovetzky, G. de Giacomo, and H. Geffner. Computing infinite plans for LTL goals using a classical planner. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 2003-2008, 2011. DOI: 10.5591/978-1-57735-516-8/IJCAI11-334
184. F. Patrizi, N. Lipovetzky, and H. Geffner. Fair LTL synthesis for non-deterministic systems using strong cyclic planners. In Proc. 23rd Int. Joint Conf. on Artificial Intelligence, 2013.
185. J. Pearl. Heuristics. Addison-Wesley, 1983. 17, 18, 19, 23
186. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988. 58, 74
187. E. Pednault. ADL: Exploring the middle ground between Strips and the situation calcules. In Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 324-332, 1989.
188. J. Penberthy and D. S. Weld. UCPOP: A sound, complete, partiall order planner for ADL. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 103-114, 1992.
189. J. Pineau, G. J. Gordon, and S. run. Anytime point-based approximations for large POMDPs. Journal of Artificial Intelligence Research, 27:335-380, 2006. DOI: 10.1613/jair.2078
190. A. Pnueli. ?e temporal logic of programs. In Proc. 18th Annual Symposium on the Foundations of Computer Science, pages 46-57, 1977. DOI: 10.1109/SFCS.1977.32
191. P. Poupart and C. Boutilier. Bounded finite state controllers. In Proc. 17th Annual Conf. on Advances in Neural Information Processing Systems, pages 823-830, 2003.
192. M. Puterman. Markov Decision Processes-Discrete Stochastic Dynamic Programming. John Wiley and Sons, 1994. DOI: 10.1002/9780470316887 79, 82
193. M. Ramírez and H. Geffner. Probabilistic plan recognition using off-the-shelf classical planners. In Proc. 24th Conf. on Artificial Intelligence, pages 1121-1126, 2010. 58
194. M. Ramírez and H. Geffner. Goal recognition over POMDPs: Inferring the intention of a POMDP agent. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 2009-2014, 2011. DOI: 10.5591/978-1-57735-516-8/IJCAI11-335
195. S. Richter and M. Westphal. ?e LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39:127-177, 2010. DOI: 10.1613/jair.2972 13, 20, 33, 38
196. S. Richter, M. Helmert, and M. Westphal. Landmarks revisited. In Proc. 23th Conf. on Artificial Intelligence, pages 975-982, 2008.
197. S. Richter, J. T. ?ayer, and W. Ruml. ?e joy of forgetting: Faster anytime search via restarting. In Proc. 20th Int. Conf. on Automated Planning and Scheduling, pages 137-144, 2010.
198. J. Rintanen. Complexity of planning with partial observability. In Proc. 14th Int. Conf. on Automated Planning and Scheduling, pages 345-354, 2004.
199. J. Rintanen. Distance estimates for planning in the discrete belief space. In Proc. 19th Nat. Conf. on Artificial Intelligence, pages 525-530, 2004.
200. J. Rintanen. Planning as satisfiability: Heuristics. Artificial Intelligence, 193:45-86, 2012. DOI: 10.1016/j.artint.2012.08.001
201. G. Röger and M. Helmert. Emore, the merrier: Combining heuristic estimators for satisficing planning. In Proc. 20th Int. Conf. on Automated Planning and Scheduling, pages 246-249, 2010.
202. S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 3rd edition, 2009. 11, 1, 13
203. E. D. Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5(2):115-135, 1974. DOI: 10.1016/0004-3702(74)90026-5
204. E. Sacerdoti. ?e nonlinear nature of plans. In Proc. 4th Int. Joint Conf. on Artificial Intelligence, pages 206-214, 1975.
205. R. Sanchez and S. Kambhampati. Planning graph heuristics for selecting objectives in oversubscription planning problems. In Proc. 15th Int. Conf. on Automated Planning and Scheduling, pages 192-201, 2005.
206. S. Sanner and C. Boutilier. Practical solution techniques for first-order MDPs. Artificial Intelligence, 173(5-6):748-788, 2009. DOI: 10.1016/j.artint.2008.11.003
207. S. Sanner and K. Kersting. Symbolic dynamic programming for first-order POMDPs. In Proc. 24th Conf. on Artificial Intelligence, pages 1140-1146, 2010.
208. M. J. Schoppers. Universal plans for reactive robots in unpredictable environments. In Proc. 10th Int. Joint Conf. on Artificial Intelligence, pages 1039-1046, 1987.
209. W. Schultz, P. Dayan, and P. R. Montague. A neural substrate of prediction and reward. Science, 275(5306):1593-1599, 1997. DOI: 10.1126/science.275.5306.1593
210. G. Shani, J. Pineau, and R. Kaplow. A survey of point-based POMDP solvers. Journal of Autonomous Agents and Multi-Agent Systems, pages 1-51, 2012. Online-First Article. DOI: 10.1007/s10458-012-9200-2 102
211. D. Silver and J. Veness. Monte-Carlo planning in large POMDPs. In Proc. 24th Annual Conf. on Advances in Neural Information Processing Systems, pages 2164-2172, 2010.
212. H. A. Simon. A behavioral model of rational choice. Quarterly Journal of Economics, 69(1):99-118, 1955. DOI: 10.2307/1884852
213. H. A. Simon.Esciences of the artificial. MIT Press, 3rd edition, 1996.
214. M. Sipser. Introduction to ?eory of Computation.Omson Course Technology, Boston, MA, 2nd edition, 2006. 8, 45
215. R. Smallwood and E. Sondik. ?e optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973. DOI: 10.1287/opre.21.5.1071
216. D. E. Smith and D. S. Weld. Conformant graphplan. In Proc. 15th Nat. Conf. on Artificial Intelligence, pages 889-896, 1998.
217. D. E. Smith and D. S. Weld. Temporal planning with mutual exclusion reasoning. In Proc. 16th Int. Joint Conf. on Artificial Intelligence, pages 326-337, 1999.
218. D. E. Smith, J. Frank, and A. K. Jonsson. Bridging the gap between planning and scheduling. Knowledge Engineering Review, 15(1):47-83, 2000. DOI: 10.1017/S0269888900001089 47
219. D. E. Smith. Choosing objectives in over-subscription planning. In Proc. 14th Int. Conf. on Automated Planning and Scheduling, pages 393-401, 2004. 30
220. S. Srivastava, N. Immerman, and S. Zilberstein. A new representation and associated algorithms for generalized planning. Artificial Intelligence, 175(2):615-647, 2011. DOI: 10.1016/j.artint.2010.10.006
221. S. Srivastava, S. Zilberstein, N. Immerman, and H. Geffner. Qualitative numeric planning. In Proc. 25th Conf. on Artificial Intelligence, pages 1010-1016, 2011.
222. K. Stanley, B. Bryant, and R. Miikkulainen. Real-time neuroevolution in the NERO video game. IEEE Trans. on Evolutionary Computation, 9(6):653-668, 2005. DOI: 10.1109/TEVC.2005.856210
223. C. Striebel. Sufficient statistics in the control of stochastic systems. Journal of Mathematical Analaysis and Applications, 12:576-592, 1965. DOI: 10.1016/0022-247X(65)90027-2
224. R. Sutton and A. Barto. Introduction to Reinforcement Learning. MIT Press, 1998. 95, 96
225. C. Szepesvári. Algorithms for reinforcement learning. Morgan & Claypool Publishers, 2010. DOI: 10.2200/S00268ED1V01Y201005AIM009
226. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972. DOI: 10.1137/0201010
227. A. Tate. Generating project networks. In Proc. 5th Int. Joint Conf. on Artificial Intelligence, pages 888-893, 1977.
228. S. T. To, E. Pontelli, and T. Cao Son. On the effectiveness of CNF and DNF representations in contingent planning. In Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pages 2033-2038, 2011. DOI: 10.5591/978-1-57735-516-8/ IJCAI11-339 55
229. J. Tooby and L. Cosmides. ?e psychological foundations of culture. In J. Barkow, L. Cosmides, and J. Tooby, editors, Adapted Mind. Oxford, 1992.
230. M. Toussaint and A. Storkey. Probabilistic inference for solving discrete and continuous state markov decision processes. In Proc. 23rd Int. Conf. on Machine Learning, pages 945-952, 2006. DOI: 10.1145/1143844.1143963
231. M. van den Briel and S. Kambhampati. Optiplan: Unifying IP-based and graph-based planning. Journal of Artificial Intelligence Research, 24:919-931, 2005. DOI: 10.1613/jair.1698
232. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994. DOI: 10.1006/inco.1994.1092
233. J. Veness, K. S. Ng, M. Hutter, W. Uther, and D. Silver. A Monte-Carlo AIXI approximation. Journal of Artificial Intelligence Research, 40:95-142, 2011. DOI: 10.1613/jair.3125
234. V. Vidal and H. Geffner. Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence, 170(3):298-335, 2006. DOI: 10.1016/j.artint.2005.08.004 13, 47
235. C. Watkins. Learning from Delayed Rewards. PhD thesis, Cambridge University, 1989.
236. D. S. Weld. An introduction to least commitment planning. AI Magazine, 15(4):27-61, 1994. 44, 46
237. T. D. Wilson. Strangers to Ourselves. Belknap Press, 2002.
238. Q. Yang. Activity recognition: Linking low-level sensors to high-level intelligence. In Proc. 21st Int. Joint Conf. on Artificial Intelligence, pages 20-25, 2009.
239. S. Yoon, A. Fern, and R. Givan. FF-replan: A baseline for probabilistic planning. In Proc. 17th Int. Conf. on Automated Planning and Scheduling, pages 352-359, 2007. 77
240. L. Zhu and R. Givan. Landmark extraction via planning graph propagation. In ICAPS Doctoral Consortium, pages 156-160, 2003.