{"id":"https://openalex.org/W3091974399","doi":"https://doi.org/10.1109/case48305.2020.9216988","title":"Miniature Robot Path Planning for Bridge Inspection: Min-Max Cycle Cover-Based Approach","display_name":"Miniature Robot Path Planning for Bridge Inspection: Min-Max Cycle Cover-Based Approach","publication_year":2020,"publication_date":"2020-08-01","ids":{"openalex":"https://openalex.org/W3091974399","doi":"https://doi.org/10.1109/case48305.2020.9216988","mag":"3091974399"},"language":"en","primary_location":{"id":"doi:10.1109/case48305.2020.9216988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9216988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","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/A5101516840","display_name":"Michael Lin","orcid":"https://orcid.org/0000-0002-9611-5288"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Lin","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039201084","display_name":"Richard J. La","orcid":"https://orcid.org/0000-0002-4836-8475"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard J. La","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101516840"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.1542,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52878579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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":0.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6806033849716187},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6541645526885986},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6538090705871582},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5807665586471558},{"id":"https://openalex.org/keywords/bridge","display_name":"Bridge (graph theory)","score":0.5797076225280762},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5116720199584961},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.48105931282043457},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.478076696395874},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.449920117855072},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4446888864040375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4436955153942108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42429107427597046},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4176928997039795},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35855352878570557},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32516220211982727},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29952701926231384},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.24578920006752014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20821166038513184},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09430983662605286}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6806033849716187},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6541645526885986},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6538090705871582},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5807665586471558},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.5797076225280762},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5116720199584961},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.48105931282043457},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.478076696395874},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.449920117855072},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4446888864040375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4436955153942108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42429107427597046},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4176928997039795},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35855352878570557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32516220211982727},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29952701926231384},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.24578920006752014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20821166038513184},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09430983662605286},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"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/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case48305.2020.9216988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9216988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.4399999976158142,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1502521435","https://openalex.org/W1974713906","https://openalex.org/W1976697723","https://openalex.org/W1991781549","https://openalex.org/W2008850276","https://openalex.org/W2032643924","https://openalex.org/W2071701840","https://openalex.org/W2071848017","https://openalex.org/W2082628447","https://openalex.org/W2117226423","https://openalex.org/W2131994692","https://openalex.org/W2138358085","https://openalex.org/W2145866065","https://openalex.org/W2258629489","https://openalex.org/W2797063765","https://openalex.org/W2946046356"],"related_works":["https://openalex.org/W2079730540","https://openalex.org/W2079263399","https://openalex.org/W4221167366","https://openalex.org/W4226211922","https://openalex.org/W1560183925","https://openalex.org/W2056597184","https://openalex.org/W2024517697","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2125212169"],"abstract_inverted_index":{"We":[0,171],"study":[1],"the":[2,6,15,37,53,65,75,98,103,112,120,132,137,142,145,148,152,158,163,189,193,216,223],"problem":[3,16,83],"of":[4,8,11,39,49,62,84,102,114,122,179,192,218,225],"planning":[5,86],"deployments":[7],"a":[9,29,33,47,60,90,173],"group":[10],"mobile":[12],"robots.":[13,170],"While":[14],"and":[17,108,111,220],"formulation":[18],"can":[19],"be":[20,106,199],"used":[21],"for":[22,36,141],"many":[23],"different":[24],"problems,":[25],"here":[26],"we":[27],"use":[28],"bridge":[30,66],"inspection":[31,154],"as":[32,89],"motivating":[34],"application":[35],"purpose":[38],"exposition.":[40],"The":[41,82],"robots":[42],"are":[43],"initially":[44],"stationed":[45],"at":[46],"set":[48,61,100],"depots":[50],"placed":[51],"throughout":[52],"bridge.":[54],"Each":[55],"robot":[56,85,109],"is":[57,80,87,151,162,196,215,222],"then":[58],"assigned":[59],"sites":[63,104],"on":[64],"to":[67,74,105,125,131,198],"inspect":[68],"and,":[69],"upon":[70],"completion,":[71],"must":[72],"return":[73],"same":[76],"depot":[77],"where":[78,181,213],"it":[79,161],"stored.":[81],"formulated":[88],"rooted":[91],"min-max":[92],"cycle":[93],"cover":[94],"problem,":[95],"in":[96,157],"which":[97],"vertex":[99,130,134],"consists":[101],"inspected":[107],"depots,":[110],"weight":[113],"an":[115],"edge":[116],"captures":[117],"either":[118],"(i)":[119],"amount":[121],"time":[123],"needed":[124],"travel":[126],"from":[127],"one":[128],"end":[129],"other":[133],"or":[135],"(ii)":[136],"necessary":[138],"energy":[139,165],"expenditure":[140,166],"travel.":[143],"In":[144,187],"first":[146],"case,":[147,160],"objective":[149],"function":[150],"total":[153],"time,":[155],"whereas":[156],"latter":[159],"maximum":[164],"among":[167],"all":[168],"deployed":[169],"propose":[172],"novel":[174],"algorithm":[175,195],"with":[176],"approximation":[177],"ratio":[178],"5+\u03b5,":[180],"0":[182],"<;":[183,185],"\u03b5":[184],"1.":[186],"addition,":[188],"computational":[190],"complexity":[191],"proposed":[194],"shown":[197],"O(n":[200],"<sup":[201,205],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[202,206],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[203],"+2":[204],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m-1</sup>":[207],"n":[208,211,214],"log(n)":[209],"+":[210],"log(\u03b5-1)\u03b5,":[212],"number":[217,224],"vertices,":[219],"m":[221],"depots.":[226]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}