{"id":"https://openalex.org/W3092171610","doi":"https://doi.org/10.1109/case48305.2020.9216998","title":"Aerial Coverage Planning for Areas Hidden from the View of a Moving Ground Vehicle","display_name":"Aerial Coverage Planning for Areas Hidden from the View of a Moving Ground Vehicle","publication_year":2020,"publication_date":"2020-08-01","ids":{"openalex":"https://openalex.org/W3092171610","doi":"https://doi.org/10.1109/case48305.2020.9216998","mag":"3092171610"},"language":"en","primary_location":{"id":"doi:10.1109/case48305.2020.9216998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9216998","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":"conference-paper","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/A5008389148","display_name":"Barry Gilhuly","orcid":"https://orcid.org/0000-0003-0622-7305"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Barry Gilhuly","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103134580","display_name":"Stephen L. Smith","orcid":"https://orcid.org/0000-0002-8636-407X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen L. Smith","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":null,"first_page":"541","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9925000071525574,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9916999936103821,"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/scalability","display_name":"Scalability","score":0.7041521668434143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6947953104972839},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5906025767326355},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5574676990509033},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.550310492515564},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.5261820554733276},{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.5188097357749939},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.508588433265686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5039750933647156},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49460408091545105},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47064465284347534},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4592442810535431},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.44236359000205994},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.41387850046157837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21969091892242432},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20095965266227722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13937494158744812},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1244954764842987},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10417687892913818}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7041521668434143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6947953104972839},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5906025767326355},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5574676990509033},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.550310492515564},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.5261820554733276},{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.5188097357749939},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.508588433265686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5039750933647156},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49460408091545105},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47064465284347534},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4592442810535431},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.44236359000205994},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.41387850046157837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21969091892242432},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20095965266227722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13937494158744812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1244954764842987},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10417687892913818},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/case48305.2020.9216998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9216998","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":[{"display_name":"Sustainable cities and communities","score":0.6899999976158142,"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/W35252975","https://openalex.org/W115622331","https://openalex.org/W1601776805","https://openalex.org/W1658820457","https://openalex.org/W2002420134","https://openalex.org/W2023314929","https://openalex.org/W2041495686","https://openalex.org/W2110762409","https://openalex.org/W2113873983","https://openalex.org/W2160179157","https://openalex.org/W2267012268","https://openalex.org/W2283031475","https://openalex.org/W2530592706","https://openalex.org/W2553326346","https://openalex.org/W2590971326","https://openalex.org/W2738842532","https://openalex.org/W2772154329","https://openalex.org/W2791958123","https://openalex.org/W2891973815","https://openalex.org/W2905002857","https://openalex.org/W2909067415","https://openalex.org/W2911302472","https://openalex.org/W2928611323","https://openalex.org/W2952417580","https://openalex.org/W2963054668","https://openalex.org/W2971925930","https://openalex.org/W3011090415","https://openalex.org/W3041834803","https://openalex.org/W4298410530"],"related_works":["https://openalex.org/W4249387127","https://openalex.org/W4205733164","https://openalex.org/W4389261357","https://openalex.org/W2583894403","https://openalex.org/W153773207","https://openalex.org/W2033830317","https://openalex.org/W4200371605","https://openalex.org/W2538043052","https://openalex.org/W2333016343","https://openalex.org/W2104302609"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,36,42,46,52,84],"problem":[3],"of":[4,16,92,96,104,113,132],"path":[5],"planning":[6],"for":[7],"a":[8,17,25,72,90,111,120,127],"UAV,":[9],"deployed":[10],"to":[11,48],"provide":[12],"sensor":[13],"coverage":[14],"ahead":[15],"moving":[18],"ground":[19,22],"vehicle.":[20],"The":[21],"vehicle":[23],"travels":[24],"fixed":[26],"route":[27],"through":[28],"an":[29,61],"uncertain":[30],"environment":[31],"and":[32,51,68,126],"requires":[33],"information":[34],"about":[35],"area":[37],"ahead.":[38],"Given":[39],"this":[40],"route,":[41],"UAV":[43],"planner":[44],"calculates":[45],"regions":[47],"be":[49,58,87,99],"covered":[50],"time":[53,125],"by":[54],"which":[55,97,117],"each":[56,95],"must":[57],"covered,":[59],"as":[60],"orienteering":[62],"Problem":[63],"with":[64],"Time":[65],"Windows":[66],"(OPTW)":[67],"solves":[69],"it":[70],"using":[71],"Mixed":[73],"Integer":[74],"Linear":[75],"Program":[76],"(MILP).":[77],"To":[78],"improve":[79],"scalability,":[80],"we":[81,109],"prove":[82],"that":[83],"optimization":[85],"can":[86,118],"partitioned":[88],"into":[89],"set":[91],"smaller":[93],"problems,":[94],"may":[98],"solved":[100],"independently":[101],"without":[102],"loss":[103,115],"overall":[105],"solution":[106,124],"optimality.":[107],"Finally,":[108],"demonstrate":[110],"method":[112],"limited":[114],"partitioning,":[116],"perform":[119],"trade-off":[121],"between":[122],"improved":[123],"bounded":[128],"objective":[129],"loss.":[130],"All":[131],"our":[133],"results":[134],"are":[135],"validated":[136],"in":[137],"simulation.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}