scholarly journals A Hybrid Metaheuristic Algorithm for the Efficient Placement of UAVs

Algorithms ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 323
Author(s):  
Stephanie Alvarez Fernandez ◽  
Marcelo M. Carvalho ◽  
Daniel G. Silva
Keyword(s):  
Optimization Problem ◽  
Data Transfer ◽  
Fixed Number ◽  
Metaheuristic Algorithm ◽  
Network Coverage ◽  
Time Intervals ◽  
Hybrid Metaheuristic ◽  
Relay Communications ◽  
Real World Application ◽  
Short Time

This work addresses the problem of using Unmanned Aerial Vehicles (UAV) to deploy a wireless aerial relay communications infrastructure for stations scattered on the ground. In our problem, every station in the network must be assigned to a single UAV, which is responsible for handling all data transfer on behalf of the stations that are assigned to it. Consequently, the placement of UAVs is key to achieving both network coverage and the maximization of the aggregate link capacities between UAVs and stations, and among the UAVs themselves. Because the complexity of this problem increases significantly with the number of stations to cover, for a given fixed number p of available UAVs, we model it as a single allocation p-hub median optimization problem, and we propose a hybrid metaheuristic algorithm to solve it. A series of numerical experiments illustrate the efficiency of the proposed algorithm against traditional optimization tools, which achieves high-quality results in very short time intervals, thus making it an attractive solution for real-world application scenarios.

On Maximum Discounted Effort Reward Search Problem

2016 ◽  
Vol 33 (03) ◽  
pp. 1650019 ◽  
Author(s):  
Mohamed Abd Allah El-Hadidy
Keyword(s):  
Optimization Problem ◽  
Random Variable ◽  
Fixed Number ◽  
Search Model ◽  
Search Problem ◽  
Time Intervals ◽  
Search Effort ◽  
Stochastic Optimization Problem ◽  
Finite Set ◽  
Fuzzy Parameter

In this paper, we formulate a new search model for detecting two related targets that randomly located in a finite set of different cells or randomly moved through those cells. We assume that the search effort at each fixed number of time intervals is a random variable with a normal distribution. Rather than minimizing the expected effort of detecting two related targets, the proposed mathematical model allows us to include the search effort as a function with fuzzy parameter (discounted parameter). Another feature of this paper is considering a fuzzy extension of a stochastic optimization problem, which is interesting. We present an algorithm that gives the optimal distribution of an effort which makes the discounted effort reward of finding the targets is maximum. Two numerical examples are illustrated to show the effectiveness of this model by setting some parameters to represent some situations, such as detecting the enemy ships, fighters and the landmines in the war.

scholarly journals Dynamic Graph Learning: A Structure-Driven Approach

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 168
Author(s):  
Bo Jiang ◽  
Yuming Huang ◽  
Ashkan Panahi ◽  
Yiyi Yu ◽  
Hamid Krim ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Time Varying ◽  
Dynamic Graph ◽  
Time Intervals ◽  
Data Set ◽  
Network Nodes ◽  
Continuous Relaxation ◽  
Short Time ◽  
The Brain ◽  
Objective Functional

The purpose of this paper is to infer a dynamic graph as a global (collective) model of time-varying measurements at a set of network nodes. This model captures both pairwise as well as higher order interactions (i.e., more than two nodes) among the nodes. The motivation of this work lies in the search for a connectome model which properly captures brain functionality across all regions of the brain, and possibly at individual neurons. We formulate it as an optimization problem, a quadratic objective functional and tensor information of observed node signals over short time intervals. The proper regularization constraints reflect the graph smoothness and other dynamics involving the underlying graph’s Laplacian, as well as the time evolution smoothness of the underlying graph. The resulting joint optimization is solved by a continuous relaxation of the weight parameters and an introduced novel gradient-projection scheme. While the work may be applicable to any time-evolving data set (e.g., fMRI), we apply our algorithm to a real-world dataset comprising recorded activities of individual brain cells. The resulting model is shown to be not only viable but also efficiently computable.

Proposal of PV Output Estimate Method in Short Time Intervals

2016 ◽  
Vol 136 (12) ◽  
pp. 891-897 ◽  
Author(s):  
Katsuhiro Matsuda ◽  
Kazuhiro Misawa ◽  
Hirotaka Takahashi ◽  
Kenta Furukawa ◽  
Satoshi Uemura
Keyword(s):  
Time Intervals ◽  
Estimate Method ◽  
Short Time

EVALUATION OF SHORT TIME INTERVALS IN NORMAL AGING AND LATE-LIFE DEPRESSIONS

2020 ◽  
pp. 54-69
Author(s):  
Elena Yu. Balashova ◽  
◽  
Lika I. Mikeladze ◽  
Elena K. Kozlova ◽  
◽  
...  
Keyword(s):  
Late Life ◽  
Normal Aging ◽  
Time Intervals ◽  
Short Time

scholarly journals Neural Network Approach for Global Solar Irradiance Prediction at Extremely Short-Time-Intervals Using Particle Swarm Optimization Algorithm

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1213
Author(s):  
Ahmed Aljanad ◽  
Nadia M. L. Tan ◽  
Vassilios G. Agelidis ◽  
Hussain Shareef
Keyword(s):  
Neural Networks ◽  
Particle Swarm Optimization ◽  
Solar Irradiance ◽  
Particle Swarm ◽  
Time Interval ◽  
Time Intervals ◽  
Swarm Optimization ◽  
Backpropagation Neural Networks ◽  
Proposed Model ◽  
Short Time

