{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:11:01Z","timestamp":1772043061835,"version":"3.50.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000046","name":"National Research Council Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000046","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.engappai.2025.112795","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:19:48Z","timestamp":1761743988000},"page":"112795","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"P2","title":["Investigation of stochastic deep learning path planning methods for mobile robots"],"prefix":"10.1016","volume":"163","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0614-836X","authenticated-orcid":false,"given":"Spencer","family":"Ploeger","sequence":"first","affiliation":[]},{"given":"Aidan","family":"Holvik","sequence":"additional","affiliation":[]},{"given":"Rachael","family":"Mohl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6576-0647","authenticated-orcid":false,"given":"Mohammad","family":"Biglarbegian","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Myers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.engappai.2025.112795_b1","series-title":"Wasserstein GAN","author":"Arjovsky","year":"2017"},{"issue":"2","key":"10.1016\/j.engappai.2025.112795_b2","doi-asserted-by":"crossref","DOI":"10.3390\/drones7020122","article-title":"Quadrotor path planning and polynomial trajectory generation using quadratic programming for indoor environments","volume":"7","author":"Arshad","year":"2023","journal-title":"Drones"},{"key":"10.1016\/j.engappai.2025.112795_b3","series-title":"A systematic review on overfitting control in shallow and deep neural networks","first-page":"6391","author":"Bejani","year":"2021"},{"key":"10.1016\/j.engappai.2025.112795_b4","series-title":"30th International Conference on Machine Learning","first-page":"552","article-title":"Better mixing via deep representations","author":"Bengio","year":"2013"},{"key":"10.1016\/j.engappai.2025.112795_b5","series-title":"SIMULTECH 2019 - Proceedings of the 9th International Conference on Simulation and Modeling Methodologies, Technologies and Applications","first-page":"398","article-title":"A comparison of A* and RRT* algorithms with dynamic and real time constraint scenarios for mobile robots","author":"Braun","year":"2019"},{"issue":"1","key":"10.1016\/j.engappai.2025.112795_b6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/MRA.2011.2181749","article-title":"Moveit! [ROS topics]","volume":"19","author":"Chitta","year":"2012","journal-title":"IEEE Robot. Autom. Mag."},{"key":"10.1016\/j.engappai.2025.112795_b7","series-title":"Modular Mapping and Learning for Robotics","author":"Cramariuc","year":"2023"},{"key":"10.1016\/j.engappai.2025.112795_b8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"271","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/j.engappai.2025.112795_b9","first-page":"29","article-title":"Multi-resolution A*","volume":"11","author":"Du","year":"2021","journal-title":"Proc. Int. Symp. Comb. Search"},{"key":"10.1016\/j.engappai.2025.112795_b10","series-title":"Processing Sequences Using RNNs and CNNs","first-page":"497","author":"G\u00e9ron","year":"2020"},{"key":"10.1016\/j.engappai.2025.112795_b11","series-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"issue":"11","key":"10.1016\/j.engappai.2025.112795_b12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/3422622","article-title":"Generative adversarial networks","volume":"63","author":"Goodfellow","year":"2014","journal-title":"Commun. ACM"},{"key":"10.1016\/j.engappai.2025.112795_b13","first-page":"5768","article-title":"Improved training of wasserstein gans","volume":"30","author":"Gulrajani","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"10.1016\/j.engappai.2025.112795_b14","first-page":"100","article-title":"FFormal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"Syst. Sci. Cybern."},{"issue":"8","key":"10.1016\/j.engappai.2025.112795_b15","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","article-title":"Long short-term memory","volume":"9","author":"Hochreiter","year":"1997","journal-title":"Neural Comput."},{"key":"10.1016\/j.engappai.2025.112795_b16","series-title":"ICNSC 2021 - 18th IEEE International Conference on Networking, Sensing and Control: Industry 4.0 and AI","article-title":"ROS based obstacle avoidance motion planning of UR5 manipulator","author":"Huang","year":"2021"},{"key":"10.1016\/j.engappai.2025.112795_b17","first-page":"317","article-title":"Robot path planning by LSTM network under changing environment","volume":"759","author":"Inoue","year":"2019","journal-title":"Adv. Intell. Syst. Comput."},{"key":"10.1016\/j.engappai.2025.112795_b18","series-title":"Proceedings - 30th IEEE Conference on Computer Vision and Pattern Recognition","first-page":"5967","article-title":"Image-to-image translation with conditional adversarial networks","volume":"Vol. 2017-Janua","author":"Isola","year":"2017"},{"key":"10.1016\/j.engappai.2025.112795_b19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.7551\/mitpress\/9123.003.0038","article-title":"Incremental sampling-based algorithms for optimal motion planning","volume":"6","author":"Karaman","year":"2011","journal-title":"Robot.: Sci. Syst."},{"issue":"4","key":"10.1016\/j.engappai.2025.112795_b20","first-page":"1005","article-title":"Improved trajectory planning of mobile robot based on pelican optimization algorithm","volume":"57","author":"Khaleel","year":"2024","journal-title":"J. Eur. Syst. Autom."},{"issue":"10","key":"10.1016\/j.engappai.2025.112795_b21","first-page":"2869","article-title":"Design and implementation low cost smart cleaner mobile robot in complex environment","volume":"11","author":"Khaleel","year":"2024","journal-title":"Math. Model. Eng. Probl."},{"issue":"1","key":"10.1016\/j.engappai.2025.112795_b22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.11591\/eei.v13i1.6560","article-title":"Ultrasonic sensor decision-making algorithm for mobile robot motion in maze environment","volume":"13","author":"Khaleel","year":"2024","journal-title":"Bull. Electr. Eng. Inform."},{"issue":"1","key":"10.1016\/j.engappai.2025.112795_b23","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TSG.2017.2753802","article-title":"Short-term residential load forecasting based on LSTM recurrent neural network","volume":"10","author":"Kong","year":"2019","journal-title":"IEEE Trans. Smart Grid"},{"key":"10.1016\/j.engappai.2025.112795_b24","series-title":"Rapidly-exploring random trees: A new tool for path planning","first-page":"68","author":"LaValle","year":"1998"},{"key":"10.1016\/j.engappai.2025.112795_b25","series-title":"Proceedings - IEEE International Conference on Robotics and Automation","first-page":"7386","article-title":"Efficient heuristic generation for robot path planning with recurrent generative model","volume":"Vol. 2021-May","author":"Li","year":"2021"},{"key":"10.1016\/j.engappai.2025.112795_b26","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/978-3-030-96302-6_62","article-title":"Path planning techniques for mobile robots: A review","volume":"417 LNNS","author":"Mohanty","year":"2022","journal-title":"Lect. Notes Netw. Syst."},{"issue":"22","key":"10.1016\/j.engappai.2025.112795_b27","article-title":"Trajectory planning for a mobile robot in a dynamic environment using an lstm neural network","volume":"11","author":"Molina-Leal","year":"2021","journal-title":"Appl. Sci. (Switz.)"},{"key":"10.1016\/j.engappai.2025.112795_b28","doi-asserted-by":"crossref","first-page":"156787","DOI":"10.1109\/ACCESS.2019.2949835","article-title":"Hybrid path planning algorithm based on membrane pseudo-bacterial potential field for autonomous mobile robots","volume":"7","author":"Orozco-Rosas","year":"2019","journal-title":"IEEE Access"},{"issue":"August","key":"10.1016\/j.engappai.2025.112795_b29","doi-asserted-by":"crossref","first-page":"84648","DOI":"10.1109\/ACCESS.2022.3197628","article-title":"Mobile robot path planning using a QAPF learning algorithm for known and unknown environments","volume":"10","author":"Orozco-Rosas","year":"2022","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.engappai.2025.112795_b30","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TRO.2020.3006716","article-title":"Motion planning networks: Bridging the gap between learning-based and classical motion planners","volume":"37","author":"Qureshi","year":"2021","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.engappai.2025.112795_b31","series-title":"Unsupervised representation learning with deep convolutional generative adversarial networks","first-page":"1","author":"Radford","year":"2015"},{"key":"10.1016\/j.engappai.2025.112795_b32","series-title":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","first-page":"779","article-title":"Yolo1","volume":"Vol. 2016-Decem","author":"Redmon","year":"2016"},{"key":"10.1016\/j.engappai.2025.112795_b33","series-title":"Long short-term memory based recurrent neural network architectures for large vocabulary speech recognition","author":"Sak","year":"2014"},{"key":"10.1016\/j.engappai.2025.112795_b34","series-title":"GAN path finder: Preliminary results","author":"Soboleva","year":"2019"},{"key":"10.1016\/j.engappai.2025.112795_b35","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"10.1016\/j.engappai.2025.112795_b36","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The open motion planning library","volume":"19","author":"\u015eucan","year":"2012","journal-title":"IEEE Robot. Autom. Mag."},{"issue":"January","key":"10.1016\/j.engappai.2025.112795_b37","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume":"4","author":"Sutskever","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.engappai.2025.112795_b38","first-page":"9548","article-title":"3D-CNN based heuristic guided task-space planner for faster motion planning","author":"Terasawa","year":"2020","journal-title":"Proc. IEEE Int. Conf. Robot. Autom."},{"issue":"4","key":"10.1016\/j.engappai.2025.112795_b39","doi-asserted-by":"crossref","first-page":"1748","DOI":"10.1109\/TASE.2020.2976560","article-title":"Neural RRT*: Learning-based optimal path planning","volume":"17","author":"Wang","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"10.1016\/j.engappai.2025.112795_b40","doi-asserted-by":"crossref","first-page":"705","DOI":"10.2307\/1419730","article-title":"Principles of neurodynamics: Perceptrons and the theory of brain mechanisms","volume":"76","author":"White","year":"1963","journal-title":"Am. J. Psychol."},{"issue":"10","key":"10.1016\/j.engappai.2025.112795_b41","doi-asserted-by":"crossref","first-page":"4814","DOI":"10.3390\/s23104814","article-title":"Implementation of a real-time object pick-and-place system based on a changing strategy for rapidly-exploring random tree","volume":"23","author":"Wong","year":"2023","journal-title":"Sensors"},{"issue":"6","key":"10.1016\/j.engappai.2025.112795_b42","first-page":"2343","article-title":"A novel bio-inspired approach with multi-resolution mapping for the path planning of multi-robot system in complex environments","volume":"9","author":"Yi","year":"2022","journal-title":"J. Comput. Des. Eng."},{"key":"10.1016\/j.engappai.2025.112795_b43","series-title":"Recurrent neural network regularization","first-page":"1","author":"Zaremba","year":"2014"},{"issue":"24","key":"10.1016\/j.engappai.2025.112795_b44","doi-asserted-by":"crossref","DOI":"10.3390\/s23249802","article-title":"Path planning of a mobile robot for a dynamic indoor environment based on an SAC-LSTM algorithm","volume":"23","author":"Zhang","year":"2023","journal-title":"Sensors"},{"key":"10.1016\/j.engappai.2025.112795_b45","series-title":"Path planning for the mobile robot: a review","author":"Zhang","year":"2018"},{"issue":"1","key":"10.1016\/j.engappai.2025.112795_b46","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/JAS.2021.1004275","article-title":"Generative adversarial network based heuristics for sampling-based path planning","volume":"9","author":"Zhang","year":"2022","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"10.1016\/j.engappai.2025.112795_b47","first-page":"5949","article-title":"An actor-critic approach for legible robot motion planner","author":"Zhao","year":"2020","journal-title":"Proc. IEEE Int. Conf. Robot. Autom."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095219762502826X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095219762502826X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:30:22Z","timestamp":1766068222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095219762502826X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":47,"alternative-id":["S095219762502826X"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2025.112795","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Investigation of stochastic deep learning path planning methods for mobile robots","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2025.112795","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112795"}}