arXiv subjects

Changyun Wen

Publications and source records attributed to Changyun Wen.

At least 19 recordsLinked to original sources

arXiv2026

Composite learning control with modular backstepping and high-order tuners

This paper proposes a composite learning backstepping control (CLBC) strategy based on modular backstepping and high-order tuners to achieve closed-loop exponential stability without high-gain feedback and PE. A novel composite learning mechanism that maximizes the staged exciting strength is designed for parameter estimation, enabling parameter convergence under interval excitation (IE) or even partial IE, which is strictly weaker than PE. An extra prediction error is employed in the adaptive law to ensure the transient performance without high-gain feedback. Simulations have demonstrated the effectiveness and superiority of the proposed method in both parameter estimation and control compared to state-of-the-art methods.

eess.SY↗

arXiv2025

Composite Learning Adaptive Control under Non-Persistent Partial Excitation

This paper focuses on relaxing the excitation conditions for the adaptive control of uncertain nonlinear systems. By adopting the spectral decomposition technique, a linear regression equation (LRE) is constructed to quantitatively collect historical excitation information, based on which the parameter estimation error is decomposed into the excited component and the unexcited component. By sufficiently utilizing the collected excitation information, the composite learning and μ-modification terms are designed and incorporated into the "Lyapunov-based" parameter update law. By developing a novel Lyapunov function, it is demonstrated that under non-persistent partial excitation, the control error and the excited parameter estimation error component converge to zero, while the unexcited component remains bounded. Furthermore, the proposed adaptive control scheme can effectively eliminate the effects of parametric uncertainties and enhance the robustness of the closed-loop systems. Simulation results are provided to verify the theoretical findings.

eess.SY↗

arXiv2025

Resilient Multi-Dimensional Consensus and Distributed Optimization against Agent-Based and Denial-of-Service Attacks

In this paper, we consider the resilient multi-dimensional consensus and distributed optimization problems of multi-agent systems (MASs) in the presence of both agent-based and denial-of-service (DoS) attacks. The considered agent-based attacks can cover malicious, Byzantine, and stubborn agents. The links between agents in the network can be blocked by DoS attacks, which may lead the digraph to be time-varying and even disconnected. The objective is to ensure that the remaining benign agents achieve consensus. To this end, an "auxiliary point"-based resilient control algorithm is proposed for MASs. Under the proposed algorithm, each healthy agent constructs a "safe kernel" utilizing the states of its in-neighbors and updates its state toward a specific point within this kernel at each iteration. If an agent cannot receive its neighbors' states owing to DoS attacks, it will use the states received immediately before the DoS period. Moreover, a resilient multi-dimensional distributed optimization (RMDO) algorithm is also proposed. Theoretical proofs and numerical examples are presented to demonstrate the effectiveness of the proposed algorithms.

eess.SY↗

arXiv2024

Distributed Matrix Pencil Formulations for Prescribed-Time Leader-Following Consensus of MASs with Unknown Sensor Sensitivity

In this paper, we address the problem of prescribed-time leader-following consensus of heterogeneous multi-agent systems (MASs) in the presence of unknown sensor sensitivity. Under a connected undirected topology, we propose a time-varying dual observer/controller design framework that makes use of regular local and inaccurate feedback to achieve consensus tracking within a prescribed time. In particular, the developed analysis framework is applicable to MASs equipped with sensors of different sensitivities. One of the design innovations involves constructing a distributed matrix pencil formulation based on worst-case sensors, yielding control parameters with sufficient robustness yet relatively low conservatism. Another novelty is the construction of the control gains, which consists of the product of a proportional coefficient obtained from the matrix pencil formulation and a classic time-varying function that grows to infinity or a novel bounded time-varying function. Furthermore, it is possible to extend the prescribed-time distributed protocol to infinite time domain by introducing the bounded time-varying gain technique without sacrificing the ultimate control accuracy, and the corresponding technical proof is comprehensive. The effectiveness of the method is demonstrated through a group of 5 single-link robot manipulators.

eess.SY↗

arXiv2023

Data-Driven Modeling with Experimental Augmentation for the Modulation Strategy of the Dual-Active-Bridge Converter

