{"id":"https://openalex.org/W3010649139","doi":"https://doi.org/10.1109/cdc40024.2019.9029345","title":"An Energy Optimal Path-Planning Scheme for Quadcopters in Forests","display_name":"An Energy Optimal Path-Planning Scheme for Quadcopters in Forests","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3010649139","doi":"https://doi.org/10.1109/cdc40024.2019.9029345","mag":"3010649139"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","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/A5033545973","display_name":"Christoph Aoun","orcid":null},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Christoph Aoun","raw_affiliation_strings":["Department of Mechanical Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010140692","display_name":"Naseem Daher","orcid":"https://orcid.org/0000-0002-3292-0261"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Naseem Daher","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049264238","display_name":"Elie Shammas","orcid":"https://orcid.org/0000-0002-3604-334X"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Elie Shammas","raw_affiliation_strings":["Department of Mechanical Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Maroun Semaan Faculty of Engineering and Architecture, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033545973"],"corresponding_institution_ids":["https://openalex.org/I98635879"],"apc_list":null,"apc_paid":null,"fwci":0.7086,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7593125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"8323","last_page":"8328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9761000275611877,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9628999829292297,"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/motion-planning","display_name":"Motion planning","score":0.6496194005012512},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6199755668640137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5448671579360962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5349489450454712},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5090153217315674},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44798898696899414},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.44574064016342163},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4281643033027649},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.414998859167099},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4116891324520111},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4104410409927368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31209003925323486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2849685549736023},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.19706860184669495},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.1953776478767395},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17668187618255615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13586503267288208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1002964973449707}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6496194005012512},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6199755668640137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5448671579360962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5349489450454712},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5090153217315674},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44798898696899414},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.44574064016342163},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4281643033027649},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.414998859167099},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4116891324520111},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4104410409927368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31209003925323486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2849685549736023},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.19706860184669495},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.1953776478767395},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17668187618255615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13586503267288208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1002964973449707},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9029345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1977346877","https://openalex.org/W1990284552","https://openalex.org/W2002508249","https://openalex.org/W2035988527","https://openalex.org/W2067213582","https://openalex.org/W2092481826","https://openalex.org/W2108399637","https://openalex.org/W2117226423","https://openalex.org/W2311756909","https://openalex.org/W2316682111","https://openalex.org/W2414661092","https://openalex.org/W2468618434","https://openalex.org/W2536747409","https://openalex.org/W2753576362","https://openalex.org/W2798000375","https://openalex.org/W2939391664","https://openalex.org/W4390786978","https://openalex.org/W4399382066","https://openalex.org/W6677426919","https://openalex.org/W6685145707"],"related_works":["https://openalex.org/W2977483259","https://openalex.org/W4213150077","https://openalex.org/W4285089922","https://openalex.org/W2369410163","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2564285047","https://openalex.org/W4280593160"],"abstract_inverted_index":{"Motivated":[0],"by":[1,8],"the":[2,46,58,70,94,117,123,129],"seriousness":[3],"of":[4,45,57,89],"local":[5],"forests":[6],"infestation":[7],"Pine":[9],"Processionary":[10],"Moths,":[11],"in":[12,48,131],"this":[13],"paper":[14],"we":[15],"devise":[16],"a":[17,24,29,40,82],"method":[18],"to":[19,42,80,105,121,128],"completely":[20],"yet":[21],"optimally":[22],"scan":[23],"forest.":[25],"More":[26],"precisely,":[27],"given":[28],"forest":[30,125],"map,":[31],"an":[32,49,98,132],"optimal":[33,51,71,134],"path-planning":[34],"algorithm":[35],"that":[36,65],"is":[37,53,77,101],"adequate":[38],"for":[39],"drone":[41],"visit":[43],"all":[44],"trees,":[47],"energy":[50,133],"manner,":[52],"developed.":[54],"The":[55],"pre-map":[56],"trees":[59],"and":[60,84,108,126],"terrain":[61],"are":[62,67,119],"modeled":[63],"so":[64],"they":[66],"embedded":[68],"within":[69],"trajectory":[72,83],"planning.":[73],"Optimal":[74],"control":[75],"theory":[76],"then":[78],"used":[79],"generate":[81],"path":[85],"between":[86],"each":[87],"pair":[88],"trees.":[90],"Having":[91],"robustly":[92],"defined":[93],"tree-to-tree":[95],"travel":[96],"cost,":[97],"adjacency":[99],"matrix":[100],"constructed.":[102],"Taking":[103],"recourse":[104],"Graph":[106],"Theory":[107],"Integer":[109],"Linear":[110],"Programming":[111],"along":[112],"with":[113],"Sub-Tour":[114],"Elimination":[115],"Constraints,":[116],"routes":[118],"chosen":[120],"tour":[122],"entire":[124],"return":[127],"base":[130],"fashion.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}