Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 48 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 473 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

DDPG-based Resource Management for MEC/UAV-Assisted Vehicular Networks (2009.03721v1)

Published 19 Aug 2020 in cs.NI

Abstract: In this paper, we investigate joint vehicle association and multi-dimensional resource management in a vehicular network assisted by multi-access edge computing (MEC) and unmanned aerial vehicle (UAV). To efficiently manage the available spectrum, computing, and caching resources for the MEC-mounted base station and UAVs, a resource optimization problem is formulated and carried out at a central controller. Considering the overlong solving time of the formulated problem and the sensitive delay requirements of vehicular applications, we transform the optimization problem using reinforcement learning and then design a deep deterministic policy gradient (DDPG)-based solution. Through training the DDPG-based resource management model offline, optimal vehicle association and resource allocation decisions can be obtained rapidly. Simulation results demonstrate that the DDPG-based resource management scheme can converge within 200 episodes and achieve higher delay/quality-of-service satisfaction ratios than the random scheme.

Citations (31)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)