Nonlinear Analysis-Hybrid Systems最新文献

In this paper, the partial synchronization of general Boolean Networks is studied from the perspective of nodes and states by using the semi-tensor product of matrices. First, by introducing the Hamming distances and its algebraic expression, the partial synchronization of general Boolean Networks can be transformed into an ensemble stability problem. Second, through optimizing the pinning strategy, the conditions for achieving partial synchronization of general Boolean Networks are developed, and the algorithm for finding the optimal pinning nodes is given. Subsequently, to further simplify the above condition, the related pinning node strategy is further optimized and combined by introducing state-flipped mechanism, which makes the general Boolean Networks partially synchronous under no condition, and requires the less number of nodes to be pinned compared to the previous works. Meanwhile, the corresponding algorithm for seeking the optimal pinning nodes is designed in the context of flipping the state only once. Finally, the obtained results are validated by several specific numerical examples. In summary, the current work can further enrich and improve the study of partial synchronization problems in Boolean Networks.

In this work, we develop an ordinary differential equation (ODE) model with impulsive sanitation of cholera. The sanitation interventions are classified into three types in this article. The first two types are human sanitation, with type-1 sanitation focused on the prevention of direct and indirect transmissions and type-2 focused on prevention of bacterial shedding. The third type refers to pathogen sanitation where interventions are performed in contaminated water environment via disinfection. For the developed impulsive model, we introduce the basic production number $R_0$ and show that $R_0$ remains a sharp disease threshold parameter despite the incorporation of impulsive sanitation. We numerically investigate the impact of impulsive sanitation on the prevention and control of the disease. Our numerical results indicate that type-1 sanitation tends to bear the longest time window between subsequent interventions among all the three types of sanitation provided the same level of sanitation efficacy. Particularly, when the sanitation efficacy is 50% under 90% compliance, type-1 sanitation can be implemented about every 7 months for the purpose of disease control, whereas type-2 and type-3 sanitation will have be performed on a daily basis and every three weeks or so, respectively.

We present a method for the approximate propagation of mean and covariance of a probability distribution through ordinary differential equations (ODE) with discontinuous right-hand side. For piecewise affine systems, a normalization of the propagated probability distribution at every time step allows us to analytically compute the expectation integrals of the mean and covariance dynamics while explicitly taking into account the discontinuity. This leads to a natural smoothing of the discontinuity such that for relevant levels of uncertainty the resulting ODE can be integrated directly with standard schemes and it is neither necessary to prespecify the switching sequence nor to use a switch detection method. We then show how this result can be employed in the more general case of piecewise smooth functions based on a structure preserving linearization scheme. The resulting dynamics can be straightforwardly used within standard formulations of stochastic optimal control problems with chance constraints.

Despite the proposed results on the non-existing of finite time stable equilibria for fractional order systems (Shen and Lam, 2014), the commented paper (Wang et al., 2020) has shown finite time convergence of fractional order control systems via a couple of theorems. This comment demonstrates that the proofs of the given theorems in Wang et al. (2020) are incorrect.

This study focuses on the observer-based sliding mode control (SMC) for discrete stochastic switching models, where the semi-Markov kernel information is incomplete. Because the sensors do not always have direct access to the state vector in a complex environment, an observer-based output measurement is considered to estimate the system state. In contrast to previous works, the observer-based strategy is first investigated in studying the SMC for semi-Markov switching systems under the discrete framework. The sufficient condition for achieving mean-square stability is proposed to solve the desired observer and controller gains by utilizing the upper bound of sojourn time, along with the Lyapunov function that pertains to the system mode and the elapsed time. A mode-dependent SMC law is also constructed to ensure that the system state can reach the specified sliding region. Finally, the efficiency of the proposed method is demonstrated through the single-link robot arm model.

