Routing problems naturally arise in several civil and military applications involving Unmanned Aerial Vehicles (UAVs) with fuel and motion constraints. A typical routing problem requires a team of UAVs to visit a collection of targets with an objective of minimizing the total distance travelled. In this chapter, we consider a class of routing problems and review the classical results and the recent developments available to address the same. © 2007 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Rathinam, S., & Sengupta, R. (2007). Algorithms for routing problems involving UAVs. Studies in Computational Intelligence, 70, 147–172. https://doi.org/10.1007/978-3-540-72696-8_6
Mendeley helps you to discover research relevant for your work.