Hourly global solar irradiance (GSR) data are required for sizing, planning, and modeling of solar photovoltaic farms. However, operating and controlling such farms exposed to varying environmental conditions, such as fast passing clouds, necessitates GSR data to be available for very short time intervals. Classical backpropagation neural networks do not perform satisfactorily when predicting parameters within short intervals. This paper proposes a hybrid backpropagation neural networks based on particle swarm optimization. The particle swarm algorithm is used as an optimization algorithm within the backpropagation neural networks to optimize the number of hidden layers and neurons used and its learning rate. The proposed model can be used as a reliable model in predicting changes in the solar irradiance during short time interval in tropical regions such as Malaysia and other regions. Actual global solar irradiance data of 5-s and 1-min intervals, recorded by weather stations, are applied to train and test the proposed algorithm. Moreover, to ensure the adaptability and robustness of the proposed technique, two different cases are evaluated using 1-day and 3-days profiles, for two different time intervals of 1-min and 5-s each. A set of statistical error indices have been introduced to evaluate the performance of the proposed algorithm. From the results obtained, the 3-days profile’s performance evaluation of the BPNN-PSO are 1.7078 of RMSE, 0.7537 of MAE, 0.0292 of MSE, and 31.4348 of MAPE (%), at 5-s time interval, where the obtained results of 1-min interval are 0.6566 of RMSE, 0.2754 of MAE, 0.0043 of MSE, and 1.4732 of MAPE (%). The results revealed that proposed model outperformed the standalone backpropagation neural networks method in predicting global solar irradiance values for extremely short-time intervals. In addition to that, the proposed model exhibited high level of predictability compared to other existing models.

scholarly journals Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

2021 ◽  
Vol 5 (1) ◽  
pp. 1-22
Author(s):  
Jing Tang ◽  
Xueyan Tang ◽  
Andrew Lim ◽  
Kai Han ◽  
Chongshou Li ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Greedy Algorithm ◽  
Branch And Bound ◽  
Upper Bound ◽  
Optimization Problem ◽  
Approximation Factor ◽  
Real World Application ◽  
Efficiency Of Algorithms ◽  
Knapsack Constraint ◽  
Submodular Maximization

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of 0.405, which significantly improves the known factors of 0.357 given by Wolsey and (1-1/e)/2\approx 0.316 given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of (1-1/\sqrte )\approx 0.393 in the literature to clarify a long-standing misconception on this issue. Second, we enhance the modified greedy algorithm to derive a data-dependent upper bound on the optimum. We empirically demonstrate the tightness of our upper bound with a real-world application. The bound enables us to obtain a data-dependent ratio typically much higher than 0.405 between the solution value of the modified greedy algorithm and the optimum. It can also be used to significantly improve the efficiency of algorithms such as branch and bound.

scholarly journals Optimal Perturbations of an Oceanic Vortex Lens

Fluids ◽  
2018 ◽  
Vol 3 (3) ◽  
pp. 63 ◽  
Author(s):  
Thomas Meunier ◽  
Claire Ménesguen ◽  
Xavier Carton ◽  
Sylvie Le Gentil ◽  
Richard Schopp
Keyword(s):  
Normal Mode ◽  
Growth Rates ◽  
Time Interval ◽  
Time Intervals ◽  
Horizontal Structure ◽  
Azimuthal Wave ◽  
Wave Numbers ◽  
Non Linear ◽  
Long Time ◽  
Short Time

The stability properties of a vortex lens are studied in the quasi geostrophic (QG) framework using the generalized stability theory. Optimal perturbations are obtained using a tangent linear QG model and its adjoint. Their fine-scale spatial structures are studied in details. Growth rates of optimal perturbations are shown to be extremely sensitive to the time interval of optimization: The most unstable perturbations are found for time intervals of about 3 days, while the growth rates continuously decrease towards the most unstable normal mode, which is reached after about 170 days. The horizontal structure of the optimal perturbations consists of an intense counter-shear spiralling. It is also extremely sensitive to time interval: for short time intervals, the optimal perturbations are made of a broad spectrum of high azimuthal wave numbers. As the time interval increases, only low azimuthal wave numbers are found. The vertical structures of optimal perturbations exhibit strong layering associated with high vertical wave numbers whatever the time interval. However, the latter parameter plays an important role in the width of the vertical spectrum of the perturbation: short time interval perturbations have a narrow vertical spectrum while long time interval perturbations show a broad range of vertical scales. Optimal perturbations were set as initial perturbations of the vortex lens in a fully non linear QG model. It appears that for short time intervals, the perturbations decay after an initial transient growth, while for longer time intervals, the optimal perturbation keeps on growing, quickly leading to a non-linear regime or exciting lower azimuthal modes, consistent with normal mode instability. Very long time intervals simply behave like the most unstable normal mode. The possible impact of optimal perturbations on layering is also discussed.

Sign in / Sign up

Export Citation Format

Share Document