Applying jumping locomotion into autonomous mobile robot is an effective way for improving abilities to overcome barriers and pass through complex terrains. In this paper, based on the designed structural framework for bio-inspired quadruped jumping robot, dynamic model is established by utilizing port-Hamiltonian with dissipation (pHd) method, and a passivity-based control strategy for the robot joints trajectory tracking is presented. First, morphology and biomimetics knowledges of frogs (a kind of animals with excellent jumping skill) motivate us to complete a bio-inspired jumping robot framework based on frog’s motion mechanism and body structure with torsional springs as energy storage device. Then, combining system passivity and dissipation, port-Hamiltonian method is utilized to build a dynamic model for expressing the relationship of energy and force in the designed robot. Jumping process analysis of different stages is also designed for ensuring the robot to complete taking-off and landing stages successfully. Next, with the definition of extending feasible robotic joint trajectory by La Salle invariant set principle, interconnection and damping assignment passivity-based control (IDA-PBC) method is exerted to obtain a trajectory controller for realizing smoothly and stably trajectory tracking in joint space. At last, simulation results show the reasonableness of the designed framework. By comparing our method with state-feedback and sliding mode control, effectiveness of the dynamic model and trajectory controller is also verified.

In this paper, we consider a stochastic SIS epidemic model with vaccination in random switching environment. The system is formulated as a hybrid stochastic differential equation. We provide a threshold number that characterizes completely its longtime behavior. It turns out that if the threshold is negative, the number of the infected class converges to zero or the extinction happens. The rate of convergence is also obtained. In contrast, if the threshold is positive, the infection is endemic. We are able to obtain an algebraic formula for the threshold, which helps us to study some strategies for controlling the disease such as: (i) determining the minimum vaccination rate needed to keep the population from the disease and (ii) determining the strategy with minimum cost of vaccination and treatment. To illustrate the results, a number of mathematical simulations and numerical examples are also presented.

This paper analyzes the asymptotic behavior of inter-event times in planar linear systems, under event-triggered control with a general class of scale-invariant event triggering rules. In this setting, the inter-event time is a function of the “angle” of the state at an event. This viewpoint allows us to analyze the inter-event times by studying the fixed points of the angle map, which represents the evolution of the “angle” of the state from one event to the next. We provide a sufficient condition for the convergence or non-convergence of inter-event times to a steady state value under a scale-invariant event-triggering rule. Following up on this, we further analyze the inter-event time behavior in the special case of threshold based event-triggering rule and we provide various conditions for convergence or non-convergence of inter-event times to a constant. We also analyze the asymptotic average inter-event time as a function of the angle of the initial state of the system. With the help of ergodic theory, we provide a sufficient condition for the asymptotic average inter-event time to be a constant for all non-zero initial states of the system. Then, we consider a special case where the angle map is an orientation-preserving homeomorphism. Using rotation theory, we comment on the asymptotic behavior of the inter-event times, including on whether the inter-event times converge to a periodic sequence. We illustrate the proposed results through numerical simulations.

In this paper we provide a positive answer for the C${}^0$-Closing Lemma in the context of $n$-dimensional piecewise smooth vector fields governed by the Filippov’s rules. So, given a model presenting a nontrivially recurrent point it is possible to consider a C${}^0$-close perturbation of it possessing a closed trajectory. Also, we conclude the paper proving the existence of a closed orbit around a T-singularity.

While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as the time step size. Manual tuning is especially problematic if one aims to verify that the system satisfies complicated specifications described by signal temporal logic formulas since the effect the tightness of the reachable set has on the satisfaction of the specification is often non-trivial to see for humans. We address this problem with a fully-automated verifier for linear systems, which automatically refines all parameters for reachability analysis until it can either prove or disprove that the system satisfies a signal temporal logic formula for all initial states and all uncertain inputs. Our verifier combines reachset temporal logic with dependency preservation to obtain a model checking approach whose over-approximation error converges to zero for adequately tuned parameters. While we in this work focus on linear systems for simplicity, the general concept we present can equivalently be applied for nonlinear and hybrid systems.