{"id":"https://openalex.org/W4416942068","doi":"https://doi.org/10.1017/s0263574725102956","title":"Informative path planning for unmanned aerial vehicles using cost-benefit spanning tree","display_name":"Informative path planning for unmanned aerial vehicles using cost-benefit spanning tree","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416942068","doi":"https://doi.org/10.1017/s0263574725102956"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574725102956","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725102956","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-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/A5050697365","display_name":"Wei-Hsiang Chiu","orcid":null},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wei-Hsiang Chiu","raw_affiliation_strings":["National Central University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Central University","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039241771","display_name":"Kuo-Shih Tseng","orcid":"https://orcid.org/0000-0002-7818-5821"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Kuo-Shih Tseng","raw_affiliation_strings":["National Central University"],"raw_orcid":"https://orcid.org/0000-0002-7818-5821","affiliations":[{"raw_affiliation_string":"National Central University","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039241771"],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34833603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":"12","first_page":"4402","last_page":"4428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9430000185966492,"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.9430000185966492,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.004000000189989805,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11489","display_name":"Air Traffic Management and Optimization","score":0.002400000113993883,"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/spanning-tree","display_name":"Spanning tree","score":0.7301999926567078},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7139000296592712},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6531999707221985},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6373999714851379},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5763999819755554},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.553600013256073},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.54830002784729},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5454000234603882}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7301999926567078},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7139000296592712},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6531999707221985},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6212999820709229},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5763999819755554},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.553600013256073},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.54830002784729},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5454000234603882},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5072000026702881},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40939998626708984},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.38589999079704285},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.35929998755455017},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.3488999903202057},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3257000148296356},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.3231000006198883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.3001999855041504},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.27250000834465027},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574725102956","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725102956","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W40650588","https://openalex.org/W102487131","https://openalex.org/W1680189815","https://openalex.org/W1940299996","https://openalex.org/W1966213627","https://openalex.org/W1994863634","https://openalex.org/W1999050017","https://openalex.org/W2007231811","https://openalex.org/W2011193572","https://openalex.org/W2018020586","https://openalex.org/W2019738489","https://openalex.org/W2023509699","https://openalex.org/W2042986967","https://openalex.org/W2054085030","https://openalex.org/W2064209160","https://openalex.org/W2065549538","https://openalex.org/W2070831947","https://openalex.org/W2077042172","https://openalex.org/W2080379754","https://openalex.org/W2117928809","https://openalex.org/W2130724591","https://openalex.org/W2139935271","https://openalex.org/W2143996311","https://openalex.org/W2148134592","https://openalex.org/W2215252637","https://openalex.org/W2283031475","https://openalex.org/W2345111710","https://openalex.org/W2531699011","https://openalex.org/W2620408778","https://openalex.org/W2740307401","https://openalex.org/W2790830285","https://openalex.org/W2883975974","https://openalex.org/W2956015669","https://openalex.org/W2963338060","https://openalex.org/W2981562293","https://openalex.org/W2996863123","https://openalex.org/W3004751533","https://openalex.org/W3092357259","https://openalex.org/W4206270770","https://openalex.org/W4210429346","https://openalex.org/W4220889379","https://openalex.org/W4319878801","https://openalex.org/W4320059797","https://openalex.org/W4387111076","https://openalex.org/W4392745502","https://openalex.org/W4394699159","https://openalex.org/W4400187966"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Informative":[1],"path":[2,81],"planning":[3],"(IPP)":[4],"is":[5,52],"one":[6],"of":[7],"key":[8],"applications":[9],"for":[10],"unmanned":[11],"aerial":[12],"vehicles.":[13],"It":[14],"can":[15],"be":[16],"applied":[17],"to":[18,24,45,54],"terrain":[19],"monitoring":[20],"problems,":[21],"which":[22],"are":[23],"find":[25],"the":[26,36,40,47,67,72,89,93],"static":[27],"targets":[28],"from":[29],"bird\u2019s":[30],"eye":[31],"view.":[32],"In":[33],"this":[34],"research,":[35],"proposed":[37,90],"algorithm":[38],"generates":[39],"cost-benefit":[41],"spanning":[42,77],"tree":[43,57,73,78],"(CBST)":[44],"boost":[46],"IPP":[48],"performance.":[49],"The":[50,63,83],"CBST":[51],"able":[53],"generate":[55],"different":[56,61],"structures":[58,74],"based":[59],"on":[60,71],"parameters.":[62],"proofs":[64],"show":[65],"that":[66,88],"theoretical":[68],"guarantees":[69],"depend":[70],"(e.g.,":[75],"minimal":[76],"and":[79,85],"shortest":[80],"tree).":[82],"simulations":[84],"experiments":[86],"demonstrate":[87],"method":[91],"outperforms":[92],"benchmark":[94],"approaches.":[95]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-03T00:00:00"}