{"id":"https://openalex.org/W3207556645","doi":"https://doi.org/10.32604/iasc.2022.020974","title":"Optimal Path Planning for Intelligent UAVs Using Graph Convolution Networks","display_name":"Optimal Path Planning for Intelligent UAVs Using Graph Convolution Networks","publication_year":2021,"publication_date":"2021-10-10","ids":{"openalex":"https://openalex.org/W3207556645","doi":"https://doi.org/10.32604/iasc.2022.020974","mag":"3207556645"},"language":"en","primary_location":{"id":"doi:10.32604/iasc.2022.020974","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.020974","pdf_url":"https://www.techscience.com/iasc/v31n3/44860/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.techscience.com/iasc/v31n3/44860/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059219928","display_name":"Akshya Jothi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akshya Jothi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021524457","display_name":"P. L. K. Priyadarsini","orcid":"https://orcid.org/0009-0007-1250-6972"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. L. K. Priyadarsini","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7537,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.73522722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"31","issue":"3","first_page":"1577","last_page":"1591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9976000189781189,"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/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8094059228897095},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5980077981948853},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5321962833404541},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5247690677642822},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5136231780052185},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5124192833900452},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5069952011108398},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.499190092086792},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4783027768135071},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.43711474537849426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30200496315956116},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2741725444793701},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25949105620384216},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.13189592957496643},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11523115634918213},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08334943652153015}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8094059228897095},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5980077981948853},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5321962833404541},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5247690677642822},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5136231780052185},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5124192833900452},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5069952011108398},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.499190092086792},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4783027768135071},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.43711474537849426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30200496315956116},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2741725444793701},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25949105620384216},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.13189592957496643},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11523115634918213},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08334943652153015},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.32604/iasc.2022.020974","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.020974","pdf_url":"https://www.techscience.com/iasc/v31n3/44860/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.32604/iasc.2022.020974","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.020974","pdf_url":"https://www.techscience.com/iasc/v31n3/44860/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2065862878","https://openalex.org/W2528929878","https://openalex.org/W2584262413","https://openalex.org/W2800786248","https://openalex.org/W2985331920","https://openalex.org/W3011395188","https://openalex.org/W3040731923","https://openalex.org/W3048783225","https://openalex.org/W3109714359","https://openalex.org/W3134321845","https://openalex.org/W3159604127","https://openalex.org/W6629674689","https://openalex.org/W6769159780","https://openalex.org/W6780410316","https://openalex.org/W6791373639","https://openalex.org/W6795558221","https://openalex.org/W6910723786"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2377010080"],"abstract_inverted_index":{"Unmanned":[0],"Aerial":[1],"Vehicles":[2],"(UAVs)":[3],"are":[4,15,26,135,221,228],"in":[5,10,34,60,137,244],"use":[6],"for":[7,81],"surveillance":[8,61],"services":[9],"the":[11,52,64,73,82,88,103,106,117,144,179,187,190,195,203,236,250],"geographic":[12,71],"areas,":[13],"that":[14,55,85,235],"very":[16],"hard":[17],"and":[18,141,143,174,218,227,248],"sometimes":[19],"not":[20],"reachable":[21],"by":[22,194],"humans.":[23],"Nowadays,":[24],"UAVs":[25,42,59],"being":[27],"used":[28,184,222],"as":[29,124,171],"substitutions":[30],"to":[31,46,76,185,223],"manned":[32],"operations":[33],"various":[35],"applications.":[36],"The":[37,132,161,197],"intensive":[38],"utilization":[39],"of":[40,51,91,105,139,189,205],"autonomous":[41],"has":[43],"given":[44],"rise":[45],"many":[47],"new":[48],"challenges.":[49],"One":[50],"vital":[53],"problems":[54],"arise":[56],"while":[57],"deploying":[58],"applications":[62,146],"is":[63,75,122,154,163,199,233],"Coverage":[65,118],"Path":[66,119],"Planning(CPP)":[67],"problem.":[68],"Given":[69],"a":[70,125,152],"area,":[72],"problem":[74,121,168],"find":[77,224],"an":[78],"optimal":[79,225,245],"path/tour":[80],"UAV":[83],"such":[84,170],"it":[86],"covers":[87],"entire":[89],"area":[90,107],"interest":[92],"with":[93,166,230],"minimal":[94],"tour":[95,192,246],"length.":[96],"A":[97],"graph":[98],"can":[99],"be":[100],"constructed":[101],"from":[102,178],"map":[104],"under":[108],"surveillance,":[109],"using":[110,156],"computational":[111],"geometric":[112],"techniques.":[113],"In":[114],"this":[115],"work,":[116],"Planning":[120],"posed":[123],"Travelling":[126],"Salesperson":[127],"Problem(TSP)":[128],"on":[129,208],"these":[130,241],"graphs.":[131,211],"graphs":[133],"obtained":[134,177],"large":[136],"number":[138],"vertices":[140],"edges":[142],"real-time":[145],"require":[147],"good":[148],"computation":[149,251],"speed.":[150],"Hence":[151],"model":[153,162,198],"built":[155],"Graph":[157],"Convolution":[158],"Network":[159],"(GCN).":[160],"effectively":[164],"trained":[165],"different":[167],"instances":[169],"TSP20,":[172],"TSP50,":[173],"TSP100.":[175],"Results":[176],"Concorde":[180],"Benchmark":[181],"Dataset":[182],"were":[183],"analyze":[186],"optimality":[188],"predicted":[191],"length":[193,247],"GCN.":[196,231],"also":[200,249],"evaluated":[201],"against":[202],"performance":[204],"evolutionary":[206,242],"algorithms":[207,243],"several":[209],"self-constructed":[210],"Particle":[212],"Swarm":[213],"Optimization,":[214,217],"Ant":[215],"Colony":[216],"Firefly":[219],"Algorithm":[220],"tours":[226],"compared":[229],"It":[232],"found":[234],"proposed":[237],"GCN":[238],"framework":[239],"outperforms":[240],"time.":[252]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-24T06:17:17.354583","created_date":"2025-10-10T00:00:00"}