Search Results (440)

With the diversification of space applications, the tracking of maneuvering targets has gradually gained attention. Issues such as their wide range of movement and observation outliers caused by human operation are worthy of in-depth discussion. This paper presents a novel distributed diffusion multi-noise Interacting Multiple Model (IMM) filter for maneuvering target tracking in heavy-tailed noise. The proposed approach leverages parallel Gaussian and Student-t filters to enhance robustness against non-Gaussian process and measurement noise. This hybrid filter is implemented as a node within a distributed network, where the diffusion algorithm leads to the global state asymptotically reaching consensus as the filtering time progresses. Furthermore, a fusion of multiple motion models within the IMM algorithm enables robust tracking of maneuvering targets across the distributed network and process outlier caused by maneuver compared to previous studies. Simulation results demonstrate the effectiveness of the proposed filter in tracking maneuvering targets. Full article

We introduce a modern methodology for constructing global analytical approximations of special functions over their entire domains. By integrating the traditional method of matching asymptotic expansions—enhanced with Padé approximants—with differential evolution optimization, a modern machine learning technique, we achieve high-accuracy approximations using elegantly simple expressions. This method transforms non-elementary functions, which lack closed-form expressions and are often defined by integrals or infinite series, into simple analytical forms. This transformation enables deeper qualitative analysis and offers an efficient alternative to existing computational techniques. We demonstrate the effectiveness of our method by deriving an analytical expression for the Fermi gas pressure that has not been previously reported. Additionally, we apply our approach to the one-loop correction in thermal field theory, the synchrotron functions, common Fermi–Dirac integrals, and the error function, showcasing superior range and accuracy over prior studies. Full article

This paper proposes a Distributed Adaptive Regularization Algorithm (DARN) for solving composite non-convex and non-smooth optimization problems in multi-agent systems. The algorithm employs a three-phase iterative framework to achieve efficient collaborative optimization: (1) a local regularized optimization step, which utilizes proximal mappings to enforce strong convexity of weakly convex objectives and ensure subproblem well-posedness; (2) a consensus update based on doubly stochastic matrices, guaranteeing asymptotic convergence of agent states to a global consensus point; and (3) an innovative adaptive regularization mechanism that dynamically adjusts regularization strength using local function value variations to balance stability and convergence speed. Theoretical analysis demonstrates that the algorithm maintains strict monotonic descent under non-convex and non-smooth conditions by constructing a mixed time-scale Lyapunov function, achieving a sublinear convergence rate. Notably, we prove that the projection-based update rule for regularization parameters preserves lower-bound constraints, while spectral decay properties of consensus errors and perturbations from local updates are globally governed by the Lyapunov function. Numerical experiments validate the algorithm’s superiority in sparse principal component analysis and robust matrix completion tasks, showing a 6.6% improvement in convergence speed and a 51.7% reduction in consensus error compared to fixed-regularization methods. This work provides theoretical guarantees and an efficient framework for distributed non-convex optimization in heterogeneous networks. Full article

Antivirus (patch) is one of the most powerful tools for defending against malware spread. Distributed patching is superior to its centralized counterpart in terms of significantly lower bandwidth requirement. Under the distributed patching mechanism, a novel malware propagation model with double delays and double saturation effects is proposed. The basic properties of the model are discussed. A pair of thresholds, i.e., the first threshold $R_0$ and the second threshold $R_1$, are determined. It is shown that (a) the model admits no malware-endemic equilibrium if $R_0\le 1$, (b) the model admits a unique patch-free malware-endemic equilibrium and admits no patch-endemic malware-endemic equilibrium if $1<R_0\le R_1$, and (c) the model admits a unique patch-free malware-endemic equilibrium and a unique patch-endemic malware-endemic equilibrium if $R_0>R_1$. A criterion for the global asymptotic stability of the malware-free equilibrium is given. A pair of criteria for the local asymptotic stability of the patch-free malware-endemic equilibrium are presented. A pair of criteria for the local asymptotic stability of the patch-endemic malware-endemic equilibrium are derived. Using cybersecurity terms, these theoretical outcomes have the following explanations: (a) In the case where the first threshold can be kept below unity, the malware can be eradicated through distributed patching. (b) In the case where the first threshold can only be kept between unity and the second threshold, the patches may fail completely, and the malware cannot be eradicated through distributed patching. (c) In the case where the first threshold cannot be kept below the second threshold, the patches may work permanently, but the malware cannot be eradicated through distributed patching. The influence of the delays and the saturation effects on malware propagation is examined experimentally. The relevant conclusions reveal the way the delays and saturation effects modulate these outcomes. Full article

