{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:29:26Z","timestamp":1716820166809},"reference-count":45,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"In order to protect people\u2019s lives and property, increasing numbers of explosive disposal robots have been developed. It is necessary for an explosive ordinance disposal (EOD) robot to quickly detect all explosives, especially when the location of the explosives is unknown. To achieve this goal, we propose a bidirectional dynamic weighted-A star (BD-A*) algorithm and a learn memory-swap sequence particle swarm optimization (LM-SSPSO) algorithm. Firstly, in the BD-A* algorithm, our aim is to obtain the shortest distance path between any two goal positions, considering computation time optimization. We optimize the computation time by introducing a bidirectional search and a dynamic OpenList cost weight strategy. Secondly, the search-adjacent nodes are extended to obtain a shorter path. Thirdly, by using the LM-SSPSO algorithm, we aim to plan the shortest distance path that traverses all goal positions. The problem is similar to the symmetric traveling salesman problem (TSP). We introduce the swap sequence strategy into the traditional PSO and optimize the whole PSO process by imitating human learning and memory behaviors. Fourthly, to verify the performance of the proposed algorithm, we begin by comparing the improved A* with traditional A* over different resolutions, weight coefficients, and nodes. The hybrid PSO algorithm is also compared with other intelligent algorithms. Finally, different environment maps are also discussed to further verify the performance of the algorithm. The simulation results demonstrate that our improved A* algorithm has superior performance by finding the shortest distance with less computational time. In the simulation results for LM-SSPSO, the convergence rate significantly improves, and the improved algorithm is more likely to obtain the optimal path.<\/jats:p>","DOI":"10.3390\/sym15051052","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T05:40:02Z","timestamp":1683697202000},"page":"1052","source":"Crossref","is-referenced-by-count":4,"title":["A Multigoal Path-Planning Approach for Explosive Ordnance Disposal Robots Based on Bidirectional Dynamic Weighted-A* and Learn Memory-Swap Sequence PSO Algorithm"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"http:\/\/orcid.org\/0009-0008-7898-1802","authenticated-orcid":false,"given":"Minghao","family":"Li","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2667-1713","authenticated-orcid":false,"given":"Lijun","family":"Qiao","sequence":"additional","affiliation":[{"name":"School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3374-428X","authenticated-orcid":false,"given":"Jianfeng","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Mechanical and Power Engineering, Henan Polytechnic University, Jiaozuo 454003, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zhao, J., Han, T., Ma, X., Ma, W., Liu, C., Li, J., and Liu, Y. (2021). Research on Kinematics Analysis and Trajectory Planning of Novel EOD Manipulator. Appl. Sci., 11.","DOI":"10.3390\/app11209438"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Tran, J., Ufkes, A., Fiala, M., and Ferworn, A. (2011, January 1\u20135). Low-Cost 3D Scene Reconstruction for Response Robots in Real-time. Proceedings of the 2011 IEEE International Symposium on Safety, Security and Rescue Robotics, Kyoto, Japan.","DOI":"10.1109\/SSRR.2011.6106780"},{"key":"ref_3","unstructured":"Rudakevych, P., Clark, S., and Wallace, J. (2007). Unmanned Systems Technology IX, Proceedings of the Defense and Security Symposium, Orlando, FL, USA, 9\u201313 April 2007, SPIE."},{"key":"ref_4","unstructured":"Odedra, S., Prio, S., Karamanoglu, M., and Shen, S.T. (2009, January 22\u201324). Increasing the trafficability of unmanned ground vehicles through intelligent morphing. Proceedings of the 2009 ASME\/IFToMM International Conference on Reconfigurable Mechanisms and Robots, London, UK."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/s13198-021-01428-w","article-title":"Research on the application of intelligent robots in explosive crime scenes","volume":"14","author":"Guo","year":"2023","journal-title":"Int. J. Syst. Assur. Eng. Manag."},{"key":"ref_6","unstructured":"Li, X., Meng, C., Liang, J., and Wang, T. (2006, January 16\u201318). Research on Simulation and Training System for EOD Robots. Proceedings of the IEEE 2006 4th IEEE International Conference on Industrial Informatics, Singapore."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1080\/00207721.2014.929191","article-title":"UAV path planning using artificial potential fieldmethod updated by optimal control theory","volume":"47","author":"Chen","year":"2016","journal-title":"Int. J. Syst. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Chen, C.-M., Lv, S., Ning, J., and Wu, J.M.-T. (2023). A Genetic Algorithm for the Waitable Time-Varying Multi-Depot Green Vehicle Routing Problem. Symmetry, 15.","DOI":"10.3390\/sym15010124"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"121267","DOI":"10.1109\/ACCESS.2020.3006579","article-title":"Multi-Objective Genetic Algorithm-Based Autonomous Path Planning for Hinged-Tetro Reconfigurable Tiling Robot","volume":"8","author":"Cheng","year":"2020","journal-title":"IEEE Access"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.asoc.2018.08.041","article-title":"Optimized tool path planning for five-axis flank milling of ruled surfaces using geometric decomposition strategy and multi-population harmony search algorithm","volume":"73","author":"Yi","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, H., Qi, X., Lou, S., Jing, J., He, H., and Liu, W. (2021). An Efficient and Robust Improved A* Algorithm for Path Planning. Symmetry, 13.","DOI":"10.3390\/sym13112213"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Dang, C.V., Ahn, H., Lee, D.S., and Lee, S.C. (2022). Improved Analytic Expansions in Hybrid A-Star Path Planning for Non-Holonomic Robots. Appl. Sci., 12.","DOI":"10.3390\/app12125999"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhang, J., Zhang, Q., and Wei, X. (2022). Obstacle Avoidance Path Planning of Space Robot Based on Improved Particle Swarm Optimization. Symmetry, 14.","DOI":"10.3390\/sym14050938"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"106076","DOI":"10.1016\/j.asoc.2020.106076","article-title":"Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm","volume":"89","author":"Ajeila","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Zhou, H., Jiang, Z., Xue, Y., Li, W., Cai, F., and Li, Y. (2022). Research on Path Planning in 3D Complex Environments Based on Improved Ant Colony Algorithm. Symmetry, 14.","DOI":"10.3390\/sym14091917"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"53296","DOI":"10.1109\/ACCESS.2018.2871222","article-title":"Path planning of industrial robot based on improved RRT algorithm in complex environments","volume":"6","author":"Zhang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Feng, J., and Zhang, W. (2021). An Efficient RRT Algorithm for Motion Planning of Live-Line Maintenance Robots. Appl. Sci., 11.","DOI":"10.3390\/app112210773"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/TSMCC.2009.2020789","article-title":"Neural-network-based path planning for a multirobot system with moving obstacles","volume":"39","author":"Li","year":"2009","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"60253","DOI":"10.1109\/ACCESS.2022.3181131","article-title":"Field Evaluation of Path-Planning Algorithms for Autonomous Mobile Robot in Smart Farms","volume":"10","author":"Pak","year":"2022","journal-title":"IEEE Access"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Tian, Z., Guo, Z., Liu, Y., and Chen, J. (2020, January 15\u201320). An improved RRT robot autonomous exploration and SLAM construction method. Proceedings of the 2020 5th International Conference on Automation, Control and Robotics Engineering (CACRE), Dalian, China.","DOI":"10.1109\/CACRE50138.2020.9230216"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10846-017-0567-9","article-title":"Faster RRT-based Nonholonomic Path Planning in 2D Building Environments Using Skeleton-constrained Path Biasing","volume":"89","author":"Dong","year":"2018","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, Z., Xiang, X., Yang, J., and Yang, S. (2017, January 18\u201320). Composite Astar and B-spline algorithm for path planning of Autonomous Underwater Vehicle. Proceedings of the 2017 IEEE 7th International Conference on Underwater System Technology: Theory and Applications (USYS), Kuala Lumpur, Malaysia.","DOI":"10.1109\/USYS.2017.8309463"},{"key":"ref_23","unstructured":"Zhang, L., and Li, Y. (2021, January 29\u201331). Mobile Robot Path Planning Algorithm Based on Improved A Star. Proceedings of the 2021 4th International Conference on Advanced Algorithms and Control Engineering (ICAACE 2021), Sanya, China."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Yang, R., and Cheng, L. (2019, January 14\u201315). Path planning of restaurant service robot based on a-star algorithms with updated weights. Proceedings of the 2019 12th International Symposium on Computational Intelligence and Design (ISCID), Hangzhou, China.","DOI":"10.1109\/ISCID.2019.00074"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Le, A.V., Prabakaran, V., Sivanantham, V., and Mohan, R.E. (2018). Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor. Sensors, 18.","DOI":"10.3390\/s18082585"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Shang, E., Dai, B., Nie, Y., Zhu, Q., Xiao, L., and Zhao, D. (2020, January 20\u201323). A guide-line and key-point based a-star path planning algorithm for autonomous land vehicles. Proceedings of the 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), Rhodes, Greece.","DOI":"10.1109\/ITSC45102.2020.9294336"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"59196","DOI":"10.1109\/ACCESS.2021.3070054","article-title":"Geometric A-star algorithm: An improved A-star algorithm for AGV path planning in a port environment","volume":"9","author":"Tang","year":"2021","journal-title":"IEEE Access"},{"key":"ref_28","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"107693","DOI":"10.1016\/j.oceaneng.2020.107693","article-title":"Global path planning and multi-objective path control for unmanned surface vehicle based on modified particle swarm optimization (PSO) algorithm","volume":"216","author":"Guo","year":"2020","journal-title":"Ocean Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1496","DOI":"10.1109\/TCYB.2016.2549639","article-title":"A Micro-GA embedded PSO feature selection approach to intelligent facial emotion recognition","volume":"47","author":"Mistry","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Jiang, G., Luo, M., Bai, K., and Chen, S. (2017). A Precise Positioning Method for a Puncture Robot Based on a PSO-Optimized BP Neural Network Algorithm. Appl. Sci., 7.","DOI":"10.3390\/app7100969"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.neucom.2012.09.019","article-title":"Robot path planning in uncertain environment using multi-objective particle swarm optimization","volume":"103","author":"Zhang","year":"2013","journal-title":"Neurocomputing"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Rath, M.K., and Deepak, B.B.V.L. (2015, January 23\u201324). PSO based system architecture for path planning of mobile robot in dynamic environment. Proceedings of the 2015 Global Conference on Communication Technologies (GCCT), Thuckalay, India.","DOI":"10.1109\/GCCT.2015.7342773"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Yang, B., Yan, J., Cai, Z., Ding, Z., Li, D., Cao, Y., and Guo, L. (2021). A Novel Heuristic Emergency Path Planning Method Based on Vector Grid Map. ISPRS Int. J. Geo-Inf., 10.","DOI":"10.3390\/ijgi10060370"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Majeed, A., and Lee, S. (2018). A Fast Global Flight Path Planning Algorithm Based on Space Circumscription and Sparse Visibility Graph for Unmanned Aerial Vehicle. Electronics, 7.","DOI":"10.3390\/electronics7120375"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"86026","DOI":"10.1109\/ACCESS.2019.2925623","article-title":"Mobile robot path planning in dynamic environment using Voronoi diagram and computation geometry technique","volume":"7","author":"Ayawli","year":"2019","journal-title":"IEEE Access"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Yang, D., Xu, B., Rao, K., and Sheng, W. (2018). Passive Infrared (PIR)-Based Indoor Position Tracking for Smart Homes Using Accessibility Maps and A-Star Algorithm. Sensors, 18.","DOI":"10.3390\/s18020332"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s11370-019-00281-y","article-title":"Sampling-Based Motion Planning of Manipulator with Goal-Oriented Sampling","volume":"12","author":"Kang","year":"2019","journal-title":"Intell. Serv. Robot."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, L., Iantovics, L.B., and Iakovidis, D.K. (2018). IntraClusTSP\u2014An Incremental Intra-Cluster Refinement Heuristic Algorithm for Symmetric Travelling Salesman Problem. Symmetry, 10.","DOI":"10.3390\/sym10120663"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.orl.2007.05.001","article-title":"Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP","volume":"36","author":"Hassin","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.eswa.2018.12.044","article-title":"The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem","volume":"122","author":"Boryczka","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"212794","DOI":"10.1155\/2015\/212794","article-title":"An improved genetic algorithm with initial population strategy for symmetric TSP","volume":"2015","author":"Deng","year":"2015","journal-title":"Math. Probl. Eng."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Hoffmann, M., M\u00fchlenthaler, M., and Helwig, S. (2011, January 6\u20138). Discrete particle swarm optimization for TSP: Theoretical results and experimental evaluations. Proceedings of the Second International Conference, ICAIS 2011, Klagenfurt, Austria.","DOI":"10.1007\/978-3-642-23857-4_40"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Brand, M., Masuda, M., Wehner, N., and Yu, X. (2010, January 25\u201327). Ant Colony Optimization Algorithm for Robot Path Planning. Proceedings of the 2010 International Conference on Computer Design and Applications, Qinhuangdao, China.","DOI":"10.1109\/ICCDA.2010.5541300"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"164820","DOI":"10.1109\/ACCESS.2021.3133493","article-title":"An Enhanced Swap Sequence-Based Particle Swam Optimization Algorithm to Solve TSP","volume":"9","author":"Emambocus","year":"2021","journal-title":"IEEE Access"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/5\/1052\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T08:42:34Z","timestamp":1683708154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/5\/1052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":45,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["sym15051052"],"URL":"https:\/\/doi.org\/10.3390\/sym15051052","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,9]]}}}