For the performance modeling of power converters, the mainstream approaches are essentially knowledge-based, suffering from heavy manpower burden and low modeling accuracy. Recent emerging data-driven techniques greatly relieve human reliance by automatic modeling from simulation data. However, model discrepancy may occur due to unmodeled parasitics, deficient thermal and magnetic models, unpredictable ambient conditions, etc. These inaccurate data-driven models based on pure simulation cannot represent the practical performance in physical world, hindering their applications in power converter modeling. To alleviate model discrepancy and improve accuracy in practice, this paper proposes a novel data-driven modeling with experimental augmentation (D2EA), leveraging both simulation data and experimental data. In D2EA, simulation data aims to establish basic functional landscape, and experimental data focuses on matching actual performance in real world. The D2EA approach is instantiated for the efficiency optimization of a hybrid modulation for neutral-point-clamped dual-active-bridge (NPC-DAB) converter. The proposed D2EA approach realizes 99.92% efficiency modeling accuracy, and its feasibility is comprehensively validated in 2-kW hardware experiments, where the peak efficiency of 98.45% is attained. Overall, D2EA is data-light and can achieve highly accurate and highly practical data-driven models in one shot, and it is scalable to other applications, effortlessly.

eess.SY↗

arXiv2023

Novel Intensity Mapping Functions: Weighted Histogram Averaging

It is challenging to align the brightness distribution of the images with different exposures due to possible color distortion and loss of details in the brightest and darkest regions of input images. In this paper, a novel intensity mapping algorithm is first proposed by introducing a new concept of weighted histogram averaging (WHA). The proposed WHA algorithm leverages the correspondence between the histogram bins of two images which are built up by using the non-decreasing property of the intensity mapping functions (IMFs). Extensive experiments indicate that the proposed WHA algorithm significantly surpasses the related state-of-the-art intensity mapping methods.

cs.CV↗

arXiv2022

Quantized control of non-Lipschitz nonlinear systems: a novel control framework with prescribed transient performance and lower design complexity

A novel control design framework is proposed for a class of non-Lipschitz nonlinear systems with quantized states, meanwhile prescribed transient performance and lower control design complexity could be guaranteed. Firstly, different from all existing control methods for systems with state quantization, global stability of strict-feedback nonlinear systems is achieved without requiring the condition that the nonlinearities of the system model satisfy global Lipschitz continuity. Secondly, a novel barrier function-free prescribed performance control (BFPPC) method is proposed, which can guarantee prescribed transient performance under quantized states. Thirdly, a new \textit{W}-function-based control scheme is designed such that virtual control signals are not required to be differentiated repeatedly and the controller could be designed in a simple way, which guarantees global stability and lower design complexity compared with traditional dynamic surface control (DSC). Simulation results demonstrate the effectiveness of our method.

eess.SY↗

arXiv2022

Resilient Multi-Dimensional Consensus in Adversarial Environment

This paper considers the multi-dimensional consensus in networked systems, where some of the agents might be misbehaving (or faulty). Despite the influence of these misbehaviors, the benign agents aim to reach an agreement while avoiding being seriously influenced by the faulty ones. To this end, this paper first considers a general class of consensus algorithms, where each benign agent computes an "auxiliary point" based on the received values and moves its state toward this point. Concerning this generic form, we present conditions for achieving resilient consensus and obtain a lower bound on the exponential convergence rate. Assuming that the number of malicious agents is upper bounded, two specific resilient consensus algorithms are further developed based on the obtained conditions. Particularly, the first solution, based on Helly's Theorem, achieves the consensus within the convex hull formed by the benign agents' initial states, where the auxiliary point can be efficiently computed through linear programming. On the other hand, the second algorithm serves as a "built-in" security guarantee for standard average consensus algorithms, in the sense that its performance coincides exactly with that of the standard ones in the absence of faulty nodes while also resisting the serious influence of the misbehaving ones in adversarial environment. Some numerical examples are provided in the end to verify the theoretical results.

eess.SY↗

arXiv2021

Deep Joint Demosaicing and High Dynamic Range Imaging within a Single Shot

Spatially varying exposure (SVE) is a promising choice for high-dynamic-range (HDR) imaging (HDRI). The SVE-based HDRI, which is called single-shot HDRI, is an efficient solution to avoid ghosting artifacts. However, it is very challenging to restore a full-resolution HDR image from a real-world image with SVE because: a) only one-third of pixels with varying exposures are captured by camera in a Bayer pattern, b) some of the captured pixels are over- and under-exposed. For the former challenge, a spatially varying convolution (SVC) is designed to process the Bayer images carried with varying exposures. For the latter one, an exposure-guidance method is proposed against the interference from over- and under-exposed pixels. Finally, a joint demosaicing and HDRI deep learning framework is formalized to include the two novel components and to realize an end-to-end single-shot HDRI. Experiments indicate that the proposed end-to-end framework avoids the problem of cumulative errors and surpasses the related state-of-the-art methods.

eess.IV↗

arXiv2021

Feature Flow: In-network Feature Flow Estimation for Video Object Detection

