{"id":"https://openalex.org/W6926140463","doi":"https://doi.org/10.21227/8yvb-e654","title":"MADDPG and P2P-VFRL for minimizing AoI in NTN network under CSI uncertainty","display_name":"MADDPG and P2P-VFRL for minimizing AoI in NTN network under CSI uncertainty","publication_year":2022,"publication_date":"2022-10-08","ids":{"openalex":"https://openalex.org/W6926140463","doi":"https://doi.org/10.21227/8yvb-e654"},"language":"en","primary_location":{"id":"doi:10.21227/8yvb-e654","is_oa":true,"landing_page_url":"https://doi.org/10.21227/8yvb-e654","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"type":"dataset","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.21227/8yvb-e654","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ansarifard, Maryam","orcid":null},"institutions":[{"id":"https://openalex.org/I1516879","display_name":"Tarbiat Modares University","ror":"https://ror.org/03mwgfy56","country_code":"IR","type":"education","lineage":["https://openalex.org/I1516879"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Ansarifard, Maryam","raw_affiliation_strings":["Tarbiat Modares University(TMU)"],"affiliations":[{"raw_affiliation_string":"Tarbiat Modares University(TMU)","institution_ids":["https://openalex.org/I1516879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1516879"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12248","display_name":"Water Governance and Infrastructure","score":0.14429999887943268,"subfield":{"id":"https://openalex.org/subfields/3320","display_name":"Political Science and International Relations"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12248","display_name":"Water Governance and Infrastructure","score":0.14429999887943268,"subfield":{"id":"https://openalex.org/subfields/3320","display_name":"Political Science and International Relations"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11331","display_name":"Fecal contamination and water quality","score":0.06840000301599503,"subfield":{"id":"https://openalex.org/subfields/2312","display_name":"Water Science and Technology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10596","display_name":"Child Nutrition and Water Access","score":0.05209999904036522,"subfield":{"id":"https://openalex.org/subfields/2916","display_name":"Nutrition and Dietetics"},"field":{"id":"https://openalex.org/fields/29","display_name":"Nursing"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5857999920845032},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5141000151634216},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.4936999976634979},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4625999927520752},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4422999918460846},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4352000057697296},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41339999437332153},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.3993000090122223},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39899998903274536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7149999737739563},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5857999920845032},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5141000151634216},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46299999952316284},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4422999918460846},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4352000057697296},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4255000054836273},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.40290001034736633},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.3993000090122223},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.37229999899864197},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C153646914","wikidata":"https://www.wikidata.org/wiki/Q535695","display_name":"Cellular network","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C2989126829","wikidata":"https://www.wikidata.org/wiki/Q2388981","display_name":"Power network","level":4,"score":0.2969000041484833},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C95491727","wikidata":"https://www.wikidata.org/wiki/Q992968","display_name":"Mobile telephony","level":3,"score":0.2815000116825104},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C2985963534","wikidata":"https://www.wikidata.org/wiki/Q7603704","display_name":"State information","level":3,"score":0.2766999900341034},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C2986053828","wikidata":"https://www.wikidata.org/wiki/Q355217","display_name":"Time budget","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21227/8yvb-e654","is_oa":true,"landing_page_url":"https://doi.org/10.21227/8yvb-e654","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"dataset"}],"best_oa_location":{"id":"doi:10.21227/8yvb-e654","is_oa":true,"landing_page_url":"https://doi.org/10.21227/8yvb-e654","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Non-terrestrial":[0],"networks":[1],"(NTNs)":[2],"are":[3,73,168],"emerging":[4],"asa":[5],"promising":[6],"solution":[7],"to":[8,15,63,86,101,131,150,177],"handle":[9],"the":[10,16,23,38,65,82,88,117,152,164,172],"increment":[11],"of":[12,18,25,27,37,54,68,90,126,138,161],"computationrequirements.":[13],"Due":[14],"importance":[17],"time":[19,99],"in":[20,44],"computationintensive":[21],"applications,":[22],"criterion":[24],"age":[26],"information":[28],"(AoI)has":[29],"been":[30],"introduced,":[31],"which":[32,113,170],"gives":[33],"a":[34,49],"better":[35],"view":[36],"freshness":[39],"ofinformation.":[40],"To":[41],"this":[42,45,133],"aim,":[43],"paper":[46],"we":[47],"develop":[48],"hierarchicalaerial":[50],"computing":[51],"framework":[52],"composed":[53],"high":[55],"altitude":[56],"platform(HAP)":[57],"and":[58,106,122,144,163],"unmanned":[59],"aerial":[60],"vehicles":[61],"(UAVs)":[62],"compute":[64],"fulloffloaded":[66],"tasks":[67,93],"terrestrial":[69],"mobile":[70],"users":[71],"who":[72],"connected":[74],"byuplink":[75],"non-orthogonal":[76],"multiple":[77,123],"access":[78],"(UL-NOMA).":[79],"In":[80,129],"particular,":[81],"problem":[83],"is":[84,114],"formulated":[85],"minimize":[87],"AoI":[89],"all":[91],"users,whose":[92],"can":[94],"take":[95],"more":[96],"than":[97],"one":[98],"slot":[100],"be":[102],"received,by":[103],"UAV\u2019s":[104],"trajectory":[105],"resource":[107,124],"allocation":[108],"on":[109],"both":[110],"UAVsand":[111],"HAP,":[112],"restricted":[115],"by":[116],"channel":[118],"state":[119],"information(CSI)":[120],"uncertainty":[121],"constraints":[125],"UAVs":[127],"andHAP.":[128],"order":[130],"solve":[132],"non-convex":[134],"optimization":[135],"problem,two":[136],"methods":[137],"multi-agent":[139],"deep":[140],"deterministic":[141],"policy":[142],"gradient(MADDPG)":[143],"federated":[145],"reinforcement":[146],"learning":[147],"(FRL)":[148],"areconsidered":[149],"design":[151],"UAVs\u2019":[153],"trajectory,":[154],"channel,":[155],"power":[156],"andCPU":[157],"allocation.":[158],"The":[159],"complexity":[160],"algorithms":[162],"impactsof":[165],"different":[166],"parameters":[167],"analyzed":[169],"verifies":[171],"efficiencyof":[173],"MADDPG":[174],"approach":[175],"compared":[176],"other":[178],"method":[179]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}