A UAV routing and sensor control optimization algorithm for target search

Author(s):  
Gaemus E. Collins ◽  
James R. Riehl ◽  
Philip S. Vegdahl
2010 ◽  
Vol 30 (9) ◽  
pp. 2444-2448
Author(s):  
Ke-ji WANG ◽  
Zhi-wei KANG ◽  
Xin-huan LIU ◽  
Bu-zhen CHEN

SPE Journal ◽  
2015 ◽  
Vol 20 (04) ◽  
pp. 856-871 ◽  
Author(s):  
Andrés Codas ◽  
Bjarne Foss ◽  
Eduardo Camponogara

Summary We propose to formulate and solve the reservoir-control optimization problem with the direct multiple-shooting method. This method divides the optimal-control problem prediction horizon in smaller intervals that one can evaluate in parallel. Further, output constraints are easily established on each interval boundary and as such hardly affect computation time. This opens new opportunities to include state constraints on a much broader scale than is common in reservoir optimization today. However, multiple shooting deals with a large number of variables because it decides on the boundary-state variables of each interval. Therefore, we exploit the structure of the reservoir simulator to conceive a variable-reduction technique to solve the optimization problem with a reduced sequential quadratic-programming algorithm. We discuss the optimization-algorithm building blocks and focus on structure exploitation and parallelization opportunities. To demonstrate the method's capabilities to handle output constraints, the optimization algorithm is interfaced to an open-source reservoir simulator. Then, on the basis of a widely used reservoir model, we evaluate performance, especially related to output constraints. The performance of the proposed method is qualitatively compared with a conventional method.


2021 ◽  
Vol 11 (16) ◽  
pp. 7358
Author(s):  
Linlin Li ◽  
Shufang Xu ◽  
Hua Nie ◽  
Yingchi Mao ◽  
Shun Yu

Unmanned aerial vehicles (UAVs) have shown their superiority in military and civilian missions. In the face of complex tasks, many UAVs are usually needed to cooperate with each other. Therefore, multi-UAV cooperative target search has attracted more and more scholars’ attention. At present, there are many bionic algorithms for solving the cooperative search problem of multi-UAVs, including particle swarm optimization algorithm (PSO) and differential evolution (DE). Pigeon-inspired optimization (PIO) is a new swarm intelligence optimization algorithm proposed in recent years. It has great advantages over other algorithms in convergence, robustness, and accuracy, and has few parameters to be adjusted. Aiming at the shortcomings of the standard pigeon colony algorithm, such as poor population diversity, slow convergence speed, and the ease of falling into local optimum, we have proposed chaotic disturbance pigeon-inspired optimization (CDPIO) algorithm. The improved tent chaotic map was used to initialize the population and increase the diversity of the population. The disturbance factor is introduced in the iterative update stage of the algorithm to generate new individuals, replace the individuals with poor performance, and carry out disturbance to increase the optimization accuracy. Benchmark functions and UAV target search model were used to test the algorithm performance. The results show that the CDPIO had faster convergence speed, better optimization precision, better robustness, and better performance than PIO.


2020 ◽  
Vol 35 (2) ◽  
pp. 95-102
Author(s):  
Chen Zhi ◽  
Yiliang Li ◽  
Huang Ke ◽  
Xiao Kai

A condenser control system of a nuclear power plant consists of a pressure control system, a condensate water sub-cooling degree control system and a water level control system. The existing control optimization methods can hardly take into account all the performance indices of the three control systems at the same time. To solve this problem, this paper presents a control optimization method based on a multi-objective optimization algorithm. This method takes control parameters as optimization objects, and takes the performance of step response as optimization objectives. The multi-objective particle swarm optimization algorithm based on Pareto dominance concept is used to solve the optimization problem. This enables obtaining of high-quality control parameters. Simulation results confirm the feasibility and effectiveness of this control optimization method.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yongjie Wang ◽  
Maolin Li

The traditional wireless sensor network coverage control optimization algorithm has the problems of long completion time, high energy consumption, and low coverage. A new algorithm based on combinational mathematics for wireless sensor network coverage control is proposed. The particle swarm optimization (PSO) algorithm is used to optimize the coverage control process of wireless sensor networks. Then, the combined mathematics method is used to detect the local convergence problem. Finally, the quasi-physical forces of quasi-gravity and Coulomb force are used to integrate the quasi-physical force into the particle. In the process of velocity evolution, the speed correction process of particle swarm optimization is optimized, which can effectively avoid the local convergence problem of the particle swarm optimization algorithm, reduce the repeated coverage, and expand the coverage. The experimental results show that compared with the traditional algorithm, the proposed algorithm has short completion time, low energy consumption, and high coverage.


Sign in / Sign up

Export Citation Format

Share Document