Results 41 to 50 of about 78,251 (234)
A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller
International Journal of Adaptive Control and Signal Processing, EarlyView.Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg +5 more
wiley +1 more source
Fractal and Fractional, 2023 We consider a system of Riemann–Liouville fractional differential equations with multi-point coupled boundary conditions. Using some techniques from matrix analysis and the properties of the integral operator defined on two Banach spaces, we establish ...
Yumei Zou, Yujun Cui
doaj +1 more source
Formation Control of Multi‐Agent System with Local Interaction and Artificial Potential Field
Advanced Robotics Research, EarlyView.This article proposes a local interaction‐based formation control method for Multi‐Agent system, integrating consensus and leader‐follower strategies with a stress response mechanism—artificial potential field to reduce communication overhead and enable obstacle avoidance. Experimental results on triangular, square, and hexagonal formations confirm its
Luoyin Zhao +3 more
wiley +1 more source
Guaranteed Cost Control for a Class of Nonlinear Discrete Time-Delay Systems
IEEE Access, 2019 The guaranteed cost control problem for a class of nonlinear discrete time-delay systems is investigated. Based on the Lyapunov matrix, a complete-type Lyapunov-Krasovskii functional is constructed.
Lanhui Zhang +3 more
doaj +1 more source
Resultants and Lyapunov matrix equations
Linear Algebra and its Applications, 1989 AbstractLet B and Q be real n × n matrices. It is well known that the discrete Lyapunov matrix equation Y − BTYB = Q has a unique solution Y if and only if the resultant R(g(x), xng(1/x)) is nonzero, where g(x) is the characteristic polynomial of B. Here, by reducing the underlying matrix, we obtain the factorization R(g(x), xng(1x)) = sntn(det Θ)2 ...
openaire +1 more source
Photon‐Sphere Modes in Curved Optical Microcavities: A Black‐Hole Analogue Laser
Advanced Science, EarlyView.An optical analogue of a Schwarzschild black hole is realized using curved microcavities that preserve light‐like geodesics. A new family of laser modes confined around the photon sphere is identified alongside conventional whispering‐gallery modes. Analytical theory, numerical simulations, and experiments reveal curvature‐induced confinement, enabling
Chenni Xu +9 more
wiley +1 more source
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
IET Networks, EarlyView., 2022 Abstract As the problems concerning the number of information to be optimised is increasing, the optimisation level is getting higher, the target information is more diversified, and the algorithms are becoming more complex; the traditional algorithms such as particle swarm and differential evolution are far from being able to deal with this situation ...
Linfeng Huang
wiley +1 more source
SICE Journal of Control, Measurement, and System Integration, 2019 We consider solving a large-scale Lyapunov equation for a multi-agent system. As is well known, the Lyapunov equation can be solved by equivalently rewriting it as a system of linear equations.
Asuka Ohashi, Kiyotsugu Takaba
doaj +1 more source
Two modified least-squares iterative algorithms for the Lyapunov matrix equations
Advances in Difference Equations, 2019 In this paper two modified least-squares iterative algorithms are presented for solving the Lyapunov matrix equations. The first algorithm is based on the hierarchical identification principle, which can be viewed as a surrogate of the least-squares ...
Min Sun, Yiju Wang, Jing Liu
doaj +1 more source
Lyapunov matrix equation with complex matrices
Electronics Letters, 1970 Rules are given for converting the equation in n×n matrices, A*L+LA = -K, with A complex and K Hermitian, to the form sd = -f, where s is a real n2×n2 matrix and d and f are real column vectors formed from the real and imaginary parts of L and K.
H.M. Power, A.C. Tsoi
openaire +1 more source