Coordinated UAV-UGV trajectory planning based on load balancing in IoT data collection
To improve the efficiency of large-scale Internet of things (IoT) data collection, a coordinated trajectory planning algorithm for multiple aerial and ground vehicles based on load balancing region partitioning was proposed, where unmanned aerial vehicles (UAVs) acting as aerial base stations were d...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024005/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To improve the efficiency of large-scale Internet of things (IoT) data collection, a coordinated trajectory planning algorithm for multiple aerial and ground vehicles based on load balancing region partitioning was proposed, where unmanned aerial vehicles (UAVs) acting as aerial base stations were dispatched to gather data from IoT devices and unmanned ground vehicles (UGVs) acting as mobile battery swap stations were used to compensate for the shortage of UAV’s energy.Aiming at shortening the mission completion time, the optimization task was to minimize the longest mission time among a fleet of UAV-UGVs, which was formulated as a variant of min-max multi-depot vehicle routing problem and solved from the load-balancing perspective.Specifically, the IoT devices were assigned to the UAV-UGVs’ service zones by a load-balancing region partition algorithm, based on which the trajectory planning problem of multiple UAV and UGV was reduced to several independent route planning problems for each UAV-UGV pair.Then, a cooperative trajectory planning strategy was developed to optimize the route in each service zone.Numerical results validate that the proposed algorithm outperforms the compared algorithms in terms of mission completion time and balancing degree. |
|---|---|
| ISSN: | 1000-436X |