Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance and Reconnaissance

Abstract

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

The UJI Aerial Librarian Robot: A Quadcopter for Visual Library Inventory and Book Localisation

“…On the other hand, aerial robotics has grown to be a popular field in the last decade to the extent that unmanned aerial vehicles (UAVs)—or drones—have become a standard platform in the robotics research community [ 18 ] thanks to their versatility, high mobility, and ability to cover areas at different altitudes and locations. Indeed, this kind of robots have enabled a large variety of applications, such as traffic monitoring [ 19 ], tracking [ 20 , 21 ], surveillance [ 22 ], public protection and disaster relief operations [ 23 ], homeland security [ 24 ], film making [ 25 ], farming [ 26 ], mining [ 27 ], personal assistance [ 28 , 29 ], smart cities [ 30 ], or package delivery [ 31 ].…”

Designing unmanned aerial vehicle networks for biological material transportation – The case of Brussels

“…They formulate a coverage location model, referred to as distance-restricted maximal coverage location model, and solve it by the way of a heuristic based on a simulated annealing with a greedy algorithm. Liu et al (2019) investigate the location-routing problem of UAVs in border patrol for intelligence, surveillance, and reconnaissance; two heuristic algorithms combined with local search strategies are designed for solving the problem. In the care sector, Pulver et al (2016) address the maximum coverage problem for debrillators in the Salt Lake City area.…”