{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:32:01Z","timestamp":1743049921520,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983902"},{"type":"electronic","value":"9789819983919"}],"license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"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-981-99-8391-9_23","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T16:02:21Z","timestamp":1701014541000},"page":"286-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leaving the\u00a0NavMesh: An Ablative Analysis of\u00a0Deep Reinforcement Learning for\u00a0Complex Navigation in\u00a03D Virtual Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8739-6121","authenticated-orcid":false,"given":"Dale","family":"Grant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-1605","authenticated-orcid":false,"given":"Jaime","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5310-0943","authenticated-orcid":false,"given":"William","family":"Raffe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alonso, E., Peter, M., Goumard, D., Romoff, J.: Deep Reinforcement Learning for Navigation in AAA Video Games, November 2020. arXiv:2011.04764 [cs]","key":"23_CR1","DOI":"10.24963\/ijcai.2021\/294"},{"unstructured":"Beeching, E., et al.: Graph augmented Deep Reinforcement Learning in the GameRLand3D environment, December 2021. arXiv:2112.11731 [cs]","key":"23_CR2"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.3912","volume":"47","author":"MG Bellemare","year":"2013","unstructured":"Bellemare, M.G., Naddaf, Y., Veness, J., Bowling, M.: The arcade learning environment: an evaluation platform for general agents. J. Artif. Intell. Res. 47, 253\u2013279 (2013). https:\/\/doi.org\/10.1613\/jair.3912","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Bergdahl, J., Gordillo, C., Tollmar, K., Gissl\u00e9n, L.: Augmenting Automated Game Testing with Deep Reinforcement Learning, March 2021. arXiv:2103.15819 [cs]","key":"23_CR4","DOI":"10.1109\/CoG47356.2020.9231552"},{"unstructured":"Budde, S.: Automatic Generation of Jump Links in Arbitrary 3d Environments. Master\u2019s thesis, Humboldt-Universit\u00e4t zu Berlin (2013)","key":"23_CR5"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/7529.8927","volume":"5","author":"RL Cook","year":"1986","unstructured":"Cook, R.L.: Stochastic sampling in computer graphics. ACM Trans. Graph. 5(1), 51\u201372 (1986). https:\/\/doi.org\/10.1145\/7529.8927","journal-title":"ACM Trans. Graph."},{"unstructured":"Daley, B., Amato, C.: Reconciling $$\\lambda $$-returns with experience replay. In: Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)","key":"23_CR7"},{"unstructured":"Devlin, S., et al.: Navigation Turing Test (NTT): Learning to Evaluate Human-Like Navigation, July 2021. arXiv:2105.09637 [cs]","key":"23_CR8"},{"unstructured":"Fedus, W., et al.: Revisiting Fundamentals of Experience Replay, July 2020. arXiv:2007.06700 [cs]","key":"23_CR9"},{"doi-asserted-by":"crossref","unstructured":"Gissl\u00e9n, L., Eakins, A., Gordillo, C., Bergdahl, J., Tollmar, K.: Adversarial Reinforcement Learning for Procedural Content Generation, June 2021. arXiv:2103.04847 [cs]","key":"23_CR10","DOI":"10.1109\/CoG52621.2021.9619053"},{"doi-asserted-by":"crossref","unstructured":"Gordillo, C., Bergdahl, J., Tollmar, K., Gissl\u00e9n, L.: Improving Playtesting Coverage via Curiosity Driven Reinforcement Learning Agents, June 2021. arXiv:2103.13798 [cs]","key":"23_CR11","DOI":"10.1109\/CoG52621.2021.9619048"},{"unstructured":"Haarnoja, T., Zhou, A., Abbeel, P., Levine, S.: Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, August 2018. arXiv:1801.01290 [cs, stat]","key":"23_CR12"},{"unstructured":"Haarnoja, T., et al.: Soft Actor-Critic Algorithms and Applications, January 2019. arXiv:1812.05905 [cs, stat]","key":"23_CR13"},{"issue":"2","key":"23_CR14","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). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"unstructured":"Ioffe, S., Szegedy, C.: Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift, March 2015. arXiv:1502.03167 [cs]","key":"23_CR15"},{"unstructured":"Juliani, A., et al.: Unity: A General Platform for Intelligent Agents, May 2020. arXiv:1809.02627 [cs, stat]","key":"23_CR16"},{"doi-asserted-by":"crossref","unstructured":"Kempka, M., Wydmuch, M., Runc, G., Toczek, J., Ja\u015bkowski, W.: ViZDoom: A Doom-based AI Research Platform for Visual Reinforcement Learning, September 2016. arXiv:1605.02097 [cs]","key":"23_CR17","DOI":"10.1109\/CIG.2016.7860433"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y Lecun","year":"1998","unstructured":"Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86, 2278\u20132324 (1998). https:\/\/doi.org\/10.1109\/5.726791","journal-title":"Proc. IEEE"},{"unstructured":"Mirowski, P., et al.: Learning to Navigate in Complex Environments, January 2017. arXiv:1611.03673 [cs]","key":"23_CR19"},{"issue":"7540","key":"23_CR20","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015). https:\/\/doi.org\/10.1038\/nature14236","journal-title":"Nature"},{"unstructured":"Roy, J., Girgis, R., Romoff, J., Bacon, P.L., Pal, C.: Direct Behavior Specification via Constrained Reinforcement Learning, January 2022. arXiv:2112.12228 [cs]","key":"23_CR21"},{"unstructured":"Schaul, T., Quan, J., Antonoglou, I., Silver, D.: Prioritized Experience Replay, February 2016. arXiv:1511.05952","key":"23_CR22"},{"unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal Policy Optimization Algorithms, August 2017. arXiv:1707.06347 [cs]","key":"23_CR23"},{"doi-asserted-by":"publisher","unstructured":"Sestini, A., Gissl\u00e9n, L., Bergdahl, J., Tollmar, K., Bagdanov, A.D.: CCPT: Automatic Gameplay Testing and Validation with Curiosity-Conditioned Proximal Trajectories, February 2022. arXiv:2202.10057 [cs]. https:\/\/doi.org\/10.48550\/arXiv.2202.10057","key":"23_CR24","DOI":"10.48550\/arXiv.2202.10057"},{"doi-asserted-by":"crossref","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)","key":"23_CR25","DOI":"10.1109\/TNN.1998.712192"},{"doi-asserted-by":"publisher","unstructured":"van Hasselt, H., Doron, Y., Strub, F., Hessel, M., Sonnerat, N., Modayil, J.: Deep Reinforcement Learning and the Deadly Triad, December 2018. arXiv:1812.02648 [cs]. https:\/\/doi.org\/10.48550\/arXiv.1812.02648","key":"23_CR26","DOI":"10.48550\/arXiv.1812.02648"},{"doi-asserted-by":"publisher","unstructured":"Zhang, S., Sutton, R.S.: A Deeper Look at Experience Replay, April 2018. arXiv:1712.01275 [cs]. https:\/\/doi.org\/10.48550\/arXiv.1712.01275","key":"23_CR27","DOI":"10.48550\/arXiv.1712.01275"}],"container-title":["Lecture Notes in Computer Science","AI 2023: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8391-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:46:32Z","timestamp":1710355592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8391-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"ISBN":["9789819983902","9789819983919"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8391-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2023.org\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"213","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":"23","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":"59","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":"11% - 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)"}}]}}