{"id":"https://openalex.org/W7138877778","doi":"https://doi.org/10.1109/globecom59602.2025.11432205","title":"A PPO-based Task Offloading and Resource Allocation Algorithm for VEC Systems","display_name":"A PPO-based Task Offloading and Resource Allocation Algorithm for VEC Systems","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138877778","doi":"https://doi.org/10.1109/globecom59602.2025.11432205"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100709184","display_name":"Xinyu Zhao","orcid":"https://orcid.org/0000-0002-5128-4424"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Zhao","raw_affiliation_strings":["Southeast University,School of Information Science and Engineering,Nanjing,China,210096"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southeast University,School of Information Science and Engineering,Nanjing,China,210096","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130097835","display_name":"Jun Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Zheng","raw_affiliation_strings":["Southeast University,School of Information Science and Engineering,Nanjing,China,210096"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southeast University,School of Information Science and Engineering,Nanjing,China,210096","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71171205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1141","last_page":"1146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.833899974822998,"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"}},"topics":[{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.833899974822998,"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"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.05810000002384186,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.009399999864399433,"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/markov-decision-process","display_name":"Markov decision process","score":0.6800000071525574},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.644599974155426},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5928999781608582},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.454800009727478},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4521999955177307},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44530001282691956},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4203999936580658},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.39089998602867126}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7738999724388123},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6800000071525574},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.644599974155426},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.550599992275238},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.454800009727478},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4521999955177307},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39089998602867126},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38499999046325684},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C166109690","wikidata":"https://www.wikidata.org/wiki/Q4677422","display_name":"Action selection","level":3,"score":0.3231000006198883},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.3199000060558319},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3086000084877014},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2612999975681305}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2982650630","https://openalex.org/W3196226093","https://openalex.org/W3212172638","https://openalex.org/W4214717370","https://openalex.org/W4313118019","https://openalex.org/W4386212337","https://openalex.org/W4388692586","https://openalex.org/W4392207799"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,42,62,66,72,75,106,134,142,145,157,167,176,181,186,196,201],"task":[4,50,92,178,198],"offloading":[5,31,93],"and":[6,32,52,85,94,119,140,180,188],"resource":[7,33,53,95,183],"allocation":[8,34,96],"problem":[9,18,26,76],"in":[10,41,156,185,193,200],"a":[11,22,46,80,86,102,120,130,173],"vehicle":[12],"edge":[13],"computing":[14,38],"(VEC)":[15],"system.":[16,202],"The":[17,108],"is":[19,59,77,98],"formulated":[20,73],"as":[21],"long-term":[23],"stochastic":[24],"optimization":[25,89],"aiming":[27],"to":[28,100,105,115,123,132],"jointly":[29],"make":[30],"decisions":[35],"for":[36,55],"all":[37,56],"tasks":[39,58,67],"generated":[40],"system":[43],"such":[44],"that":[45,166],"weighted":[47],"sum":[48],"of":[49,65,136,144,160,195],"utilities":[51],"costs":[54],"offloaded":[57],"maximized":[60],"while":[61],"delay":[63],"constraints":[64],"are":[68],"satisfied.":[69],"To":[70],"solve":[71],"problem,":[74],"transformed":[78],"into":[79],"Markov":[81],"decision":[82,151],"process":[83,159],"(MDP),":[84],"proximal":[87],"policy":[88,125],"(PPO)":[90],"based":[91],"algorithm":[97,110,169],"proposed":[99,109,168],"find":[101],"near-optimal":[103],"solution":[104],"problem.":[107],"introduces":[111],"an":[112,137,161],"actor":[113],"network":[114,122],"perform":[116,124],"action":[117,138,146],"selection":[118],"critic":[121],"evaluation.":[126],"Meanwhile,":[127],"it":[128],"uses":[129],"method":[131],"reduce":[133],"size":[135],"space":[139,147],"keep":[141],"dimension":[143],"unchanged":[148],"by":[149],"decoupling":[150],"steps":[152,155],"from":[153],"real-time":[154],"decision-making":[158],"agent.":[162],"Simulation":[163],"results":[164],"show":[165],"can":[170],"effectively":[171],"achieve":[172],"balance":[174],"between":[175],"total":[177,197],"utility":[179,199],"average":[182],"cost":[184],"system,":[187],"outperforms":[189],"several":[190],"benchmark":[191],"algorithms":[192],"terms":[194]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-03-20T00:00:00"}