{"id":"https://openalex.org/W4406612954","doi":"https://doi.org/10.1109/smc54092.2024.10831827","title":"Augmenting Particle Swarm Optimization with Simulated Annealing and Dimensional Learning for UAVs Path Planning","display_name":"Augmenting Particle Swarm Optimization with Simulated Annealing and Dimensional Learning for UAVs Path Planning","publication_year":2024,"publication_date":"2024-10-06","ids":{"openalex":"https://openalex.org/W4406612954","doi":"https://doi.org/10.1109/smc54092.2024.10831827"},"language":"en","primary_location":{"id":"doi:10.1109/smc54092.2024.10831827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc54092.2024.10831827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100440058","display_name":"Jie Wei","orcid":"https://orcid.org/0000-0002-2436-3768"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Wei","raw_affiliation_strings":["School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China","institution_ids":["https://openalex.org/I2799850029"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100624916","display_name":"Yuhui Zhang","orcid":"https://orcid.org/0000-0002-5769-3456"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuhui Zhang","raw_affiliation_strings":["School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China","institution_ids":["https://openalex.org/I2799850029"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062578677","display_name":"Wenhong Wei","orcid":"https://orcid.org/0000-0002-0881-459X"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenhong Wei","raw_affiliation_strings":["School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Dongguan University of Technology,Dongguan,China","institution_ids":["https://openalex.org/I2799850029"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5311,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8474374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3721","last_page":"3726"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.967199981212616,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9652000069618225,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7531634569168091},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7108298540115356},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6226677298545837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6224812865257263},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5836988687515259},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4793580174446106},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3253090977668762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2919372320175171},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1754235327243805},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08306145668029785}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7531634569168091},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7108298540115356},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6226677298545837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6224812865257263},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5836988687515259},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4793580174446106},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3253090977668762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2919372320175171},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1754235327243805},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08306145668029785},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc54092.2024.10831827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc54092.2024.10831827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2020088087","https://openalex.org/W2020516535","https://openalex.org/W2024060531","https://openalex.org/W2102213208","https://openalex.org/W2479723776","https://openalex.org/W2510642710","https://openalex.org/W3003100621","https://openalex.org/W3025350644","https://openalex.org/W3040469843","https://openalex.org/W3149784096","https://openalex.org/W3151306683","https://openalex.org/W3164419039","https://openalex.org/W4293027896","https://openalex.org/W4295185430","https://openalex.org/W4319721356","https://openalex.org/W4386189528","https://openalex.org/W4387846679"],"related_works":["https://openalex.org/W2546046681","https://openalex.org/W1965569281","https://openalex.org/W2363850205","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W4327850430","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583"],"abstract_inverted_index":{"In":[0],"order":[1],"to":[2,56,79,91,106,132,197],"mitigate":[3],"premature":[4],"convergence":[5,101,170,191],"commonly":[6],"faced":[7],"by":[8],"conventional":[9],"Particle":[10],"Swarm":[11],"Optimization":[12],"(PSO)":[13],"and":[14,34,46,63,87,193],"enhance":[15,88,156],"the":[16,53,67,75,81,93,99,108,115,137,147,152,157,168],"algorithm's":[17],"global":[18,61,94,138],"search":[19,54,77,116],"cparticles":[20],"can":[21],"swiftly":[22],"navigatingapability":[23],"in":[24,52,74,114,146,177,186],"UAV":[25],"path":[26],"planning,":[27],"this":[28],"paper":[29],"proposes":[30],"a":[31,58,120],"simulated":[32,68],"annealing":[33,69],"dimensional":[35,121],"learning":[36,44,122],"augmented":[37],"particle":[38,111,131],"swarm":[39],"optimization":[40,189],"algorithm":[41,71,82,153],"(SDPSO).":[42],"Firstly,":[43],"factors":[45],"inertia":[47],"weights":[48],"are":[49],"dynamically":[50],"adjusted":[51],"process":[55],"achieve":[57],"balance":[59],"between":[60],"exploration":[62],"local":[64,85,163],"exploitation.":[65],"Subsequently,":[66],"(SA)":[70],"is":[72],"utilized":[73],"early":[76],"phase":[78],"help":[80],"escape":[83],"from":[84,136,162],"optima":[86],"its":[89],"ability":[90],"discover":[92],"optimal":[95],"solution,":[96],"while":[97],"retaining":[98],"fast":[100],"characteristic":[102,171],"of":[103,110,129,151,159,172,188],"PSO.":[104,173],"Moreover,":[105],"rectify":[107],"challenge":[109],"oscillation":[112],"appeared":[113],"process,":[117],"SDPSO":[118,183],"embeds":[119],"strategy":[123],"(DLS),":[124],"which":[125],"enables":[126],"all":[127],"dimensions":[128],"each":[130],"learn":[133],"useful":[134],"information":[135],"optimal.":[139],"Experimental":[140],"results":[141],"demonstrate":[142],"that":[143,182],"incorporating":[144],"SA":[145],"first":[148],"30":[149],"iterations":[150],"not":[154],"only":[155],"capability":[158],"jumping":[160],"out":[161],"optima,":[164],"but":[165],"also":[166],"maintains":[167],"rapid":[169],"Comparative":[174],"experiments":[175],"conducted":[176],"two":[178],"distinct":[179],"environments":[180],"reveal":[181],"exhibits":[184],"advantages":[185],"terms":[187],"capability,":[190],"rate,":[192],"robustness":[194],"when":[195],"compared":[196],"other":[198],"algorithms.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}