Conformant plans and beyond: Principles and complexity

Artificial Intelligence

Volumn 174, Issue 3-4, 2010, Pages 245-269

  Bonet, Blai ^a  

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

Author keywords

Complexity of planning; Modal logic; Non deterministic planning; Partially observable planning; Planning

Indexed keywords

APRIORI; BELIEF SPACE; BRANCH POINTS; CLASSICAL PLANNING; COMPLEXITY CLASS; COMPLEXITY OF PLANNING; COMPLEXITY RESULTS; CONFORMANT PLANNING; DECISION PROBLEMS; DISCRETE SPECTRUM; EXTREME POINTS; LINEAR SEQUENCE; MODAL LOGIC; NON-DETERMINISTIC PLANNING; PARTIALLY-OBSERVABLE PLANNING; PLANNING MODELS; PLANNING PROBLEM; POSSIBLE SOLUTIONS; REAL-LIFE PROBLEMS; STATE SPACE; TIME STEP; UNOBSERVABLE;

SPECTROSCOPY;

EID: 74449093361     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.11.001     Document Type: Article

References (62)

1. Bernstein D., Hansen E., and Zilberstein S. Bounded policy iteration for decentralized POMDPs. In: Kaelbling L.P., and Saffiottiiba A. (Eds). Proc. 19th Int. Joint Conf. on Artificial Intelligence. Edinburgh, Scotland (2005), Professional Book Center 1287-1292
2. Bertoli P., Cimatti A., Roveri M., and Traverso P. Strong planning under partial observability. Artificial Intelligence 170 4-5 (2006) 337-384
3. Bertsekas D. Dynamic Programming and Optimal Control (2 vols) (1995), Athena Scientific
4. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2002), Cambridge University Press
5. Bonet B. Bounded branching and modalities in non-deterministic planning. In: Long D., Smith S., Borrajo D., and McCluskey L. (Eds). Proc. 16th Int. Conf. on Automated Planning and Scheduling. Ambleside, UK (2006), AAAI Press 42-51
6. Bonet B., and Geffner H. Planning with incomplete information as heuristic search in belief space. In: Chien S., Kambhampati S., and Knoblock C. (Eds). Proc. 6th Int. Conf. on Artificial Intelligence Planning and Scheduling. Breckenridge, CO (2000), AAAI Press 52-61
7. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1-2 (2001) 5-33
8. Bonet B., and Geffner H. Faster heuristic search algorithms for planning with uncertainty and full feedback. In: Gottlob G. (Ed). Proc. 18th Int. Joint Conf. on Artificial Intelligence. Acapulco, Mexico (2003), Morgan Kaufmann 1233-1238
9. Bonet B., and Geffner H. An algorithm better than AO*?. In: Veloso M., and Kambhampati S. (Eds). Proc. 20th National Conf. on Artificial Intelligence. Pittsburgh, PA (2005), AAAI Press/MIT Press 1343-1348
10. Bryce D., Kambhampati S., and Smith D.E. Planning graph heuristics for belief space search. J. Artificial Intelligence Res. 26 (2006) 35-99
11. Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69 (1994) 165-204
12. Cassandra A.R., Littman M., and Kaelbling L.P. Acting optimally in partially observable stochastic domains. In: Hayes-Roth B., and Korf R. (Eds). Proc. 12th National Conf. on Artificial Intelligence. Seattle, WA (1994), AAAI Press/MIT Press 1023-1028
13. Chandra A., Kozen D., and Stockmeyer L.J. Alternation. J. ACM 28 1 (1981) 114-133
14. Chvatal V. Mastermind. Combinatorica 3 3-4 (1983) 325-329
15. Cimatti A., Pistore M., Roveri M., and Traverso P. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147 (2003) 35-84
16. Cimatti A., Roveri M., and Bertoli P. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence 159 (2004) 127-206
17. Du D., and Ko K. Theory of Computational Complexity (2000), Wiley-Interscience, New York, NY
18. Erdös P., and Ranyi C. On two problems in information theory. Magyar Tud. Akad. Mat. Kut. Int. Közl. 8 (1963) 229-242
19. Fagin R., Halpern J., Moses Y., and Vardi M. Reasoning about Knowledge (1995), MIT Press
20. Fikes R., and Nilsson N. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 1 (1971) 27-120
21. De Giacomo G., Lespérance Y., Levesque H.J., and Sardiña S. On the semantics of deliberation in indigolog: From theory to implementation. Ann. Math. Artif. Intell. 41 1-2 (2004) 256-299
22. De Giacomo G., and Vardi M.Y. Automata-theoretic approach to planning for temporally extended goals. In: Biundo S., and Fox M. (Eds). Proc. 5th European Conf. on Planning. Durham, UK. Lecture Notes in Comput. Sci. vol. 1809 (1999), Springer 226-238
23. Goddard W. Static Mastermind. J. Combin. Math. Combin. Comput. 47 (2003) 225-236
24. Goldman R.P., and Boddy M.S. Expressive planning and explicit knowledge. In: Drabble B. (Ed). Proc. 3rd Int. Conf. on Artificial Intelligence Planning Systems. Edinburgh, Scotland (1996), AAAI Press 110-117
25. Hansen E. Solving POMDPs by searching in policy space. In: Cooper G., and Moral S. (Eds). Proc. 14th Conf. on Uncertainty in Artificial Intelligence. Madison, WI (1998), Morgan Kaufmann 211-219
26. Hansen E., and Zilberstein S. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129 (2001) 35-62
27. Haslum P., and Jonsson P. Some results on the complexity of planning with incomplete information. In: Biundo S., and Fox M. (Eds). Proc. 5th European Conf. on Planning. Durham, UK. Lecture Notes in Comput. Sci. vol. 1809 (1999), Springer 308-318
28. Helmert M. The fast downward planning system. J. Artificial Intelligence Res. 26 (2006) 191-246
29. Hoffmann J., and Brafman R. Contingent planning via heuristic forward search with implicit belief states. In: Biundo S., Myers K., and Rajan K. (Eds). Proc. 15th Int. Conf. on Automated Planning and Scheduling. Monterey, CA (2005), Morgan Kaufmann 71-80
30. Hoffmann J., and Brafman R. Conformant planning via heuristic forward search: A new approach. Artificial Intelligence 170 (2006) 507-541
31. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. J. Artificial Intelligence Res. 14 (2001) 253-302
32. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
33. Huang J. Combining knowledge compilation and search for conformant probabilistic planning. In: Long D., Smith S., Borrajo D., and McCluskey L. (Eds). Proc. 16th Int. Conf. on Automated Planning and Scheduling. Lake District, UK (2006), AAAI Press 253-262
34. Hughes G.E., and Cresswell M.J. A New Introduction to Modal Logic (1996), Routledge
35. Kaelbling L.P., Littman M., and Cassandra A.R. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101 (1999) 99-134
36. Kautz H., and Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. In: Clanceyuiba W., and Weld D. (Eds). Proc. 13th National Conf. on Artificial Intelligence. Portland, OR (1996), AAAI Press/MIT Press 1194-1201
37. Knuth D.E. The computer as a Master Mind. J. Recreational Mathematics 9 (1976-1977) 1-6
38. Koyama M., and Lai T. An optimal Mastermind strategy. J. Recreational Mathematics 25 (1993) 251-256
39. Levesque H.J. What is planning in the presence of sensing. In: Clancey W., and Weld D. (Eds). Proc. 13th National Conf. on Artificial Intelligence. Portland, OR (1996), AAAI Press/MIT Press 1139-1146
40. Levesque H.J. Planning with loops. In: Kaelbling L.P., and Saffiotti A. (Eds). Proc. 19th Int. Joint Conf. on Artificial Intelligence. Edinburgh, Scotland (2005), Professional Book Center 509-515
41. Littman M. Probabilistic propositional planning: Representations and complexity. In: Kuipers B., and Webber B. (Eds). Proc. 14th National Conf. on Artificial Intelligence. Providence, RI (1997), AAAI Press/MIT Press 748-754
42. Lusena C., Li T., Sittinger S., Wells C., and Goldsmith J. My brain is full: When more memory helps. In: Laskey K., and Prade H. (Eds). Proc. 15th Conf. on Uncertainty in Artificial Intelligence. Stockholm, Sweden (1999), Morgan Kaufmann 374-381
43. Majercik S., and Littman M. Maxplan: A new approach to probabilistic planning. In: Simmons R., Veloso M., and Smith S. (Eds). Proc. 4th Int. Conf. on Artificial Intelligence Planning Systems. Pittsburgh, PA (1998), AAAI Press 86-93
44. Meuleau N., Peshkin L., Kim K., and Kaelbling L.P. Learning finite-state controllers for partially observable environments. In: Laskey K., and Prade H. (Eds). Proc. 15th Conf. on Uncertainty in Artificial Intelligence. Stockholm, Sweden (1999), Morgan Kaufmann 427-436
45. Meuleau N., and Smith D. Optimal limited contingency planning. In: Meek C., and Kjaerulff U. (Eds). Proc. 19th Conf. on Uncertainty in Artificial Intelligence. Acapulco, Mexico (2003), Morgan Kaufmann 417-426
46. A.R. Meyer, L.J. Stockmeyer, The equivalence problem of regular expressions with squaring requires exponential space, in: Proc. 13th Annual IEEE Symposium on Switching and Automata Theory, 1973, pp. 125-129
47. Palacios H., Bonet B., Darwiche A., and Geffner H. Pruning conformant plans by counting models on compiled d-DNNF representations. In: Biundo S., Myers K., and Rajan K. (Eds). Proc. 15th Int. Conf. on Automated Planning and Scheduling. Monterey, CA (2005), AAAI Press 141-150
48. Palacios H., and Geffner H. From conformant into classical planning: Efficient translations that may be efficient too. In: Boddy M., Fox M., and Thiébaux S. (Eds). Proc. 17th Int. Conf. on Automated Planning and Scheduling. Providence, RI (2007), AAAI Press
49. Papadimitriou C.H. Computational Complexity (1993), Addison-Wesley
50. Pednault E. ADL: Exploring the middle ground between strips and the situation calculus. In: Brachman R., Levesque H.J., and Reiter R. (Eds). Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning. Toronto, Canada (1989), Morgan Kaufmann 324-332
51. Poupart P., and Boutilier C. Bounded finite state controllers. Advances in Neural Information Processing Systems 16 [NIPS 2003]. Vancouver, Canada (2003), MIT Press
52. Puterman M. Markov Decision Processes - Discrete Stochastic Dynamic Programming (1994), John Wiley and Sons, Inc.
53. Rintanen J. Complexity of planning with partial observability. In: Zilberstein S., Koenig S., and Koehler J. (Eds). Proc. 14th Int. Conf. on Automated Planning and Scheduling. Whistler, Canada (2004), AAAI Press 345-354
54. Rintanen J. Distance estimates for planning in the discrete belief space. In: McGuinness D.L., and Ferguson G. (Eds). Proc. 19th National Conf. on Artificial Intelligence. San Jose, CA (2004), AAAI Press/MIT Press 525-530
55. Sardiña S., De Giacomo G., Lespérance Y., and Levesque H.J. On the limits of planning over belief states under strict uncertainty. In: Doherty P., Mylopoulos J., and Welty C.A. (Eds). Proc. 10th Int. Conf. on Principles of Knowledge Representation and Reasoning. Lake District, UK (2006), AAAI Press 463-471
56. Sipser M. Introduction to Theory of Computation. second ed. (2005), Thomson Course Technology, Boston, MA
57. Smith D., and Weld D. Conformant graphplan. In: Mostow J., and Rich C. (Eds). Proc. 15th National Conf. on Artificial Intelligence. Madison, WI (1998), AAAI Press/MIT Press 889-896
58. Sondik E. The optimal control of partially observable Markov decision processes over the infinite horizon: Discounted costs. Oper. Res. 26 2 (1978)
59. Stockmeyer L.J. The polynomial time hierarchy. Theoret. Comput. Sci. 3 (1977) 1-22
60. Time, And now, Master Mind, Time 106 (22) (December 1, 1975) 73
61. Turner H. Polynomial-length planning spans the polynomial hierarchy. In: Flesca S., and Giovambattista I. (Eds). Proc. 8th European Conf. on Logics in Artificial Intelligence. Cosenza, Italy. Lecture Notes in Comput. Sci. vol. 2424 (2002), Springer 111-124
62. Yao A.C.-C. Separating the polynomial-time hierarchy by oracles. Proc. 26th Annual Symp. on Foundations of Computer Science. Portland, OR (1985), IEEE Press 1-10