{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:43:58Z","timestamp":1775177038682,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Autonomous Navigation for Indoor Intelligent Service Robots","award":["JYTMS20231500"],"award-info":[{"award-number":["JYTMS20231500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3602286","type":"journal-article","created":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T20:47:29Z","timestamp":1756154849000},"page":"149921-149932","source":"Crossref","is-referenced-by-count":1,"title":["NM-TD3: A Hybrid Noise-Driven TD3 Algorithm With Long-Term Reward Propagation for Mobile Robot Path Planning"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2014-8915","authenticated-orcid":false,"given":"Xuqi","family":"Yang","sequence":"first","affiliation":[{"name":"College of Information Engineering, Shenyang University of Chemical Technology, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2355-4069","authenticated-orcid":false,"given":"Qinghui","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shenyang University of Chemical Technology, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinfeng","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shenyang University of Chemical Technology, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiongwen","family":"Jiang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shenyang University of Chemical Technology, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120254"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128423"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/electronics13142865"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.126123"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/8881684"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/s24134041"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3355952"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jobe.2025.112626"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.109866"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/app142311195"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref12","first-page":"1861","article-title":"Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Haarnoja"},{"key":"ref13","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv:1707.06347"},{"key":"ref14","article-title":"Continuous control with deep reinforcement learning","author":"Lillicrap","year":"2015","journal-title":"arXiv:1509.02971"},{"key":"ref15","first-page":"1587","article-title":"Addressing function approximation error in actor-critic methods","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Fujimoto"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111400"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3311519"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2024.3521508"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2024.3509521"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128820"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110601"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/app14177555"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2023.3348827"},{"key":"ref24","article-title":"Path planning algorithm for construction robots based on gradient fusion of lstm and double-delay deep deterministic policy","author":"Chen","year":"2024","journal-title":"SSRN Electron. J."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2024.3377876"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3236361"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.102"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2024.e32167"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.23919\/ICCAS55662.2022.10003950"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11135450.pdf?arnumber=11135450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:31:57Z","timestamp":1756755117000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11135450\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3602286","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}