scholarly journals Optimal Control through Leadership of the Cucker and Smale Flocking Model with Time Delays

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Adsadang Himakalasa ◽  
Suttida Wongkaew

The Cucker and Smale model is a well-known flocking model that describes the emergence of flocks based on alignment. The first part focuses on investigating this model, including the effect of time delay and the presence of a leader. Furthermore, the control function is inserted into the dynamics of a leader to drive a group of agents to target. In the second part of this work, leadership-based optimal control is investigated. Moreover, the existence of the first-order optimality conditions for a delayed optimal control problem is discussed. Furthermore, the Runge–Kutta discretization method and the nonlinear conjugate gradient method are employed to solve the discrete optimality system. Finally, the capacity of the proposed control approach to drive a group of agents to reach the desired places or track the trajectory is demonstrated by numerical experiment results.

1980 ◽  
Vol 20 (06) ◽  
pp. 521-532 ◽  
Author(s):  
A.T. Watson ◽  
J.H. Seinfeld ◽  
G.R. Gavalas ◽  
P.T. Woo

Abstract An automatic history-matching algorithm based onan optimal control approach has been formulated forjoint estimation of spatially varying permeability andporosity and coefficients of relative permeabilityfunctions in two-phase reservoirs. The algorithm usespressure and production rate data simultaneously. The performance of the algorithm for thewaterflooding of one- and two-dimensional hypotheticalreservoirs is examined, and properties associatedwith the parameter estimation problem are discussed. Introduction There has been considerable interest in thedevelopment of automatic history-matchingalgorithms. Most of the published work to date onautomatic history matching has been devoted tosingle-phase reservoirs in which the unknownparameters to be estimated are often the reservoirporosity (or storage) and absolute permeability (ortransmissibility). In the single-phase problem, theobjective function usually consists of the deviationsbetween the predicted and measured reservoirpressures at the wells. Parameter estimation, orhistory matching, in multiphase reservoirs isfundamentally more difficult than in single-phasereservoirs. The multiphase equations are nonlinear, and in addition to the porosity and absolutepermeability, the relative permeabilities of each phasemay be unknown and subject to estimation. Measurements of the relative rates of flow of oil, water, and gas at the wells also may be available forthe objective function. The aspect of the reservoir history-matchingproblem that distinguishes it from other parameterestimation problems in science and engineering is thelarge dimensionality of both the system state and theunknown parameters. As a result of this largedimensionality, computational efficiency becomes aprime consideration in the implementation of anautomatic history-matching method. In all parameterestimation methods, a trade-off exists between theamount of computation performed per iteration andthe speed of convergence of the method. Animportant saving in computing time was realized insingle-phase automatic history matching through theintroduction of optimal control theory as a methodfor calculating the gradient of the objective functionwith respect to the unknown parameters. Thistechnique currently is limited to first-order gradientmethods. First-order gradient methods generallyconverge more slowly than those of higher order.Nevertheless, the amount of computation requiredper iteration is significantly less than that requiredfor higher-order optimization methods; thus, first-order methods are attractive for automatic historymatching. The optimal control algorithm forautomatic history matching has been shown toproduce excellent results when applied to field problems. Therefore, the first approach to thedevelopment of a general automatic history-matchingalgorithm for multiphase reservoirs wouldseem to proceed through the development of anoptimal control approach for calculating the gradientof the objective function with respect to theparameters for use in a first-order method. SPEJ P. 521^


Author(s):  
Fouad Yacef ◽  
Nassim Rizoug ◽  
Laid Degaa ◽  
Omar Bouhali ◽  
Mustapha Hamerlain

Unmanned aerial vehicles are used today in many real-world applications. In all these applications, the vehicle endurance (flight time) is an important constraint that affects mission success. This study investigates the limitations of embedded energy for a quadrotor aerial vehicle. We consider a quadrotor simple tasked to travel from an initial hover configuration to a final hover configuration. In order to have a precise approximation of the consumed energy, we propose a power consumption model with battery dynamic, motor dynamic, and rotor efficiency function. We then introduce an optimization algorithm to minimize the energy consumption during quadrotor aerial vehicle mission. The proposed algorithm is based on an optimal control problem formulated for the quadrotor model and solved using nonlinear programming. In the optimal control problem, we seek to find control inputs (rotor velocity) and vehicle trajectory between initial and final configurations that minimize the consumed energy during a point-to-point mission. We extensively test in simulation experiments the proposed algorithm under normal and windy weather conditions. We compare the proposed optimization method with a nonlinear adaptive control approach to highlight the saved amount of energy.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Mohammed Benharrat ◽  
Delfim F. M. Torres

We prove necessary optimality conditions of Euler-Lagrange type for a problem of the calculus of variations with time delays, where the delay in the unknown function is different from the delay in its derivative. Then, a more general optimal control problem with time delays is considered. Main result gives a convergence theorem, allowing us to obtain a solution to the delayed optimal control problem by considering a sequence of delayed problems of the calculus of variations.


2020 ◽  
Vol 13 (06) ◽  
pp. 2050047
Author(s):  
Fahad Al Basir

Farming awareness is an important measure for pest controlling in agricultural practice. Time delay in controlling pest may affect the system. Time delay occurs in organizing awareness campaigns, also time delay may takes place in becoming aware of the control strategies or implementing suitable controlling methods informed through social media. Thus we have derived a mathematical model incorporating two time delays into the system and Holling type-II functional response. The existence and the stability criteria of the equilibria are obtained in terms of the basic reproduction number and time delays. Stability changes occur through Hopf-bifurcation when time delays cross the critical values. Optimal control theory has been applied for cost-effectiveness of the delayed system. Numerical simulations are carried out to justify the analytical results. This study shows that optimal farming awareness through radio, TV etc. can control the delay induced bifurcation in a cost-effective way.


2009 ◽  
Vol 45 (11) ◽  
pp. 1621-1635 ◽  
Author(s):  
N. L. Grigorenko ◽  
D. V. Kamzolkin ◽  
L. N. Luk’yanova ◽  
D. G. Pivovarchuk

Author(s):  
S.V. Konstantinov ◽  
A.I. Diveev

A new approach is considered to solving the problem of synthesizing an optimal control system based on the extremals' set approximation. At the first stage, the optimal control problem for various initial states out of a given domain is being numerically sold. Evolutionary algorithms are used to solve the optimal control problem numerically. At the second stage, the problem of approximating the found set of extremals by the method of symbolic regression is solved. Approach considered in the work makes it possible to eliminate the main drawback of the known approach to solving the control synthesis problem using the symbolic regression method, which consists in the fact that the genetic algorithm used in solving the synthesis problem does not provide information about proximity of the found solution to the optimal one. Here, control function is built on the basis of a set of extremals; therefore, any particular solution should be close to the optimal trajectory. Computational experiment is presented for solving the applied problem of synthesizing the four-wheel robot optimal control system in the presence of phase constraints. It is experimentally demonstrated that the synthesized control function makes it possible for any initial state from a given domain to obtain trajectories close to optimal in the quality functional. Initial states were considered during the experiment, both included in the approximating set of optimal trajectories and others from the same given domain. Approximation of the extremals set was carried out by the network operator method


2014 ◽  
Vol 26 (1) ◽  
pp. 1-13 ◽  
Author(s):  
N. L. Grigorenko ◽  
D. V. Kamzolkin ◽  
L. N. Luk’yanova ◽  
D. G. Pivovarchuk

Sign in / Sign up

Export Citation Format

Share Document