Disaster Region Coverage Using Drones: Maximum Area Coverage and Minimum Resource Utilisation

نویسندگان

چکیده

The purpose of this study is to develop a design for maximum area drone coverage in post-disaster flood situation. When it comes covering disaster-region monitoring and detection the extent damage losses, suitable technically balanced approach vital achieving best solution while affected area. Therefore, mathematical optimisation model proposed effectively capture images impacted region. particle swarm (PSO) algorithm used solve problem. Modern relief missions heavily rely on drones, specifically case flooding, due disaster create roadmaps help people. This system has convincing results inertia, exploration, exploitation, velocity, determining height drones enhance response disaster. indicates that when maintaining flight above 120 m, can be enhanced by approximately 34% compared with 100 m.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximum Coverage Set Calculated Algorithm for WSN Area Coverage

The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, maximum set covers problem is pr...

متن کامل

On Realistic Target Coverage by Autonomous Drones

Low-cost mini-drones with advanced sensing and maneuverability enable a new class of intelligent sensing systems. Œis trend motivated several research e‚orts to employ drones as standalone systems or to assist legacy deployments. However, several fundamental challenges remain unsolved including: 1) Adequate coverage of sizable targets; 2) Target orientation that render coverage e‚ective only fr...

متن کامل

Maximum Coverage Representative Skyline

Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline points. However, existing approaches are not scaleinvariant, not stable, or must materialise the entire skyline. We introduce the maximum coverage representative skyline, which returns the k points collectively dominatin...

متن کامل

Online Maximum k-Coverage

We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memor...

متن کامل

Online Budgeted Maximum Coverage

We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a given budget. Upon arrival of a set the algorithm must decide whether to accept or to reject the arriving set, and it may also drop previously acce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Drones

سال: 2022

ISSN: ['2504-446X']

DOI: https://doi.org/10.3390/drones6040096