{"id":"https://openalex.org/W4241981971","doi":"https://doi.org/10.1109/rcar.2017.8311901","title":"A new multi-robot path planning algorithm: Dynamic distributed particle swarm optimization","display_name":"A new multi-robot path planning algorithm: Dynamic distributed particle swarm optimization","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W4241981971","doi":"https://doi.org/10.1109/rcar.2017.8311901"},"language":"en","primary_location":{"id":"doi:10.1109/rcar.2017.8311901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcar.2017.8311901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Real-time Computing and Robotics (RCAR)","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/A5052342788","display_name":"Asma Ayari","orcid":"https://orcid.org/0000-0002-3805-6726"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Asma Ayari","raw_affiliation_strings":["Department of Information Technology in Northern Border University, KSA and also a member of COSMOS Lab. PICTENSI, Tunisia"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology in Northern Border University, KSA and also a member of COSMOS Lab. PICTENSI, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072960507","display_name":"Sadok Bouamama","orcid":"https://orcid.org/0000-0002-3840-3978"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sadok Bouamama","raw_affiliation_strings":["Department of Information Technology in Faculty of computing and information technology, Ex-Head and member of COSMOS Lab. PICT. ENSI, Tunisia"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology in Faculty of computing and information technology, Ex-Head and member of COSMOS Lab. PICT. ENSI, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052342788"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.091,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5313776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"437","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7286581993103027},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6426528096199036},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.6222712993621826},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6218259930610657},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.601858913898468},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5596480369567871},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5538121461868286},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5193363428115845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5158328413963318},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.46289294958114624},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4495833218097687},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.41066789627075195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40721139311790466},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3421279489994049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2912168502807617},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0654468834400177},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.061028361320495605}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7286581993103027},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6426528096199036},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.6222712993621826},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6218259930610657},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.601858913898468},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5596480369567871},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5538121461868286},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5193363428115845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5158328413963318},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.46289294958114624},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4495833218097687},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.41066789627075195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40721139311790466},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3421279489994049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2912168502807617},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0654468834400177},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.061028361320495605},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rcar.2017.8311901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcar.2017.8311901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Real-time Computing and Robotics (RCAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W188204312","https://openalex.org/W1574966963","https://openalex.org/W1593035080","https://openalex.org/W1933842034","https://openalex.org/W1980392184","https://openalex.org/W2024689109","https://openalex.org/W2033657248","https://openalex.org/W2038075364","https://openalex.org/W2040102577","https://openalex.org/W2048391069","https://openalex.org/W2109364787","https://openalex.org/W2120600560","https://openalex.org/W2135087848","https://openalex.org/W2149273661","https://openalex.org/W2150312211","https://openalex.org/W2152195021","https://openalex.org/W2162271170","https://openalex.org/W2185146726","https://openalex.org/W2235553398","https://openalex.org/W2417848255","https://openalex.org/W2484085037","https://openalex.org/W2546078121","https://openalex.org/W2908934755","https://openalex.org/W4236981972","https://openalex.org/W6686261612"],"related_works":["https://openalex.org/W2133833450","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W1972453571","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W1934426788","https://openalex.org/W4292862729"],"abstract_inverted_index":{"Multiple":[0],"Robot":[1],"Systems":[2],"(MRS)":[3],"has":[4],"become":[5],"a":[6,32],"major":[7],"study":[8],"concern":[9],"in":[10,53,64,71],"the":[11,24,65,123,127,147],"field":[12],"of":[13,26,51,102,131,142],"robotic":[14],"research.":[15],"Their":[16],"control":[17],"becomes":[18],"unreliable":[19],"and":[20,81,96,112,139],"even":[21],"infeasible":[22],"if":[23],"number":[25,101],"robots":[27,136],"increases.":[28],"In":[29],"this":[30],"paper,":[31],"new":[33],"dynamic":[34],"distributed":[35,148],"particle":[36],"swarm":[37],"optimization":[38],"(D":[39],"<sup":[40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[41,79,84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[42],"PSO)":[43],"algorithm":[44],"is":[45],"proposed":[46,68],"for":[47,61,99],"trajectory":[48],"path":[49,60],"planning":[50],"multi-robots":[52],"order":[54],"to":[55,91,122],"find":[56],"collision":[57],"free":[58],"optimal":[59],"each":[62],"robot":[63],"environment.":[66],"The":[67],"approach":[69,144],"consists":[70],"calculating":[72],"two":[73],"local":[74,113],"optima":[75,114],"detectors,":[76],"LOD":[77,82],"<sub":[78,83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">pBest</sub>":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">gBest</sub>":[85],".":[86],"Particles":[87],"which":[88],"are":[89,137],"unable":[90],"improve":[92],"their":[93],"personal":[94],"best":[95,98],"global":[97],"predefined":[100],"successive":[103],"iterations":[104],"would":[105,116],"be":[106,117],"replaced":[107],"with":[108,134,146],"restructured":[109],"ones.":[110],"Stagnation":[111],"problems":[115],"avoided":[118],"by":[119],"adding":[120],"diversity":[121],"population,":[124],"without":[125],"losing":[126],"fast":[128],"convergence":[129],"characteristic":[130],"PSO.":[132,149],"Experiments":[133],"multiple":[135],"provided":[138],"proved":[140],"effectiveness":[141],"such":[143],"compared":[145]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}