arXiv subjects

Jianquan Lu

Publications and source records attributed to Jianquan Lu.

12 recordsLinked to original sources

arXiv2026

Admissibility of control operators for positive semigroups and robustness of input-to-state stability

In this paper, we investigate well-posedness and stability properties of distributed parameter systems, with particular emphasis on linear positive control systems. We establish a characterization of the well-posedness in the Banach lattice setting. Furthermore, we derive a resolvent condition for admissibility of control operators for positive semigroups. In addition, we study the behavior of input-to-state stability (ISS) under unbounded perturbations of the underlying semigroup generator. More precisely, we establish necessary and sufficient conditions for the robustness of ISS under Desch-Schappacher perturbations. Our theoretical results are demonstrated through a boundary value-controlled transport equation with non-local boundary conditions.

math.OC↗

arXiv2025

Event-triggered robust control of linear systems: Sliding mode cone method

In this paper, we investigate the global robust stabilization of linear time-invariant systems by using event-triggered sliding mode control (SMC). Different from the practical sliding mode band, which is commonly used in previous studies on event-triggered SMC, a new concept of ideal sliding mode cone is proposed in this paper. Specifically, we design a hybrid event-triggering mechanism that takes into account both the size and direction shift of the error state. The proposed event-triggered SMC law is shown to enforce and sustain the system state in the ideal sliding mode cone. Moreover, the state of the closed-loop system can asymptotically converge to the equilibrium point, rather than merely to a neighborhood of it, which is usually difficult to handle by using practical sliding mode band. Technically speaking, to achieve strong convergence, the triggering frequency should naturally be as high as possible due to the existence of the external disturbances, but this will also increase the communication load. Hence, to balance the asymptotic convergence and frequent triggering near the equilibrium point that is the price paid for achieving asymptotic stability, we extend the obtained results to the case of practical sliding mode cone. In addition, it is verified that the ETM is global, namely, the inter-event times are uniformly lower bounded from zero globally. Further, a practical application for the quadrotor unmanned aerial vehicles is presented. Finally, three illustrative examples are given to demonstrate the effectiveness of the obtained results.

math.OC↗

arXiv2025

Real-time Estimation of DoS Duration and Frequency for Security Control

In this paper, we develop a new denial-of-service (DoS) estimator, enabling defenders to identify duration and frequency parameters of any DoS attacker, except for three edge cases, exclusively using real-time data. The key advantage of the estimator lies in its capability to facilitate security control in a wide range of practical scenarios, even when the attacker's information is previously unknown. We demonstrate the advantage and application of our new estimator in the context of two classical control scenarios, namely consensus of multi-agent systems and impulsive stabilization of nonlinear systems, for illustration.

eess.SY↗

arXiv2024

Predefined-time distributed non-convex optimization via a time-base generator

In this paper, we propose two novel multi-agent systems for the resource allocation problems (RAPs) and consensus-based distributed optimization problems. Different from existing distributed optimal approaches, we propose the new time-base generators (TBGs) for predefined-time non-convex optimization. Leveraging the proposed time-base generator, we study the roughness and boundedness of Lyapunov function based on TBGs. We prove that our approach achieves predefined-time approximate convergence to the optimal solution if the cost functions exhibit non-strongly convex or even non-convex characteristics. Furthermore, we prove that our approaches converge to the optimal solution if cost functions are generalized smoothness, and exhibit faster convergence rate and CPU speed. Finally, we present numerous numerical simulation examples to confirm the effectiveness of our approaches.

math.OC↗

arXiv2022

Distributed Pinning Set Stabilization of Large-Scale Boolean Networks

