Computational models of planning

Wiley Interdisciplinary Reviews: Cognitive Science

Volumn 4, Issue 4, 2013, Pages 341-356

  Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84879205615     PISSN: 19395078     EISSN: 19395086     Source Type: Journal    
DOI: 10.1002/wcs.1233     Document Type: Article

References (106)

1. Newell A, Simon H. Elements of a theory of human problem solving. Psychol Rev 1958, 65:151-166.
2. Newell A, Simon H. GPS: a program that simulates human thought. In: Feigenbaum E, Feldman J, eds. Computers and Thought. McGraw Hill; 1963, 279-293.
3. Brooks R. A robust layered control system for a mobile robot. IEEE J Robot Autom 1987, 2:14-27.
4. Mataric MJ. The Robotics Primer. Cambridge, MA: MIT Press; 2007.
5. Sutton R, Barto A. Introduction to Reinforcement Learning. Cambridge, MA: MIT Press; 1998.
6. Mitchell T. Machine Learning. Boston, MA: McGraw-Hill; 1997.
7. Russell S, Norvig P. Artificial Intelligence: A Modern Approach. 3rd ed. Upper Saddle River, NJ: Prentice Hall; 2009.
8. Ghallab M, Nau D, Traverso P. Automated Planning: Theory and Practice. San Francisco, CA: Morgan Kaufmann; 2004.
9. Geffner H, Bonet B. Advanced Introduction to Planning: Models and Methods. San Rafael, CA: Morgan & Claypool; 2013.
10. Dennett D. Kinds of Minds. New York: Basic Books; 1996.
11. Bylander T. The computational complexity of STRIPS planning. Artif Intell 1994, 69:165-204.
12. Tooby J, Cosmides L. The psychological foundations of culture. In: Barkow J, Cosmides L, Tooby J, eds. The Adapted Mind. Oxford, NY: Oxford University Press; 1992.
13. Coles AJ, Coles A, Olaya AG, Jiménez S, López CL, Sanner S, Yoon S. A survey of the seventh international planning competition. AI Mag 2012, 33:83-88.
14. Geffner H. Heuristics, planning, cognition. In: Dechter R, Geffner H, Halpern J, eds. Heuristics, Probability and Causality. A Tribute to Judea Pearl. London: College Publications; 2010.
15. Gratch J. Why you should buy an emotional planner. Proceedings of Agents'99 Workshop on Emotion-based Agent Architectures (EBAA'99), 1999. Available at: http://emotions.usc.edu/∼gratch/gratch-ebaa99.pdf.
16. Gratch J, Marsella S. A domain-independent framework for modeling emotion. Cogn Syst Res 2004, 5:269-306.
17. Fikes R, Nilsson N. STRIPS: A new approach to the application of theorem proving to problem solving. Artif Intell 1971, 1:27-120.
18. McDermott D. PDDL--the planning domain definition language, 1998. Available at: http://ftp.cs.yale.edu/pub/mcdermott
19. Backstrom C, Nebel B. Complexity results for SAS+ planning. Comput Intell 1995, 11:625-655.
20. Younes H, Littman M, Weissman D, Asmuth J. The first probabilistic track of the international planning competition. J Artif Intell Res 2005, 24:851-887.
21. Dijkstra E. A note on two problems in connexion with graphs. Numer Math 1959;1:269-271.
22. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. Cambridge, MA: The MIT Press; 2009.
23. Hart P, Nilsson N, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 1968, 4:100-107.
24. Pearl J. Heuristics. Reading, MA: Addison Wesley; 1983.
25. Korf R. Finding optimal solutions to Rubik's cube using pattern databases. Proceedings of AAAI-98, 1998, 1202-1207.
26. Simon H. A behavioral model of rational choice. Quart J Econ 1955, 69:99-118.
27. Minsky M. Steps toward artificial intelligence. Proc IRE 1961, 49:8-30.
28. McDermott D. A heuristic estimator for means-ends analysis in planning. Proceedings of AIPS-96, 1996, 142-149.
29. Bonet B, Loerincs G, Geffner H. A robust and fast action selection mechanism for planning. Proceedings of AAAI-97, 1997, 714-719.
30. Bonet B, Geffner H. Planning as heuristic search. Artif Intell 2001, 129:5-33.
31. Keyder E, Geffner H. Heuristics for planning with action costs revisited. Proceedings of ECAI-08, 2008, 588-592.
32. Hoffmann J, Nebel B. The FF planning system: fast plan generation through heuristic search. J Artif Intell Res 2001, 14:253-302.
33. Newell A, Shaw JC, Simon H. Chess-playing programs and the problem of complexity. In: Feigenbaum E, Feldman J, eds. Computers and Thought. McGraw Hill; 1963, 109-133.
34. Korf R. Real-time heuristic search. Artif Intell 1990, 42:189-211.
35. Barto A, Bradtke S, Singh S. Learning to act using real-time dynamic programming. Artif Intell 1995, 72:81-138.
36. Bonet B, Geffner H. Labeled RTDP: Improving the convergence of real-time dynamic programming. Proceedings of 13th International Conference on Automated Planning and Scheduling (ICAPS-2003). Menlo Park, CA: AAAI Press; 2003, 12-31.
37. Bonet B, Geffner H. Solving POMDPs: RTDP-Bel vs. point-based algorithms. Proceedings of IJCAI, 2009, 1641-1646.
38. Kocsis L, Szepesvári C. Bandit based Monte-Carlo planning. Proceedings of ECML-2006, 2006, 282-293.
39. Gelly S, Silver D. Combining online and offline knowledge in UCT. Proceedings of ICML, 2007, 273-280.
40. Bonet B, Geffner H. Action selection for MDPs: Anytime AO* vs. UCT. Proceedings of AAAI-2012, 2012.
41. Martelli A, Montanari U. Additive AND/OR graphs. Proceedings of IJCAI-73, 1973, 1-11.
42. Schultz W, Dayan P, Montague P. A neural substrate of prediction and reward. Science 1997, 275:1593-1599.
43. Damasio A. Descartes' Error: Emotion, Reason, and the Human Brain. Castleton, NY: Quill; 1995.
44. Gigerenzer G, Todd P. Simple Heuristics that Make Us Smart. Oxford, NY: Oxford University Press; 1999.
45. Gigerenzer G. Gut Feelings: The Intelligence of the Unconscious. New York: Viking Books; 2007.
46. Wilson T. Strangers to Ourselves. Cambridge, MA: Belknap Press; 2002.
47. Hassin R, Uleman J, Bargh J. The New Unconscious. Oxford, NY: Oxford University Press; 2005.
48. Kahneman D. Thinking, fast and slow, Farrar, Straus and Giroux, New York; 2011.
49. Penberthy J, Weld D. UCPOP: a sound, complete, partial order planner for ADL, Proceedings of KR-92, 1992.
50. Sacerdoti E. The nonlinear nature of plans. Proceedings of IJCAI-75, 1975, 206-214.
51. Tate A. Generating project networks. Proceedings of IJCAI, 1977, 888-893.
52. McAllester D, Rosenblitt D. Systematic nonlinear planning. Proceedings of AAAI-91, 1991, 634-639.
53. Blum A, Furst M. Fast planning through planning graph analysis. Proceedings of IJCAI-95. 1995, 1636-1642.
54. Haslum P, Geffner H. Admissible heuristics for optimal planning. Proceedings of the Fifth International Conference on AI Planning Systems (AIPS-2000), 2000, 70-82.
55. Kautz H, Selman B. Pushing the envelope: planning, propositional logic, and stochastic search. Proceedings of AAAI, 1996, 1194-1201.
56. Biere A, Heule M, van Maaren H, Walsh T. Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. Amsterdam: IOS Press; 2009.
57. Rintanen J. Heuristics for planning with SAT. Proceedings of on Principles and Practice of Constraint Programming (CP 2010). Berlin: Springer; 2010, 414-428.
58. Hoffmann J, Porteous J, Sebastia L. Ordered landmarks in planning. J Artif Intell Res 2004, 22:215-278.
59. Richter S, Westphal M. The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 2010, 39:127-177.
60. Lipovetzky N, Geffner H. Width and serialization of classical planning problems. Proceedings of ECAI. Amsterdam: IOS Press; 2012, 540-545.
61. Bertsekas D. Dynamic Programming and Optimal Control, Vols 1 and 2. Nashua, NH: Athena Scientific; 1995.
62. Puterman M. Markov Decision Processes -Discrete Stochastic Dynamic Programming. New York: John Wiley and Sons, Inc.; 1994.
63. Boutilier C, Dean T, Hanks S. Decision-theoretic planning: structural assumptions and computational leverage. J Artif Intell Res (JAIR) 1999, 11:1-94.
64. Astrom K. Optimal control of Markov decision processes with incomplete state estimation. J Math Anal Appl 1965, 10:174-205.
65. Kaelbling L, Littman M, Cassandra T. Planning and acting in partially observable stochastic domains. Artif Intell 1998, 101:99-134.
66. Bellman R. Dynamic Programming. Princeton, NJ: Princeton University Press; 1957.
67. Howard R. Dynamic Probabilistic Systems-Volume I: Markov Models. New York: John Wiley and Sons; 1971.
68. Kolobov A, Mausam, Weld D. LRTDP vs. UCT for online probabilistic planning. Proceedings of AAAI, 2012.
69. Silver D, Veness J. Monte-Carlo planning in large POMDPs. Advances in Neural Information Processing Systems (NIPS), 2010. 2164-2172.
70. Keller T, Eyerich P. PROST: Probabilistic planning based on UCT. Proceedings of ICAPS, 2012.
71. Watkins C, Dayan P. Q-learning. Mach Learn 1992, 8:279-292.
72. Sutton R. Learning to predict by the methods of temporal differences. Mach Learn 1988, 3:9-44.
73. Kearns M, Singh S. Near-optimal reinforcement learning in polynomial time. Mach Learn 2002, 49:209-232.
74. Brafman R, Tennenholtz M. R-Max: a general polynomial time algorithm for near-optimal reinforcement learning. J Mach Learn Res 2003, 3:213-231.
75. Asmuth J, Littman M. Learning is planning: near bayes-optimal reinforcement learning via Monte-Carlo tree search. Proceedings of UAI, 2011, 19-26.
76. Attias H. Planning by probabilistic inference. Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics, 2003.
77. Toussaint M, Storkey A. Probabilistic inference for solving discrete and continuous state Markov decision processes. Proceedings of 23rd International Conference on Machine Learning, 2006, 945-952.
78. Botvinick M, An J. Goal-directed decision making in the prefrontal cortex: a computational framework. Adv Neural Inform Process Syst (NIPS), 2008. 169-176.
79. Yoon S, Fern A, Givan R. FF-replan: a baseline for probabilistic planning. Proceedings of ICAPS-07, 2007, 352-359.
80. Ogata K. Modern Control Engineering. Upper Saddle River, NJ: Prentice Hall; 2001.
81. Keyder E, Geffner H. Soft goals can be compiled away. J Artif Intell Res 2009, 36:547-556.
82. Palacios H, Geffner H. Compiling uncertainty away in conformant planning problems with bounded width. J Artif Intell Res 2009, 35:623-675.
83. Albore A, Palacios H, Geffner H. A translation-based approach to contingent planning. Proceedings of IJCAI-09, 2009, 1623-1628.
84. Bonet B, Geffner H. Planning under partial observability by classical replanning: theory and experiments. Proceedings of IJCAI-11, 2011, 1936-1941.
85. Shani G, Brafman R. Replanning in domains with partial information and sensing actions. Proceedings of IJCAI-2011, 2011, 2021-2026.
86. Chapman D. Penguins can make cake. AI Mag 1989, 10:45-50.
87. Ballard D, Hayhoe M, Pook P, Rao R. Deictic codes for the embodiment of cognition. Behav Brain Sci 1997, 20:723-742.
88. Bonet B, Palacios H, Geffner H. Automatic derivation of memoryless policies and finite-state controllers using classical planners. Proceedings of ICAPS-09, 2009, 34-41.
89. Martin M, Geffner H. Learning generalized policies from planning examples using concept languages. Appl Intell 2004, 20:9-19.
90. Hu Y, De Giacomo G. Generalized planning: synthesizing plans that work for multiple environments. Proceedings of IJCAI, 2011; 918-923.
91. Bowling M, Jensen R, Veloso M. A formalization of equilibria for multiagent planning. Proceedings of IJCAI-03, 2003, 1460-1462.
92. Larbi R, Konieczny S, Marquis P. Extending classical planning to the multi-agent case: a game-theoretic approach. Proceedings of 9th European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2007), volume 4724 of Lecture Notes in Computer Science. Springer; 2007, 731-742.
93. Brafman R, Domshlak C, Engel Y, Tennenholtz M. Planning games. Proceedings of IJCAI-09, 2009, 73-78.
94. Camerer C. Behavioral Game Theory: Experiments in Strategic Interaction. Princeton, NJ: Princeton University Press; 2003.
95. Erol K, Hendler J, Nau DS. HTN planning: Complexity and expressivity. Proceedings of AAAI-94, 1994, 1123.
96. Sacerdoti E. Planning in a hierarchy of abstraction spaces. Artif Intell 1974, 5:115-135.
97. Korf R. Planning as search: a quantitative approach. Artif Intell 1987, 33:65-88.
98. Knoblock C. Learning abstraction hierarchies for problem solving. Proceedings of AAAI-90, 1990, 923-928.
99. Bacchus F, Yang Q. Downward refinement and the efficiency of hierarchical problem solving. Artif Intell 1994, 71:43-100.
100. McIlraith S, Fadel R. Planning with complex actions. Proceedings of NMR-02, 2002, 356-364.
101. Marthi B, Russell S, Wolfe J. Angelic semantics for high-level actions. Proceedings of ICAPS-07, 2007, 232-239.
102. Jonsson A. The role of macros in tractable planning over causal graphs. Proceedings of IJCAI-07, 2007, 1936-1941.
103. McCallum A. Overcoming incomplete perception with utile distinction memory. Proceedings Tenth International Conference on Machine Learning, 1993, 190-196.
104. Stanley K, Bryant B, Miikkulainen R. Real-time neuroevolution in the nero video game. IEEE Trans Evolution Comput 2005, 9:653-668.
105. Veness J, Ng K, Hutter M, Uther W, Silver D. A Monte-Carlo AIXI approximation. J Artif Intell Res 2011, 40:95-142.
106. Gopnik A, Glymour C, Sobel D, Schulz L, Kushnir T, Danks D. A theory of causal learning in children: causal maps and Bayes nets. Psychol Rev 2004, 111:3-31.