{"id":"https://openalex.org/W2167050241","doi":"https://doi.org/10.1109/icra.2011.5979995","title":"The multi-robot coverage problem for optimal coordinated search with an unknown number of robots","display_name":"The multi-robot coverage problem for optimal coordinated search with an unknown number of robots","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2167050241","doi":"https://doi.org/10.1109/icra.2011.5979995","mag":"2167050241"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5979995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","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/A5091209975","display_name":"Hyeun Jeong Min","orcid":"https://orcid.org/0000-0002-9033-7023"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hyeun Jeong Min","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109170958","display_name":"Nikolaos Papanikolopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaos Papanikolopoulos","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4628,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84570553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2866","last_page":"2871"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9984999895095825,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9944000244140625,"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.8821386694908142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.610897421836853},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5331202149391174},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.52286696434021},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5097417235374451},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4314213693141937},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4151843190193176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3634573519229889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26982569694519043},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23743104934692383},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11426231265068054}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.8821386694908142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.610897421836853},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5331202149391174},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.52286696434021},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5097417235374451},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4314213693141937},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4151843190193176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3634573519229889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26982569694519043},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23743104934692383},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11426231265068054},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2011.5979995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1966028333","https://openalex.org/W1990184358","https://openalex.org/W1996902553","https://openalex.org/W2101894691","https://openalex.org/W2143987816","https://openalex.org/W2153114207","https://openalex.org/W2155183030","https://openalex.org/W2167353639","https://openalex.org/W2292279207","https://openalex.org/W6684794184"],"related_works":["https://openalex.org/W4232403550","https://openalex.org/W623607250","https://openalex.org/W4245429118","https://openalex.org/W4205110281","https://openalex.org/W4212927854","https://openalex.org/W4211151614","https://openalex.org/W4244798043","https://openalex.org/W2122871747","https://openalex.org/W2070875930","https://openalex.org/W3114279067"],"abstract_inverted_index":{"This":[0,41],"work":[1],"presents":[2,44],"a":[3,32,74,130],"novel":[4],"multi-robot":[5],"coverage":[6,101,119,132],"scheme":[7],"for":[8,73],"an":[9],"unknown":[10],"number":[11,19,34,70,106,124,145],"of":[12,20,35,46,56,71,85,94,107,125,146],"robots;":[13],"it":[14],"focuses":[15],"on":[16,135],"optimizing":[17],"the":[18,38,53,59,68,80,90,105,117,123,137,144],"robots":[21,36,72,87,108,147],"and":[22,148],"each":[23],"path":[24],"cost.":[25],"Coverage":[26],"problems":[27],"traditionally":[28],"deal":[29],"with":[30],"how":[31,50,65,114],"given":[33,75],"covers":[37],"entire":[39],"environment.":[40],"work,":[42],"however,":[43],"solutions":[45],"not":[47],"only":[48],"(i)":[49],"to":[51,66,115,142],"cover":[52],"area":[54],"(locations":[55],"interest)":[57],"within":[58],"minimum":[60,100,118],"time,":[61],"but":[62,82],"simultaneously":[63],"(ii)":[64],"find":[67,116],"optimal":[69],"time.":[76],"Also,":[77],"we":[78,128],"consider":[79],"worst":[81],"realistic":[83],"case":[84],"all":[86],"starting":[88],"at":[89],"same":[91],"location":[92],"instead":[93],"assuming":[95],"randomly":[96],"initialized":[97],"positions.":[98],"The":[99],"time":[102,120],"depends":[103],"upon":[104],"used.":[109],"Our":[110],"research":[111],"specifies":[112],"(iii)":[113],"without":[121],"knowing":[122],"robots.":[126],"Finally,":[127],"present":[129],"deterministic":[131],"algorithm":[133],"based":[134],"finding":[136],"shortest":[138],"paths":[139],"in":[140],"order":[141],"optimize":[143],"corresponding":[149],"paths.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}