{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T20:38:51Z","timestamp":1717447131323},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10458-014-9248-2","type":"journal-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T05:45:51Z","timestamp":1391751951000},"page":"40-72","source":"Crossref","is-referenced-by-count":5,"title":["The complexity of multi-agent plan recognition"],"prefix":"10.1007","volume":"29","author":[{"given":"Bikramjit","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Lyle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Landon","family":"Kraemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"issue":"1\u20132","key":"9248_CR1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.artint.2004.06.001","volume":"159","author":"AM Abdelbar","year":"2004","unstructured":"Abdelbar, A. M. (2004). Approximating cost-based abduction is NP-hard. Artificial Intelligence, 159(1\u20132), 231\u2013239.","journal-title":"Artificial Intelligence"},{"key":"9248_CR2","unstructured":"Avrahami-Zilberbrand, D., & Kaminka, G. A. (2007). Towards dynamic tracking of multi-agent teams: An initial report. In Proceedings of the AAAI Workshop on Plan, Activity and Intent Recognition (PAIR-07)."},{"key":"9248_CR3","unstructured":"Avrahami-Zilberbrand, D., & Kaminka, G. A. (2007). Incorporating observer biases in keyhole plan recognition (efficiently!). In Proceedings of AAAI-07."},{"key":"9248_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee, B., Kraemer, L., & Lyle, J. (2010). Multi-agent plan recognition: Formalization and algorithms. Proceedings of AAAI-10, Atlanta, GA (pp. 1059\u20131064).","DOI":"10.1609\/aaai.v24i1.7746"},{"key":"9248_CR5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1214\/aos\/1176348521","volume":"20","author":"D Barry","year":"1992","unstructured":"Barry, D., & Hartigan, J. A. (1992). Product partition models for change point problems. The Annals of Statistics, 20, 260\u2013279.","journal-title":"The Annals of Statistics"},{"key":"9248_CR6","doi-asserted-by":"crossref","unstructured":"Beetz, M., Gedikli, S., Kirchlechner, B., Maldonado, A. (2006). Camera-based observation of football games for analyzing multi-agent activities. In Proceedings of AAMAS.","DOI":"10.1145\/1160633.1160638"},{"key":"9248_CR7","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1287\/moor.27.4.819.297","volume":"27","author":"DS Bernstein","year":"2002","unstructured":"Bernstein, D. S., Givan, R., Immerman, N., & Zilberstein, S. (2002). The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27, 819\u2013840.","journal-title":"Mathematics of Operations Research"},{"key":"9248_CR8","volume-title":"Pattern recognition and machine learning (information science and statistics)","author":"CM Bishop","year":"2007","unstructured":"Bishop, C. M. (2007). Pattern recognition and machine learning (information science and statistics). Heidelberg: Springer."},{"issue":"1","key":"9248_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1613\/jair.740","volume":"14","author":"C Boutilier","year":"2001","unstructured":"Boutilier, C., & Brafman, R. I. (2001). Partial-order planning with concurrent interacting actions. JAIR, 14(1), 105\u2013136.","journal-title":"JAIR"},{"key":"9248_CR10","unstructured":"Brenner, M. (2003). A multiagent planning language. In Proceedings of the ICAPS-03 workshop on PDDL (pp. 33\u201338)."},{"key":"9248_CR11","unstructured":"Bui, H. (2003). A general model for online probabilistic plan recognition. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI (pp. 1309\u20131315)."},{"key":"9248_CR12","unstructured":"Castelfranchi, C., & Falcone, R. (1995). From single-agent to multi-agent: Challenges for plan recognition systems. In Proceedings of the IJCAI-95 Workshop on The Next Generation of Plan Recognition Systems (pp. 24\u201332)."},{"key":"9248_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0004-3702(93)90060-O","volume":"64","author":"E Charniak","year":"1993","unstructured":"Charniak, E., & Goldman, R. P. (1993). A Bayesian model of plan recognition. Artificial Intelligence, 64, 53\u201379.","journal-title":"Artificial Intelligence"},{"key":"9248_CR14","volume-title":"Strategies for natural language processing","author":"PR Cohen","year":"1981","unstructured":"Cohen, P. R., Perrault, C. R., & Allen, J. F. (1981). Beyond question answering. In W. Lehnert & M. Ringle (Eds.), Strategies for natural language processing. Hillsdale, NJ: Lawrence Earlbaum Assoc."},{"key":"9248_CR15","unstructured":"Devaney, M., & Ram, A. (1998). Needles in a haystack: Plan recongition in large spatial domains involving multiple agents. In Proceedings of AAAI conference."},{"key":"9248_CR16","unstructured":"Erol, K., Hendler, J., & Nau, D. S. (1994). HTN planning: Complexity and expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94) (pp. 1123\u20131128). Seattle, WA: AAAI Press."},{"key":"9248_CR17","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A guide to the theory of NP-completeness. San Francisco, CA: W.H. Freeman and Co."},{"key":"9248_CR18","unstructured":"Geib, C. (2004). Assessing the complexity of plan recognition. In Proceedings of AAAI-04."},{"key":"9248_CR19","unstructured":"Geib, C., & Goldman, R. (2003). Recognizing plan\/goal abandonment. In Proceedings of IJCAI-03."},{"issue":"11","key":"9248_CR20","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1016\/j.artint.2009.01.003","volume":"173","author":"CW Geib","year":"2009","unstructured":"Geib, C. W., & Goldman, R. P. (2009). A probabilistic plan recognition algorithm based on plan tree grammars. Artificial Intelligence, 173(11), 1101\u20131132.","journal-title":"Artificial Intelligence"},{"key":"9248_CR21","unstructured":"Geib, C. W., & Goldman, R. P. (2002). Requirements for plan recognition in network security systems. In Proceedings of International Symposium on Recent Advances in Intrusion Detection."},{"key":"9248_CR22","volume-title":"Automated planning: Theory and practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., & Traverso, P. (2004). Automated planning: Theory and practice. San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"9248_CR23","unstructured":"Goldman, R. P., Geib, C. W., & Miller, C. A. (1999). A new model of plan recognition. In Proceedings of the Conference on Uncertainty in Artificial Intelligence."},{"key":"9248_CR24","unstructured":"Goldsmith, J., & Mundhenk, M. (2007). Competition adds complexity. In Proceedings of the NIPS."},{"key":"9248_CR25","doi-asserted-by":"crossref","unstructured":"Hongeng, S., & Nevatia, R. (2001). Multi-agent event recognition. In Proceedings of the Eighth IEEE International Conference on Computer Vision (Vol. 2, pp. 84\u201391).","DOI":"10.1109\/ICCV.2001.937608"},{"issue":"5","key":"9248_CR26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(92)90216-I","volume":"43","author":"J Hsiao","year":"1992","unstructured":"Hsiao, J., Yuan, T., & Chang, R. S. (1992). An efficient algorithm for finding a maximum weight $$2$$ 2 -independent set on interval graphs. Information Processing Letters, 43(5), 229\u2013235.","journal-title":"Information Processing Letters"},{"key":"9248_CR27","unstructured":"Huber, M. J., & Durfee, E. H. (1992). Plan recognition for real-world autonomous robots: Work in progress. In Working Notes of AAAI Symposium: Applications of AI to Real-World Autonomous Robots."},{"key":"9248_CR28","doi-asserted-by":"crossref","unstructured":"Ieong, S., & Shoham, Y. (2005). Marginal contribution nets: A compact representation scheme for coalitional games. In Proceedings of the 6th ACM Conference on Electronic Commerce (pp. 193\u2013202).","DOI":"10.1145\/1064009.1064030"},{"key":"9248_CR29","unstructured":"Intille, S., & Bobick, A. (1999). A framework for recognizing multi-agent action from visual evidence. In Proceedings of AAAI."},{"key":"9248_CR30","unstructured":"Jensen, R. M., & Veloso, M. M. (2005). ASET: A multi-agent planning language with nondeterministic durative tasks for BDD-based fault tolerant planning. In Proceedings of the 2005 ICAPS Workshop on Multi-agent Planning and Scheduling (pp. 58\u201365)."},{"key":"9248_CR31","doi-asserted-by":"crossref","unstructured":"Kaminka, G. A., & Bowling, M. (2002). Towards robust teams with many agents. In Proceeding of AAMAS-02.","DOI":"10.1145\/544862.544916"},{"key":"9248_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1613\/jair.970","volume":"17","author":"GA Kaminka","year":"2002","unstructured":"Kaminka, G. A., Pynadath, D. V., & Tambe, M. (2002). Monitoring teams by overhearing: A multi-agent plan recognition approach. Journal of Artificial Intelligence Research, 17, 83\u2013135.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9248_CR33","unstructured":"Kautz, H. A., & Allen, J. F. (1986). Generalized plan recognition. In Proceedings of AAAI."},{"key":"9248_CR34","unstructured":"Kebert, A., Banerjee, B., George, G., Solano, J., & Solano, W. (2013). Detecting distributed SQL injection attacks in a Eucalyptus cloud environment. In Proceedings of the 12th International Conference on Security and Management (SAM-13), Las Vegas, NV, July. Las Vegas, NV: CSREA Press."},{"key":"9248_CR35","unstructured":"Lesh, N., & Etzioni, O. (1995). Insights from machine learning for plan recognition. In Proceedings of the Workshop on The Next Generation of Plan Recognition Systems: Challenges for and Insight from Related Areas of AI (pp. 78\u201383)."},{"issue":"1","key":"9248_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00108ED1V01Y200802AIM003","volume":"2","author":"K Leyton-Brown","year":"2008","unstructured":"Leyton-Brown, K., & Shoham, Y. (2008). Essentials of game theory: A concise multidisciplinary introduction. Synthesis Lectures on Artificial Intelligence and Machine Learning, 2(1), 1\u201388.","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"key":"9248_CR37","unstructured":"Norman, M. D. T. J., Vasconcelos, W. W., & Sycara, K. (2011). Agent-oriented incremental team and activity recognition. In Proceedings of IJCAI."},{"key":"9248_CR38","unstructured":"Pynadath, D. V., & Wellman, M. P. (2000). Probabilistic state-dependent grammars for plan recognition. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, UAI2000 (pp. 507\u2013514). San Francisco, CA: Morgan Kaufmann Publishers."},{"key":"9248_CR39","unstructured":"Ramirez, M., & Geffner, H. (2009). Plan recognition as planning. In Proceedings of IJCAI."},{"key":"9248_CR40","doi-asserted-by":"crossref","unstructured":"Ramirez, M., & Geffner, H. (2010). Probabilistic plan recognition using off-the-shelf classical planners. Proceedings of AAAI-10, Atlanta, GA (pp. 1121\u20131126).","DOI":"10.1609\/aaai.v24i1.7745"},{"key":"9248_CR41","volume-title":"The language complexity game","author":"ES Ristad","year":"1993","unstructured":"Ristad, E. S. (1993). The language complexity game. Cambridge, MA: MIT Press."},{"issue":"1","key":"9248_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-8640.1985.tb00054.x","volume":"1","author":"C Sidner","year":"1985","unstructured":"Sidner, C. (1985). Plan parsing for intended response recognition in discourse. Computational Intelligence, 1(1), 1\u201310.","journal-title":"Computational Intelligence"},{"key":"9248_CR43","unstructured":"Sukthankar, G., & Sycara, K. (2006). Simultaneous team assignment and behavior recognition from spatio-temporal agent traces. In Proceedings of AAAI conference."},{"key":"9248_CR44","unstructured":"Sukthankar, G., & Sycara, K. (2008). Hypothesis pruning and ranking for large plan recognition problems. In Proceedings of AAAI."},{"key":"9248_CR45","unstructured":"Sukthankar, G., & Sycara, K. (2008). Robust and efficient plan recognition for dynamic multi-agent teams (short paper). In Proceedings of 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008). International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"9248_CR46","unstructured":"Sukthankar, G., & Sycara, K. (2011). Activity recognition for dynamic multi-agent teams. ACM Transactions on Intelligent Systems and Technology, 3(1), 18:1\u201318:24."},{"key":"9248_CR47","unstructured":"Tambe, M. (1995). Recursive agent and agent-group tracking in a real-time, dynamic environment. In Proceedings of International Conference on Multiagent Systems (pp. 368\u2013375)."},{"key":"9248_CR48","unstructured":"Tambe, M. (1996). Tracking dynamic team activity. In Proceedings of AAAI."},{"key":"9248_CR49","unstructured":"Vilain, M. (1990). Getting serious about parsing plans: A grammatical analysis of plan recognition. In Proceedings of AAAI-90."},{"key":"9248_CR50","unstructured":"Zhuo, H. H., & Li, L. (2011). Multi-agent plan recognition with partial team traces and plan libraries. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11) (pp. 484\u2013489)."},{"key":"9248_CR51","unstructured":"Zhuo, H. H., Yang, Q., & Kambhampati, S. (2012). Action-model based multi-agent plan recognition. In Proceedings of NIPS."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9248-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-014-9248-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9248-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T09:41:19Z","timestamp":1688982079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-014-9248-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s10458-014-9248-2","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}