{"id":"https://openalex.org/W2605824764","doi":"https://doi.org/10.1080/0952813x.2017.1310142","title":"DiMPP: a complete distributed algorithm for multi-agent path planning","display_name":"DiMPP: a complete distributed algorithm for multi-agent path planning","publication_year":2017,"publication_date":"2017-04-13","ids":{"openalex":"https://openalex.org/W2605824764","doi":"https://doi.org/10.1080/0952813x.2017.1310142","mag":"2605824764"},"language":"en","primary_location":{"id":"doi:10.1080/0952813x.2017.1310142","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2017.1310142","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental &amp; Theoretical Artificial Intelligence","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/A5052776282","display_name":"Satyendra Singh Chouhan","orcid":"https://orcid.org/0000-0002-0280-7364"},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Satyendra Singh Chouhan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India","institution_ids":["https://openalex.org/I154851008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049887458","display_name":"Rajdeep Niyogi","orcid":"https://orcid.org/0000-0003-1664-4882"},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajdeep Niyogi","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India","institution_ids":["https://openalex.org/I154851008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052776282"],"corresponding_institution_ids":["https://openalex.org/I154851008"],"apc_list":null,"apc_paid":null,"fwci":0.5412,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.74818084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"29","issue":"6","first_page":"1129","last_page":"1148"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9983999729156494,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9973999857902527,"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/computer-science","display_name":"Computer science","score":0.8575125932693481},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5781195163726807},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5736233592033386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42285069823265076},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3526259958744049},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3321758508682251},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.10880550742149353},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08728855848312378}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8575125932693481},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5781195163726807},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5736233592033386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42285069823265076},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3526259958744049},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3321758508682251},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10880550742149353},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08728855848312378}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0952813x.2017.1310142","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2017.1310142","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental &amp; Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W92902385","https://openalex.org/W119150805","https://openalex.org/W177987302","https://openalex.org/W1551562380","https://openalex.org/W1607355011","https://openalex.org/W1614580925","https://openalex.org/W1659382545","https://openalex.org/W1739646785","https://openalex.org/W1777366632","https://openalex.org/W1989407213","https://openalex.org/W2007193228","https://openalex.org/W2039107569","https://openalex.org/W2050078488","https://openalex.org/W2072839015","https://openalex.org/W2082845025","https://openalex.org/W2100695938","https://openalex.org/W2109932483","https://openalex.org/W2122277562","https://openalex.org/W2123030512","https://openalex.org/W2124015815","https://openalex.org/W2135125135","https://openalex.org/W2136644454","https://openalex.org/W2155992093","https://openalex.org/W2158883244","https://openalex.org/W2164060583","https://openalex.org/W2166462345","https://openalex.org/W2167451681","https://openalex.org/W2189809649","https://openalex.org/W2238914755","https://openalex.org/W2293119400","https://openalex.org/W2293971009","https://openalex.org/W2408746829","https://openalex.org/W2775798521","https://openalex.org/W2914296650"],"related_works":["https://openalex.org/W4313288939","https://openalex.org/W3089420797","https://openalex.org/W2329866592","https://openalex.org/W16307331","https://openalex.org/W2356567870","https://openalex.org/W3082883870","https://openalex.org/W2392092446","https://openalex.org/W2371529414","https://openalex.org/W2978447330","https://openalex.org/W4309225961"],"abstract_inverted_index":{"Multi-agent":[0],"path":[1,115],"planning":[2],"(MAPP)":[3],"is":[4,26,102,126,151,183],"a":[5,20,34,134,145],"challenging":[6],"task":[7],"that":[8,108,163,189],"aims":[9],"to":[10,32,132],"find":[11,42,133],"conflict":[12],"free":[13],"paths":[14,43,51],"for":[15],"all":[16],"the":[17,29,57,61,85,91,168,178],"agents":[18,46,75,89],"in":[19,90,99,110,167],"given":[21],"domain.":[22],"Priority-based":[23],"decoupled":[24,63],"approach":[25],"one":[27],"of":[28,44,56,60,88,94,170,185,190],"several":[30],"approaches":[31,64],"solve":[33],"MAPP":[35],"problem.":[36],"It":[37],"works":[38,109],"as":[39],"follows:":[40],"first,":[41],"individual":[45,114],"and":[47,79,120],"then":[48],"restructure":[49],"these":[50,95],"based":[52],"on":[53,157],"some":[54,158,191],"priority":[55,118],"agents.":[58],"Most":[59],"existing":[62,104,192],"use":[65],"centralised":[66,193],"algorithms.":[67,194],"However,":[68,124],"multi-agent":[69],"systems":[70],"are":[71,97],"inherently":[72],"distributed,":[73],"where":[74],"have":[76],"limited":[77],"information":[78],"each":[80],"agent":[81],"may":[82,130],"not":[83],"know":[84],"total":[86],"number":[87,169],"system.":[92],"Some":[93],"aspects":[96],"incorporated":[98],"DMAPP.":[100],"DMAPP":[101,125,129,166],"an":[103],"fully":[105],"distributed":[106,147],"algorithm":[107,148],"three":[111],"phases:":[112],"(i)":[113],"planning,":[116],"(ii)":[117],"decision-making":[119],"(iii)":[121],"plan":[122],"restructuring.":[123],"incomplete,":[127],"i.e.":[128],"fail":[131],"solution,":[135],"even":[136],"if":[137],"it":[138],"exists.":[139],"In":[140],"this":[141],"paper,":[142],"we":[143],"present":[144],"new":[146],"(DiMPP)":[149],"which":[150],"complete.":[152],"The":[153],"computer":[154],"simulations":[155],"performed":[156],"well-known":[159],"benchmark":[160],"domains":[161],"reveal":[162],"DiMPP":[164,182],"outperforms":[165],"problem":[171,176],"instances":[172],"solved.":[173],"For":[174],"larger":[175],"instances,":[177],"time":[179],"taken":[180],"by":[181],"orders":[184],"magnitude":[186],"less":[187],"than":[188]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
