paper-with-me

홈 › Papers

Enhancing UAV Path Planning Efficiency Through Accelerated Learning

2025-01-17 · Joseanne Viana, Boris Galkin, Lester Ho, Holger Claussen

Unmanned Aerial Vehicles (UAVs) are increasingly essential in various fields such as surveillance, reconnaissance, and telecommunications. This study aims to develop a learning algorithm for the path planning of UAV wireless communication relays, which can reduce storage requirements and accelerate Deep Reinforcement Learning (DRL) convergence. Assuming the system possesses terrain maps of the area and can estimate user locations using localization algorithms or direct GPS reporting, it can input these parameters into the learning algorithms to achieve optimized path planning performance. However, higher resolution terrain maps are necessary to extract topological information such as terrain height, object distances, and signal blockages. This requirement increases memory and storage demands on UAVs while also lengthening convergence times in DRL algorithms. Similarly, defining the telecommunication coverage map in UAV wireless communication relays using these terrain maps and user position estimations demands higher memory and storage utilization for the learning path planning algorithms. Our approach reduces path planning training time by applying a dimensionality reduction technique based on Principal Component Analysis (PCA), sample combination, Prioritized Experience Replay (PER), and the combination of Mean Squared Error (MSE) and Mean Absolute Error (MAE) loss calculations in the coverage map estimates, thereby enhancing a Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm. The proposed solution reduces the convergence episodes needed for basic training by approximately four times compared to the traditional TD3.

📄 PDF Abstract BibTeX arXiv:2501.10141

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Reinforcement LearningDimensionality Reduction

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Adam 설명 없음
Clipped Double Q-learning 설명 없음
Target Policy Smoothing Target Policy Smoothing is a regularization strategy for the value function in reinforcement learning. Deterministic policies can overfit to narrow peaks in the value…
Experience Replay Experience Replay is a replay memory technique used in reinforcement learning where we store the agent’s experiences at each time-step, $e\_{t} = \left(s\_{t}, a\_{t}, r\_{t},…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
TD3 TD3 builds on the DDPG algorithm for reinforcement learning, with a couple of modifications aimed at tackling overestimation bias…
GPS Greedy Policy Search (GPS) is a simple algorithm that learns a policy for test-time data augmentation based on the predictive performance on a validation set. GPS starts with…

Similar Papers 제목 키워드 기반

End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition

2025-06-06 · Nikunj Shah, Utsav Dey, Kenji Nishimiya

Efficient Coverage Path Planning (CPP) is necessary for autonomous robotic lawnmowers to effectively navigate and maintain lawns with diverse and irregular shapes. This paper introduces a comprehensive end-to-end pipelin…

Navigate

A Rapid Iterative Trajectory Planning Method for Automated Parking through Differential Flatness

2025-08-23 · Zhouheng Li, Lei Xie, Cheng Hu, Hongye Su arxiv

As autonomous driving continues to advance, automated parking is becoming increasingly essential. However, significant challenges arise when implementing path velocity decomposition (PVD) trajectory planning for automate…

Collision AvoidanceTrajectory PlanningAutonomous Driving

Vectorizing Projection in Manifold-Constrained Motion Planning for Real-Time Whole-Body Control

2026-04-14 · Shrutheesh R Iyer, I-Chia Chang, Andrew Z. Liu, Yan Gu 외 arxiv

Many robot planning tasks require satisfaction of one or more constraints throughout the entire trajectory. For geometric constraints, manifold-constrained motion planning algorithms are capable of planning collision-fre…

Motion Planning

Conformalized Non-uniform Sampling Strategies for Accelerated Sampling-based Motion Planning

2025-11-06 · Shubham Natraj, Bruno Sinopoli, Yiannis Kantaros arxiv

Sampling-based motion planners (SBMPs) are widely used to compute dynamically feasible robot paths. However, their reliance on uniform sampling often leads to poor efficiency and slow planning in complex environments. We…

Motion Planning

Research on reinforcement learning based warehouse robot navigation algorithm in complex warehouse layout

2024-11-09 · Keqin Li, Lipeng Liu, Jiajing Chen, Dezhi Yu 외

In this paper, how to efficiently find the optimal path in complex warehouse layout and make real-time decision is a key problem. This paper proposes a new method of Proximal Policy Optimization (PPO) and Dijkstra's algo…

Decision MakingRobot Navigation