Close-enough general routing problem for multiple unmanned aerial vehicles in monitoring missions
New algorithm reduces drone fleet travel distance by optimizing 'close-enough' monitoring points.
Deep Dive
A research team led by Huan Liu introduced the CEMUAVGRP framework for coordinating multiple UAVs. Their AILS-VND-SOCP algorithm uses a two-phase iterative method combining variable neighborhood descent and second-order cone programming. This allows drone fleets to efficiently monitor areas by visiting optimized 'representative points' within disk neighborhoods instead of exact coordinates, minimizing total travel distance for surveillance and inspection tasks.
Why It Matters
Enables more efficient large-scale drone operations for infrastructure inspection, agriculture, and security with reduced energy and time costs.