{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:04:06Z","timestamp":1760709846341,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T00:00:00Z","timestamp":1551830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Path planning, as the core of navigation control for mobile robots, has become the focus of research in the field of mobile robots. Various path planning algorithms have been recently proposed. In this paper, in view of the advantages and disadvantages of different path planning algorithms, a heuristic elastic particle swarm algorithm is proposed. Using the path planned by the A* algorithm in a large-scale grid for global guidance, the elastic particle swarm optimization algorithm uses a shrinking operation to determine the globally optimal path formed by locally optimal nodes so that the particles can converge to it rapidly. Furthermore, in the iterative process, the diversity of the particles is ensured by a rebound operation. Computer simulation and real experimental results show that the proposed algorithm not only overcomes the shortcomings of the A* algorithm, which cannot yield the shortest path, but also avoids the problem of failure to converge to the globally optimal path, owing to a lack of heuristic information. Additionally, the proposed algorithm maintains the simplicity and high efficiency of both the algorithms.<\/jats:p>","DOI":"10.3390\/info10030099","type":"journal-article","created":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T10:52:22Z","timestamp":1551955942000},"page":"99","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Heuristic Elastic Particle Swarm Optimization Algorithm for Robot Path Planning"],"prefix":"10.3390","volume":"10","author":[{"given":"Haiyan","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Security, Zhejiang Police Vocational Academy, Hangzhou 310018, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4487-8192","authenticated-orcid":false,"given":"Zhiyu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer, Zhejiang Sci-Tech University, Hangzhou 310018, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.rcim.2010.03.013","article-title":"An overview of dynamic parameter identification of robots. Robot","volume":"26","author":"Wu","year":"2010","journal-title":"Comput. Integr. Manuf."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3157","DOI":"10.1109\/TCYB.2015.2498760","article-title":"An efficient fine-to-coarse way finding strategy for robot navigation in regionalized environments","volume":"46","author":"Zhong","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3572","DOI":"10.1016\/j.ijleo.2015.12.149","article-title":"A landmark-based navigation method for autonomous aircraft","volume":"127","author":"Zhu","year":"2016","journal-title":"Optik"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Wu, J., Wang, D., and Wang, L. (2015). A control strategy of a two degrees-of-freedom heavy duty parallel manipulator. J. Dyn. Syst. Meas. Control, 137.","DOI":"10.1115\/1.4029244"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/15397734.2012.726847","article-title":"A distributed parallel motion control for the multi-thruster autonomous underwater vehicle","volume":"42","author":"He","year":"2013","journal-title":"Mech. Des. Struct. Mach."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4948","DOI":"10.1016\/j.ijleo.2016.02.043","article-title":"A new cruise missile path tracking method based on second-order smoothing","volume":"127","author":"Fang","year":"2016","journal-title":"Optik"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.mechmachtheory.2008.04.002","article-title":"Dynamics and control of a planar 3-DOF parallel manipulator with actuation redundancy","volume":"44","author":"Wu","year":"2009","journal-title":"Mech. Mach. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1177\/0278364914547786","article-title":"Sampling-based A* algorithm for robot path-planning","volume":"33","author":"Persson","year":"2014","journal-title":"Int. J. Robot. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1177\/0278364908098411","article-title":"Path deformation roadmaps: Compact graphs with useful cycles for motion planning","volume":"27","author":"Jaillet","year":"2008","journal-title":"Int. J. Robot. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1109\/TSMCB.2008.2008561","article-title":"Information-driven sensor path planning by approximate cell decomposition","volume":"39","author":"Cai","year":"2009","journal-title":"IEEE Trans Syst. Man Cybern. B"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4688","DOI":"10.1016\/j.eswa.2008.06.040","article-title":"Motion planning in order to optimize the length and clearance applying a Hopfield neural network","volume":"36","author":"Ghatee","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1631\/jzus.2005.A0549","article-title":"Neural network and genetic algorithm based global path planning in a static environment","volume":"6","author":"Du","year":"2005","journal-title":"J. Zhejiang Univ. Sci. A"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"5829","DOI":"10.1007\/s00500-016-2161-7","article-title":"An improved ant colony algorithm for robot path planning","volume":"21","author":"Liu","year":"2017","journal-title":"Soft Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.asoc.2017.05.012","article-title":"A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization","volume":"59","author":"Mac","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.measurement.2015.02.026","article-title":"Autonomous navigation based on unscented-FastSLAM using particle swarm optimization for autonomous underwater vehicles","volume":"71","author":"He","year":"2015","journal-title":"Measurement"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/j.ijleo.2017.12.169","article-title":"Tangent navigated robot path planning strategy using particle swarm optimized artificial potential field","volume":"158","author":"Zhou","year":"2018","journal-title":"Optik"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.asoc.2015.01.067","article-title":"Mobile robot path planning using artificial bee colony and evolutionary programming","volume":"30","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s13042-013-0195-z","article-title":"An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks","volume":"6","author":"Chang","year":"2015","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10846-014-0124-8","article-title":"Optimal path planning generation for mobile robots using parallel evolutionary artificial potential field","volume":"79","author":"Montiel","year":"2015","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s11370-008-0033-4","article-title":"Path planning of wheeled mobile robot with simultaneous free space locating capability","volume":"2","author":"Chang","year":"2009","journal-title":"Intell. Serv. Robot."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10514-010-9200-5","article-title":"A provably complete exploration strategy by constructing Voronoi diagrams","volume":"29","author":"Jonghoek","year":"2010","journal-title":"Auton. Robots"},{"key":"ref_22","first-page":"627","article-title":"An improved A* algorithm for searching infinite neighborhoods","volume":"36","author":"Xin","year":"2014","journal-title":"Robot"},{"key":"ref_23","first-page":"2543","article-title":"Path planning for mobile robots based on social group search algorithm","volume":"50","author":"Feng","year":"2013","journal-title":"J. Comput. Res. Dev."},{"key":"ref_24","first-page":"874","article-title":"Improved particle swarm optimization with adaptive inertia weight","volume":"43","author":"Ao","year":"2014","journal-title":"J. Univ. Electron. Sci. Technol. China"},{"key":"ref_25","first-page":"74","article-title":"Adaptive particle swarm optimization algorithm via disturbing acceleration coefficients","volume":"39","author":"Jiang","year":"2012","journal-title":"J. Xidain Univ."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.4304\/jcp.6.8.1554-1561","article-title":"Multi-objective particle swarm optimization for robot path planning in environment with danger sources","volume":"6","author":"Gong","year":"2011","journal-title":"J. Comput."},{"key":"ref_27","first-page":"102","article-title":"Path planning based on improved particle swarm optimization algorithm","volume":"49","author":"Jia","year":"2018","journal-title":"Trans. Chin. Soc. for Agric. Mach."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/3\/99\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:36:48Z","timestamp":1760186208000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/3\/99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,6]]},"references-count":27,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["info10030099"],"URL":"https:\/\/doi.org\/10.3390\/info10030099","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,3,6]]}}}