{"id":"https://openalex.org/W3048783225","doi":"https://doi.org/10.3233/jifs-189140","title":"Graph-based path planning for intelligent UAVs in area coverage applications","display_name":"Graph-based path planning for intelligent UAVs in area coverage applications","publication_year":2020,"publication_date":"2020-08-11","ids":{"openalex":"https://openalex.org/W3048783225","doi":"https://doi.org/10.3233/jifs-189140","mag":"3048783225"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-189140","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-189140","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","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":null,"display_name":"J. Akshya","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"J. Akshya","raw_affiliation_strings":["School of Computing, SASTRA Deemed to be University, Thanjavur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, SASTRA Deemed to be University, Thanjavur, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021524457","display_name":"P. L. K. Priyadarsini","orcid":"https://orcid.org/0009-0007-1250-6972"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"P.L.K. Priyadarsini","raw_affiliation_strings":["School of Computing, SASTRA Deemed to be University, Thanjavur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, SASTRA Deemed to be University, Thanjavur, India","institution_ids":["https://openalex.org/I932239252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021524457"],"corresponding_institution_ids":["https://openalex.org/I932239252"],"apc_list":null,"apc_paid":null,"fwci":1.5333,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.85311833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"39","issue":"6","first_page":"8191","last_page":"8203"},"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/T11133","display_name":"UAV Applications and Optimization","score":0.9944000244140625,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.697935938835144},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6745213270187378},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6274889707565308},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.61443692445755},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5821486711502075},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.568523645401001},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.5545116662979126},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5064600706100464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4844701290130615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4676496684551239},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4402810037136078},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.421072393655777},{"id":"https://openalex.org/keywords/quadtree","display_name":"Quadtree","score":0.4176555573940277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33020538091659546},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2539742588996887},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1832890808582306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.180723637342453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12500682473182678},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10830458998680115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.697935938835144},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6745213270187378},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6274889707565308},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.61443692445755},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5821486711502075},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.568523645401001},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.5545116662979126},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5064600706100464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4844701290130615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4676496684551239},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4402810037136078},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.421072393655777},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.4176555573940277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33020538091659546},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2539742588996887},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1832890808582306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.180723637342453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12500682473182678},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10830458998680115},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-189140","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-189140","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W2013205100","https://openalex.org/W2037069310","https://openalex.org/W2055569927","https://openalex.org/W2069209512","https://openalex.org/W2075956742","https://openalex.org/W2093778275","https://openalex.org/W2180623458","https://openalex.org/W2327902530","https://openalex.org/W2579187612","https://openalex.org/W2584262413","https://openalex.org/W2597364644","https://openalex.org/W2607767115","https://openalex.org/W2608726595","https://openalex.org/W2767005840","https://openalex.org/W2808115698","https://openalex.org/W2902915929","https://openalex.org/W2905529951","https://openalex.org/W2905789584","https://openalex.org/W2910105989","https://openalex.org/W2914193687","https://openalex.org/W2914873175","https://openalex.org/W2946857491","https://openalex.org/W2967721034","https://openalex.org/W2978145949","https://openalex.org/W3101957802","https://openalex.org/W4237708235","https://openalex.org/W4250022545"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082","https://openalex.org/W2564967516"],"abstract_inverted_index":{"In":[0,27,89],"recent":[1],"times,":[2],"Unmanned":[3],"Air":[4],"Vehicles":[5],"(UAVs)":[6],"are":[7,161],"being":[8],"deployed":[9],"for":[10,48,97],"several":[11],"tasks":[12],"of":[13,31,115,130],"terrain":[14],"coverage":[15,73],"such":[16,125],"as":[17,59,103,126,190],"surveillance,":[18],"photogrammetry,":[19],"smart":[20],"irrigation,":[21],"civil":[22],"security,":[23],"and":[24,66,133,174],"disaster":[25],"management.":[26],"these":[28],"applications,":[29],"one":[30],"the":[32,41,49,52,67,71,75,85,98,112,127,131,155,167,186],"most":[33],"vital":[34],"issues":[35],"to":[36,78,163],"be":[37,137],"addressed":[38,54],"is,":[39],"covering":[40],"area":[42,65,99,114],"under":[43,100],"observation":[44],"with":[45],"minimum":[46],"traversal":[47],"UAV.":[50],"So,":[51],"problem":[53,76,143],"in":[55,196],"this":[56,90,164],"paper":[57],"is":[58,77,107,144],"follows:":[60],"For":[61],"a":[62,104,152],"given":[63,68,86,102,113],"geographic":[64,87],"parameters":[69,124],"describing":[70],"UAV\u2019s":[72],"capacity,":[74],"find":[79],"an":[80,92],"optimal":[81,93],"route":[82],"that":[83,135,183],"covers":[84],"area.":[88],"paper,":[91],"path":[94],"planning":[95],"algorithm":[96,110,173,189],"observation,":[101],"closed":[105],"curve,":[106],"proposed.":[108],"The":[109,142,179],"partitions":[111],"interest":[116],"into":[117,146],"multiple":[118],"non-uniform":[119],"rectangles":[120],"while":[121],"considering":[122],"other":[123],"flying":[128],"altitude":[129],"UAV":[132],"obstacles":[134],"could":[136],"encountered":[138],"during":[139],"its":[140],"flight.":[141],"transformed":[145],"Traveling":[147],"Salesman":[148],"Problem":[149],"by":[150],"constructing":[151],"graph":[153],"from":[154],"rectangular":[156],"partitioning.":[157],"Effective":[158],"approximate":[159],"solutions":[160],"provided":[162],"problem,":[165],"using":[166],"Minimum":[168],"Spanning":[169],"Tree":[170],"(MST)":[171],"approximation":[172],"Ant":[175],"Colony":[176],"Optimization":[177],"(ACO).":[178],"experimental":[180],"results":[181],"show":[182],"ACO":[184],"outperforms":[185],"MST":[187],"based":[188],"it":[191],"does":[192],"not":[193],"get":[194],"stuck":[195],"local":[197],"minima.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}