Optimal placement of base stations in border surveillance using limited capacity drones

DOI10.1016/j.tcs.2022.06.024OpenAlexW4282970360MaRDI QIDQ2079881

Yanyan Li

Publication date: 7 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.13311

zbMATH Keywords

algorithmsoptimal locationunmanned aerial vehiclespolygonsborder protection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing and recognizing weak visibility polygons
• Location-routing: issues, models and methods
• Finding shortest safari routes in simple polygons
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On-line construction of the convex hull of a simple polyline
• Triangulating a simple polygon in linear time
• The zookeeper route problem
• Continuous location of dimensional structures.
• Fast computation of shortest watchman routes in simple polygons
• An O\((n\log n)\) algorithm for the zoo-keeper's problem
• The location-allocation problem of drone base stations
• Unmanned aerial vehicle hub-location and routing for monitoring geographic borders
• Euclidean shortest paths in the presence of rectilinear barriers
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: Optimal placement of base stations in border surveillance using limited capacity drones