Abstract

Search and Rescue (SAR) missions aim to search and provide first aid to persons in distress or danger. Due to the urgency of these situations, it is important to possess a system able to take fast action and effectively and efficiently utilise the available resources to conduct the mission. In addition, the potential complexity of the search such as the ruggedness of terrain or large size of the search region should be considered. Such issues can be tackled by using Unmanned Aerial Vehicles (UAVs) equipped with optical sensors. This can ensure the efficiency in terms of speed, coverage and flexibility required to conduct this type of time-sensitive missions. This paper centres on designing a fast solution approach for planning UAV-assisted SAR missions. The challenge is to cover an area where targets (people in distress after a hurricane or earthquake, lost vessels in sea, missing persons in mountainous area, etc.) can be potentially found with a variable likelihood. The search area is modelled using a scoring map to support the choice of the search sub-areas, where the scores represent the likelihood of finding a target. The goal of this paper is to propose a heuristic approach to automate the search process using scarce heterogeneous resources in the most efficient manner.

Highlights

  • Due to the computation complexity of the Team Orienteering Problem (TOP), exact solutions are only explored for small instances, and heuristic solutions are considered for large-scale instances

  • Heuristic and metaheuristic methods are proposed as solution approaches to tackle the Search and Rescue (SAR) problem formulated in Section 3, in addition to a constructive algorithm which is used in the proposed metaheuristic framework

  • The results show that Greedy Randomised Adaptive Search Procedure (GRASP) outperforms both the Greedy and Hill Climbing algorithms for all instances

Read more

Summary

A GRASP-Based Approach for Planning UAV-Assisted Search and Rescue Missions

Casper Bak Pedersen , Kasper Gaj Nielsen , Kasper Rosenkrands , Alex Elkjær Vasegaard , Peter Nielsen and Mohamed El Yafrani *. Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations

Literature Review
Problem Formulation
The Proposed Approach
Exact Solution Approach
Heuristics and Metaheuristics
A Greedy Algorithm
Hill Climbing
Parameter Tuning
Numerical Results
Discussion
Conclusions and Future Directions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call