{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:22Z","timestamp":1772119762615,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"DOI":"10.1007\/s11063-024-11671-4","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:10:43Z","timestamp":1737353443000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LPM-Net: A Data-Driven Resource-Efficient Predictive Motion Planner for Mobile Robots"],"prefix":"10.1007","volume":"57","author":[{"given":"Fakhreddin","family":"Amirhosseini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6021-0315","authenticated-orcid":false,"given":"Zahra","family":"Nilforoushan","sequence":"additional","affiliation":[]},{"given":"Seyedeh","family":"Leili\u00a0Mirtaheri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"key":"11671_CR1","doi-asserted-by":"publisher","unstructured":"Adiyatov O, Varol HA (2013) Rapidly-exploring random tree based memory efficient motion planning. In: 2013 IEEE international conference on mechatronics and automation. IEEE, pp 354\u2013359. https:\/\/doi.org\/10.1109\/ICMA.2013.6617944","DOI":"10.1109\/ICMA.2013.6617944"},{"issue":"5","key":"11671_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"SM LaValle","year":"2001","unstructured":"LaValle SM, Kuffner JJ Jr (2001) Randomized kinodynamic planning. Int J Robot Res 20(5):378\u2013400. https:\/\/doi.org\/10.1177\/02783640122067453","journal-title":"Int J Robot Res"},{"issue":"5","key":"11671_CR3","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1177\/0278364915614386","volume":"35","author":"Y Li","year":"2016","unstructured":"Li Y, Littlefield Z, Bekris KE (2016) Asymptotically optimal sampling-based kinodynamic planning. Int J Robot Res 35(5):528\u2013564. https:\/\/doi.org\/10.1177\/0278364915614386","journal-title":"Int J Robot Res"},{"key":"11671_CR4","doi-asserted-by":"publisher","unstructured":"Xiao S, Bergmann N, Postula A (2017) Parallel RRT architecture design for motion planning. In: 2017 27th international conference on field programmable logic and applications (FPL). IEEE, pp 1\u20134. https:\/\/doi.org\/10.23919\/FPL.2017.8056773","DOI":"10.23919\/FPL.2017.8056773"},{"key":"11671_CR5","doi-asserted-by":"publisher","unstructured":"Agarwal S et al (2018) Potential and sampling based RRT star for real-time dynamic motion planning accounting for momentum in cost function. In: International conference on neural information processing. Springer, Berlin, pp 209\u2013221. https:\/\/doi.org\/10.1007\/978-3-030-04239-4_19","DOI":"10.1007\/978-3-030-04239-4_19"},{"key":"11671_CR6","doi-asserted-by":"publisher","unstructured":"Perez A et al (2012) LQR-RRT*: optimal sampling-based motion planning with automatically derived extension heuristics. In: 2012 IEEE international conference on robotics and automation. IEEE, pp 2537\u20132542. https:\/\/doi.org\/10.1109\/ICRA.2012.6225177","DOI":"10.1109\/ICRA.2012.6225177"},{"key":"11671_CR7","doi-asserted-by":"publisher","first-page":"95046","DOI":"10.1109\/ACCESS.2019.2928846","volume":"7","author":"W Xinyu","year":"2019","unstructured":"Xinyu W et al (2019) Bidirectional potential guided RRT* for motion planning. IEEE Access 7:95046\u201395057. https:\/\/doi.org\/10.1109\/ACCESS.2019.2928846","journal-title":"IEEE Access"},{"key":"11671_CR8","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.071114","author":"I Noreen","year":"2016","unstructured":"Noreen I, Khan A, Habib Z (2016) Optimal path planning using RRT* based approaches: a survey and future directions. Int J Adv Comput Sci Appl. https:\/\/doi.org\/10.14569\/IJACSA.2016.071114","journal-title":"Int J Adv Comput Sci Appl"},{"key":"11671_CR9","doi-asserted-by":"publisher","unstructured":"Goretkin G, Perez A, Platt R (2013) Optimal sampling-based planning for linear-quadratic kinodynamic systems. In: 2013 International conference on robotics and automation. https:\/\/doi.org\/10.1109\/ICRA.2013.6630907","DOI":"10.1109\/ICRA.2013.6630907"},{"issue":"3","key":"11671_CR10","doi-asserted-by":"publisher","first-page":"4496","DOI":"10.1109\/LRA.2021.3067847","volume":"6","author":"L Li","year":"2021","unstructured":"Li L et al (2021) MPC-MPNet: model-predictive motion planning networks for fast, near-optimal planning under kinodynamic constraints. IEEE Robot Autom Lett 6(3):4496\u20134503. https:\/\/doi.org\/10.1109\/LRA.2021.3067847","journal-title":"IEEE Robot Autom Lett"},{"key":"11671_CR11","doi-asserted-by":"publisher","unstructured":"Faroni M, Beschi M, Pedrocchi N (2019) An MPC framework for online motion planning in human-robot collaborative tasks. In: 2019 24th IEEE international conference on emerging technologies and factory automation (ETFA). IEEE, pp 1555\u20131558. https:\/\/doi.org\/10.1109\/ETFA.2019.8869047","DOI":"10.1109\/ETFA.2019.8869047"},{"issue":"5","key":"11671_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10514-022-10039-8","volume":"46","author":"X Xiao","year":"2022","unstructured":"Xiao X et al (2022) Motion planning and control for mobile robot navigation using machine learning: a survey. Auton Robots 46(5):569\u2013597. https:\/\/doi.org\/10.1007\/s10514-022-10039-8","journal-title":"Auton Robots"},{"issue":"4","key":"11671_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1049\/csy2.12020","volume":"3","author":"J Wang","year":"2021","unstructured":"Wang J et al (2021) A survey of learning-based robot motion planning. IET Cyber-Syst Robot 3(4):302\u2013314. https:\/\/doi.org\/10.1049\/csy2.12020","journal-title":"IET Cyber-Syst Robot"},{"issue":"4","key":"11671_CR14","doi-asserted-by":"publisher","first-page":"3577","DOI":"10.1109\/LRA.2019.2928255","volume":"4","author":"S Lai","year":"2019","unstructured":"Lai S, Lan M, Chen BM (2019) Model predictive local motion planning with boundary state constrained primitives. IEEE Robot Autom Lett 4(4):3577\u20133584. https:\/\/doi.org\/10.1109\/LRA.2019.2928255","journal-title":"IEEE Robot Autom Lett"},{"key":"11671_CR15","doi-asserted-by":"publisher","unstructured":"Mansard N et al (2018) Using a memory of motion to efficiently warm-start a nonlinear predictive controller. In: 2018 IEEE international conference on robotics and automation (ICRA). IEEE, pp 2986\u20132993. https:\/\/doi.org\/10.1109\/ICRA.2018.8463154","DOI":"10.1109\/ICRA.2018.8463154"},{"issue":"4","key":"11671_CR16","doi-asserted-by":"publisher","first-page":"4298","DOI":"10.1109\/LRA.2019.2931199","volume":"4","author":"H-TL Chiang","year":"2019","unstructured":"Chiang H-TL et al (2019) RL-RRT: kinodynamic motion planning via learning reachability estimators from RL policies. IEEE Robot Autom Lett 4(4):4298\u20134305. https:\/\/doi.org\/10.1109\/LRA.2019.2931199","journal-title":"IEEE Robot Autom Lett"},{"key":"11671_CR17","doi-asserted-by":"publisher","unstructured":"Ota K et al (2020) Efficient exploration in constrained environments with goal-oriented reference path. In: 2020 IEEE\/RSJ international conference on intelligent robots and systems (IROS). IEEE, pp 6061\u20136068. https:\/\/doi.org\/10.1109\/IROS45743.2020.9341620","DOI":"10.1109\/IROS45743.2020.9341620"},{"issue":"4","key":"11671_CR18","doi-asserted-by":"publisher","first-page":"6164","DOI":"10.1109\/LRA.2021.3091019","volume":"6","author":"H Tsukamoto","year":"2021","unstructured":"Tsukamoto H, Chung S-J (2021) Learning-based robust motion planning with guaranteed stability: a contraction theory approach. IEEE Robotics Autom Lett 6(4):6164\u20136171. https:\/\/doi.org\/10.1109\/LRA.2021.3091019","journal-title":"IEEE Robotics Autom Lett"},{"key":"11671_CR19","doi-asserted-by":"publisher","unstructured":"Franceschini R, Fumagalli M, Becerra JC (2022) Learn to efficiently exploit cost maps by combining RRT* with Reinforcement Learning. In: 2022 IEEE international symposium on safety, security, and rescue robotics (SSRR), pp 251\u2013256. https:\/\/doi.org\/10.1109\/SSRR56537.2022.10018735","DOI":"10.1109\/SSRR56537.2022.10018735"},{"key":"11671_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279322","author":"PK Das","year":"2012","unstructured":"Das PK et al (2012) An improved Q-learning algorithm for path-planning of a mobile robot. Int J Comput Appl. https:\/\/doi.org\/10.1109\/ICInfA.2015.7279322","journal-title":"Int J Comput Appl"},{"key":"11671_CR21","doi-asserted-by":"publisher","unstructured":"Xu J et al (2020) Reinforcement learning to rank with pairwise policy gradient. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. SIGIR \u201920. Virtual Event, China: Association for Computing Machinery, pp 509\u2013518. https:\/\/doi.org\/10.1145\/3397271.3401148","DOI":"10.1145\/3397271.3401148"},{"key":"11671_CR22","doi-asserted-by":"publisher","unstructured":"Li T et al (2018) Learning to interrupt: a hierarchical deep reinforcement learning framework for efficient exploration. https:\/\/doi.org\/10.1109\/ROBIO.2018.8665177. arXiv:1807.11150","DOI":"10.1109\/ROBIO.2018.8665177"},{"key":"11671_CR23","doi-asserted-by":"publisher","first-page":"69061","DOI":"10.1109\/ACCESS.2021.3076530","volume":"9","author":"H Sun","year":"2021","unstructured":"Sun H et al (2021) Motion planning for mobile robots\u2014focusing on deep reinforcement learning: a systematic review. IEEE Access 9:69061\u201369081. https:\/\/doi.org\/10.1109\/ACCESS.2021.3076530","journal-title":"IEEE Access"},{"key":"11671_CR24","doi-asserted-by":"publisher","unstructured":"Yamada J et al (2021) Motion planner augmented reinforcement learning for robot manipulation in obstructed environments. In: Conference on robot learning. PMLR, pp 589\u2013603. https:\/\/doi.org\/10.48550\/arXiv.2010.11940","DOI":"10.48550\/arXiv.2010.11940"},{"issue":"17","key":"11671_CR25","doi-asserted-by":"publisher","first-page":"6655","DOI":"10.3390\/s22176655","volume":"22","author":"S Shahi","year":"2022","unstructured":"Shahi S, Lee H (2022) Autonomous rear parking via rapidly exploring random-tree-based reinforcement learning. Sensors 22(17):6655. https:\/\/doi.org\/10.3390\/s22176655","journal-title":"Sensors"},{"key":"11671_CR26","doi-asserted-by":"publisher","unstructured":"Qureshi AH et al (2019) Motion planning networks. In: 2019 International conference on robotics and automation (ICRA). IEEE, pp 2118\u20132124. https:\/\/doi.org\/10.48550\/arXiv.1806.05767","DOI":"10.48550\/arXiv.1806.05767"},{"issue":"3","key":"11671_CR27","doi-asserted-by":"publisher","first-page":"2407","DOI":"10.48550\/arXiv.1807.10366","volume":"4","author":"B Ichter","year":"2019","unstructured":"Ichter B, Pavone M (2019) Robot motion planning in learned latent spaces. IEEE Robot Autom Lett 4(3):2407\u20132414. https:\/\/doi.org\/10.48550\/arXiv.1807.10366","journal-title":"IEEE Robot Autom Lett"},{"issue":"1","key":"11671_CR28","doi-asserted-by":"publisher","first-page":"48","DOI":"10.48550\/arXiv.1907.06013","volume":"37","author":"AH Qureshi","year":"2020","unstructured":"Qureshi AH et al (2020) Motion planning networks: bridging the gap between learning-based and classical motion planners. IEEE Trans Robot 37(1):48\u201366. https:\/\/doi.org\/10.48550\/arXiv.1907.06013","journal-title":"IEEE Trans Robot"},{"issue":"3","key":"11671_CR29","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s40997-019-00281-4","volume":"44","author":"H Amirhosseini","year":"2020","unstructured":"Amirhosseini H, Najafi F (2020) Design, prototyping and performance evaluation of a bio-inspired walking microrobot. Iran J Sci Technol Trans Mech Eng 44(3):799\u2013811. https:\/\/doi.org\/10.1007\/s40997-019-00281-4","journal-title":"Iran J Sci Technol Trans Mech Eng"},{"issue":"7765","key":"11671_CR30","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1038\/s41586-019-1388-8","volume":"571","author":"Z Zhakypov","year":"2019","unstructured":"Zhakypov Z et al (2019) Designing minimal and scalable insect-inspired multi-locomotion millirobots. Nature 571(7765):381\u2013386. https:\/\/doi.org\/10.1038\/s41586-019-1388-8","journal-title":"Nature"},{"key":"11671_CR31","doi-asserted-by":"publisher","unstructured":"Heaton J (2018) Ian goodfellow, yoshua bengio, and aaron courville: deep learning. https:\/\/doi.org\/10.1007\/s10710-017-9314-z","DOI":"10.1007\/s10710-017-9314-z"},{"issue":"8","key":"11671_CR32","doi-asserted-by":"publisher","first-page":"5929","DOI":"10.1007\/s10462-020-09838-1","volume":"53","author":"G Van Houdt","year":"2020","unstructured":"Van Houdt G, Mosquera C, N\u00e1poles G (2020) A review on the long short-term memory model. Artif Intell Rev 53(8):5929\u20135955. https:\/\/doi.org\/10.1007\/s10462-020-09838-1","journal-title":"Artif Intell Rev"}],"updated-by":[{"DOI":"10.1007\/s11063-025-11736-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000}}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11671-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11671-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11671-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T08:44:07Z","timestamp":1741682647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11671-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["11671"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11671-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3184503\/v1","asserted-by":"object"}]},"ISSN":["1573-773X"],"issn-type":[{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"19 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11063-025-11736-y","URL":"https:\/\/doi.org\/10.1007\/s11063-025-11736-y","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}