{"id":"https://openalex.org/W1979775288","doi":"https://doi.org/10.1109/tcyb.2014.2309898","title":"Hierarchical Heuristic Search Using a Gaussian Mixture Model for UAV Coverage Planning","display_name":"Hierarchical Heuristic Search Using a Gaussian Mixture Model for UAV Coverage Planning","publication_year":2014,"publication_date":"2014-03-21","ids":{"openalex":"https://openalex.org/W1979775288","doi":"https://doi.org/10.1109/tcyb.2014.2309898","mag":"1979775288","pmid":"https://pubmed.ncbi.nlm.nih.gov/24691199"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2014.2309898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2014.2309898","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5062040468","display_name":"Lanny Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lanny Lin","raw_affiliation_strings":["Department of Computer Science, Brigham Young University, Provo, UT, USA","[Department of Computer Science, Brigham Young University, Provo, UT, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"[Department of Computer Science, Brigham Young University, Provo, UT, USA]","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077345598","display_name":"Michael A. Goodrich","orcid":"https://orcid.org/0000-0002-2489-5705"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Goodrich","raw_affiliation_strings":["Department of Computer Science, Brigham Young University, Provo, UT, USA","[Department of Computer Science, Brigham Young University, Provo, UT, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"[Department of Computer Science, Brigham Young University, Provo, UT, USA]","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":5.1049,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.95621168,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"44","issue":"12","first_page":"2532","last_page":"2544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9940999746322632,"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6347049474716187},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6115962862968445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5485103130340576},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5405238270759583},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.49256569147109985},{"id":"https://openalex.org/keywords/mixture-model","display_name":"Mixture model","score":0.48206979036331177},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.47376611828804016},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4729452133178711},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4683140218257904},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46472862362861633},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.4546710252761841},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44599324464797974},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3520442843437195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26855048537254333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6347049474716187},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6115962862968445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5485103130340576},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5405238270759583},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.49256569147109985},{"id":"https://openalex.org/C61224824","wikidata":"https://www.wikidata.org/wiki/Q2260434","display_name":"Mixture model","level":2,"score":0.48206979036331177},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.47376611828804016},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4729452133178711},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4683140218257904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46472862362861633},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4546710252761841},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44599324464797974},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3520442843437195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26855048537254333},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcyb.2014.2309898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2014.2309898","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},{"id":"pmid:24691199","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24691199","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on cybernetics","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1853294998","display_name":"UAV-Enabled Wilderness Search and Rescue: A Human-Centered Approach","funder_award_id":"0534736","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W39309306","https://openalex.org/W83089128","https://openalex.org/W101015759","https://openalex.org/W128952136","https://openalex.org/W1522951724","https://openalex.org/W1935186273","https://openalex.org/W2016130656","https://openalex.org/W2029681015","https://openalex.org/W2031567071","https://openalex.org/W2033348207","https://openalex.org/W2054145851","https://openalex.org/W2065066477","https://openalex.org/W2077042172","https://openalex.org/W2098432798","https://openalex.org/W2099114258","https://openalex.org/W2099144379","https://openalex.org/W2107664584","https://openalex.org/W2118425327","https://openalex.org/W2121142533","https://openalex.org/W2140892427","https://openalex.org/W2158751790","https://openalex.org/W2159248543","https://openalex.org/W2171717581","https://openalex.org/W4210823377","https://openalex.org/W4214717370","https://openalex.org/W4229578634","https://openalex.org/W4233287571","https://openalex.org/W4238242643","https://openalex.org/W4239272157","https://openalex.org/W4388475847","https://openalex.org/W6601568690","https://openalex.org/W6603348868","https://openalex.org/W6605226796","https://openalex.org/W6631331346"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2064794194","https://openalex.org/W1994919150","https://openalex.org/W2358427436","https://openalex.org/W4200104947","https://openalex.org/W2224555876","https://openalex.org/W4386269615","https://openalex.org/W2808808802","https://openalex.org/W1622225657","https://openalex.org/W2402589461"],"abstract_inverted_index":{"During":[0],"unmanned":[1],"aerial":[2],"vehicle":[3],"(UAV)":[4],"search":[5,41,82,130,134,170],"missions,":[6],"efficient":[7,187],"use":[8,116],"of":[9,20,27,70,78,89,99,111,145,151],"UAV":[10,34,59],"flight":[11,14],"time":[12],"requires":[13],"paths":[15,106,137,188],"that":[16,57,91,107,122,176,189],"maximize":[17],"the":[18,22,29,58,64,73,97,109,117,139,149,152,177,193],"probability":[19,26],"finding":[21,79],"desired":[23,30],"subject.":[24,65],"The":[25,114,132],"detecting":[28],"subject":[31],"based":[32],"on":[33],"sensor":[35],"information":[36],"can":[37,60,185],"vary":[38],"in":[39,96,164],"different":[40,143],"areas":[42],"due":[43],"to":[44,72,128],"environment":[45],"elements":[46],"like":[47],"varying":[48],"vegetation":[49],"density":[50],"or":[51],"lighting":[52],"conditions,":[53],"making":[54],"it":[55],"likely":[56],"only":[61],"partially":[62],"detect":[63],"This":[66],"adds":[67],"another":[68],"dimension":[69],"complexity":[71],"already":[74],"difficult":[75],"(NP-Hard)":[76],"problem":[77],"an":[80],"optimal":[81,112],"path.":[83],"We":[84,147],"present":[85],"a":[86,100,124],"new":[87,153,178],"class":[88],"algorithms":[90,115,133,154,158,179,182],"account":[92],"for":[93,135],"partial":[94],"detection":[95],"form":[98],"task":[101],"difficulty":[102],"map":[103],"and":[104,161,171,174,184],"produce":[105],"approximate":[108],"payoff":[110],"solutions.":[113],"mode":[118],"goodness":[119],"ratio":[120],"heuristic":[121],"uses":[123],"Gaussian":[125],"mixture":[126],"model":[127],"prioritize":[129],"subregions.":[131],"effective":[136],"through":[138],"parameter":[140],"space":[141],"at":[142],"levels":[144],"resolution.":[146],"compare":[148],"performance":[150],"against":[155],"two":[156],"published":[157],"(Bourgault's":[159],"algorithm":[160],"LHC-GW-CONV":[162],"algorithm)":[163],"simulated":[165],"searches":[166],"with":[167],"three":[168],"real":[169],"rescue":[172],"scenarios,":[173],"show":[175],"outperform":[180],"existing":[181],"significantly":[183],"yield":[186,190],"payoffs":[191],"near":[192],"optimal.":[194]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}