The rapid growth of mobile data and computing demands has strained resource-constrained edge devices, particularly in supporting IoT applications. Mobile Edge Computing (MEC) offloading alleviates these challenges by shifting complex tasks to edge-cloud servers, reducing computational burdens and enhancing efficiency. The integration of 5G and 6G technologies further enhances MEC by providing ultra-low latency and high-bandwidth connections. Despite the use of deep learning methods in task offloading, current approaches struggle with slow learning and adaptability issues. To address these challenges, we introduce a Deep Meta Reinforcement Learning based Offloading (Deep Meta-RL) Framework. Formulating the task offloading problem as a Markov Decision Process (MDP) enables us to leverage the Deep Meta-RL algorithm for precise offloading decisions, reinforcement learning’s decision-making, and meta-learning’s adaptability. Simulation results demonstrate that Deep Meta-RL significantly outperforms traditional DQN algorithms, achieving a 16.75% improvement in rewards and reducing latency by 20%.

UAVs have the potential to enhance wireless systems by improving range and quality, and this can be achieved by utilising the Mobile Edge Computing provided by the unmanned aerial vehicle. In this system, the MEC server mounted on the unmanned aerial vehicle can offer offload services to all the User Equipment in a given space. By offloading some proportion of its tasks to unmanned aerial vehicle for computation, the UE can perform the remaining tasks locally. The objective of this study is to minimize the maximum processing delay in the whole process by optimizing on four parameters, scheduling of the user equipment, portion of the task that has to be offloaded, angle of flight for the UAV, and speed of flight of the UAV, taking into account discrete variables and power constraints. However, due to the nonconvexity, the state space’s high dimension, and action’s space continuous nature of this problem, we are proposing a Proximal Policy optimization algorithm which is based on boosting the policy gradient. Further we will do a comparative analysis of PPO algorithm with other popular Reinforcement Learning algorithms, particularly the Deep Deterministic Policy Gradient algorithm. PPO algorithm can quickly achieve the optimal policy for offloading computation in a dynamic environment. The results obtained implies that the both PPO and DDPG algorithm converges quickly, and the processing delay is minimizd. However, our proposed PPO algorithm has shown significant improvement in minimizing the processing delay. Our model also performs way better compared to basic algorithm such as Deep Q Network (DQN).