{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:27:00Z","timestamp":1773001620435,"version":"3.50.1"},"reference-count":44,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"vor","delay-in-days":63,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2024J01833"],"award-info":[{"award-number":["2024J01833"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017357","name":"Science and Technology Projects of Fujian Province","doi-asserted-by":"publisher","award":["JAT231057"],"award-info":[{"award-number":["JAT231057"]}],"id":[{"id":"10.13039\/100017357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008462","name":"Fujian University of Technology","doi-asserted-by":"publisher","award":["GY-Z220295"],"award-info":[{"award-number":["GY-Z220295"]}],"id":[{"id":"10.13039\/501100008462","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008462","name":"Fujian University of Technology","doi-asserted-by":"publisher","award":["GY-Z22071"],"award-info":[{"award-number":["GY-Z22071"]}],"id":[{"id":"10.13039\/501100008462","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>\n                    The traditional A\u2009\n                    <jats:sup>\u2217<\/jats:sup>\n                    algorithm has problems such as low search speed and huge expansion nodes, resulting in low algorithm efficiency. This article proposes a circular arc distance calculation method in the heuristic function, which combines the Euclidean distance and the Manhattan distance as radius, uses a deviation distance as the correction, and assignes dynamic weights to the combined distance to make the overall heuristic function cost close to reality. Furthermore, the repulsive potential field function and turning cost are introduced into the heuristic function, to consider the relative position of obstacles while minimizing turns in the path. In order to reduce the comparison of nodes with similar cost values, the bounded suboptimal method is used, and the idea of simulated annealing is introduced to overcome the local optima trapped by node expansion. Simulation experiments show that the average running time of the improved algorithm has decreased by about 70%, the number of extended nodes has decreased by 92%, and the path has also been shortened, proving the effectiveness of the algorithm improvement.\n                  <\/jats:p>","DOI":"10.1155\/int\/5979509","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T22:56:21Z","timestamp":1741733781000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved A\u2009\n                    <sup>\u2217<\/sup>\n                    Algorithm Based on Simulated Annealing and Multidistance Heuristic Function"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0414-6499","authenticated-orcid":false,"given":"Yuandong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jinhao","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Zeyang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yuchen","family":"Gou","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Jiang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8660-9700","authenticated-orcid":false,"given":"Dewang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.8064"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1177\/17298814211019222"},{"key":"e_1_2_11_3_2","first-page":"94","article-title":"Mobile Robot Path Planning Based on an Improved A\u2217 Algorithm","volume":"44","author":"Sun W.","year":"2017","journal-title":"Journal of Hunan University"},{"key":"e_1_2_11_4_2","first-page":"2941","article-title":"Intelligent Vehicle Motion Planning Based on Improved RRT \u2217 and Driving Trajectory Optimization","volume":"48","author":"Yuan J.","year":"2022","journal-title":"Journal of Automation"},{"key":"e_1_2_11_5_2","first-page":"1","article-title":"Robot Path Planning Based on Improved Potential Field Method","author":"Wang B.","year":"2022","journal-title":"Computer Science"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.8095"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.3390\/s24062011"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6140"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.8120"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.3390\/app131810326"},{"key":"e_1_2_11_11_2","unstructured":"GeH. YingZ. ChenZ. ZuW. LiuC. andJinY. Improved A\u2217Algorithm for Path Planning of Spherical Robot Considering Energy Consumption Sensors 16."},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2019.00015"},{"key":"e_1_2_11_13_2","doi-asserted-by":"crossref","unstructured":"WenB. LiJ. PanZ. andYuR. Improved A-Star Algorithm for Mobile Robot Path Planning Based on Sixteen-Direction Search 2022 China Automation Congress (CAC) 2022 Xiamen China 1332\u20131336.","DOI":"10.1109\/CAC57257.2022.10055356"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122313"},{"key":"e_1_2_11_15_2","unstructured":"YaoD. SanH. WangY. SunH. andChenJ. Research on Improvement of A\u2217Algorithm in Mobile Robot Path Planning [J\/OL] Journal of System Simulation 1\u201316."},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1142\/s0218001424560123"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1108\/aa-07-2020-0095"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3179397"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/app142210097"},{"key":"e_1_2_11_20_2","article-title":"Probably Bounded Suboptimal Heuristic Search","author":"Stern R.","year":"2018","journal-title":"Artificial Intelligence"},{"key":"e_1_2_11_21_2","first-page":"383","article-title":"Path Planning Based on Map Preprocessing and Improved A\u223c\u2217 Algorithm","volume":"30","author":"Yu W.","year":"2020","journal-title":"High tech Communication"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2670\/1\/012011"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.3390\/s23084102"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0263841"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2023.104430"},{"key":"e_1_2_11_26_2","article-title":"Global Path Planning Based on a Bidir Ectional Alternating Search A\u2217 Algorithm for Mo Bile Robots","author":"Li C.","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"e_1_2_11_27_2","first-page":"486","article-title":"Research on Global Path Planning of Mobile Robots with Improved A \u2217 Algorithm","volume":"40","author":"Zhi C.","year":"2023","journal-title":"Computer Simulation"},{"key":"e_1_2_11_28_2","article-title":"Research on Global Path Planning Algorithm for Mobile Robots Based on Improved A\u2217","author":"Xing Xu","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.egyr.2021.09.137"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.4271\/10-08-01-0001"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110797"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2022.101755"},{"key":"e_1_2_11_33_2","first-page":"132","article-title":"Research on Robot Random Obstacle Avoidance Method Based on the Fusion of Improved A\u223c\u2217 Algorithm and Dynamic Window Method","volume":"42","author":"Chi Xu","year":"2021","journal-title":"Journal of Instrumentation"},{"key":"e_1_2_11_34_2","doi-asserted-by":"publisher","DOI":"10.3934\/mbe.2023846"},{"key":"e_1_2_11_35_2","first-page":"42","article-title":"Robot Path Planning by Integrating Improved A\u223c\u2217 and TEB Algorithms","author":"Gao X.","year":"2023","journal-title":"Combination Machine Tool and Automation Processing Technology"},{"key":"e_1_2_11_36_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2637\/1\/012008"},{"key":"e_1_2_11_37_2","doi-asserted-by":"publisher","DOI":"10.14569\/ijacsa.2023.0140655"},{"key":"e_1_2_11_38_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2330\/1\/012003"},{"key":"e_1_2_11_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101844"},{"key":"e_1_2_11_40_2","first-page":"197","article-title":"Research on Dynamic Path Planning Algorithm Combining Optimization A\u223c\u2217 Algorithm and Dynamic Window Method","volume":"36","author":"Yao J.","year":"2022","journal-title":"Journal of Chongqing University of Technology (Natural Science)"},{"key":"e_1_2_11_41_2","first-page":"2021","article-title":"Unmanned Vehicle Path Planning Based on Improved A\u223c\u2217 Algorithm","volume":"40","author":"Qi X.","year":"2020","journal-title":"Computer Applications"},{"key":"e_1_2_11_42_2","doi-asserted-by":"publisher","DOI":"10.3390\/wevj14080213"},{"key":"e_1_2_11_43_2","doi-asserted-by":"publisher","DOI":"10.3390\/app122010601"},{"key":"e_1_2_11_44_2","first-page":"136","article-title":"Application of D\u2217Lite Algorithm in Shopping Mall Robot Navigation","volume":"50","author":"Huang Xu","year":"2024","journal-title":"Computer Networks"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/5979509","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/int\/5979509","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/5979509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T18:02:01Z","timestamp":1772992921000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/int\/5979509"}},"subtitle":[],"editor":[{"given":"Said","family":"El Kafhali","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/int\/5979509"],"URL":"https:\/\/doi.org\/10.1155\/int\/5979509","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-08-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5979509"}}