- We will send in 10–14 business days.
/images/books/7107056/9781249593683.jpg)
- Author: Kevin P O'Rourke
- Publisher: BiblioScholar
- ISBN-10: 1249593689
- ISBN-13: 9781249593683
- Format: 18.9 x 24.6 x 0.7 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Dynamic Unmanned Aerial Vehicle Routing with a Java-Encoded Reactive Tabu Search Metaheuristic (e-book) (used book) | bookbook.eu
Reviews
Description
In this paper we consider the dynamic routing of unmanned aerial vehicles (UAVs) currently in operational use with the US Air Force. Dynamic vehicle routing problems (VRP) have always been challenging, and the airborne version of the VRP adds dimensions and difficulties not present in typical ground-based applications. Previous UAV routing work has focused on primarily on static, pre-planned situations; however, scheduling military operations, which are often ad-hoc, drives the need for a dynamic route solver that can respond to rapidly evolving problem constraints. With these considerations in mind, we examine the use of a Java-encoded metaheuristic to solve these dynamic routing problems, explore its operation with several general problem classes, and look at the advantages it provides in sample UAV routing problems. The end routine provides routing information for a UAV virtual battlespace simulation and allows dynamic routing of operational missions.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.02:43:42
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Kevin P O'Rourke
- Publisher: BiblioScholar
- ISBN-10: 1249593689
- ISBN-13: 9781249593683
- Format: 18.9 x 24.6 x 0.7 cm, minkšti viršeliai
- Language: English English
In this paper we consider the dynamic routing of unmanned aerial vehicles (UAVs) currently in operational use with the US Air Force. Dynamic vehicle routing problems (VRP) have always been challenging, and the airborne version of the VRP adds dimensions and difficulties not present in typical ground-based applications. Previous UAV routing work has focused on primarily on static, pre-planned situations; however, scheduling military operations, which are often ad-hoc, drives the need for a dynamic route solver that can respond to rapidly evolving problem constraints. With these considerations in mind, we examine the use of a Java-encoded metaheuristic to solve these dynamic routing problems, explore its operation with several general problem classes, and look at the advantages it provides in sample UAV routing problems. The end routine provides routing information for a UAV virtual battlespace simulation and allows dynamic routing of operational missions.
Reviews