Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles
Abstract
New threat perceptions have extended the sense of self-defense to include preemptive strikes if a threat is going to occur. For its part, the military should have high Intelligence, Surveillance, and Reconnaissance (ISR) capabilities to implement this strategy. UAVs play an important role as the most effective way of providing high quality ISR in today s modern wars. The route planning of UAVs is the most critical and challenging problem of wartime. This thesis will develop three algorithms to solve a model that produces executable routings in order to dispatch three Unmanned Aerial Vehicles (UAV) to complete 20 different missions in different locations. These algorithms seek to maximize the bonus points are paired with the targets, representing the priority of the missions. By this definition, the problem can be classified as a Multiple Tour Maximum Prize Collection Problem (MTMPC). MTMCP is closely related to the classical Traveling Salesman and Vehicle Routing Problems with the difference that not all nodes can be visited in the available time. Each node is assigned a bonus point value representing the priority of that mission, and the objective of the MTMCP is to determine the nodes to be visited to maximize the collected bonus points.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2008
- Accession Number
- ADA494126
Entities
People
- Erkan Sonmezocak
- Senol Kurt
Organizations
- Naval Postgraduate School