Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.11752 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912875682988032 |
|---|---|
| author | Viet, Pham Q. Romero, Daniel |
| author_facet | Viet, Pham Q. Romero, Daniel |
| contents | Autonomous uncrewed aerial vehicles (UAVs) can be utilized as aerial relays to serve users far from terrestrial infrastructure. Unfortunately, existing algorithms for aerial relay path planning cannot accommodate general flight constraints or channel models. This is required in practice due to connectivity constraints, the presence of obstacles (e.g., buildings), and regulations. This paper proposes a framework that overcomes these limitations by spatially discretizing the flight region. To cope with the resulting exponential growth in complexity, the framework adopts a probabilistic roadmap approach, where a shortest path is found through a graph of randomly generated states. To attain high optimality with affordable complexity, the probability distribution used to generate these states is designed based on heuristic path planners with theoretical guarantees. The algorithms derived in this framework not only overcome the main limitations of existing schemes but also entail smaller computational complexity. Extensive theoretical and numerical results corroborate the merits of the proposed approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_11752 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Path Planning for Aerial Relays via Probabilistic Roadmaps Viet, Pham Q. Romero, Daniel Optimization and Control Autonomous uncrewed aerial vehicles (UAVs) can be utilized as aerial relays to serve users far from terrestrial infrastructure. Unfortunately, existing algorithms for aerial relay path planning cannot accommodate general flight constraints or channel models. This is required in practice due to connectivity constraints, the presence of obstacles (e.g., buildings), and regulations. This paper proposes a framework that overcomes these limitations by spatially discretizing the flight region. To cope with the resulting exponential growth in complexity, the framework adopts a probabilistic roadmap approach, where a shortest path is found through a graph of randomly generated states. To attain high optimality with affordable complexity, the probability distribution used to generate these states is designed based on heuristic path planners with theoretical guarantees. The algorithms derived in this framework not only overcome the main limitations of existing schemes but also entail smaller computational complexity. Extensive theoretical and numerical results corroborate the merits of the proposed approach. |
| title | Path Planning for Aerial Relays via Probabilistic Roadmaps |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2310.11752 |