Maximizing Search Coverage Using Future Path Projection for Cooperative Multiple UAVs with Limited Communication Ranges
From MaRDI portal
Publication:3589735
Recommendations
- Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
- Cooperative area search algorithm for multi-UAVs in uncertainty environment
- Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms
- Multi-UAVs cooperative localization algorithms with communication constraints
- An efficient method for maximal area coverage in the context of a hierarchical controller for multiple unmanned aerial vehicles
- Cooperative solution of multi-UAV rendezvous problem with network restrictions
- Cooperative moving path following for multiple fixed-wing unmanned aerial vehicles with speed constraints
Cites work
Cited in
(5)- Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms
- Importance-based distributed persistent coverage strategy over environmental hotspots using quadrotors: algorithm and experiments
- An efficient method for maximal area coverage in the context of a hierarchical controller for multiple unmanned aerial vehicles
- Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
- Cooperative area search algorithm for multi-UAVs in uncertainty environment
This page was built for publication: Maximizing Search Coverage Using Future Path Projection for Cooperative Multiple UAVs with Limited Communication Ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589735)