Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.03169 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909823453364224 |
|---|---|
| author | Li, Duanjiao Chen, Yun Zhang, Ying Yao, Junwen Huang, Dongyue Zhang, Jianguo Ding, Ning |
| author_facet | Li, Duanjiao Chen, Yun Zhang, Ying Yao, Junwen Huang, Dongyue Zhang, Jianguo Ding, Ning |
| contents | For typical applications of UAVs in power grid scenarios, we construct the problem as planning UAV trajectories for coverage in cluttered environments. In this paper, we propose an optimal smooth coverage trajectory planning algorithm. The algorithm consists of two stages. In the front-end, a Genetic Algorithm (GA) is employed to solve the Traveling Salesman Problem (TSP) for Points of Interest (POIs), generating an initial sequence of optimized visiting points. In the back-end, the sequence is further optimized by considering trajectory smoothness, time consumption, and obstacle avoidance. This is formulated as a nonlinear least squares problem and solved to produce a smooth coverage trajectory that satisfies these constraints. Numerical simulations validate the effectiveness of the proposed algorithm, ensuring UAVs can smoothly cover all POIs in cluttered environments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_03169 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Smooth Coverage Trajectory Planning for Quadrotors in Cluttered Environment Li, Duanjiao Chen, Yun Zhang, Ying Yao, Junwen Huang, Dongyue Zhang, Jianguo Ding, Ning Robotics For typical applications of UAVs in power grid scenarios, we construct the problem as planning UAV trajectories for coverage in cluttered environments. In this paper, we propose an optimal smooth coverage trajectory planning algorithm. The algorithm consists of two stages. In the front-end, a Genetic Algorithm (GA) is employed to solve the Traveling Salesman Problem (TSP) for Points of Interest (POIs), generating an initial sequence of optimized visiting points. In the back-end, the sequence is further optimized by considering trajectory smoothness, time consumption, and obstacle avoidance. This is formulated as a nonlinear least squares problem and solved to produce a smooth coverage trajectory that satisfies these constraints. Numerical simulations validate the effectiveness of the proposed algorithm, ensuring UAVs can smoothly cover all POIs in cluttered environments. |
| title | Optimal Smooth Coverage Trajectory Planning for Quadrotors in Cluttered Environment |
| topic | Robotics |
| url | https://arxiv.org/abs/2510.03169 |