Stochastic flocking dynamics of the inertial spin model with state-dependent noises

We study stochastic flocking dynamics of the inertial spin (IS) model with state-dependent noises. The IS model was considered to describe the collective behaviors of starling flocks moving with constant speed. Unlike mechanical flocking models extensively studied in the literature, this model incorporates an internal dynamic observable, namely spin (internal angular momentum) in addition to mechanical observables (position and velocity), and it describes how spin interacts with mechanical observables. In previous works, emergent dynamics of the deterministic counterparts for the IS model and its mean-field limit have been investigated under some specific setting in which network topology is multiplicatively separable. In this work, we present sufficient frameworks for stochastic flocking dynamics of the IS model, which state-dependent noises vanish at the equilibria of the deterministic IS model. The proposed frameworks are in terms of coupling strength, friction, and inertial coefficients, and our asymptotic convergence results for sample paths are given in both an almost sure and an expectation sense. We have also conducted several numerical experiments to verify our analytical results and to explore what can be studied further in future work     

Application of particle swarm optimization in chaos synchronization in noisy environment in presence of unknown parameter uncertainty

In this paper, particle swarm optimization (PSO) is applied to synchronize chaotic systems in presence of parameter uncertainties and measurement noise. Particle swarm optimization is an evolutionary algorithm which is introduced by Kennedy and Eberhart. This algorithm is inspired by birds flocking. Optimization algorithms can be applied to control by defining an appropriate cost function that guarantees stability of system. In presence of environment noise and parameter uncertainty, robustness plays a crucial role in succeed of controller. Since PSO needs only rudimentary information about the system, it can be a suitable algorithm for this case. Simulation results confirm that the proposed controller can handle the uncertainty and environment noise without any extra information about them. A comparison with some earlier works is performed during simulations.     

Flocking dynamics for a multiagent system involving task strategy

Collective behavior sometimes requires forming a particular formation or reaching a certain velocity to accomplish a specific task, such as bird migration. In this paper, we investigate the collective migration model, which consists of two parts: Cucker–Smale type interaction and target velocity. Each agent has a strategy to allocate limited energy to group interaction and velocity tracking. In this case, if the system achieves monocluster flocking then the final velocity is equal to target velocity. When the strategy is invariant, we show that 1/2 is a critical threshold which is consistent with the classical Cucker–Smale model. When the strategy is time varying, we provide a time-varying strategy named threshold strategy to ensure that for any initial state the system achieves monocluster flocking and the final velocity reaches target velocity. In addition, the case of multiple target velocities is considered. According to the theory of bicluster flocking, we obtain a sufficient framework to guarantee that the system achieves bicluster flocking and two groups would reach their target velocities, respectively.     

Flocking in multi-agent systems with active virtual leader and time-varying delays coupling

In this paper, we presented a practical control protocol for flocking problems that is based only on the three classical assumptions for flocking systems. Some necessary and sufficient conditions that allow the agents to follow the leader when its acceleration is known and estimate the tracking errors when it is unknown are obtained for particular case. Some numerical simulations are also provided to show the validity of the theories.     

Emergent behaviors of a thermodynamic Cucker-Smale flock with a time-delay on a general digraph

We present emergent flocking dynamics of a thermodynamic Cucker-Smale (TCS) flock on a general digraph with spanning trees under the effect of communication time-delays. The TCS model describes a temporal evolution of mechanical and thermodynamic observables such as position, velocity and temperature of CS particles. In this paper, we study how variations in mechanical and thermodynamic variables can decay to zero along a time-independent network with position dependent weights from initial state configuration. For this, we provide a sufficient framework for a mechanical and thermodynamical flocking in terms of initial configuration, network topology, and system parameters. We also present several numerical examples and compare them with analytical results.     

Flocking Dynamics of the Inertial Spin Model with a Multiplicative Communication Weight

In this paper, we study a flocking dynamics of the deterministic inertial spin (IS) model. The IS model was introduced for the collective dynamics of active particles with an internal angular momentum, or spin. When the generalized moment of inertia becomes negligible compared to spin dissipation (overdamped limit) and mutual communication weight is a function of a relative distance between interacting particles, the deterministic inertial spin model formally reduces to the Cucker–Smale (CS) model with constant speed constraint whose emergent dynamics has been extensively studied in the previous literature. We present several sufficient frameworks leading to the asymptotic mono-cluster flocking, in which spins and relative velocities tend to zero asymptotically. We also provide several numerical simulations for the decoupled and coupled inertial spin models to see the effect of the C–S velocity flocking and compare them with our analytical results.

     

