{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:01:54Z","timestamp":1742958114917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031109850"},{"type":"electronic","value":"9783031109867"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10986-7_8","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T22:30:36Z","timestamp":1658183436000},"page":"94-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mario Fast Learner: Fast and\u00a0Efficient Solutions for\u00a0Super Mario Bros"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3051-5043","authenticated-orcid":false,"given":"Chen","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"8_CR1","unstructured":"Bros, S.M.: Nintendo entertainment system. Developed by Nintendo, Nintendo (1985)"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Pedersen, C., Togelius, J., Yannakakis, G.N.: Modeling player experience in Super Mario Bros. In: 2009 IEEE Symposium on Computational Intelligence and Games, pp. 132\u2013139 (2009). https:\/\/doi.org\/10.1109\/CIG.2009.5286482","DOI":"10.1109\/CIG.2009.5286482"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Togelius, J., Karakovskiy, S., Koutnik, J., Schmidhuber, J.: Super Mario evolution. In: 2009 IEEE Symposium on Computational Intelligence and Games, pp. 156\u2013161 (2009). https:\/\/doi.org\/10.1109\/CIG.2009.5286481","DOI":"10.1109\/CIG.2009.5286481"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Shaker, N., Nicolau, M., Yannakakis, G.N., Togelius, J., O\u2019neill, M.: Evolving levels for Super Mario Bros using grammatical evolution. In: 2012 IEEE Conference on Computational Intelligence and Games (CIG), pp. 304\u2013311. IEEE (2012)","DOI":"10.1109\/CIG.2012.6374170"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcom.2012.10.001","volume":"4","author":"J Ortega","year":"2013","unstructured":"Ortega, J., Shaker, N., Togelius, J., Yannakakis, G.N.: Imitating human playing styles in Super Mario Bros. Entertain. Comput. 4(2), 93\u2013104 (2013)","journal-title":"Entertain. Comput."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Viglietta, G., Williams, A.: Super Mario Bros. Is harder\/easier than we thought. In: Demaine, E.D., Grandoni, F. (eds.) 8th International Conference on Fun with Algorithms, FUN 2016. Leibniz International Proceedings in Informatics (LIPIcs), vol. 49, pp. 13:1\u201313:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2016.13. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5880","DOI":"10.4230\/LIPIcs.FUN.2016.13"},{"issue":"7587","key":"8_CR7","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":"7839","key":"8_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1038\/s41586-020-03051-4","volume":"588","author":"J Schrittwieser","year":"2020","unstructured":"Schrittwieser, J., et al.: Mastering Atari, Go, chess and shogi by planning with a learned model. nature 588(7839), 604\u2013609 (2020)","journal-title":"nature"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Johannink, T., et al.: Residual reinforcement learning for robot control. In: 2019 International Conference on Robotics and Automation (ICRA), pp. 6023\u20136029. IEEE (2019)","DOI":"10.1109\/ICRA.2019.8794127"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"102227","DOI":"10.1016\/j.rcim.2021.102227","volume":"73","author":"R Zhang","year":"2022","unstructured":"Zhang, R., Lv, Q., Li, J., Bao, J., Liu, T., Liu, S.: A reinforcement learning method for human-robot collaboration in assembly tasks. Robot. Comput. Integr. Manuf. 73, 102227 (2022)","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"106685","DOI":"10.1016\/j.knosys.2020.106685","volume":"214","author":"A Heuillet","year":"2021","unstructured":"Heuillet, A., Couthouis, F., D\u00edaz-Rodr\u00edguez, N.: Explainability in deep reinforcement learning. Knowl. Based Syst. 214, 106685 (2021)","journal-title":"Knowl. Based Syst."},{"key":"8_CR12","unstructured":"Yarats, D., Fergus, R., Lazaric, A., Pinto, L.: Reinforcement learning with prototypical representations. In: International Conference on Machine Learning, pp. 11920\u201311931. PMLR (2021)"},{"key":"8_CR13","unstructured":"Zhang, N., Song, Z.: Super reinforcement bros: playing Super Mario Bros with reinforcement learning (2020)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Shu, T., Liu, J., Yannakakis, G.N.: Experience-driven PCG via reinforcement learning: a Super Mario Bros study. In: 2021 IEEE Conference on Games (CoG), pp. 1\u20139. IEEE (2021)","DOI":"10.1109\/CoG52621.2021.9619124"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1007\/s10489-020-01849-3","volume":"51","author":"N Bougie","year":"2020","unstructured":"Bougie, N., Ichise, R.: Fast and slow curiosity for high-level exploration in reinforcement learning. Appl. Intell. 51(2), 1086\u20131107 (2020). https:\/\/doi.org\/10.1007\/s10489-020-01849-3","journal-title":"Appl. Intell."},{"key":"8_CR16","unstructured":"Brockman, G., et al.: OpenAI Gym (2016)"},{"key":"8_CR17","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"8_CR18","unstructured":"Kauten, C.: Super Mario Bros for OpenAI Gym. GitHub (2018). https:\/\/github.com\/Kautenja\/gym-super-mario-bros"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10986-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T22:34:08Z","timestamp":1658183648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10986-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031109850","9783031109867"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10986-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"6 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ksem22.smart-conf.net\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"498","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":"169","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":"34% - 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":"10","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)"}}]}}