{"id":"https://openalex.org/W2980569472","doi":"https://doi.org/10.1109/aim.2019.8868551","title":"A Simplified Path Planning Algorithm for Surveillance Missions of Unmanned Aerial Vehicles","display_name":"A Simplified Path Planning Algorithm for Surveillance Missions of Unmanned Aerial Vehicles","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2980569472","doi":"https://doi.org/10.1109/aim.2019.8868551","mag":"2980569472"},"language":"en","primary_location":{"id":"doi:10.1109/aim.2019.8868551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2019.8868551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)","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/A5068981712","display_name":"Mohammad Tuqan","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":"Mohammad Tuqan","raw_affiliation_strings":["Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), 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":["Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), 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":["Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Vision and Robotics Lab (VRL) in the Mechanical Engineering Department and the Electrical and Computer Engineering Department, American University of Beirut (AUB), Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068981712"],"corresponding_institution_ids":["https://openalex.org/I98635879"],"apc_list":null,"apc_paid":null,"fwci":0.3037,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.61044645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1341","last_page":"1346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12158","display_name":"Guidance and Control Systems","score":0.9944999814033508,"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.7744203209877014},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6393636465072632},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5939280986785889},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5917849540710449},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5472724437713623},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5445421934127808},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543161928653717},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.5124045014381409},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.48542580008506775},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.47833582758903503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47116050124168396},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4335689842700958},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4230441153049469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.356751024723053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3132999539375305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27848267555236816},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.19789430499076843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14939075708389282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13161563873291016},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.12948238849639893}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7744203209877014},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6393636465072632},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5939280986785889},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5917849540710449},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5472724437713623},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5445421934127808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543161928653717},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.5124045014381409},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.48542580008506775},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.47833582758903503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47116050124168396},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4335689842700958},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4230441153049469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.356751024723053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3132999539375305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27848267555236816},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.19789430499076843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14939075708389282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13161563873291016},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12948238849639893},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aim.2019.8868551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2019.8868551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8299999833106995,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1604130472","https://openalex.org/W1963641530","https://openalex.org/W1965250166","https://openalex.org/W1968420376","https://openalex.org/W1970071808","https://openalex.org/W2009317635","https://openalex.org/W2017708378","https://openalex.org/W2066873908","https://openalex.org/W2131569937","https://openalex.org/W2137880701","https://openalex.org/W2219097197","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W3150899403"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W4388726836","https://openalex.org/W2153809277","https://openalex.org/W2015961810"],"abstract_inverted_index":{"In":[0],"this":[1,104],"paper,":[2],"a":[3,36,55,59,68,91,100,118],"path":[4,126],"planning":[5],"algorithm":[6],"is":[7,88],"proposed":[8],"for":[9,125,130],"surveillance":[10],"missions":[11],"that":[12],"does":[13],"not":[14],"only":[15],"require":[16],"visiting":[17,75],"certain":[18],"known":[19],"specified":[20],"regions,":[21],"but":[22],"also":[23],"explores":[24],"these":[25],"regions.":[26],"We":[27],"set":[28],"the":[29,33,47,62,80,84,86,112,122,131,137],"motion":[30],"model":[31,39],"of":[32,79,121],"vehicle":[34],"to":[35,72,83,98,116,136],"planar":[37],"kinematic":[38],"with":[40,54,96],"bounded":[41],"steering":[42],"rate,":[43],"and":[44,76],"we":[45,66],"impose":[46],"region":[48],"exploration":[49],"as":[50,90],"traversing":[51],"an":[52],"arc":[53],"nonzero":[56],"arc-length":[57],"around":[58],"point.":[60],"Using":[61],"above":[63],"two":[64],"assumptions,":[65],"define":[67],"time-optimal":[69],"control":[70],"problem":[71,87],"ensure":[73],"completely":[74],"exploring":[77],"all":[78],"sites.":[81],"Similar":[82],"literature,":[85],"formulated":[89],"Dubin":[92],"Traveling":[93],"Salesman":[94],"Problem":[95],"Neighborhoods":[97],"derive":[99,117],"simplified":[101],"algorithm,":[102],"however,":[103],"paper":[105],"builds":[106],"on":[107,111],"previous":[108],"work":[109],"done":[110],"convex":[113],"optimization":[114],"solution":[115],"geometrical":[119],"representation":[120],"local":[123],"minima":[124],"headings.":[127],"Hence,":[128],"solving":[129],"optimal":[132],"Dubin\u2019s":[133],"maneuver":[134],"corresponding":[135],"global":[138],"shortest":[139],"path.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}