{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:34:29Z","timestamp":1743032069962,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031578076"},{"type":"electronic","value":"9783031578083"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-57808-3_19","type":"book-chapter","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T15:02:05Z","timestamp":1712329325000},"page":"260-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rolling Horizon Co-evolution for\u00a0Snake AI Competition"],"prefix":"10.1007","author":[{"given":"Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7715-4639","authenticated-orcid":false,"given":"Qingquan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"key":"19_CR1","unstructured":"Brown, J.A., de Araujo, L.J.P., Grichshenko, A.: Snakes AI competition 2020 and 2021 report (2021)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested monte-carlo search. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Gallotta, R., Arulkumaran, K., Soros, L.B.: Preference-learning emitters for mixed-initiative quality-diversity algorithms. IEEE Trans. Games 1\u201314 (2023)","DOI":"10.1109\/TG.2023.3264457"},{"key":"19_CR5","unstructured":"Grooten, B.: Technical report - AI snakes competition (2020). https:\/\/serpentine.ai\/wp-content\/uploads\/2020\/10\/Serpentine-AISnakes-paper.pdf. Accessed 08 Aug 2021"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"19_CR7","unstructured":"Hu, C., Zhao, Y., Wang, Z., Du, H., Liu, J.: Game-based platforms for artificial intelligence research. arXiv preprint arXiv:2304.13269 (2023)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"100244","DOI":"10.1016\/j.rico.2023.100244","volume":"12","author":"T Kobayashi","year":"2023","unstructured":"Kobayashi, T.: Reward bonuses with gain scheduling inspired by iterative deepening search. Results Control Optim. 12, 100244 (2023)","journal-title":"Results Control Optim."},{"key":"19_CR9","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"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Kowalski, J., Miernik, R.: Summarizing strategy card game AI competition. arXiv preprint arXiv:2305.11814 (2023)","DOI":"10.1109\/CoG57401.2023.10333181"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Liu, J., P\u00e9rez-Li\u00e9bana, D., Lucas, S.M.: Rolling horizon coevolutionary planning for two-player video games. In: 2016 8th Computer Science and Electronic Engineering (CEEC), pp. 174\u2013179. IEEE (2016)","DOI":"10.1109\/CEEC.2016.7835909"},{"key":"19_CR13","unstructured":"Marsland, T.A.: Computer chess methods (1990). https:\/\/api.semanticscholar.org\/CorpusID:61489392"},{"key":"19_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888923000012","volume":"38","author":"A Shashkov","year":"2023","unstructured":"Shashkov, A., Hemberg, E., Tulla, M., O\u2019Reilly, U.M.: Adversarial agent-learning for cybersecurity: a comparison of algorithms. Knowl. Eng. Rev. 38, e3 (2023)","journal-title":"Knowl. Eng. Rev."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1007\/s10462-022-10228-y","volume":"56","author":"M \u015awiechowski","year":"2023","unstructured":"\u015awiechowski, M., Godlewski, K., Sawicki, B., Ma\u0144dziuk, J.: Monte carlo tree search: a review of recent modifications and applications. Artif. Intell. Rev. 56(3), 2497\u20132562 (2023)","journal-title":"Artif. Intell. Rev."},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"3692","DOI":"10.1109\/TIV.2023.3274536","volume":"8","author":"S Teng","year":"2023","unstructured":"Teng, S., et al.: Motion planning for autonomous driving: the state of the art and future perspectives. IEEE Trans. Intell. Veh. 8(6), 3692\u20133711 (2023)","journal-title":"IEEE Trans. Intell. Veh."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, K., Bai, J., Liu, J.: Generating game levels of diverse behaviour engagement. In: 2022 IEEE Conference on Games (CoG), pp. 167\u2013174 (2022)","DOI":"10.1109\/CoG51982.2022.9893697"}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligent Information Processing XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57808-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T15:04:54Z","timestamp":1712329494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57808-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031578076","9783031578083"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57808-3_19","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mi.hitsz.edu.cn\/iip2024.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair online submission","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"49","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":"5","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":"84% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7 Abstracts include 4 Keynotes speakers and 3 Invited Speakers","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)"}}]}}