{"id":"https://openalex.org/W2209227950","doi":"https://doi.org/10.1109/iros.2015.7354108","title":"Tight analysis of a collisionless robot gathering algorithm","display_name":"Tight analysis of a collisionless robot gathering algorithm","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2209227950","doi":"https://doi.org/10.1109/iros.2015.7354108","mag":"2209227950"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2015.7354108","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7354108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5002981812","display_name":"Gokarna Sharma","orcid":"https://orcid.org/0000-0002-4930-4609"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gokarna Sharma","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044907189","display_name":"Costas Busch","orcid":"https://orcid.org/0000-0002-4381-4333"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Costas Busch","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101963514","display_name":"Supratik Mukhopadhyay","orcid":"https://orcid.org/0000-0003-0839-1133"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Supratik Mukhopadhyay","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071018387","display_name":"Charles Malveaux","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles Malveaux","raw_affiliation_strings":["Department of Biological and Agricultural Engineering, Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biological and Agricultural Engineering, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5002981812"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":0.338,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66852375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"5189","last_page":"5194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9853000044822693,"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/robot","display_name":"Robot","score":0.7420490980148315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6744951605796814},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6180465221405029},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6046068668365479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5539118051528931},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.538052499294281},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49631744623184204},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48862701654434204},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.45476749539375305},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4102744162082672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30356526374816895},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1756400763988495}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7420490980148315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6744951605796814},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6180465221405029},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6046068668365479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5539118051528931},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.538052499294281},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49631744623184204},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48862701654434204},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.45476749539375305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4102744162082672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30356526374816895},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1756400763988495},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2015.7354108","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7354108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.lsu.edu:enviro_sciences_pubs-1412","is_oa":false,"landing_page_url":"https://repository.lsu.edu/enviro_sciences_pubs/413","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W23804730","https://openalex.org/W119243154","https://openalex.org/W161919772","https://openalex.org/W1480113909","https://openalex.org/W1483270512","https://openalex.org/W1485100503","https://openalex.org/W1518703065","https://openalex.org/W1567376369","https://openalex.org/W1569673105","https://openalex.org/W1588762506","https://openalex.org/W1597541823","https://openalex.org/W1878407411","https://openalex.org/W1968094522","https://openalex.org/W1970322539","https://openalex.org/W2009908058","https://openalex.org/W2024735613","https://openalex.org/W2025085543","https://openalex.org/W2040689398","https://openalex.org/W2041571902","https://openalex.org/W2063318377","https://openalex.org/W2063986067","https://openalex.org/W2066466105","https://openalex.org/W2077415032","https://openalex.org/W2087407707","https://openalex.org/W2097569568","https://openalex.org/W2114943830","https://openalex.org/W2119517221","https://openalex.org/W2127843168","https://openalex.org/W2144182788","https://openalex.org/W2152272732","https://openalex.org/W2158669326","https://openalex.org/W4241185047","https://openalex.org/W4285719527","https://openalex.org/W6647435730"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1966261337"],"abstract_inverted_index":{"We":[0,150],"consider":[1],"the":[2,13,42,88,92,100,117,120,126,135,185,196],"fundamental":[3],"problem":[4,57,93,110,163],"of":[5,9,91,138,158,198,210],"gathering":[6,52,127],"a":[7,18,36,50,76,81,206],"set":[8],"n":[10,159],"robots":[11,43,95,160],"in":[12,60,80,111,161],"Euclidean":[14],"plane":[15],"which":[16],"have":[17],"physical":[19],"extent":[20],"and":[21,84],"hence":[22],"they":[23],"cannot":[24],"share":[25],"their":[26,106,139,211],"positions":[27,101],"with":[28],"other":[29],"robots.":[30],"The":[31],"objective":[32],"is":[33,116],"to":[34,40,99,125,141,188],"determine":[35],"minimum":[37],"time":[38],"schedule":[39],"gather":[41],"as":[44,47],"close":[45],"together":[46],"possible":[48],"around":[49],"predefined":[51],"point":[53],"avoiding":[54],"collisions.":[55],"This":[56],"has":[58],"applications":[59],"many":[61],"real":[62],"world":[63],"scenarios":[64],"including":[65],"fast":[66],"autonomous":[67],"coverage":[68],"formation.":[69],"Cord-Landwehr":[70,199],"et":[71,200],"al.":[72],"(SOFSEM":[73],"2011)":[74],"gave":[75],"local":[77,179],"greedy":[78,180],"algorithm":[79,107,140,197],"synchronous":[82],"setting":[83],"proved":[85],"that,":[86],"for":[87,195],"discrete":[89],"version":[90],"where":[94,114,164],"movements":[96],"are":[97,155,175],"restricted":[98],"on":[102],"an":[103],"integral":[104],"grid,":[105],"solves":[108],"this":[109,130,162],"O(nR)":[112],"rounds,":[113],"R":[115,142,167,189],"distance":[118],"from":[119],"farthest":[121],"initial":[122,156],"robot":[123],"position":[124],"point.":[128],"In":[129],"paper,":[131],"we":[132,183],"improve":[133,184],"significantly":[134],"round":[136],"complexity":[137],"+":[143,168,190],"2":[144,173],"\u00b7":[145],"(n":[146,169,191],"-":[147,170,192],"1)":[148,171,193],"rounds.":[149],"also":[151],"prove":[152],"that":[153],"there":[154],"configurations":[157],"at":[165],"least":[166],"over":[172],"rounds":[174,194],"needed":[176],"by":[177],"any":[178],"algorithm.":[181,212],"Furthermore,":[182],"lower":[186],"bound":[187],"al..":[201],"These":[202],"results":[203],"altogether":[204],"provide":[205],"tight":[207],"runtime":[208],"analysis":[209]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}