Reliable control for nonlinear systems with stochastic actuators fault and random delays through a T-S fuzzy model approach

This paper considers the reliable control design for T-S fuzzy systems with probabilistic actuators faults and random time-varying delays. The faults of each actuator occurs randomly and its failure rates are governed by a set of unrelated random variables satisfying certain probabilistic distribution. In terms of the probabilistic failures of each actuator and time-varying random delays, new fault model is proposed. Based on the new fuzzy model, reliable controller is designed and sufficient conditions for the exponentially mean square stability (EMSS) of T-S fuzzy systems are derived by using Lyapunov functional method and linear matrix inequality (LMI) technique. It should be noted that the obtained criteria depend on not only the size of the delay, but also the probability distribution of it. Finally, a numerical example is given to show the effectiveness of the proposed method.     

变系数模型小波估计的渐近性

变系数模型是线性模型的有用推广,它允许回归系数是某个变量的函数,近年来在统计分析中得到广泛的应用.文中研究回归变量都是随机时的变系数模型,提出运用小波的方法估计变系数模型中的函数系数,并在较弱的条件下得到了变系数模型小波估计的渐近正态性.     

Cyber Swarm Algorithms – Improving particle swarm optimization using adaptive memory strategies

Particle swarm optimization (PSO) has emerged as an acclaimed approach for solving complex optimization problems. The nature metaphors of flocking birds or schooling fish that originally motivated PSO have made the algorithm easy to describe but have also occluded the view of valuable strategies based on other foundations. From a complementary perspective, scatter search (SS) and path relinking (PR) provide an optimization framework based on the assumption that useful information about the global solution is typically contained in solutions that lie on paths from good solutions to other good solutions. Shared and contrasting principles underlying the PSO and the SS/PR methods provide a fertile basis for combining them. Drawing especially on the adaptive memory and responsive strategy elements of SS and PR, we create a combination to produce a Cyber Swarm Algorithm that proves more effective than the Standard PSO 2007 recently established as a leading form of PSO. Applied to the challenge of finding global minima for continuous nonlinear functions, the Cyber Swarm Algorithm not only is able to obtain better solutions to a well known set of benchmark functions, but also proves more robust under a wide range of experimental conditions.     

Global dynamics of two phytoplankton-zooplankton models with toxic substances effect

In this paper, we investigate phytoplankton-zooplankton models with toxic substances effect and two different kinds of predator functional responses. For Holling type II predator functional response, it is shown that the local stability of the positive equilibrium implies global stability if there exists a unique positive equilibrium. When there exist multiple positive equilibria, the local stability of the positive equilibrium with small phytoplankton population density implies that the model occurs bistable phenomenon. These results also hold for Holling type III predator functional response under certain conditions.     

Dynamic analysis of a non-autonomous ratio-dependent predator-prey model with additional food

In this paper, a non-autonomous ratio-dependent three species predator-prey system with additional food to top predator was proposed. The permanence of the model is obtained. Based on the continuation theorem, the sufficient conditions for the existence of a periodic solution are obtained. By using the method of Lyapunov function, we prove that the system exists a unique positive almost periodic solution under some certain conditions.     

Flocking of Multi-particle Swarm with Group Coupling Structure and Measurement Delay

We investigate the flocking conditions of a group coupling system with time delays, in which the communication between particles includes inter-group and intra-group interactions, and the time delay comes from the theory of moving object observation. As an effective model, we introduce a system of nonlinear functional differential equations to describe its dynamic evolution mechanism. By constructing two differential inequalities on velocity and velocity fluctuation from a continuity argument, and using the Lyapunov functional approach, we present some sufficient conditions for the existence of asymptotic flocking solutions to the coupling system, in which an upper bound of the delay allowed by the system is quantitatively given to ensure the emergence of flocking behavior. All results are novel and can be illustrated by using some specific numerical simulations.     

Analysis of a nonautonomous model for migratory birds with saturation incidence rate

