{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T14:55:42Z","timestamp":1788879342497,"version":"build-2803163510"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811991943","type":"print"},{"value":"9789811991950","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-9195-0_35","type":"book-chapter","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T12:03:08Z","timestamp":1671796988000},"page":"431-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Belief State Monte Carlo Planning for\u00a0Multi-agent Visibility-Based Pursuit-Evasion"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengming","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pinggang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaocheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,24]]},"reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10514-015-9491-7","volume":"40","author":"C Robin","year":"2016","unstructured":"Robin, C., Lacroix, S.: Multi-robot target detection and tracking: taxonomy and survey. Auton. Robots 40(4), 729\u2013760 (2016)","journal-title":"Auton. Robots"},{"issue":"8","key":"35_CR2","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1177\/0278364917711535","volume":"36","author":"NM Stiffler","year":"2017","unstructured":"Stiffler, N.M., O\u2019Kane, J.M.: Complete and optimal visibility-based pursuit-evasion. Int. J. Robot. Res. 36(8), 923\u2013946 (2017)","journal-title":"Int. J. Robot. Res."},{"key":"35_CR3","unstructured":"Raboin, E., Nau, D.S., Kuter, U., Gupta, S.K., Svec, P.: Strategy generation in multi-agent imperfect-information pursuit games. In: 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), pp. 947\u2013954. Toronto, Canada, May 2010"},{"key":"35_CR4","unstructured":"Lis\u00fd, V., Bosansk\u00fd, B., Pechoucek, M.: Anytime algorithms for multi-agent visibility-based pursuit-evasion games. In: International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, pp. 1301\u20131302. Valencia, Spain, June 2012"},{"key":"35_CR5","unstructured":"Li, A.Q., Fioratto, R., Amigoni, F., Isler, V.: A search-based approach to solve pursuit-evasion games with limited visibility in polygonal environments. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, pp. 1693\u20131701. Stockholm, Sweden, July 2018"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ejor.2019.02.017","volume":"277","author":"J Karwowski","year":"2019","unstructured":"Karwowski, J., Mandziuk, J.: A monte Carlo tree search approach to finding efficient patrolling schemes on graphs. Eur. J. Oper. Res. 277(1), 255\u2013268 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Churchill, D., Buro, M.: Portfolio greedy search and simulation for large-scale combat in starcraft. In: 2013 IEEE Conference on Computational Intelligence in Games (CIG), pp. 1\u20138. Niagara Falls, ON, Canada (2013)","DOI":"10.1109\/CIG.2013.6633643"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Browne, C., et al.: A survey of monte Carlo tree search methods. IEEE Trans. Comput. Intellig. AI Games. 4(1), 1\u201343 (2012)","DOI":"10.1109\/TCIAIG.2012.2186810"},{"issue":"7587","key":"35_CR9","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TG.2021.3065313","volume":"14","author":"Z Yang","year":"2022","unstructured":"Yang, Z., Onta\u00f1\u00f3n, S.: An experimental survey on methods for integrating scripts into adversarial search for RTS games. IEEE Trans. Games 14(2), 117\u2013125 (2022)","journal-title":"IEEE Trans. Games"},{"key":"35_CR11","unstructured":"Balla, R., Fern, A.: UCT for tactical assault planning in real-time strategy games. In: 21st International Joint Conference on Artificial Intelligence, pp. 40\u201345. Pasadena, CA, USA, July 2009"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"35_CR13","unstructured":"Swiechowski, M., Godlewski, K., Sawicki, B., Mandziuk, J.: Monte Carlo tree search: a review of recent modifications and applications. CoRR abs\/2103.04931 (2021). https:\/\/arxiv.org\/abs\/2103.04931"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Long, J.R., Sturtevant, N.R., Buro, M., Furtak, T.: Understanding the success of perfect information monte Carlo sampling in game tree search. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010. Atlanta, Georgia, USA, July 2010","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Bjarnason, R., Fern, A., Tadepalli, P.: Lower bounding Klondike solitaire with monte-Carlo planning. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling, Thessaloniki, Greece, September 2009","DOI":"10.1609\/icaps.v19i1.13363"},{"issue":"2","key":"35_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TCIAIG.2012.2200894","volume":"4","author":"PI Cowling","year":"2012","unstructured":"Cowling, P.I., Powley, E.J., Whitehouse, D.: Information set monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 4(2), 120\u2013143 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCIAIG.2017.2734067","volume":"10","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhu, T., Li, H., Hsueh, C., Wu, I.: Belief-state monte Carlo tree search for phantom go. IEEE Trans. Games 10(2), 139\u2013154 (2018)","journal-title":"IEEE Trans. Games"},{"key":"35_CR18","unstructured":"Silver, D., Veness, J.: Monte-Carlo planning in large POMDPs. In: 24th Annual Conference on Neural Information Processing Systems 2010, pp. 2164\u20132172. Vancouver, British Columbia, Canada, December 2010"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.5328","volume":"58","author":"N Ye","year":"2017","unstructured":"Ye, N., Somani, A., Hsu, D., Lee, W.S.: DESPOT: online POMDP planning with regularization. J. Artif. Intell. Res. 58, 231\u2013266 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"35_CR20","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-319-28872-7_35","volume-title":"Robotics Research","author":"H Kurniawati","year":"2016","unstructured":"Kurniawati, H., Yadav, V.: An online POMDP solver for uncertainty planning in dynamic environment. In: Inaba, M., Corke, P. (eds.) Robotics Research. STAR, vol. 114, pp. 611\u2013629. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28872-7_35"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","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.: The complexity of decentralized control of Markov decision processes. Math. Oper. Res. 27(4), 819\u2013840 (2002)","journal-title":"Math. Oper. Res."},{"issue":"11","key":"35_CR22","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.artint.2011.03.007","volume":"175","author":"S Gelly","year":"2011","unstructured":"Gelly, S., Silver, D.: Monte-Carlo tree search and rapid action value estimation in computer go. Artif. Intell. 175(11), 1856\u20131875 (2011)","journal-title":"Artif. Intell."}],"container-title":["Communications in Computer and Information Science","Methods and Applications for Modeling and Simulation of Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-9195-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T00:08:10Z","timestamp":1672013290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-9195-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811991943","9789811991950"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-9195-0_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AsiaSim","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Simulation Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiasim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cnsim.org.cn\/cass-sim\/cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CNSIM","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"218","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"97","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Covid pandemic AsiaSim 2022 has been postponed to January 2023.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}