{"id":"https://openalex.org/W7124428828","doi":"https://doi.org/10.1109/tase.2026.3654174","title":"M2PP: Effective Path Planning Based on Multi-Phase Particle Swarm Optimization and Multi-Scenario Adaptative DWA","display_name":"M2PP: Effective Path Planning Based on Multi-Phase Particle Swarm Optimization and Multi-Scenario Adaptative DWA","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7124428828","doi":"https://doi.org/10.1109/tase.2026.3654174"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2026.3654174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2026.3654174","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-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/A5123229462","display_name":"Chao Li","orcid":null},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chao Li","raw_affiliation_strings":["Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123246777","display_name":"Hao Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Chen","raw_affiliation_strings":["Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123237578","display_name":"Jun Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Sun","raw_affiliation_strings":["Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123193048","display_name":"Wei Fang","orcid":null},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Fang","raw_affiliation_strings":["Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033573545","display_name":"Vasile Palade","orcid":null},"institutions":[{"id":"https://openalex.org/I73417466","display_name":"Coventry University","ror":"https://ror.org/01tgmhj36","country_code":"GB","type":"education","lineage":["https://openalex.org/I73417466"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vasile Palade","raw_affiliation_strings":["Centre for Computational Science and Mathematical Modelling, Coventry University, Coventry, U.K"],"affiliations":[{"raw_affiliation_string":"Centre for Computational Science and Mathematical Modelling, Coventry University, Coventry, U.K","institution_ids":["https://openalex.org/I73417466"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiaojun Wu","orcid":"https://orcid.org/0000-0002-0310-5778"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Wu","raw_affiliation_strings":["Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, Jiangsu, China","institution_ids":["https://openalex.org/I111599522"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5123229462"],"corresponding_institution_ids":["https://openalex.org/I111599522"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10827324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"2717","last_page":"2733"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9847999811172485,"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.9847999811172485,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.002199999988079071,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7961999773979187},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5896999835968018},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5540000200271606},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5145000219345093},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4244999885559082},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.3785000145435333},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3776000142097473},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.3736000061035156},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3725999891757965}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7961999773979187},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5896999835968018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5813999772071838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5570999979972839},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5540000200271606},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5145000219345093},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3776000142097473},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.3736000061035156},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3725999891757965},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.3098999857902527},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.28360000252723694},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.27639999985694885},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2606000006198883},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25769999623298645}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tase.2026.3654174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2026.3654174","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/0fe76e7e-96bd-4f5f-b5be-7531b383e19e","is_oa":false,"landing_page_url":"https://pureportal.coventry.ac.uk/en/publications/0fe76e7e-96bd-4f5f-b5be-7531b383e19e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402411","display_name":"Pure (Coventry University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I73417466","host_organization_name":"Coventry University","host_organization_lineage":["https://openalex.org/I73417466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, C, Chen, H, Sun, J, Fang, W, Palade, V & Wu, X 2026, 'M2PP: Effective Path Planning Based on Multi-Phase Particle Swarm Optimization and Multi-Scenario Adaptative DWA', IEEE Transactions on Automation Science and Engineering, vol. 23, pp. 2717-2733. https://doi.org/10.1109/tase.2026.3654174","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.40358179807662964,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4119518197","display_name":null,"funder_award_id":"BK20221068","funder_id":"https://openalex.org/F4320334982","funder_display_name":"Basic Research Program of Jiangsu Province"},{"id":"https://openalex.org/G4555050861","display_name":null,"funder_award_id":"61672263","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6112421292","display_name":null,"funder_award_id":"62272202","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7814660000","display_name":null,"funder_award_id":"62503198","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334982","display_name":"Basic Research Program of Jiangsu Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W1969483458","https://openalex.org/W2000359213","https://openalex.org/W2099441085","https://openalex.org/W2105934661","https://openalex.org/W2107941094","https://openalex.org/W2110250181","https://openalex.org/W2117211893","https://openalex.org/W2128990851","https://openalex.org/W2152195021","https://openalex.org/W2169528473","https://openalex.org/W2427601938","https://openalex.org/W2505308623","https://openalex.org/W2515498963","https://openalex.org/W2612102354","https://openalex.org/W2897315850","https://openalex.org/W2942307437","https://openalex.org/W2972467006","https://openalex.org/W3048293652","https://openalex.org/W3083466020","https://openalex.org/W3086651301","https://openalex.org/W3111873728","https://openalex.org/W3116367434","https://openalex.org/W3132433692","https://openalex.org/W3187936759","https://openalex.org/W3217061540","https://openalex.org/W4200114476","https://openalex.org/W4206945510","https://openalex.org/W4224300633","https://openalex.org/W4236251699","https://openalex.org/W4283386169","https://openalex.org/W4285189951","https://openalex.org/W4292258351","https://openalex.org/W4311757964","https://openalex.org/W4313531156","https://openalex.org/W4323339337","https://openalex.org/W4362664520","https://openalex.org/W4367839715","https://openalex.org/W4388010306","https://openalex.org/W4391589833","https://openalex.org/W4403859889","https://openalex.org/W4404198301"],"related_works":[],"abstract_inverted_index":{"To":[0,75,123],"address":[1,76],"the":[2,58,120,133,188],"challenge":[3],"of":[4],"autonomous":[5],"navigation":[6],"for":[7],"mobile":[8,194],"robots":[9],"in":[10,50,93,128,167,182],"complex":[11,169],"environments,":[12],"many":[13],"recent":[14],"path":[15,84],"planning":[16,32,55,85,91,135],"methods":[17],"employ":[18],"a":[19,107,129,192],"two-layer":[20],"motion":[21],"framework":[22],"that":[23,110,158],"integrates":[24,140],"both":[25,149],"global":[26,31,90,115],"and":[27,47,63,117,151,164,171,178],"local":[28,54,134,180],"planning.":[29],"However,":[30],"algorithms":[33,37],"based":[34],"on":[35,191],"evolutionary":[36],"often":[38],"yield":[39],"suboptimal":[40],"paths,":[41],"primarily":[42],"due":[43],"to":[44,69],"premature":[45],"convergence":[46],"wasted":[48],"iterations":[49],"infeasible":[51],"regions.":[52],"Meanwhile,":[53],"algorithms,":[56],"particularly":[57],"dynamic":[59,152],"window":[60],"approach":[61],"(DWA)":[62],"its":[64,145,198],"variants,":[65],"are":[66],"frequently":[67],"tailored":[68],"specific":[70],"scenarios,":[71,170],"limiting":[72],"their":[73],"generalizability.":[74],"these":[77],"issues,":[78],"this":[79],"paper":[80],"proposes":[81],"an":[82],"effective":[83],"method,":[86],"namely":[87],"M2PP.":[88],"The":[89],"algorithm":[92],"M2PP":[94,189],"enhances":[95],"particle":[96],"swarm":[97],"optimization":[98],"(PSO)":[99],"by":[100],"introducing":[101],"multiple":[102,126],"new":[103],"search":[104],"phases,":[105],"creating":[106],"multi-phase":[108,159],"PSO":[109,160],"can":[111,175],"quickly":[112],"identify":[113],"feasible":[114],"paths":[116],"thoroughly":[118],"explore":[119],"sampling":[121],"space.":[122],"effectively":[124],"handle":[125],"scenarios":[127],"more":[130],"generalized":[131],"manner,":[132],"component,":[136],"multi-scenario":[137,172],"adaptative":[138,173],"DWA,":[139],"two":[141],"novel":[142],"terms":[143],"into":[144],"cost":[146],"function,":[147],"enhancing":[148],"static":[150],"obstacle":[153],"avoidance.":[154],"Extensive":[155],"simulations":[156],"demonstrate":[157],"exhibits":[161],"strong":[162],"performance":[163],"robustness,":[165],"especially":[166],"highly":[168],"DWA":[174],"generate":[176],"safe":[177],"efficient":[179],"trajectories":[181],"hazardous":[183],"conditions.":[184],"Additionally,":[185],"experiments":[186],"deploying":[187],"method":[190],"real-world":[193],"robot":[195],"further":[196],"confirm":[197],"feasibility.":[199]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-17T00:00:00"}