Learning probabilistic hierarchical task networks as probabilistic context-free grammars to capture user preferences

ACM Transactions on Intelligent Systems and Technology

Volumn 5, Issue 2, 2014, Pages

  Li, Nan ^a   Cushing, William ^b   Kambhampati, Subbarao ^b   Yoon, Sungwook ^b  

^a Computer Science Department Carnegie Mellon University ^*  (United States)

^b Arizona State University   (United States)

Author keywords

AI Technology; Hierarchical task networks; Learning user preferences; Planning

Indexed keywords

BEHAVIORAL RESEARCH; PLANNING;

AI TECHNOLOGIES; EXPECTATION MAXIMIZATION; HIERARCHICAL TASK NETWORKS; LEARNING USER PREFERENCES; PRIMITIVE ACTIONS; PROBABILISTIC CONTEXT FREE GRAMMARS; PROBABILISTIC GRAMMARS; USER'S PREFERENCES;

ALGORITHMS;

EID: 84899719995     PISSN: 21576904     EISSN: 21576912     Source Type: Journal    
DOI: 10.1145/2589481     Document Type: Article

References (52)

1. D. W. Albrecht, I. Zukerman, and A. E. Nicholson. 1998. Bayesian models for keyhole plan recognition in an adventure game. User Model. User-Adapt. Interact. 8, 1-2, 5-47
2. J. A. Baier and S. A. McIlraith. 2008. Planning with preferences. AI Mag. 29, 4, 25-36
3. A. Barrett and D. S. Weld. 1994. Task-decomposition via plan parsing. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94). AAAI Press, 1117-1122
4. N. Blaylock and J. Allen. 2003. Corpus-based, statistical goal recognition. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI?03). Morgan Kaufmann Publishers Inc., San Francisco, CA, 1303-1308
5. Charniak, E. 2000. A maximum-entropy-inspired parser. In Proceedings of the 1st Conference of the North American Chapter of the Association for Computational Linguistics. Morgan Kaufmann Publishers Inc., San Francisco, CA, 132-139
6. E. Charniak and R. P. Goldman. 1993. A bayesian model of plan recognition. Artif. Intell. 64, 1, 53-79
7. M. Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th AnnualMeeting of the Association for Computational Linguistics and the 8th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, 16-23
8. D. J. Cook and L. B.Holder. 1994. Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 1, 231-255
9. K. Erol, J. A. Hendler, and D. S. Nau. 1996. Complexity results for HTN planning. Ann. Math. Artif. Intell. 18, 1, 69-93
10. R. Fikes and N. J. Nilsson. 1971. Strips: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 3/4, 189-208
11. Geib, C. W. 2009. Delaying commitment in plan recognition using combinatory categorial grammars. In Proceedings of the 21st International Jont Conference on Artifical Intelligence.Morgan Kaufmann Publishers Inc., San Francisco, CA, 1702-1707
12. C. W. Geib and M. Steedman. 2007. On natural language processing and plan recognition. In Proceedings of the 20th International Joint Conference on Artificial Intelligence. 1612-1617
13. A. E. Gerevini, P. Haslum, D. Long, A. Saetti, and Y. Dimopoulos. 2009. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intell. 173, 619-668
14. I. Guyon and A. Elisseeff. 2003. An introduction to variable and feature selection. J. Machine Learning Research 3, 1157-1182
15. M. Helmert, M. Do, and I. Refanidis. 2008. The deterministic track of the international planning competition. http://ipc.informatik.uni-freiburg.de/.
16. C. Hogg, H. Muñoz-Avila, and U. Kuter. 2008. HTN-MAKER: Learning HTNs with minimal additional knowledge engineering required. In Proceedings of the 23rd National Conference on Artificial Intelligence. AAAI Press, 950-956
17. O. Ilghami, D. S. Nau, H. Muñoz-Avila, and D. W. Aha. 2002. CaMeL: Learning method preconditions for HTN planning. In Proceedings of the 6th International Conference on AI Planning and Scheduling. AAAI Press, 131-141
18. H. Ishizaka. 1989. Learning simple deterministic languages. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory. Morgan Kaufmann Publishers Inc., San Francisco, CA, 162-174
19. S. Kambhampati, A. Mali, and B. Srivastava. 1998. Hybrid planning for partially hierarchical domains. In Proceedings of the 15th National Conference on Artificial Intelligence and the 10th Conference on Innovative Applications of Artificial Intelligence. AAAI Press, 882-888
20. T. E. Kammeyer and R. K. Belew. 1996. Stochastic context-free grammar induction with a genetic algorithm using local search. In Foundations of Genetic Algorithms IV. Morgan Kaufmann, 3-5
21. V. Kandylas, L. H. Ungar, and D. P. Foster. 2007. Winner-take-all EM clustering. In Proceedings of the North-East Student Colloguium on Artifical Intelligence (NESCAI
22. H. A. Kautz and J. F. Allen. 1986. Generalized Plan Recognition. Morgan Kaufmann Inc. San Mateo, CA, 32-37
23. M. Kearns, Y. Mansour, and A. Y. Ng. 1997. An information-Theoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 282-293
24. B. Keller and R. Lutz. 2005. Evolutionary induction of stochastic context free grammars. Pattern Recog. 38, 9, 1393-1406
25. D. Koller and N. Friedman. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press
26. P. Langley and D. Choi. 2006. A unified cognitive architecture for physical agents. In Proceedings of the 21st National Conference on Artificial Intelligence. AAAI Press
27. P. Langley and S. Stromsten. 2000. Learning context-free grammars with a simplicity bias. In Proceedings of the 11th European Conference on Machine Learning. Springer-Verlag, London, 220-228
28. K. Lari and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Comput. Speech Lang. 4, 35-56
29. N. Lesh and O. Etzioni. 1995. A sound and fast goal recognizer. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI?95). Vol. 2, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1704-1710
30. N. Li, W. Cushing, S. Kambhampati, and S. W. Yoon. 2009a. Learning user plan preferences obfuscated by feasibility constraints. In Proceedings of the 19th International Conference on Automated Planning and Scheduling
31. N. Li, S. Kambhampati, and S. Yoon. 2009b. Learning probabilistic hierarchical task networks to capture user preferences. In Proceedings of the 21th International Joint Conference on Artificial Intelligence
32. H. Liu and L. Yu. 2005. Toward integrating feature selection algorithms for classification and clustering. IEEE Trans. Knowl. Data Eng. 17, 4, 491-502
33. D. Nau, M. Ghallab, and P. Traverso. 2004. Automated Planning: Theory & Practice. Morgan Kaufmann, San Francisco, CA.
34. D. S. Nau, T.-C. Au, O. Ilghami, U. Kuter, J. W. Murdock, D. Wu, and F. Yaman. 2003. Shop2: An HTN planning system. J. Artif. Intell. Res. 20, 379-404
35. C. G. Nevill-Manning and I. H. Witten. 1997. Identifying hierarchical structure in sequences: A linear-time algorithm. J. Artif. Intell. Res. 7, 1, 67-82
36. T. A. Nguyen, M. B. Do, S. Kambhampati, and B. Srivastava. 2009. Planning with partial preference models. In Proceedings of the 21st International Joint Conference on Artificial Intelligence. C. Boutilier, Ed., 1772-1777
37. D. V. Pynadath and M. P. Wellman. 2000. Probabilistic state-dependent grammars for plan recognition. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers Inc., San Francisco, CA, 507-514
38. D.-Y. Ra and G. C. Stockman. 1999. A new one pass algorithm for estimating stochastic context-free grammars. Inform. Process. Lett. 72, 37-45
39. Y. Sakakibara. 1992. Efficient learning of context-free grammars from positive structural examples. Inform. Comput. 97, 23-60
40. Y. Sakakibara, M. Brown, R. Hughey, I. S. Mian, K. Sjölander, R. C. Underwood, and D. Haussler. 1994. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Res. 22, 23, 5112-5120
41. S. Sohrabi, J. Baier, and S. A. McIlraith. 2009. HTN planning with preferences. In Proceedings of the 21st International Joint Conference on Artificial Intelligence. 1790-1797
42. B. Srivastava, T. A.Nguyen, A. Gerevini, S.Kambhampati, M. B. Do, and I. Serina. 2007. Domain independent approaches for finding diverse plans. In Proceedings of the 20th International Joint Conference on Artificial Intelligence. 2016-2022
43. A. Stolcke. 1994. Bayesian learning of probabilistic language models. Ph.D. thesis, University of California, Berkeley, CA.
44. Takada, Y. 1988. Grammatical inference for even linear languages based on control sets. Inform. Process. Lett. 28, 4, 193-199
45. L. Terveen and W. Hill. 2001. Beyond recommender systems: Helping people help each other. In Human- Computer Interaction in the New Millennium. Addison-Wesley, 487-509
46. O. Unold and M.Jaworski. 2010. Learning context-free grammar using improved tabular representation. Appl. Soft Comput. 10, 1, 44-52
47. K. Vanlehn andW. Ball. 1987. A version space approach to learn. context-free grammars. Machine Learn. 2, 1, 39-74
48. Wolff, J. G. 1982. Language acquisition, data compression and generalization. Lang. Commun. 2, 57-89
49. Q. Yang, R. Pan, and S. J. Pan. 2007. Learning recursive HTN-method structures for planning. In Proceedings of the ICAPS Workshop on AI Planning and Learning
50. Yang, Q.,Wu, K., and Jiang, Y. 2005. Learning action models from plan examples with incomplete knowledge. In Proceedings of the 15th International Conference on Automated Planning and Scheduling. AAAI Press, 241-250
51. J. Yin, X. Chai, and Q. Yang. 2004. High-level goal recognition in a wireless lan. In Proceedings of the 19th National Conference on Artifical Intelligence (AAAI?04). AAAI Press, 578-583
52. T. Zimmerman and S. Kambhampati. 2003. Learning-assisted automated planning: Looking back, taking stock, going forward. AI Mag. 24, 2, 73-96