{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:59:35Z","timestamp":1774058375292,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030986810","type":"print"},{"value":"9783030986827","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-3-030-98682-7_4","type":"book-chapter","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T11:04:41Z","timestamp":1647860681000},"page":"40-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inter-task Similarity Measure for\u00a0Heterogeneous Tasks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4994-9052","authenticated-orcid":false,"given":"Sergio A.","family":"Serrano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8914-1904","authenticated-orcid":false,"given":"Jose","family":"Martinez-Carranza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3685-5567","authenticated-orcid":false,"given":"L. Enrique","family":"Sucar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,22]]},"reference":[{"key":"4_CR1","unstructured":"Ammar, H.B., et al.: An automated measure of MDP similarity for transfer in reinforcement learning. In: Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence (2014)"},{"key":"4_CR2","unstructured":"Bellman, R.E.: Dynamic programming (1957)"},{"key":"4_CR3","unstructured":"Brockman, G., et al.: Openai gym (2016)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Carroll, J.L., Seppi, K.: Task similarity measures for transfer in reinforcement learning task libraries. In: Proceedings of the 2005 IEEE International Joint Conference on Neural Networks, vol. 2, pp. 803\u2013808. IEEE (2005)","DOI":"10.1109\/IJCNN.2005.1555955"},{"key":"4_CR5","unstructured":"Ferns, N., Panangaden, P., Precup, D.: Metrics for finite Markov decision processes. In: UAI, vol. 4, pp. 162\u2013169 (2004)"},{"key":"4_CR6","unstructured":"Ferns, N., Panangaden, P., Precup, D.: Metrics for Markov decision processes with infinite state spaces. arXiv preprint arXiv:1207.1386 (2012)"},{"key":"4_CR7","first-page":"69","volume":"1","author":"J Henrikson","year":"1999","unstructured":"Henrikson, J.: Completeness and total boundedness of the Hausdorff metric. MIT Undergraduate J. Math. 1, 69\u201380 (1999)","journal-title":"MIT Undergraduate J. Math."},{"issue":"11","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1177\/0278364913495721","volume":"32","author":"J Kober","year":"2013","unstructured":"Kober, J., Bagnell, J.A., Peters, J.: Reinforcement learning in robotics: a survey. Int. J. Robot. Res. 32(11), 1238\u20131274 (2013)","journal-title":"Int. J. Robot. Res."},{"key":"4_CR9","unstructured":"Lin, K., Wang, S., Zhou, J.: Collaborative deep reinforcement learning. arXiv preprint arXiv:1702.05796 (2017)"},{"key":"4_CR10","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (2014)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Song, J., Gao, Y., Wang, H., An, B.: Measuring the distance between finite Markov decision processes. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 468\u2013476 (2016)","DOI":"10.65109\/HCGU8533"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Sorg, J., Singh, S.: Transfer via soft homomorphisms. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, vol. 2, pp. 741\u2013748 (2009)","DOI":"10.65109\/PDJC7617"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Taylor, M.E., Kuhlmann, G., Stone, P.: Autonomous transfer for reinforcement learning. In: AAMAS (1), pp. 283\u2013290. Citeseer (2008)","DOI":"10.65109\/IRYX6371"},{"key":"4_CR14","unstructured":"Taylor, M.E., Stone, P.: Representation transfer for reinforcement learning. In: AAAI Fall Symposium: Computational Approaches to Representation Change during Learning and Development, pp. 78\u201385 (2007)"},{"issue":"Jul","key":"4_CR15","first-page":"1633","volume":"10","author":"ME Taylor","year":"2009","unstructured":"Taylor, M.E., Stone, P.: Transfer learning for reinforcement learning domains: a survey. J. Mach. Learn. Res. 10(Jul), 1633\u20131685 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR16","unstructured":"Wan, M., Gangwani, T., Peng, J.: Mutual information based knowledge transfer under state-action dimension mismatch. arXiv preprint arXiv:2006.07041 (2020)"},{"issue":"3\u20134","key":"4_CR17","first-page":"279","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","RoboCup 2021: Robot World Cup XXIV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98682-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:02:32Z","timestamp":1774054952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98682-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030986810","9783030986827"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98682-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RoboCup","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Robot World Cup","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"robocup2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.robocup.org\/","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":"42","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":"19","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":"45% - 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":"3","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":"The volume also contains 10 reviewed champion papers","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}