Optical flow, which expresses pixel displacement, is widely used in many computer vision tasks to provide pixel-level motion information. However, with the remarkable progress of the convolutional neural network, recent state-of-the-art approaches are proposed to solve problems directly on feature-level. Since the displacement of feature vector is not consistent to the pixel displacement, a common approach is to:forward optical flow to a neural network and fine-tune this network on the task dataset. With this method,they expect the fine-tuned network to produce tensors encoding feature-level motion information. In this paper, we rethink this de facto paradigm and analyze its drawbacks in the video object detection task. To mitigate these issues, we propose a novel network (IFF-Net) with an \textbf{I}n-network \textbf{F}eature \textbf{F}low estimation module (IFF module) for video object detection. Without resorting pre-training on any additional dataset, our IFF module is able to directly produce \textbf{feature flow} which indicates the feature displacement. Our IFF module consists of a shallow module, which shares the features with the detection branches. This compact design enables our IFF-Net to accurately detect objects, while maintaining a fast inference speed. Furthermore, we propose a transformation residual loss (TRL) based on \textit{self-supervision}, which further improves the performance of our IFF-Net. Our IFF-Net outperforms existing methods and sets a state-of-the-art performance on ImageNet VID.

cs.CV↗

arXiv2021

Detecting False Data Injection Attacks in Smart Grids with Modeling Errors: A Deep Transfer Learning Based Approach

Most traditional false data injection attack (FDIA) detection approaches rely on a key assumption, i.e., the power system can be accurately modeled. However, the transmission line parameters are dynamic and cannot be accurately known during operation and thus the involved modeling errors should not be neglected. In this paper, an illustrative case has revealed that modeling errors in transmission lines significantly weaken the detection effectiveness of conventional FDIA approaches. To tackle this issue, we propose an FDIA detection mechanism from the perspective of transfer learning. Specifically, the simulated power system is treated as a source domain, which provides abundant simulated normal and attack data. The real world's running system whose transmission line parameters are unknown is taken as a target domain where sufficient real normal data are collected for tracking the latest system states online. The designed transfer strategy that aims at making full use of data in hand is divided into two optimization stages. In the first stage, a deep neural network (DNN) is built by simultaneously optimizing several well-designed objective terms with both simulated data and real data, and then it is fine-tuned via real data in the second stage. Several case studies on the IEEE 14-bus and 118-bus systems verify the effectiveness of the proposed mechanism.

eess.SP↗

arXiv2021

Solving specified-time distributed optimization problem via sampled-data-based algorithm

Despite significant advances on distributed continuous-time optimization of multi-agent networks, there is still lack of an efficient algorithm to achieve the goal of distributed optimization at a pre-specified time. Herein, we design a specified-time distributed optimization algorithm for connected agents with directed topologies to collectively minimize the sum of individual objective functions subject to an equality constraint. With the designed algorithm, the settling time of distributed optimization can be exactly predefined. The specified selection of such a settling time is independent of not only the initial conditions of agents, but also the algorithm parameters and the communication topologies. Furthermore, the proposed algorithm can realize specified-time optimization by exchanging information among neighbours only at discrete sampling instants and thus reduces the communication burden. In addition, the equality constraint is always satisfied during the whole process, which makes the proposed algorithm applicable to online solving distributed optimization problems such as economic dispatch. For the special case of undirected communication topologies, a reduced-order algorithm is also designed. Finally, the effectiveness of the theoretical analysis is justified by numerical simulations.

math.OC↗

arXiv2021

Online Active Proposal Set Generation for Weakly Supervised Object Detection

To reduce the manpower consumption on box-level annotations, many weakly supervised object detection methods which only require image-level annotations, have been proposed recently. The training process in these methods is formulated into two steps. They firstly train a neural network under weak supervision to generate pseudo ground truths (PGTs). Then, these PGTs are used to train another network under full supervision. Compared with fully supervised methods, the training process in weakly supervised methods becomes more complex and time-consuming. Furthermore, overwhelming negative proposals are involved at the first step. This is neglected by most methods, which makes the training network biased towards to negative proposals and thus degrades the quality of the PGTs, limiting the training network performance at the second step. Online proposal sampling is an intuitive solution to these issues. However, lacking of adequate labeling, a simple online proposal sampling may make the training network stuck into local minima. To solve this problem, we propose an Online Active Proposal Set Generation (OPG) algorithm. Our OPG algorithm consists of two parts: Dynamic Proposal Constraint (DPC) and Proposal Partition (PP). DPC is proposed to dynamically determine different proposal sampling strategy according to the current training state. PP is used to score each proposal, part proposals into different sets and generate an active proposal set for the network optimization. Through experiments, our proposed OPG shows consistent and significant improvement on both datasets PASCAL VOC 2007 and 2012, yielding comparable performance to the state-of-the-art results.

cs.CV↗

arXiv2020

