{"id":"https://openalex.org/W2890332809","doi":"https://doi.org/10.1109/icra.2018.8461028","title":"How Many Robots are Enough: A Multi-Objective Genetic Algorithm for the Single-Objective Time-Limited Complete Coverage Problem","display_name":"How Many Robots are Enough: A Multi-Objective Genetic Algorithm for the Single-Objective Time-Limited Complete Coverage Problem","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2890332809","doi":"https://doi.org/10.1109/icra.2018.8461028","mag":"2890332809"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8461028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8461028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","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/A5101851239","display_name":"Xing Zhou","orcid":"https://orcid.org/0000-0001-6358-1621"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xing Zhou","raw_affiliation_strings":["College of Computer, National University of Defense Technology, P.R. China"],"affiliations":[{"raw_affiliation_string":"College of Computer, National University of Defense Technology, P.R. China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101522100","display_name":"Huaimin Wang","orcid":"https://orcid.org/0000-0002-3245-1901"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huaimin Wang","raw_affiliation_strings":["College of Computer, National University of Defense Technology, P.R. China"],"affiliations":[{"raw_affiliation_string":"College of Computer, National University of Defense Technology, P.R. China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088885490","display_name":"Bo Ding","orcid":"https://orcid.org/0000-0002-1236-8318"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Ding","raw_affiliation_strings":["College of Computer, National University of Defense Technology, P.R. China"],"affiliations":[{"raw_affiliation_string":"College of Computer, National University of Defense Technology, P.R. China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101851239"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.9401,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80834277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2380","last_page":"2387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.994700014591217,"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.9909999966621399,"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.75555419921875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6162235736846924},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5785486102104187},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5455966591835022},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.46235570311546326},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4601131081581116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.432422399520874},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42067837715148926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2764398157596588},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27283135056495667}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.75555419921875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6162235736846924},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5785486102104187},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5455966591835022},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.46235570311546326},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4601131081581116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.432422399520874},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42067837715148926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2764398157596588},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27283135056495667},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8461028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8461028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","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":21,"referenced_works":["https://openalex.org/W79646070","https://openalex.org/W1484715016","https://openalex.org/W1544032329","https://openalex.org/W1551617335","https://openalex.org/W1873425142","https://openalex.org/W1970776799","https://openalex.org/W1977623721","https://openalex.org/W2003172979","https://openalex.org/W2013276661","https://openalex.org/W2019738489","https://openalex.org/W2037337557","https://openalex.org/W2053400346","https://openalex.org/W2067079175","https://openalex.org/W2089344586","https://openalex.org/W2101405656","https://openalex.org/W2106498895","https://openalex.org/W2110362031","https://openalex.org/W2119520055","https://openalex.org/W4255306344","https://openalex.org/W6659787839","https://openalex.org/W6676333856"],"related_works":["https://openalex.org/W2353396818","https://openalex.org/W2370473919","https://openalex.org/W8302103","https://openalex.org/W2762984199","https://openalex.org/W2390496461","https://openalex.org/W2389654532","https://openalex.org/W3171631314","https://openalex.org/W2900325930","https://openalex.org/W2110944602","https://openalex.org/W3213722473"],"abstract_inverted_index":{"Complete":[0],"coverage,":[1],"which":[2],"is":[3,84,114,197,208,214,234],"the":[4,22,34,54,68,78,81,87,91,109,140,146,175,192,202,223,230],"foundation":[5],"of":[6,25,37,59,74,121,145,148,158,177,226,237],"many":[7],"robotic":[8],"applications,":[9],"aims":[10],"to":[11,32,43,70,199,216,219],"cover":[12],"an":[13],"area":[14],"as":[15,17,154],"quickly":[16],"possible.":[18],"This":[19,57],"study":[20],"investigates":[21],"time-limited":[23,110],"version":[24,58],"multi-robot":[26],"complete":[27,111],"coverage":[28,112],"problem,":[29],"that":[30,46],"is,":[31],"find":[33],"least":[35,224],"number":[36,73,124,147,173,207,225],"robots":[38,75,227],"and":[39,76,86,101,125,142],"allocate":[40],"tasks":[41,96],"properly":[42],"them":[44],"such":[45],"they":[47],"can":[48,61,181],"finish":[49],"a":[50,71,117,155,159,168,171],"known":[51],"mission":[52],"within":[53],"time":[55],"limit.":[56],"problem":[60,83,93,113,129],"be":[62],"tackled":[63,115],"straightforwardly":[64],"based":[65],"on":[66],"optimizing":[67,126],"task-allocation":[69],"fixed":[72],"enumerating":[77,122],"number.":[79],"However,":[80],"number-fixed":[82,92,128],"NP-hard":[85],"existing":[88,187,212,238],"algorithm":[89],"for":[90,195,211],"allows":[94],"intersecting":[95],"(possibly":[97],"causing":[98],"robots'":[99,123,206],"interference)":[100],"endures":[102],"high":[103],"approximation":[104,193],"factor.":[105],"In":[106],"this":[107],"study,":[108],"with":[116,189],"multi-objective":[118,134],"approach,":[119],"instead":[120],"each":[127,152,165],"one":[130],"by":[131,232],"one.":[132],"The":[133],"GA,":[135],"Mofint,":[136],"at":[137],"first":[138],"estimates":[139],"lower":[141],"upper":[143],"bounds":[144],"robots.":[149],"It":[150],"abstracts":[151],"task":[153],"weighted":[156],"node":[157],"graph.":[160],"Then,":[161],"Mofint":[162,180,196,233],"evolves":[163],"individuals,":[164],"individual":[166],"being":[167],"forest":[169],"containing":[170],"certain":[172],"(within":[174],"bounds)":[176],"non-intersecting":[178],"trees.":[179],"finally":[182],"obtain":[183],"higher":[184,221],"precision":[185],"than":[186],"work":[188,213],"less":[190],"time:":[191],"factor":[194],"1.1":[198],"1.5":[200,215],"times":[201,236],"ideal":[203],"allocation":[204],"when":[205],"fixed,":[209],"while":[210],"2.":[217],"Due":[218],"its":[220],"precision,":[222],"obtained":[228],"in":[229],"experiments":[231],"0.6":[235],"work.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}