{"id":"https://openalex.org/W2241553860","doi":"https://doi.org/10.1109/tro.2016.2593448","title":"Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics","display_name":"Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics","publication_year":2016,"publication_date":"2016-08-10","ids":{"openalex":"https://openalex.org/W2241553860","doi":"https://doi.org/10.1109/tro.2016.2593448","mag":"2241553860"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2016.2593448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2016.2593448","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"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 Robotics","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/A5076210154","display_name":"Jingjin Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Computer Science, Rutgers University, New Brunswick, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104734","display_name":"Steven M. LaValle","orcid":"https://orcid.org/0000-0003-4841-2584"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. LaValle","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.5957,"has_fulltext":false,"cited_by_count":343,"citation_normalized_percentile":{"value":0.99094234,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"32","issue":"5","first_page":"1163","last_page":"1177"},"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/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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9868000149726868,"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/heuristics","display_name":"Heuristics","score":0.8056369423866272},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.650027871131897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5651630163192749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5637570023536682},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5507814884185791},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.48076316714286804},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4677121043205261},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4608428478240967},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4542631506919861},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45342516899108887},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.42528820037841797},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41732925176620483},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41620147228240967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.274597704410553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2592701315879822},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.22091639041900635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20317405462265015},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16772183775901794},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1415438950061798}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8056369423866272},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.650027871131897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5651630163192749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5637570023536682},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5507814884185791},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.48076316714286804},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4677121043205261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4608428478240967},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4542631506919861},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45342516899108887},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.42528820037841797},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41732925176620483},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41620147228240967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.274597704410553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2592701315879822},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.22091639041900635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20317405462265015},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16772183775901794},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1415438950061798},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tro.2016.2593448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2016.2593448","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"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 Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2676221204","display_name":"NRI: Large: Collaborative Research: Human-robot Coordinated Manipulation and Transportation of Large Objects","funder_award_id":"1328018","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":88,"referenced_works":["https://openalex.org/W93645818","https://openalex.org/W101508493","https://openalex.org/W125001008","https://openalex.org/W126122642","https://openalex.org/W257667390","https://openalex.org/W599055196","https://openalex.org/W784387389","https://openalex.org/W964554611","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1530765895","https://openalex.org/W1549280300","https://openalex.org/W1551562380","https://openalex.org/W1753742327","https://openalex.org/W1964462572","https://openalex.org/W1973396716","https://openalex.org/W1977545325","https://openalex.org/W1986164452","https://openalex.org/W1989234747","https://openalex.org/W1997417333","https://openalex.org/W2004815408","https://openalex.org/W2005079828","https://openalex.org/W2007193228","https://openalex.org/W2032894041","https://openalex.org/W2034604437","https://openalex.org/W2048036606","https://openalex.org/W2076171427","https://openalex.org/W2086807633","https://openalex.org/W2091364465","https://openalex.org/W2105932936","https://openalex.org/W2109835212","https://openalex.org/W2117701425","https://openalex.org/W2119098384","https://openalex.org/W2119120935","https://openalex.org/W2124015815","https://openalex.org/W2128453677","https://openalex.org/W2135939055","https://openalex.org/W2136323427","https://openalex.org/W2136644454","https://openalex.org/W2139369541","https://openalex.org/W2140994944","https://openalex.org/W2142943472","https://openalex.org/W2152754876","https://openalex.org/W2153159477","https://openalex.org/W2153239294","https://openalex.org/W2154571828","https://openalex.org/W2157411165","https://openalex.org/W2158400962","https://openalex.org/W2158883244","https://openalex.org/W2163502413","https://openalex.org/W2166462345","https://openalex.org/W2167451681","https://openalex.org/W2167979940","https://openalex.org/W2168958225","https://openalex.org/W2169240708","https://openalex.org/W2169742265","https://openalex.org/W2212839140","https://openalex.org/W2241357751","https://openalex.org/W2261103830","https://openalex.org/W2399153727","https://openalex.org/W2404271123","https://openalex.org/W2611243847","https://openalex.org/W2795123157","https://openalex.org/W2914296650","https://openalex.org/W2952264750","https://openalex.org/W2963309123","https://openalex.org/W2963358853","https://openalex.org/W2964211993","https://openalex.org/W2987233852","https://openalex.org/W4213060235","https://openalex.org/W4214629267","https://openalex.org/W4240374930","https://openalex.org/W4242811155","https://openalex.org/W4244044799","https://openalex.org/W6603775515","https://openalex.org/W6622510454","https://openalex.org/W6625145268","https://openalex.org/W6631783260","https://openalex.org/W6632662516","https://openalex.org/W6632973643","https://openalex.org/W6680300789","https://openalex.org/W6688296104","https://openalex.org/W6692580413","https://openalex.org/W6712589207","https://openalex.org/W6713083276","https://openalex.org/W6750112065","https://openalex.org/W6758754608","https://openalex.org/W6764488352"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W1996877776"],"abstract_inverted_index":{"We":[0],"study":[1],"optimal":[2,55,107],"multirobot":[3],"path":[4],"planning":[5],"on":[6,48,78],"graphs":[7],"(MPP)":[8],"over":[9,94],"four":[10,98],"minimization":[11],"objectives:":[12],"the":[13,18,23,28,97,132,140,146,160,168,182],"makespan":[14,108],"(last":[15],"arrival":[16,25],"time),":[17],"maximum":[19],"(single-robot":[20],"traveled)":[21],"distance,":[22],"total":[24,29],"time,":[26],"and":[27,39,70,81,89,159],"distance.":[30],"Having":[31],"established":[32],"previously":[33],"that":[34,113],"these":[35,54,136],"objectives":[36],"are":[37],"distinct":[38],"NP-hard":[40],"to":[41,163],"optimize,":[42],"in":[43,181,185],"this":[44,59,79],"paper,":[45],"we":[46,61,86,129],"focus":[47],"efficient":[49],"algorithmic":[50],"solutions":[51,109,172],"for":[52,92,105,173],"solving":[53,117],"MPP":[56,69],"problems.":[57],"Toward":[58],"goal,":[60],"first":[62,112],"establish":[63],"a":[64,71,111],"one-to-one":[65],"solution":[66],"mapping":[67],"between":[68],"special":[72],"type":[73],"of":[74,96,116,135,142,148,154,170,177],"multiflow":[75],"network.":[76],"Based":[77],"equivalence":[80],"integer":[82],"linear":[83],"programming":[84],"(ILP),":[85],"design":[87],"novel":[88],"complete":[90],"algorithms":[91,138,158],"optimizing":[93],"each":[95],"objectives.":[99],"In":[100],"particular,":[101],"our":[102],"exact":[103,137],"algorithm":[104],"computing":[106],"is":[110,114],"capable":[115],"extremely":[118],"challenging":[119],"problems":[120,174],"with":[121],"robot-vertex":[122],"ratios":[123],"as":[124,126],"high":[125],"100%.":[127],"Then,":[128],"further":[130],"improve":[131],"computational":[133],"performance":[134],"through":[139],"introduction":[141],"principled":[143],"heuristics,":[144],"at":[145],"expense":[147],"slight":[149],"optimality":[150],"loss.":[151],"The":[152],"combination":[153],"ILP":[155],"model":[156],"based":[157],"heuristics":[161],"proves":[162],"be":[164],"highly":[165],"effective,":[166],"allowing":[167],"computation":[169],"1.x-optimal":[171],"containing":[175],"hundreds":[176],"robots,":[178],"densely":[179],"populated":[180],"environment,":[183],"often":[184],"just":[186],"seconds.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":38},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":42},{"year":2022,"cited_by_count":48},{"year":2021,"cited_by_count":47},{"year":2020,"cited_by_count":42},{"year":2019,"cited_by_count":36},{"year":2018,"cited_by_count":22},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}