{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:55Z","timestamp":1767339955803,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Mobile robots are extensively utilized across various fields, with path planning consistently representing a core and pivotal area of research. Path planning is essential for enabling the efficient navigation of robots within complex environments. In reality, the terrain on which the robot operates is non-uniform, resulting in varying costs associated with different areas due to differing terrains and materials. Practical tasks often necessitate traversing a series of landmark points to fulfill specific requirements. Furthermore, considerations related to control and dynamics frequently require setting minimum line segment lengths between curves and maximum curve curvatures to ensure the successful execution of the path. The objective of this paper is to find a low-cost path with continuous curvature on a map with an assigned cost, which passes through all the given landmark points while avoiding obstacles, and satisfies the minimum length of the line segments between the curves and the maximum curvature constraints of the curves. We propose an innovative path planning method that solves the limitations of traditional algorithms by considering map cost, curvature continuity, and other factors by establishing a collaborative mechanism between global coarse search and local fine-tuning. The method is divided into two stages: In the first stage, the graph structure is constructed by generating points on the map, and uses Dijkstra\u2019s Algorithm to obtain the connection order of the landmark points. In the second stage, which builds on the previous stage and processes landmark points sequentially, the key points of the path are generated using our proposed Smooth Beacon Reconnection (SBR) algorithm. A low-cost path meeting the requirements is then obtained through fine-tuning. The smooth path generated by this method is verified on multiple maps and demonstrates superior performance compared to traditional methods.<\/jats:p>","DOI":"10.3390\/axioms14060394","type":"journal-article","created":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T07:04:28Z","timestamp":1747897468000},"page":"394","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Algorithm for a Low-Cost, Curvature-Continuous Smooth Path with Multiple Constraints on a Cost-Assigned Flat Map"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8550-0703","authenticated-orcid":false,"given":"Xu","family":"Du","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence and Data Science, University of Science and Technology of China, Hefei 230026, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7124-3187","authenticated-orcid":false,"given":"Lu","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Data Science, University of Science and Technology of China, Hefei 230026, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W. (2022). A note on two problems in connexion with graphs. Edsger Wybe Dijkstra: His Life, Work, and Legacy, Morgan & Claypool.","DOI":"10.1145\/3544585.3544600"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_3","unstructured":"Sun, X., Yeoh, W., Chen, P.A., and Koenig, S. (2009, January 10\u201315). Simple optimization techniques for A*-based search. Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, Budapest, Hungary."},{"key":"ref_4","first-page":"1114","article-title":"Online graph pruning for pathfinding on grid maps","volume":"25","author":"Harabor","year":"2011","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/ACCESS.2014.2302442","article-title":"Sampling-based robot motion planning: A review","volume":"2","author":"Elbanhawi","year":"2014","journal-title":"IEEE Access"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Karaman, S., Walter, M.R., Perez, A., Frazzoli, E., and Teller, S. (2011, January 9\u201313). Anytime motion planning using the RRT. Proceedings of the 2011 IEEE International Conference on Robotics and Automation, Shanghai, China.","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"ref_7","unstructured":"LaValle, S.M. (1998). Rapidly-exploring random trees: A new tool for path planning. Annu. Res. Rep., Available online: https:\/\/msl.cs.illinois.edu\/~lavalle\/papers\/Lav98c.pdf."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.5772\/56718","article-title":"RRT*-SMART: A rapid convergence implementation of RRT","volume":"10","author":"Nasir","year":"2013","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/s10514-024-10157-5","article-title":"Adaptive hybrid local\u2013global sampling for fast informed sampling-based optimal path planning","volume":"48","author":"Faroni","year":"2024","journal-title":"Auton. Robot."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"124121","DOI":"10.1016\/j.eswa.2024.124121","article-title":"Density gradient-rrt: An improved rapidly exploring random tree algorithm for uav path planning","volume":"252","author":"Huang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"107230","DOI":"10.1016\/j.cie.2021.107230","article-title":"Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm","volume":"156","author":"Miao","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"104748","DOI":"10.1016\/j.robot.2024.104748","article-title":"Cooperative Path Planning Study of Distributed Multi-Mobile Robots Based on Optimised ACO Algorithm","volume":"179","author":"Cai","year":"2024","journal-title":"Robot. Auton. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1177\/027836499701600301","article-title":"Smooth local-path planning for autonomous vehicles1","volume":"16","author":"Kanayama","year":"1997","journal-title":"Int. J. Robot. Res."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Fei, Z., and Pan, Y.-J. (2023, January 28\u201330). A parameterized cubic b\u00e9zier spline-based informed rrt* for non-holonomic path planning. Proceedings of the 2023 IEEE\/ASME International Conference on Advanced Intelligent Mechatronics (AIM), Seattle, WA, USA.","DOI":"10.1109\/AIM46323.2023.10196284"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s10846-013-9963-y","article-title":"Spline-based RRT path planner for non-holonomic robots","volume":"73","author":"Yang","year":"2014","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TITS.2015.2477355","article-title":"Randomized bidirectional B-spline parameterization motion planning","volume":"17","author":"Elbanhawi","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.cie.2022.108123","article-title":"Global path planning based on a bidirectional alternating search A* algorithm for mobile robots","volume":"168","author":"Li","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1007\/s12555-021-0440-2","article-title":"Stack-RRT*: A Random Tree Expansion Algorithm for Smooth Path Planning","volume":"21","author":"Liao","year":"2023","journal-title":"Int. J. Control. Autom. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10846-013-9884-9","article-title":"FPGA-based parallel metaheuristic PSO algorithm and its application to global path planning for autonomous robot navigation","volume":"76","author":"Huang","year":"2014","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.robot.2016.12.008","article-title":"Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control","volume":"89","author":"Bakdi","year":"2017","journal-title":"Robot. Auton. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1108\/AA-11-2015-094","article-title":"A new genetic algorithm approach to smooth path planning for mobile robots","volume":"36","author":"Song","year":"2016","journal-title":"Assem. Autom."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1080\/21642583.2021.1880985","article-title":"A new approach to optimal smooth path planning of mobile robots with continuous-curvature constraint","volume":"9","author":"Xu","year":"2021","journal-title":"Syst. Sci. Control Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/LRA.2016.2521165","article-title":"Continuous-Curvature Path Planning With Obstacle Avoidance Using Four Parameter Logistic Curves","volume":"1","author":"Upadhyay","year":"2016","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_25","first-page":"1","article-title":"Aspects of spiral transition curve design","volume":"631","author":"Craus","year":"1977","journal-title":"Transp. Res. Rec."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/6\/394\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:38:15Z","timestamp":1760031495000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/6\/394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,22]]},"references-count":25,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["axioms14060394"],"URL":"https:\/\/doi.org\/10.3390\/axioms14060394","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2025,5,22]]}}}