A "Safe Kernel" Approach for Resilient Multi-Dimensional Consensus

This paper considers the resilient multi-dimensional consensus problem in networked systems, where some of the agents might be malicious (or faulty). We propose a multi-dimensional consensus algorithm, where at each time step each healthy agent computes a "safe kernel" based on the information from its neighbors, and modifies its own state towards a point inside the kernel. Assuming that the number of malicious agents is locally (or globally) upper bounded, sufficient conditions on the network topology are presented to guarantee that the benign agents exponentially reach an agreement within the convex hull of their initial states, regardless of the actions of the misbehaving ones. It is also revealed that the graph connectivity and robustness required to achieve the resilient consensus increases linearly with respect to the dimension of the agents' state, indicating the existence of a trade-off between the low communication cost and system security. Numerical examples are provided in the end to validate the theoretical results.

eess.SY↗

arXiv2020

Adaptive Backstepping Control for Fractional-Order Nonlinear Systems with External Disturbance and Uncertain Parameters Using Smooth Control

In this paper, we consider controlling a class of single-input-single-output (SISO) commensurate fractional-order nonlinear systems with parametric uncertainty and external disturbance. Based on backstepping approach, an adaptive controller is proposed with adaptive laws that are used to estimate the unknown system parameters and the bound of unknown disturbance. Instead of using discontinuous functions such as the $\mathrm{sign}$ function, an auxiliary function is employed to obtain a smooth control input that is still able to achieve perfect tracking in the presence of bounded disturbances. Indeed, global boundedness of all closed-loop signals and asymptotic perfect tracking of fractional-order system output to a given reference trajectory are proved by using fractional directed Lyapunov method. To verify the effectiveness of the proposed control method, simulation examples are presented.

eess.SY↗

arXiv2020

Sampled-Data Control Based Consensus of Fractional-Order Multi-Agent Systems

In this paper, we investigate consensus control of fractional-order multi-agent systems with order in (0,1) via sampled-data control. A new scheme to design distributed controllers with rigorous analysis is presented by utilizing the unique properties of fractional-order calculus, namely hereditary and infinite memory. It is established that global boundedness of all closed-loop signals is ensured and asymptotic consensus is realized. Simulation studies are conducted to illustrate the effectiveness of the proposed control method and verify the obtained results.

eess.SY↗

arXiv2019

High Speed Tracking With A Fourier Domain Kernelized Correlation Filter

It is challenging to design a high speed tracking approach using l1-norm due to its non-differentiability. In this paper, a new kernelized correlation filter is introduced by leveraging the sparsity attribute of l1-norm based regularization to design a high speed tracker. We combine the l1-norm and l2-norm based regularizations in one Huber-type loss function, and then formulate an optimization problem in the Fourier Domain for fast computation, which enables the tracker to adaptively ignore the noisy features produced from occlusion and illumination variation, while keep the advantages of l2-norm based regression. This is achieved due to the attribute of Convolution Theorem that the correlation in spatial domain corresponds to an element-wise product in the Fourier domain, resulting in that the l1-norm optimization problem could be decomposed into multiple sub-optimization spaces in the Fourier domain. But the optimized variables in the Fourier domain are complex, which makes using the l1-norm impossible if the real and imaginary parts of the variables cannot be separated. However, our proposed optimization problem is formulated in such a way that their real part and imaginary parts are indeed well separated. As such, the proposed optimization problem can be solved efficiently to obtain their optimal values independently with closed-form solutions. Extensive experiments on two large benchmark datasets demonstrate that the proposed tracking algorithm significantly improves the tracking accuracy of the original kernelized correlation filter (KCF) while with little sacrifice on tracking speed. Moreover, it outperforms the state-of-the-art approaches in terms of accuracy, efficiency, and robustness.

cs.CV↗

arXiv2018

Target Control of Directed Networks based on Network Flow Problems

Target control of directed networks, which aims to control only a target subset instead of the entire set of nodes in large natural and technological networks, is an outstanding challenge faced in various real world applications. We address one fundamental issue regarding this challenge, i.e., for a given target subset, how to allocate a minimum number of control sources which provide input signals to the network nodes. This issue remains open in general networks with loops. We show that the issue is essentially a path cover problem and can be further converted into a maximum network flow problem. A method termed `Maximum Flow based Target Path-cover' (MFTP) with complexity $O(|V|^{1/2}|E|)$ in which $|V|$ and $|E|$ denote the number of network nodes and edges is proposed. It is also rigorously proven to provide the minimum number of control sources on arbitrary directed networks, whether loops exist or not. We anticipate that this work would serve wide applications in target control of real-life networks, as well as counter control of various complex systems which may contribute to enhancing system robustness and resilience.

eess.SY↗