{"id":"https://openalex.org/W2963972190","doi":"https://doi.org/10.1109/lra.2015.2503143","title":"Intractability of Optimal Multirobot Path Planning on Planar Graphs","display_name":"Intractability of Optimal Multirobot Path Planning on Planar Graphs","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2963972190","doi":"https://doi.org/10.1109/lra.2015.2503143","mag":"2963972190"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2015.2503143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2015.2503143","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7282/t3bc41hn","any_repository_has_fulltext":true},"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":true,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Computer Science, Rutgers University at New Brunswick, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-4112-2250","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University at New Brunswick, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076210154"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":3.3187,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.93512826,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"1","issue":"1","first_page":"33","last_page":"40"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/planar","display_name":"Planar","score":0.706760585308075},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6960363984107971},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.611835241317749},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5988264083862305},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5927545428276062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5853021144866943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5526901483535767},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.5219609141349792},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5212103128433228},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4670138955116272},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43019339442253113},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4005950093269348},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38757577538490295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3209233283996582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3014032244682312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25964170694351196},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17045822739601135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06352850794792175}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.706760585308075},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6960363984107971},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.611835241317749},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5988264083862305},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5927545428276062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5853021144866943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5526901483535767},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.5219609141349792},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5212103128433228},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4670138955116272},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43019339442253113},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4005950093269348},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38757577538490295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3209233283996582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3014032244682312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25964170694351196},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17045822739601135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06352850794792175},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/lra.2015.2503143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2015.2503143","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11643391620004646","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:alma.01RUT_INST:11643391620004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/acceptedManuscript/Intractability-of-Optimal-Multi-Robot-Path-Planning/991031550023404646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.7282/t3bc41hn","is_oa":true,"landing_page_url":"https://doi.org/10.7282/t3bc41hn","pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7282/t3bc41hn","is_oa":true,"landing_page_url":"https://doi.org/10.7282/t3bc41hn","pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W126122642","https://openalex.org/W171273828","https://openalex.org/W196900508","https://openalex.org/W599055196","https://openalex.org/W1549280300","https://openalex.org/W1553182599","https://openalex.org/W1588299616","https://openalex.org/W1986164452","https://openalex.org/W1994442991","https://openalex.org/W2011039300","https://openalex.org/W2034604437","https://openalex.org/W2036722182","https://openalex.org/W2048036606","https://openalex.org/W2068796584","https://openalex.org/W2072839015","https://openalex.org/W2104969271","https://openalex.org/W2107874727","https://openalex.org/W2124015815","https://openalex.org/W2135939055","https://openalex.org/W2136644454","https://openalex.org/W2169528473","https://openalex.org/W2191404279","https://openalex.org/W2241357751","https://openalex.org/W2399153727","https://openalex.org/W2550873457","https://openalex.org/W2963309123","https://openalex.org/W6605146274","https://openalex.org/W6608015362","https://openalex.org/W6632662516","https://openalex.org/W6635555861","https://openalex.org/W6687175555","https://openalex.org/W6712589207"],"related_works":["https://openalex.org/W2125652721","https://openalex.org/W1540371141","https://openalex.org/W4231274751","https://openalex.org/W2154063878","https://openalex.org/W2556012038","https://openalex.org/W2333896121","https://openalex.org/W2583763619","https://openalex.org/W2145073242","https://openalex.org/W1570592793","https://openalex.org/W1489772951"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,25,38,44,65,73,82,87],"computational":[3,45],"complexity":[4],"of":[5,47,75,89],"optimally":[6],"solving":[7,69],"multirobot":[8,49],"path":[9,27,50],"planning":[10,51],"problems":[11,29,52],"on":[12,53,97],"planar":[13,54,83],"graphs.":[14],"For":[15],"four":[16],"common":[17],"time-":[18],"and":[19,108,115],"distance-based":[20],"objectives,":[21],"we":[22],"show":[23],"that":[24],"associated":[26],"optimization":[28],"for":[30],"multiple":[31],"robots":[32,76,92],"are":[33,111],"all":[34],"NP-complete,":[35],"even":[36],"when":[37,72],"underlying":[39],"graph":[40],"is":[41,77,79],"planar.":[42],"Establishing":[43],"intractability":[46],"optimal":[48],"graphs":[55],"has":[56],"important":[57],"practical":[58],"implications.":[59],"In":[60],"particular,":[61],"our":[62],"result":[63],"suggests":[64],"preferred":[66],"approach":[67],"toward":[68],"such":[70,101,105],"problems,":[71],"number":[74],"large,":[78],"to":[80,85],"augment":[81],"environment":[84],"reduce":[86],"sharing":[88],"paths":[90],"among":[91],"traveling":[93],"in":[94,113],"opposite":[95],"directions":[96],"those":[98],"paths.":[99],"Indeed,":[100],"efficiency":[102],"boosting":[103],"structures,":[104],"as":[106],"highways":[107],"elevated":[109],"intersections,":[110],"ubiquitous":[112],"robotics":[114],"transportation":[116],"applications.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}