In this article, we design the distributed pinning controllers to globally stabilize a Boolean network (BN), specially a sparsely connected large-scale one, towards a preassigned subset of state space through the node-to-node message exchange. Given an appointed state set, system nodes are partitioned into two disjoint parts, which respectively gather the nodes whose states are fixed or arbitrary with respect to the given state set. With such node division, three parts of pinned nodes are selected and the state feedback controllers are accordingly designed such that the resulting BN satisfies three conditions: the states of the other nodes cannot affect the nodal dynamics of fixed-state nodes, the subgraph of network structure induced by the fixed-state nodes is acyclic, and the steady state of the subnetwork induced by the fixed-state nodes lies in the state set given beforehand. If the BN after control is acyclic, the stabilizing time is revealed to be no more than the length of the longest path in the current network structure plus one. This enables us to further design the pinning controllers with the constraint of stabilizing time. Noting that the overall procedure runs in an exponentially increasing time with respect to the largest number of functional variables in the dynamics of pinned nodes, the sparsely-connected large-scale BNs can be well addressed in a reasonable amount of time. Finally, we demonstrate the applications of our theoretical results in a T-LGL survival signal network with $29$ nodes and T-cell receptor signaling network with $90$ nodes.

eess.SY↗

arXiv2022

Sensors Design for Large-Scale Boolean Networks via Pinning Observability

In this paper, a set of sensors is constructed via the pinning observability approach with the help of observability criteria given in [1] and [2], in order to make the given Boolean network (BN) be observable. Given the assumption that system states can be accessible, an efficient pinning control scheme is developed to generate an observable BN by adjusting the network structure rather than just to check system observability. Accordingly, the sensors are constructed, of which the form is consistent with that of state feedback controllers in the designed pinning control. Since this pinning control approach only utilizes node-to-node message communication instead of global state space information, the time complexity is dramatically reduced from $O(2^{2n})$ to $O(n^2+n2^d)$, where where $n$ and $d$ are respectively the node number of the considered BN and the largest in-degree of vertices in its network structure. Finally, we design the sensors for the reduced D. melanogaster segmentation polarity gene network and the T-cell receptor kinetics, respectively.

eess.SY↗

arXiv2021

Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices

The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begin with, by exploring structural observability of large-scale Boolean networks (LSBNs), an underlying type of SOGs is provided based on a recent observability criterion of conjunctive BNs. Besides, SOGs are also proved to have important applicability to structural observability of general discrete-time systems. Further, two minimum realization strategies are considered to induce an SOG from an arbitrarily given digraph by marking and controlling the minimal vertices, respectively. It indicates that one can induce an observable system by means of adding the minimal sensors or modifying the adjacency relation of minimal vertices. Finally, the structural observability of finite-field networks, and the minimum pinned node theorem for Boolean networks are displayed as application and simulation. The most salient superiority is that the designed algorithms are polynomial time and avoid exhaustive brute-force searches. It means that our results can be applied to deal with the observability of large-scale systems (particularly, LSBNs), whose observability analysis and the minimum controlled node theorem are known as intractable problems.

eess.SY↗

arXiv2021

A General Control Framework for Boolean Networks

This paper focuses on proposing a general control framework for large-scale Boolean networks (\texttt{BNs}). Only by the network structure, the concept of structural controllability for \texttt{BNs} is formalized. A necessary and sufficient criterion is derived for the structural controllability of \texttt{BNs}; it can be verified with $Θ(n^2)$ time, where $n$ is the number of network nodes. An interesting conclusion is shown as that a \texttt{BN} is structurally controllable if and only if it is structurally fixed-time controllable. Afterwards, the minimum node control problem with respect to structural controllability is proved to be NP-hard for structural \texttt{BNs}. In virtue of the structurally controllable criterion, three difficult control issues can be efficiently addressed and accompanied with some advantages. In terms of the design of pinning controllers to generate a controllable \texttt{BN}, by utilizing the structurally controllable criterion, the selection procedure for the pinning node set is developed for the first time instead of just checking the controllability under the given pinning control form; the pinning controller is of distributed form, and the time complexity is $Θ(n2^{3d^{\ast}}+2(n+m)^2)$, where $m$ and $d^\ast$ are respectively the number of generators and the maximum vertex in-degree. With regard to the control design for stabilization in probability of probabilistic \texttt{BNs} (\texttt{PBNs}), an important theorem is proved to reveal the equivalence between several types of stability. The existing difficulties on the stabilization in probability are then solved to some extent via the structurally controllable criterion.

