Coordinated dynamical swarm behavior occurs when certain types of animals forage for food or try to avoid predators. Analogous behaviors can occur in engineering systems (e.g., groups autonomous mobile robots air vehicles). In this paper, we study a model an M-dimensional (M/spl ges/2) asynchronous with fixed communication topology, where each member only communicate neighbors, provide conditions under which collision-free convergence be achieved finite-size members that have proximity...

In the paper, we investigate exponential stability of nonlinear delayed systems with destabilizing and stabilizing impulses, respectively. Specifically, study can be divided into two cases: (1) where time delays in impulses flexible even larger than length impulsive interval, (2) are between consecutive instants. order to address time-delay term concept average delay (AID) is proposed. Using ideas interval AID, present some Lyapunov-based criteria for average-delay satisfy proposed AID...

This article considers global exponential synchronization almost surely (GES a.s.) for a class of switched discrete-time neural networks (DTNNs). The considered system switches from one mode to another according transition probability (TP) and evolves with mode-dependent average dwell time (MDADT), i.e., TP-based MDADT switching, which is more practical than classical (ADT) switching. logarithmic quantization technique utilized design quantized output controllers (QOCs). Noticing that...

This article investigates the observability of Markovian jump Boolean networks (MJBNs) via algebraic state space representation approach. A necessary and sufficient criterion in form linear programming is derived for asymptotic distribution MJBNs, several conditions are obtained finite-time based on properties nilpotent matrices. Subsequently, order to minimize time consumption, a maximum principle established address minimum-time problem. With regard event-triggered output feedback...

In this study, we propose a predefined-time multiagent approach for multiobjective optimization. Predefined-time optimization is an that can converge to state extremely close optimal solution at given time. A time-base generator derived and applied the approaches achieving The problem reformulated as distributed and, thus, solved in private safe manner. For optimization, system with generators developed its convergence speed are proven. Several examples confirm validity of results.

A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from binary set {0,1}. At each time step, variable of the BCN updates its value simultaneously according to function which takes state and previous step as input. Given an ordered pair states BCN, we define reachable steps positive integer k's where there exists sequence such that can be steered one other in exactly k steps; unreachable does not exist any steps. We consider this article so-called...

This article studies the constrained optimization problems in quaternion regime via a distributed fashion. We begin with presenting some differences for generalized gradient between real and domains. Then, an algorithm considered problem is given, by which desired transformed into unconstrained setup. Using tools from Lyapunov-based technique nonsmooth analysis, convergence property associated devised further guaranteed. In addition, designed has potential solving neurodynamic as recurrent...

In genetic regulatory networks, steady states represent cell types of death or unregulated growth, which are significant interest in modeling networks. this article, a pinning control intervention is studied for global stabilization Boolean networks (BNs) under knock-out perturbation. Knock-out perturbation means that logical variables some nodes BN remain 0 s. order to reduce the impact on stability, approach proposed maintain rest other than those knocked out nodes, based network structure...

For a Boolean network with disturbances and outputs, necessary sufficient graphic condition for the original disturbance decoupling is proposed, it reveals that outputs are unaffected by if only vertex-colored state transition graph has concolorous perfect vertex partition (CP-VP). In addition, CP-VP an equal partition, corresponding system decomposition implemented. Furthermore, algorithm designed to check existence of CP-VP.

In this paper, we address the Clifford-valued distributed optimization subject to linear equality and inequality constraints. The objective function of problems is composed sum convex functions defined in Clifford domain. Based on generalized gradient, a system multiple recurrent neural networks (RNNs) proposed for solving problems. Each RNN minimizes local individually, with interactions others. convergence rigorously proved based Lyapunov theory. Two illustrative examples are delineated...

Sparse approximation is key to many signal processing, image and machine learning applications. If multiple signals maintain some degree of dependency, for example, the support sets are statistically related, then it will generally be advantageous jointly estimate sparse representation vectors from measurement as opposed solving each individually. In this paper, we propose simultaneous Bayesian (SBL) joint with two structured models (SSMs), where one row-sparse embedded element-sparse other...

Analysis and design of steady states representing cell types, such as death or unregulated growth, are significant interest in modeling genetic regulatory networks. In this article, the steady-state large-dimensional Boolean networks (BNs) is studied via model reduction pinning control. Compared with existing literature, control article based on original node's connection, but not state-transition matrix BNs. Hence, computational complexity dramatically reduced from O(2n×2n) to O(2×2r) ,...

This article investigates the partial stabilization problem of probabilistic Boolean control networks (PBCNs) under sample-data state-feedback (SDSFC) with a Lyapunov function (CLF) approach. First, probability structure matrix considered PBCN is represented by matrix, based on which, new algebraic form system obtained. Second, we convert PBCNs into global set one. Third, define CLF and its structural SDSFC. It found that existence equivalent to Then, necessary sufficient condition obtained...

This article considers asymptotic stability and stabilization of Markovian jump Boolean networks (MJBNs) with stochastic state-dependent perturbation. By defining an augmented random variable as the product canonical form switching signal state variable, MJBN perturbation is converted into set a Markov chain (MC). Then, concept induced equations proposed for MC, corresponding criterion subsequently derived MC by utilizing solutions equations. can be, respectively, examined either linear...

In this article, a set of sensors is constructed via the pinning observability approach with help criteria given in [1] and [2], order tomake Boolean network (BN)be observable. Given assumption that system states can be accessible, an efficient control scheme developed to generate observable BN by adjusting structure rather than just check observability. Accordingly, are constructed, which form consistent state feedback controllers designed control. Since only utilizes node-to-node message...

In this brief, stabilization of Boolean networks (BNs) by flipping a subset nodes is considered, here we call such action state-flipped control. The control implies that the logical variables certain are flipped from 1 to 0 or as time flows. Under on nodes, state-flipped-transition matrix defined describe impact state transition space. Weak first and then some criteria presented judge same. An algorithm proposed find stabilizing kernel BNs can achieve weak desired with in-degree more than 0....