{"id":"https://openalex.org/W2795484789","doi":"https://doi.org/10.1109/iros.2018.8594417","title":"SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee","display_name":"SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2795484789","doi":"https://doi.org/10.1109/iros.2018.8594417","mag":"2795484789"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2018.8594417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2018.8594417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5037243756","display_name":"Shuai D. Han","orcid":"https://orcid.org/0000-0001-7741-2378"},"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":"Shuai D. Han","raw_affiliation_strings":["Department of Computer Science\u2019 Rutgers, The State University of New Jersey, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science\u2019 Rutgers, The State University of New Jersey, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103802174","display_name":"Edgar J. Rodriguez","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edgar J. Rodriguez","raw_affiliation_strings":["Department of Mathematics, University of California Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","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\u2019 Rutgers, The State University of New Jersey, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science\u2019 Rutgers, The State University of New Jersey, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9983999729156494,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/robot","display_name":"Robot","score":0.6855186820030212},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.669333815574646},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5968260765075684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5900896787643433},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5772970914840698},{"id":"https://openalex.org/keywords/holonomic","display_name":"Holonomic","score":0.5717500448226929},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5693404078483582},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.560519278049469},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5368059277534485},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5118479132652283},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.505059540271759},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.4824402928352356},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4703880548477173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4244781732559204},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4171634316444397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2947884202003479},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1103588342666626}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6855186820030212},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.669333815574646},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5968260765075684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5900896787643433},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5772970914840698},{"id":"https://openalex.org/C2777964439","wikidata":"https://www.wikidata.org/wiki/Q5884201","display_name":"Holonomic","level":2,"score":0.5717500448226929},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5693404078483582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.560519278049469},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5368059277534485},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5118479132652283},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.505059540271759},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.4824402928352356},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4703880548477173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4244781732559204},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4171634316444397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2947884202003479},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1103588342666626},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2018.8594417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2018.8594417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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":63,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W125001008","https://openalex.org/W126122642","https://openalex.org/W196900508","https://openalex.org/W211895014","https://openalex.org/W784387389","https://openalex.org/W964554611","https://openalex.org/W1424654272","https://openalex.org/W1510564526","https://openalex.org/W1844237500","https://openalex.org/W1964462572","https://openalex.org/W1969483458","https://openalex.org/W1973189035","https://openalex.org/W1997417333","https://openalex.org/W1998716564","https://openalex.org/W2004815408","https://openalex.org/W2007193228","https://openalex.org/W2016374168","https://openalex.org/W2032894041","https://openalex.org/W2033013465","https://openalex.org/W2068796584","https://openalex.org/W2070224057","https://openalex.org/W2072839015","https://openalex.org/W2083721544","https://openalex.org/W2086807633","https://openalex.org/W2097639646","https://openalex.org/W2117701425","https://openalex.org/W2120633474","https://openalex.org/W2123030512","https://openalex.org/W2128453677","https://openalex.org/W2133067819","https://openalex.org/W2137952598","https://openalex.org/W2142943472","https://openalex.org/W2152754876","https://openalex.org/W2153239294","https://openalex.org/W2166462345","https://openalex.org/W2169240708","https://openalex.org/W2169742265","https://openalex.org/W2241553860","https://openalex.org/W2399153727","https://openalex.org/W2550873457","https://openalex.org/W2737066350","https://openalex.org/W2737170301","https://openalex.org/W2783094580","https://openalex.org/W2951033740","https://openalex.org/W2962769831","https://openalex.org/W2963358853","https://openalex.org/W2963972190","https://openalex.org/W2964093001","https://openalex.org/W2984170232","https://openalex.org/W2987233852","https://openalex.org/W4214629267","https://openalex.org/W4243386470","https://openalex.org/W6605146274","https://openalex.org/W6608015362","https://openalex.org/W6608555317","https://openalex.org/W6625145268","https://openalex.org/W6636642143","https://openalex.org/W6678131887","https://openalex.org/W6680300789","https://openalex.org/W6684436658","https://openalex.org/W6712589207","https://openalex.org/W6764488352"],"related_works":["https://openalex.org/W2391861012","https://openalex.org/W2488336788","https://openalex.org/W4285469493","https://openalex.org/W1593224248","https://openalex.org/W2080384954","https://openalex.org/W2375766869","https://openalex.org/W4382519933","https://openalex.org/W3151465598","https://openalex.org/W2368144149","https://openalex.org/W4386597929"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,15,62,65,81,89,92,113,119,145,153],"labeled":[3],"multi-robot":[4],"path":[5],"planning":[6],"problem":[7,93],"in":[8,14,33,59,97],"continuous":[9],"2D":[10],"and":[11,36,56,83],"3D":[12],"domains":[13],"absence":[16],"of":[17,31,80,112,149,156],"obstacles":[18],"where":[19],"robots":[20,32,151],"must":[21],"not":[22],"collide":[23],"with":[24,49],"each":[25],"other.":[26],"For":[27],"an":[28,123],"arbitrary":[29,34],"number":[30],"initial":[35,82],"goal":[37,84],"arrangements,":[38],"we":[39,106,130],"derive":[40],"a":[41,76,98,108,133],"polynomial":[42],"time,":[43],"complete":[44],"algorithm":[45,73],"that":[46,64,137],"produces":[47],"solutions":[48],"constant-factor":[50,78],"optimality":[51],"guarantees":[52],"on":[53,144],"both":[54],"makespan":[55],"distance":[57],"optimality,":[58],"expectation,":[60],"under":[61],"assumption":[63],"robot":[66],"labels":[67],"are":[68],"uniformly":[69],"randomly":[70],"distributed.":[71],"Our":[72],"only":[74],"requires":[75],"small":[77,100],"expansion":[79],"configuration":[85],"footprints":[86],"for":[87],"solving":[88],"problem,":[90],"i.e.,":[91],"can":[94],"be":[95],"solved":[96],"fairly":[99],"bounded":[101],"region.":[102],"Beside":[103],"theoretical":[104],"guarantees,":[105],"present":[107],"thorough":[109],"computational":[110],"evaluation":[111],"proposed":[114],"solution.":[115],"In":[116],"addition":[117],"to":[118],"baseline":[120],"implementation,":[121],"adapting":[122],"effective":[124],"(but":[125],"non-polynomial":[126],"time)":[127],"routing":[128],"subroutine,":[129],"also":[131],"provide":[132],"highly":[134],"efficient":[135],"implementation":[136],"quickly":[138],"computes":[139],"near-optimal":[140],"solutions.":[141],"Hardware":[142],"experiments":[143],"microMVP":[146],"platform":[147],"composed":[148],"non-holonomic":[150],"confirms":[152],"practical":[154],"applicability":[155],"our":[157],"algorithmic":[158],"pipeline.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}