{"id":"https://openalex.org/W4300865465","doi":"https://doi.org/10.1145/3565270","title":"Game Theory\u2013Based Parameter Tuning for Energy-Efficient Path Planning on Modern UAVs","display_name":"Game Theory\u2013Based Parameter Tuning for Energy-Efficient Path Planning on Modern UAVs","publication_year":2022,"publication_date":"2022-10-03","ids":{"openalex":"https://openalex.org/W4300865465","doi":"https://doi.org/10.1145/3565270"},"language":"en","primary_location":{"id":"doi:10.1145/3565270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3565270","pdf_url":null,"source":{"id":"https://openalex.org/S2506189754","display_name":"ACM Transactions on Cyber-Physical Systems","issn_l":"2378-962X","issn":["2378-962X","2378-9638"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Cyber-Physical 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":"https://openalex.org/A5071424693","display_name":"Diksha Moolchandani","orcid":"https://orcid.org/0000-0001-8110-049X"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Diksha Moolchandani","raw_affiliation_strings":["School of Information Technology, IIT Delhi, India"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, IIT Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045244621","display_name":"Kishore Yadav","orcid":"https://orcid.org/0000-0002-0955-6908"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kishore Yadav","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Delhi, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045811688","display_name":"Geesara Kulathunga","orcid":"https://orcid.org/0000-0003-3378-9813"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Geesara Kulathunga","raw_affiliation_strings":["Department of Computer Science, Innopolis University, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Innopolis University, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034417609","display_name":"Ilya Afanasyev","orcid":"https://orcid.org/0000-0002-6658-5369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilya Afanasyev","raw_affiliation_strings":["Huawei Technologies Co. Ltd., St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Huawei Technologies Co. Ltd., St. Petersburg, Russia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101478917","display_name":"Anshul Kumar","orcid":"https://orcid.org/0000-0002-3871-5402"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anshul Kumar","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Delhi, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075175655","display_name":"Manuel Mazzara","orcid":"https://orcid.org/0000-0002-3860-4948"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Manuel Mazzara","raw_affiliation_strings":["Department of Computer Science, Innopolis University, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Innopolis University, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007225479","display_name":"Smruti R. Sarangi","orcid":"https://orcid.org/0000-0002-1657-8523"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Smruti Sarangi","raw_affiliation_strings":["Department of Computer Science and Engineering (joint appt. with the Department of Electrical Engineering), IIT Delhi, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering (joint appt. with the Department of Electrical Engineering), IIT Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5071424693"],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":0.3057,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55081577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9934999942779541,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6980116963386536},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6333905458450317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6247628927230835},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6159021854400635},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5938379168510437},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5335256457328796},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46663790941238403},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4242883026599884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33635446429252625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17223426699638367},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16467565298080444},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11425939202308655}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6980116963386536},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6333905458450317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6247628927230835},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6159021854400635},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5938379168510437},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5335256457328796},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46663790941238403},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4242883026599884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33635446429252625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17223426699638367},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16467565298080444},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11425939202308655},{"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},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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.1145/3565270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3565270","pdf_url":null,"source":{"id":"https://openalex.org/S2506189754","display_name":"ACM Transactions on Cyber-Physical Systems","issn_l":"2378-962X","issn":["2378-962X","2378-9638"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Cyber-Physical Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1549905066","https://openalex.org/W2023441626","https://openalex.org/W2067050450","https://openalex.org/W2123871098","https://openalex.org/W2522045913","https://openalex.org/W2586416742","https://openalex.org/W2745115605","https://openalex.org/W2752803750","https://openalex.org/W2783888710","https://openalex.org/W2798788211","https://openalex.org/W2882995207","https://openalex.org/W2897895275","https://openalex.org/W2901478555","https://openalex.org/W2921100876","https://openalex.org/W2963183067","https://openalex.org/W2997591727","https://openalex.org/W2997694678","https://openalex.org/W3012451423","https://openalex.org/W3091688642","https://openalex.org/W3103046467","https://openalex.org/W3114616371","https://openalex.org/W3153545263","https://openalex.org/W3159533373","https://openalex.org/W3179514102"],"related_works":["https://openalex.org/W2982486675","https://openalex.org/W3122122033","https://openalex.org/W3102407684","https://openalex.org/W2591763881","https://openalex.org/W2797562266","https://openalex.org/W2224554719","https://openalex.org/W3015312049","https://openalex.org/W4294640227","https://openalex.org/W2402452436","https://openalex.org/W3089420797"],"abstract_inverted_index":{"Present-day":[0],"path":[1,59,80],"planning":[2],"algorithms":[3],"for":[4,28,56,103,176],"UAVs":[5],"rely":[6],"on":[7],"various":[8],"parameters":[9,106],"that":[10,45,67,122,137,147,190,229],"need":[11,114],"to":[12,17,20,49,74,115,192,213],"be":[13,18,211],"tuned":[14],"at":[15,107,178],"runtime":[16,108],"able":[19],"plan":[21,50],"the":[22,32,43,51,53,64,68,78,134,214,218],"best":[23],"possible":[24],"route.":[25],"For":[26],"example,":[27],"a":[29,37,58,61,90,100,117],"sampling-based":[30],"algorithm,":[31],"number":[33],"of":[34,42,92,126,130,133,217],"samples":[35],"plays":[36],"crucial":[38],"role.":[39],"The":[40,128,205],"dimension":[41],"space":[44],"is":[46,109,142,244],"being":[47],"searched":[48],"path,":[52],"minimum":[54,65],"distance":[55,66],"extending":[57],"in":[60,139,224],"direction,":[62],"and":[63,97,121,171,186,241],"drone":[69],"should":[70],"maintain":[71],"with":[72,86,155],"respect":[73],"obstacles":[75],"while":[76],"traversing":[77],"planned":[79],"are":[81,164,172,232],"all":[82,104],"important":[83],"variables.":[84],"Along":[85],"this,":[87],"we":[88,113,183,227],"have":[89,168],"choice":[91],"vision":[93],"algorithms,":[94],"their":[95],"parameters,":[96],"platforms.":[98],"Finding":[99],"suitable":[101,175],"configuration":[102],"these":[105],"very":[110],"challenging":[111],"because":[112],"solve":[116,193],"complicated":[118],"optimization":[119,135,151,195],"problem,":[120],"too":[123],"within":[124],"tens":[125],"milliseconds.":[127],"area":[129],"theoretical":[131],"exploration":[132],"problems":[136,196],"arise":[138],"such":[140,158],"settings":[141],"dominated":[143],"by":[144,197,238],"traditional":[145,239],"approaches":[146],"use":[148,177],"regular":[149],"nonlinear":[150],"techniques":[152,157,163],"often":[153],"enhanced":[154],"AI-based":[156],"as":[159],"genetic":[160],"algorithms.":[161],"These":[162],"sadly":[165],"rather":[166],"slow,":[167],"convergence":[169],"issues,":[170],"typically":[173],"not":[174],"runtime.":[179],"In":[180],"this":[181],"article,":[182],"leverage":[184],"recent":[185],"promising":[187],"research":[188],"results":[189],"propose":[191],"complex":[194],"converting":[198],"them":[199],"into":[200],"approximately":[201],"equivalent":[202],"game-theoretic":[203],"problems.":[204],"computed":[206],"equilibrium":[207],"strategies":[208],"can":[209],"then":[210],"mapped":[212],"optimal":[215],"values":[216],"tunable":[219],"parameters.":[220],"With":[221],"simulation":[222],"studies":[223],"virtual":[225],"worlds,":[226],"show":[228],"our":[230,242],"solutions":[231],"5-21%":[233],"better":[234],"than":[235],"those":[236],"produced":[237],"methods,":[240],"approach":[243],"10\u00d7":[245],"faster.":[246]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}