{"id":"https://openalex.org/W3205137151","doi":"https://doi.org/10.1109/icra48506.2021.9561213","title":"From Multi-Target Sensory Coverage to Complete Sensory Coverage: An Optimization-Based Robotic Sensory Coverage Approach","display_name":"From Multi-Target Sensory Coverage to Complete Sensory Coverage: An Optimization-Based Robotic Sensory Coverage Approach","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3205137151","doi":"https://doi.org/10.1109/icra48506.2021.9561213","mag":"3205137151"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9561213","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5002930599","display_name":"Joel W. Burdick","orcid":"https://orcid.org/0000-0002-3091-540X"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joel W. Burdick","raw_affiliation_strings":["California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051754642","display_name":"Amanda Bouman","orcid":"https://orcid.org/0000-0002-4215-2913"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amanda Bouman","raw_affiliation_strings":["California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049467216","display_name":"Elon Rimon","orcid":"https://orcid.org/0000-0002-8270-6167"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elon Rimon","raw_affiliation_strings":["California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Institute of Technology,Engineering and Applied Sciences,Pasadena,CA,91125","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002930599"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.097,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40873874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":null,"first_page":"10994","last_page":"11000"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9908999800682068,"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/bounded-function","display_name":"Bounded function","score":0.5980240702629089},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5535154342651367},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.537710428237915},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4977557957172394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47756582498550415},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47418007254600525},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.465703547000885},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4642273783683777},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46287208795547485},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.46029648184776306},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.43511027097702026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4054151773452759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3597221076488495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18103629350662231}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5980240702629089},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5535154342651367},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.537710428237915},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4977557957172394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47756582498550415},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47418007254600525},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.465703547000885},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4642273783683777},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46287208795547485},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.46029648184776306},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.43511027097702026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4054151773452759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3597221076488495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18103629350662231},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra48506.2021.9561213","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:authors.library.caltech.edu:112509","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:20211217-98144000","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W140238390","https://openalex.org/W195502974","https://openalex.org/W1256877402","https://openalex.org/W1543983621","https://openalex.org/W1899379166","https://openalex.org/W1925307928","https://openalex.org/W1980569270","https://openalex.org/W1982929029","https://openalex.org/W2019738489","https://openalex.org/W2053460888","https://openalex.org/W2065704444","https://openalex.org/W2081716160","https://openalex.org/W2087858211","https://openalex.org/W2094208910","https://openalex.org/W2110824994","https://openalex.org/W2114595091","https://openalex.org/W2121866178","https://openalex.org/W2128634324","https://openalex.org/W2134531991","https://openalex.org/W2138800545","https://openalex.org/W2161190864","https://openalex.org/W2162750432","https://openalex.org/W2164424155","https://openalex.org/W2170213261","https://openalex.org/W2171305916","https://openalex.org/W2296319761","https://openalex.org/W2409009991","https://openalex.org/W2502636724","https://openalex.org/W2509248489","https://openalex.org/W2530592706","https://openalex.org/W2559613836","https://openalex.org/W2892049203","https://openalex.org/W2945056800","https://openalex.org/W2975081435","https://openalex.org/W3131341185","https://openalex.org/W4205585032","https://openalex.org/W4250589301","https://openalex.org/W4288356860","https://openalex.org/W6605705772"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217","https://openalex.org/W2799386402","https://openalex.org/W2388410942"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"progressively":[3],"more":[4],"demanding":[5],"off-line":[6],"shortest":[7,24],"path":[8,25,63,80],"sensory":[9,88],"coverage":[10,62,79,89],"problems":[11],"in":[12],"an":[13],"optimization":[14,41],"framework.":[15],"In":[16],"the":[17,23,61,78,86,110,124],"first":[18],"problem,":[19],"a":[20,28,48,53,71,95,98,101,115],"robot":[21],"finds":[22],"to":[26],"cover":[27],"set":[29],"of":[30,100,109],"target":[31],"nodes":[32],"with":[33,52,119],"its":[34],"sensors.":[35],"Because":[36],"this":[37],"mixed":[38],"integer":[39],"nonlinear":[40],"problem":[42,59,90],"(MINLP)":[43],"is":[44],"NP-hard,":[45],"we":[46,83],"develop":[47],"polynomial-time":[49,75],"approximation":[50,55,76],"algorithm":[51],"bounded":[54,120],"ratio.":[56],"The":[57],"next":[58],"shortens":[60],"when":[64],"possible":[65],"by":[66],"viewing":[67],"multiple":[68],"targets":[69],"from":[70],"single":[72],"pose.":[73],"Its":[74],"simplifies":[77],"geometry.":[81],"Finally,":[82],"show":[84],"how":[85],"complete":[87],"can":[91],"be":[92],"formulated":[93],"as":[94],"MINLP":[96],"over":[97],"decomposition":[99],"given":[102],"region":[103],"into":[104],"arbitrary":[105],"convex":[106],"polygons.":[107],"Extensions":[108],"previously":[111],"introduced":[112],"algorithms":[113],"provides":[114],"polynomial":[116],"time":[117],"solution":[118],"approximation.":[121],"Examples":[122],"illustrate":[123],"methods.":[125]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}