{"id":"https://openalex.org/W3089913970","doi":"https://doi.org/10.1109/icra40945.2020.9197292","title":"Line Coverage with Multiple Robots","display_name":"Line Coverage with Multiple Robots","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3089913970","doi":"https://doi.org/10.1109/icra40945.2020.9197292","mag":"3089913970"},"language":"en","primary_location":{"id":"doi:10.1109/icra40945.2020.9197292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9197292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/A5088439425","display_name":"Saurav Agarwal","orcid":"https://orcid.org/0000-0003-1148-3186"},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"education","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saurav Agarwal","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Charlotte, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Charlotte, NC, USA","institution_ids":["https://openalex.org/I102149020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002379534","display_name":"Srinivas Akella","orcid":"https://orcid.org/0000-0003-4706-4610"},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"education","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivas Akella","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Charlotte, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Charlotte, NC, USA","institution_ids":["https://openalex.org/I102149020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088439425"],"corresponding_institution_ids":["https://openalex.org/I102149020"],"apc_list":null,"apc_paid":null,"fwci":0.5862,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.69363783,"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":"3248","last_page":"3254"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.995199978351593,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6922217607498169},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.689250648021698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.674336850643158},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6029219627380371},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5926205515861511},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5056614875793457},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48406782746315},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.46779876947402954},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4582168459892273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4486897587776184},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43827471137046814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4088084101676941},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23879486322402954},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20493295788764954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17410823702812195},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08548608422279358}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6922217607498169},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.689250648021698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.674336850643158},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6029219627380371},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5926205515861511},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5056614875793457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48406782746315},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.46779876947402954},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4582168459892273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4486897587776184},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43827471137046814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4088084101676941},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23879486322402954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20493295788764954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17410823702812195},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08548608422279358},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra40945.2020.9197292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9197292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W171569338","https://openalex.org/W1435704996","https://openalex.org/W1544032329","https://openalex.org/W1936177838","https://openalex.org/W1997610733","https://openalex.org/W2019738489","https://openalex.org/W2039011874","https://openalex.org/W2043392035","https://openalex.org/W2044807391","https://openalex.org/W2057124904","https://openalex.org/W2074654730","https://openalex.org/W2077422018","https://openalex.org/W2078408696","https://openalex.org/W2081935091","https://openalex.org/W2103516725","https://openalex.org/W2105848344","https://openalex.org/W2110620774","https://openalex.org/W2111581650","https://openalex.org/W2120651143","https://openalex.org/W2138962696","https://openalex.org/W2142484066","https://openalex.org/W2251882317","https://openalex.org/W2332701863","https://openalex.org/W2333373499","https://openalex.org/W2887759215","https://openalex.org/W2967031190","https://openalex.org/W4252801674","https://openalex.org/W4253570324","https://openalex.org/W6681534256"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":{"The":[0,39,83],"line":[1,56,84],"coverage":[2,6,57,85],"problem":[3,58,86],"is":[4,87,119],"the":[5,37,51,55,64,68,71,102,116,146,175,178,188,193],"of":[7,36,67,145,168,177],"linear":[8,80],"environment":[9],"features":[10],"(e.g.,":[11,29],"road":[12,183,197],"networks,":[13],"power":[14],"lines),":[15],"modeled":[16],"as":[17,48,59,70,76],"1D":[18],"segments,":[19],"by":[20,73,139],"one":[21],"or":[22],"more":[23],"robots":[24,40],"while":[25],"respecting":[26],"resource":[27,46],"constraints":[28],"battery":[30],"capacity,":[31],"flight":[32],"time)":[33],"for":[34,123,143],"each":[35,144],"robots.":[38],"incur":[41],"direction":[42],"dependent":[43],"costs":[44],"and":[45,89,106,121,135,160,185],"demands":[47],"they":[49],"traverse":[50],"edges.":[52],"We":[53,98,114,149,173],"treat":[54],"an":[60,165],"optimization":[61],"problem,":[62],"with":[63,157],"total":[65],"cost":[66],"tours":[69],"objective,":[72],"formulating":[74],"it":[75,100],"a":[77,93,107,154],"mixed":[78],"integer":[79],"program":[81],"(MILP).":[82],"NP-hard":[88],"hence":[90],"we":[91],"develop":[92],"heuristic":[94,109],"algorithm,":[95,110],"Merge-Embed-Merge":[96],"(MEM).":[97],"compare":[99,174],"against":[101],"optimal":[103],"MILP":[104],"approach":[105,131,152,189],"baseline":[108],"Extended":[111],"Path":[112],"Scanning.":[113],"show":[115],"MEM":[117],"algorithm":[118],"fast":[120],"suitable":[122],"real-time":[124],"applications.":[125],"To":[126],"tackle":[127],"large-scale":[128],"problems,":[129],"our":[130,151],"performs":[132],"graph":[133,136,156],"simplification":[134],"partitioning,":[137],"followed":[138],"robot":[140],"tour":[141],"generation":[142],"partitioned":[147],"subgraphs.":[148],"demonstrate":[150,187],"on":[153,180,192],"large":[155],"4,658":[158],"edges":[159],"4,504":[161],"vertices":[162],"that":[163],"represents":[164],"urban":[166],"region":[167],"about":[169],"16":[170],"sq.":[171],"km.":[172],"performance":[176],"algorithms":[179],"several":[181],"small":[182],"networks":[184],"experimentally":[186],"using":[190],"UAVs":[191],"UNC":[194],"Charlotte":[195],"campus":[196],"network.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}