eess.SY↗

arXiv2021

Exact exponential synchronization rate of high-dimensional Kuramoto models with identical oscillators and digraphs

For the high-dimensional Kuramoto model with identical oscillators under a general digraph that has a directed spanning tree, although exponential synchronization was proved under some initial state constraints, the exact exponential synchronization rate has not been revealed until now. In this paper, the exponential synchronization rate is precisely determined as the smallest non-zero real part of Laplacian eigenvalues of the digraph. Our obtained result extends the existing results from the special case of strongly connected balanced digraphs to the condition of general digraphs owning directed spanning trees, which is the weakest condition for synchronization from the aspect of network structure. Moreover, our adopted method is completely different from and much more elementary than the previous differential geometry method.

math-ph↗

arXiv2020

A New Approach to Pinning Control of Boolean Networks

Boolean networks (BNs) are discrete-time systems where nodes are inter-connected (here we call such connection rule among nodes as network structure), and the dynamics of each gene node is determined by logical functions. In this paper, we propose a new approach on pinning control design for global stabilization of BNs based on BNs' network structure, named as network-structure-based distributed pinning control. By deleting the minimum number of edges, the network structure becomes acyclic. Then, an efficient distributed pinning control is designed to achieve global stabilization. Compared with existing literature, the design of pinning control is not based on the state transition matrix of BNs. Hence, the computational complexity in this paper is reduced from $O(2^n\times 2^n)$ to $O(2\times 2^K)$, where $n$ is the number of nodes and $K\leq n$ is the largest number of in-neighbors of nodes. In addition, without using state transition matrix, global state information is no longer needed, the design of pinning control is just based on neighbors' local information, which is easier to be implemented. The proposed method is well demonstrated by several biological networks with different sizes. The results are shown to be simple and concise, while the traditional pinning control can not be applied for BNs with such a large dimension.

eess.SY↗

arXiv2020

Pinning Stabilizer Design for Large-Scale Probabilistic Boolean Networks

This paper investigates the stabilization of probabilistic Boolean networks (PBNs) via a novel pinning control strategy based on network structure. In a PBN, the evolution equation of each gene switches among a collection of candidate Boolean functions with probability distributions that govern the activation frequency of each Boolean function. Owing to the stochasticity, the uniform state feedback controller, independent of switching signal, might be out of work, and in this case, the non-uniform state feedback controller is required. Subsequently, a criterion is derived to determine whether uniform controllers is applicable to achieve stabilization. It is worth pointing out that the pinning control designed in this paper is based on the network structure, which only requires local in-neighbors' information, rather than global information (state transition matrix). Moreover, this pinning control strategy reduces the computational complexity from $O(2^{2n})$ to $O(n2^α)$, and thus it has the ability to handle some large-scale networks, especially the networks with sparse connections. Finally, the mammalian cell-cycle encountering a mutated phenotype is modelled by a PBN to demonstrate the obtained results.

eess.SY↗

arXiv2020

An improved transformation between Fibonacci FSRs and Galois FSRs

Feedback shift registers (FSRs), which have two configurations: Fibonacci and Galois, are a primitive building block in stream ciphers. In this paper, an improved transformation is proposed between Fibonacci FSRs and Galois FSRs. In the previous results, the number of stages is identical when constructing the equivalent FSRs. In this paper, there is no requirement to keep the number of stages equal for two equivalent FSRs here. More precisely, it is verified that an equivalent Galois FSR with fewer stages cannot be found for a Fibonacci FSR, but the converse is not true. Furthermore, the total number of equivalent Galois FSRs for a given Fibonacci FSR with n stages is calculated. In order to reduce the propagation time and memory, an effective algorithm is developed to find equivalent Galois FSR and is proved to own minimal operators and stages. Finally, the feasibility of our proposed strategies, to mutually transform Fibonacci FSRs and Galois FSRs, is demonstrated by numerical examples.

cs.IT↗