Consensus protocols for a multi-agent networked system consist of strategies that align the states of all agents that share information according to a given network topology, despite challenges such as communication limitations, time-varying networks, and communication delays. The special orthogonal group $SO\left(n\right)$ plays a key role in applications from rigid body attitude synchronization to machine learning on Lie groups, particularly in fields like physics-informed learning and geometric deep learning. In this paper, N-agent consensus protocols are proposed on the Lie group $SO\left(4\right)$ and the corresponding tangent bundle $TSO\left(4\right)$, in which the state spaces are $SO{\left(4\right)}^N$ and $TSO{\left(4\right)}^N$, respectively. In particular, when using communication topologies such as a ring graph for which the local stability of non-consensus equilibria is retained in the closed loop, a consensus protocol that leverages a reshaping strategy is proposed to destabilize non-consensus equilibria and produce consensus with almost global stability on $SO{\left(4\right)}^N$ or $TSO{\left(4\right)}^N$. Lyapunov-based stability guarantees are obtained, and simulations are conducted to illustrate the advantages of these proposed consensus protocols. Full article

This paper studies the convergence of distances between sequences of points and that of sequences of points in metric spaces. This investigation is focused on the iterative processes built with composed self-mappings of a cyclic contraction, which can involve more than two nonempty closed subsets in a metric space, which are combined with compositions of a strict contraction with itself, which operates in each of the individual subsets, in any order and any number of mutual compositions. It is admitted, in the most general case, the involvement of any number of repeated compositions of both self-maps with themselves. It is basically seen that, if one of the best-proximity points in the cyclic disposal is unique in a boundedly compact subset of the metric space is sufficient to achieve unique asymptotic cycles formed by a best-proximity point per each adjacent subset. The same property is achievable if such a subset is strictly convex and the metric space is a uniformly convex Banach space. Furthermore, all the sequences with arbitrary initial points in the union of all the subsets of the cyclic disposal converge to such a limit cycle. Full article

Altitude test facilities for aero-engines employ multi-chamber, multi-valve intake systems that require effective decoupling and strong disturbance rejection during transient tests. This paper proposes a coordinated active disturbance rejection control (ADRC) scheme based on external penalty functions. The chamber pressure safety limit is formulated as an inequality-constrained optimization problem, and an exponential penalty together with a gradient based algorithm is designed for dynamic constraint relaxation, with guaranteed global convergence. A coordination term is then integrated into a distributed ADRC framework to yield a multi-valve coordinated ADRC controller, whose asymptotic stability is established via Lyapunov theory. Hardware-in-the-loop simulations using MATLAB/Simulink and a PLC demonstrate that, under ±3 kPa pressure constraints, the maximum engine inlet pressure error is 1.782 kPa (77.1% lower than PID control), and under an 80 kg/s² flow-rate disturbance, valve oscillations decrease from ±27% to ±5%. These results confirm the superior disturbance rejection and decoupling performance of the proposed method. Full article

This study aims to explore the tracking control challenge in a swarm of multiple nonholonomic wheeled mobile robots (NWMRs) by utilizing a distributed leader–follower strategy grounded in the cascade system theory. Firstly, the kinematic control law is developed for the leader by constructing a sliding surface based on the error tracking model with a virtual reference trajectory. Secondly, a communication topology with the desired formation pattern is modeled for the multiple robots by using the graph theory. Further, in the leader–follower NWMR system, each follower lacks direct access to the leader’s information. Therefore, a novel distributed-based controller by PD-based controller for the follower is developed, enabling each follower to obtain the leader’s information. Thirdly, for each case, we give a further analysis of the closed-loop system to guarantee uniform global asymptotic stability with the conditions based on the cascade system theory. Finally, the trajectory tracking performance of the proposed controllers for the NWMR system is illustrated through simulation results. The leader robot achieved a low RMSE of 1.6572 (Robot 1), indicating accurate trajectory tracking. Follower robots showed RMSEs of 2.6425 (Robot 2), 3.0132 (Robot 3), and 4.2132 (Robot 3), reflecting minor variations due to the distributed control strategy and local disturbances. Full article

In this paper, we propose a new and fairly general network-based contagion dynamics model framework. In the model framework, each node in the network can be in one of multiple secure (or good) and infected (or bad) states. We characterize the dynamics of our model framework, by presenting the following: (i) a sufficient condition under which the dynamics are globally asymptotically stable; (ii) a sufficient condition under which the dynamics are locally asymptotically stable; and (iii) a sufficient condition for the persistence of bad states. Finally, we implemented three operations on the transition diagram. These three operations can help eliminate the bad states and help the model achieve the stability conditions. Full article