In this paper, an eco-epidemiological model is newly proposed to consider the role of migratory birds by incorporating the temporal pattern of the avian migration into the model. In the new model, population of birds varies because they are migratory in nature. Under quite weak assumptions, sufficient conditions for the permanence and extinction of the disease is obtained. Moreover, by constructing a Liapunov function, the global attractivity of the model is discussed.     

Flocking and asymptotic velocity of the Cucker–Smale model with processing delay

The processing delay is incorporated into the influence function of the well-known Cucker–Smale model for self-organized systems with multiple agents. Both symmetric and non-symmetric pairwise influence functions are considered, and a Lyapunov functional approach is developed to establish the existence of flocking solutions for the proposed delayed Cucker–Smale model. An analytic formula is given to calculate the asymptotic flocking velocity in terms of model parameters and the variation of the position during the initial time interval.     

Single-machine group scheduling with deteriorating jobs and allotted resource

In this paper, we consider single-machine scheduling problems with deteriorating jobs and resource allocation in a group technology environment. In the proposed model of this paper the actual processing time of a job depend on its starting time and the amount of resource allocated to it, and the actual setup time of a group depend on its starting time and the amount of resource allocated. Deterioration effect and two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost. For the linear resource allocation function and the convex resource allocation function, we show that the problem remains polynomially solvable under certain conditions.     

A new class of fixed-time bipartite flocking protocols for multi-agent systems

This work is concerned with the fixed-time stability theorem and the fixed-time bipartite flocking with collision avoidance for multi-agent systems. Under the framework of Filippov solution, a new theorem of fixed-time stability is established and a high-precision estimation of settling time is given. As an important application, the fixed-time bipartite flocking protocol of nonlinear multi-agent systems is proposed. Employing this fixed-time stability theorem and the structurally balanced signed graph theorem, the bipartite flocking without collision is achieved within a fixed-time. Moreover, the convergent time of the bipartite flocking is merely depending on the parameters of the protocol and the network connectivity. In addition, the upper bound of the size for each disjoint cluster can be estimated by the parameters of the protocol, the network connectivity and the initial states of the system. These results are novel, which are illustrated by both theoretical analysis and numerical simulations.     

Single-machine scheduling with deteriorating functions for job processing times

In many realistic scheduling settings a job processed later consumes more time than when it is processed earlier – this phenomenon is known as scheduling with deteriorating jobs. In the literature on deteriorating job scheduling problems, majority of the research assumed that the actual job processing time of a job is a function of its starting time. In this paper we consider a new deterioration model where the actual job processing time of a job is a function of the processing times of the jobs already processed. We show that the single-machine scheduling problems to minimize the makespan and total completion time remain polynomially solvable under the proposed model. In addition, we prove that the problems to minimize the total weighted completion time, maximum lateness, and maximum tardiness are polynomially solvable under certain agreeable conditions.     

Stability and Neimark-Sacker bifurcation of a semi-discrete population model

In this paper, a semi-discrete model is derived for a nonlinear simple population model, and its stability and bifurcation are investigated by invoking a key lemma we present. Our results display that a Neimark-Sacker bifurcation occurs in the positive fixed point of this system under certain parametric conditions. By using the Center Manifold Theorem and bifurcation theory, the stability of invariant closed orbits bifurcated is also obtained. The numerical simulation results not only show the correctness of our theoretical analysis, but also exhibit new and interesting dynamics of this system, which do not exist in its corresponding continuous version.     

Pattern formation in the Brusselator system

In the paper, we deal with a reaction-diffusion system well known as the Brusselator model and some improved results for the steady states of this model are presented. We first give an a priori estimates (positive upper and lower bounds) of positive steady states. Then, we obtain the non-existence and existence of positive non-constant steady states as the parameters λ, θ and b are varied, which means some certain conditions under which the pattern formation occurs or not.     

Backward bifurcation in simple SIS model

We describe and analyze a simple SIS model with treatment. In particular, we give a completely qualitative analysis by means of the theory of asymptotically autonomous system. It is found that a backward bifurcation occurs if the adequate contact rate or the capacity is small. It is also found that there exists bistable endemic equilibria. In the case of disease-induced death, it is shown that the backward bifurcation also occurs. Moreover, there is no limit cycle under some conditions, and the subcritical Hopf bifurcation occurs under another conditions. Supported by the National Natural Science Foundation of China (No. 10571143, 30770555)