Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.08405 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912320891912192 |
|---|---|
| author | Wang, Jiawei Chau, Vincent Wu, Weiwei |
| author_facet | Wang, Jiawei Chau, Vincent Wu, Weiwei |
| contents | We study the problem of the Unmanned Aerial Vehicle (UAV) such that a specific set of objects needs to be observed while ensuring a quality of observation. Our goal is to determine the shortest path for the UAV. This paper proposes an offline algorithm with an approximation of $(2+2n)(1+ε)$ where $ε>0$ is a small constant, and $n$ is the number of objects. We then propose several online algorithms in which objects are discovered during the process. To evaluate the performance of these algorithms, we conduct experimental comparisons. Our results show that the online algorithms perform similarly to the offline algorithm, but with significantly faster execution times ranging from 0.01 seconds to 200 seconds. We also show that our methods yield solutions with costs comparable to those obtained by the Gurobi optimizer that requires 30000 seconds of runtime. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_08405 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Approximation Algorithms for the UAV Path Planning with Object Coverage Constraints Wang, Jiawei Chau, Vincent Wu, Weiwei Computational Engineering, Finance, and Science We study the problem of the Unmanned Aerial Vehicle (UAV) such that a specific set of objects needs to be observed while ensuring a quality of observation. Our goal is to determine the shortest path for the UAV. This paper proposes an offline algorithm with an approximation of $(2+2n)(1+ε)$ where $ε>0$ is a small constant, and $n$ is the number of objects. We then propose several online algorithms in which objects are discovered during the process. To evaluate the performance of these algorithms, we conduct experimental comparisons. Our results show that the online algorithms perform similarly to the offline algorithm, but with significantly faster execution times ranging from 0.01 seconds to 200 seconds. We also show that our methods yield solutions with costs comparable to those obtained by the Gurobi optimizer that requires 30000 seconds of runtime. |
| title | Approximation Algorithms for the UAV Path Planning with Object Coverage Constraints |
| topic | Computational Engineering, Finance, and Science |
| url | https://arxiv.org/abs/2504.08405 |