The stability of a class of quaternion-valued switching neural networks (QVSNNs) with time-varying delays is investigated in this paper. Limited prior research exists on the stability analysis of quaternion-valued neural networks (QVNNs). This paper addresses the stability analysis of quaternion-valued neural networks (QVNNs). With the help of some symmetric matrices with excellent properties, the stability analysis method in this paper is undecomposed. The QVSNN discussed herein evolves with average dwell time. Based on the Lyapunov theoretical framework and Wirtinger-based inequality, QVSNNs under any switching law have global asymptotic stability (GAS) and global exponential stability (GES). The state decay estimation of the system is also given and proved. Finally, the effective and practical applicability of the proposed method is demonstrated by two comprehensive numerical calculations. Full article

Time delays and saturation effects are critical elements describing complex rumor spreading behaviors. In this article, a rumor spreading model with three time delays and two saturation functions is proposed. The basic properties of the model are reported. The structure of the rumor-endemic equilibria is deduced. A criterion for the global asymptotic stability of the rumor-free equilibrium is derived. In the presence of very small delays, a criterion for the local asymptotic stability of a rumor-endemic equilibrium is provided. The influence of the delays and the saturation effects on the dynamics of the model is made clear through simulation experiments. In particular, it is found that (a) extended time delays lead to slower change in the number of spreaders or stiflers and (b) lifted saturation coefficients lead to slower change in the number of spreaders or stiflers. This work helps to deepen the understanding of complex rumor spreading phenomenon and develop effective rumor-containing schemes. Full article

In this paper, we focus on mean-field stochastic differential equations driven by G-Brownian motion (G-MFSDEs for short) with a drift coefficient satisfying the local one-sided Lipschitz condition with respect to the state variable and the global Lipschitz condition with respect to the law. We are concerned with the well-posedness and the numerical approximation of the G-MFSDE. Probability uncertainty leads the resulting expectation usually to be the G-expectation, which means that we cannot apply the numerical approximation for McKean–Vlasov equations to G-MFSDEs directly. To numerically approximate the G-MFSDE, with the help of G-expectation theory, we use the sample average value to represent the law and establish the interacting particle system whose mean square limit is the G-MFSDE. After this, we introduce the modified stochastic theta method to approximate the interacting particle system and study its strong convergence and asymptotic mean square stability. Finally, we present an example to verify our theoretical results. Full article

This paper is concerned with the asymptotical behavior of the impulsive linearly implicit Euler method for the SIR epidemic model with nonlinear incidence rates and proportional impulsive vaccination. We point out the solution of the impulsive linearly implicit Euler method for the impulsive SIR system is positive for arbitrary step size when the initial values are positive. By applying discrete Floquet’s theorem and small-amplitude perturbation skills, we proved that the disease-free periodic solution of the impulsive system is locally stable. Additionally, in conjunction with the discrete impulsive comparison theorem, we show that the impulsive linearly implicit Euler method maintains the global asymptotical stability of the exact solution of the impulsive system. Two numerical examples are provided to illustrate the correctness of the results. Full article

This paper mainly investigates a class of third-order semilinear delay differential equations with a nonhomogeneous term ${\left({\left[x^{″}\left(t\right)\right]}^{\alpha }\right)}^{\prime }+q\left(t\right)x^{\alpha }\left(\sigma \left(t\right)\right)+f\left(t\right)=0,t\ge t_0.$ Under the oscillation criteria, we propose a sufficient condition to ensure that all solutions for the equation exhibit oscillatory behavior when $\alpha$ is the quotient of two positive odd integers, supported by concrete examples to verify the accuracy of these conditions. Furthermore, for the case $\alpha =1,$ a sufficient condition is established to guarantee that the solutions either oscillate or asymptotically converge to zero. Moreover, under these criteria, we demonstrate that the global oscillatory behavior of solutions remains unaffected by time-delay functions, nonhomogeneous terms, or nonlinear perturbations when $\alpha =1.$ Finally, numerical simulations are provided to validate the effectiveness of the derived conclusions. Full article

This paper investigates a class of nonlinear rational difference equations with delayed terms, which often arise in various mathematical models. We analyze the iterative behavior of these rational functions and show how their iterations can be represented through second-order linear recurrence relations. By establishing a connection with generalized Balancing sequences, we derive explicit formulas that describe the system’s asymptotic behavior. Our main contribution is proving the existence of a unique globally asymptotically stable equilibrium point for all trajectories, regardless of initial conditions. We also provide analytical expressions for the solutions and support our findings with numerical examples. These results offer valuable insights into the dynamics of nonlinear rational systems and form a theoretical basis for further exploration in this area. Full article