arXiv subjects

Jun-e Feng

Publications and source records attributed to Jun-e Feng.

10 recordsLinked to original sources

arXiv2026

A Leader-Follower Approach for The Attitude Synchronization of Multiple Rigid Body Systems on $SO(3)$

This paper deals with the leader-follower attitude synchronization problem for a group of heterogeneous rigid body systems on $SO(3)$ under an undirected, connected, and acyclic graph communication topology. The proposed distributed control strategy, endowed with almost global asymptotic stability guarantees, allows the synchronization of the rigid body systems to a constant desired orientation known only to a single rigid body. Some simulation results are also provided to validate the theoretical developments and illustrate the performance of the proposed control strategy.

eess.SY↗

arXiv2025

A Dimension-Keeping Semi-Tensor Product Framework for Compressed Sensing

In compressed sensing (CS), sparse signals can be reconstructed from significantly fewer samples than required by the Nyquist-Shannon sampling theorem. While non-sparse signals can be sparsely represented in appropriate transformation domains, conventional CS frameworks rely on the incoherence of the measurement matrix columns to guarantee reconstruction performance. This paper proposes a novel method termed Dimension-Keeping Semi-Tensor Product Compressed Sensing (DK-STP-CS), which leverages intra-group correlations while maintaining inter-group incoherence to enhance the measurement matrix design. Specifically, the DK-STP algorithm is integrated into the design of the sensing matrix, enabling dimensionality reduction while preserving signal recovery capability. For image compression and reconstruction tasks, the proposed method achieves notable noise suppression and improves visual fidelity. Experimental results demonstrate that DK-STP-CS significantly outperforms traditional CS and STP-CS approaches, as evidenced by higher Peak Signal-to-Noise Ratio (PSNR) values between the reconstructed and original images. The robustness of DK-STP-CS is further validated under noisy conditions and varying sampling rates, highlighting its potential for practical applications in resource-constrained environments.

cs.IT↗

arXiv2024

Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach

This paper exploits bisimulation relations, generated by extracting the concept of morphisms between algebraic structures, to analyze set stabilization of Boolean control networks with lower complexity. First, for two kinds of bisimulation relations, called as weak bisimulation and strong bisimulation relations, a novel verification method is provided by constructing the bisimulation matrices. Then the comparison for set stabilization of BCNs via two kinds of bisimulation methods is presented, which involves the dimensionality of quotient systems and dependency of the control laws on the original system. Moreover, the proposed method is also applied to the analysis of probabilistic Boolean control networks to establish the unified analysis framework of bisimulations. Finally, the validity of the obtained results is verified by the practical example.

math.OC↗

arXiv2023

State Feedback Control Design for Input-output Decoupling of Boolean Control Networks

A state feedback control strategy is proposed for input-output (IO) decoupling of a class of fully output controllable Boolean control networks (BCNs). Some necessary and sufficient conditions for BCN IO-decoupling are presented. As an instrumental tool in our design, we introduce a canonical form for IO-decoupled BCNs along with some conditions guaranteeing its existence. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approach.

eess.SY↗

arXiv2022

Approximate synchronization of coupled multi-valued logical networks

This article deals with the approximate synchronization of two coupled multi-valued logical networks. According to the initial state set from which both systems start, two kinds of approximate synchronization problem, local approximate synchronization and global approximate synchronization, are proposed for the first time. Three new notions: approximate synchronization state set (ASSS), the maximum approximate synchronization basin (MASB) and the shortest approximate synchronization time (SAST) are introduced and analyzed. Based on ASSS, several necessary and sufficient conditions are obtained for approximate synchronization. MASB, the set of all possible initial states, from which the systems are approximately synchronous, is investigated combining with the maximum invariant subset. And the calculation method of the SAST, associated with transient period, is presented. By virtue of MASB, pinning control scheme is investigated to make two coupled systems achieve global approximate synchronization. Furthermore, the related theories are also applied to the complete synchronization problem of $k$-valued ($k\geq2$) logical networks. Finally, four examples are given to illustrate the obtained results.

eess.SY↗

arXiv2022

A Remark on Evolution Equation of Stochastic Logical Dynamic Systems

Modelling is an essential procedure in analyzing and controlling a given logical dynamic system (LDS). It has been proved that deterministic LDS can be modeled as a linear-like system using algebraic state space representation. However, due to the inherently non-linear, it is difficult to obtain the algebraic expression of a stochastic LDS. This paper provides a unified framework for transition analysis of LDSs with deterministic and stochastic dynamics. First, modelling of LDS with deterministic dynamics is reviewed. Then modeling of LDS with stochastic dynamics is considered, and non-equivalence between subsystems and global system is proposed. Next, the reason for the non-equivalence is provided. Finally, consistency condition is presented for independent model and conditional independent model.

math.OC↗

arXiv2021

Reachability of Dimension-Bounded Linear Systems

In this paper, the reachability of dimension-bounded linear systems is investigated.Since state dimensions of dimension-bounded linear systems vary with time, the expression of state dimension at each time is provided.A method for judging the reachability of a given vector space is proposed. In addition, this paper proves that the t-step reachable subset is a linear space, and gives a computing method. The t-step reachability of a given state is verified via a rank condition. Furthermore, annihilator polynomials are discussed and used to illustrate the relationship between the invariant space and the reachable subset after the invariant time point t*. The inclusion relation between reachable subsets at times t*+i and t*+j is shown via an example.

eess.SY↗

arXiv2021

On Identification of Boolean Control Networks

A new analytical framework consisting of two phenomena: single sample and multiple samples, is proposed to deal with the identification problem of Boolean control networks (BCNs) systematically and comprehensively. Under this framework, the existing works on identification can be categorized as special cases of these two phenomena. Several effective criteria for determining the identifiability and the corresponding identification algorithms are proposed. Three important results are derived: (1) If a BN is observable, it is uniquely identifiable; (2) If a BCN is O1-observable, it is uniquely identifiable, where O1-observability is the most general form of the existing observability terms; (3) A BN or BCN may be identifiable, but not observable. In addition, remarks present some challenging future research and contain a preliminary attempt about how to identify unobservable systems.

eess.SY↗

arXiv2020

State Feedback Stabilization of Generic Logic Systems via Ledley Antecedence Solution

In this paper, the application of Ledley antecedence solutions in designing state feedback stabilizers of generic logic systems has been proposed. To make the method feasible, two modifications are made to the original Ledley antecedence solution theory: (i) the preassigned logical functions have been extended from being a set of equations to an admissible set; (ii) the domain of arguments has been extended from the whole state space to a restricted subset. In the proposed method, state feedback controls are considered as a set of extended Ledley antecedence solutions for a designed iterative admissible sets over their corresponding restricted subsets. Based on this, an algorithm has been proposed to verify the solvability, and simultaneously to provide all possible state feedback stabilizers when the problem is solvable. All stabilizers are optimal, which stabilize the logic systems from any initial state to the destination state/state set in the shortest time. The method is firstly demonstrated on Boolean control networks to achieve point stabilization. Then, with some minor modifications, the proposed method is also proven to be applicable to set stabilization problems. Finally, it is shown that in $k$-valued and mix-valued logical systems, the proposed method remains effective.

math.LO↗

arXiv2019

Matrix Expression of Finite Boolean-type Algebras

Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The construction and certain properties of BTAs are investigated via their matrix expression, including the homomorphism and isomorphism, etc. Then the product/decomposition of BTLs are considered. A necessary and sufficient condition for decomposition of BTA is obtained. Finally, a universal generator is provided for arbitrary finite universal algebras.

math.LO↗