7 July 2021 in IEEE Transactions on Automatic Control
This article presents an observer-based event-triggered boundary control strategy for a class of reaction–diffusion partial differential equations with Robin actuation. The observer only requires boundary measurements. The control approach consists of a backstepping output feedback boundary controller, derived using estimated states, and a dynamic triggering condition, which determines the time instants at which the control input needs to be updated. It is shown that under the proposed observer-based event-triggered boundary control approach, there is a minimal dwell time between two triggering instants independent of initial conditions. Furthermore, the well-posedness and the global exponential convergence of the closed-loop system to the equilibrium point are established. A simulation example is provided to validate the theoretical developments.
9 November 2021 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Hyperspectral unmixing (HU) has become an important technique in exploiting hyperspectral data since it decomposes a mixed pixel into a collection of endmembers weighted by fractional abundances. The endmembers of a hyperspectral image (HSI) are more likely to be generated by independent sources and be mixed in a macroscopic degree before arriving at the sensor element of the imaging spectrometer as mixed spectra. Over the past few decades, many attempts have focused on imposing auxiliary regularizes on the conventional nonnegative matrix factorization (NMF) framework in order to effectively unmix these mixed spectra. As a promising step toward finding an optimum regularizer to extract endmembers, this paper presents a novel blind HU algorithm, referred to as Kurtosis-based Smooth Nonnegative Matrix Factorization (KbSNMF) which incorporates a novel regularizer based on the statistical independence of the probability density functions of endmember spectra. Imposing this regularizer on the conventional NMF framework promotes the extraction of independent endmembers while further enhancing the parts-based representation of data. Experiments conducted on diverse synthetic HSI datasets (with numerous numbers of endmembers, spectral bands, pixels, and noise levels) and three standard real HSI datasets demonstrate the validity of the proposed KbSNMF algorithm compared to several stateof- the-art NMF-based HU baselines. The proposed algorithm exhibits superior performance especially in terms of extracting endmember spectra from hyperspectral data; therefore, it could uplift the performance of recent deep learning HU methods which utilize the endmember spectra as supervisory input data for abundance extraction.
12 March 2020 in IEEE Transactions on Geoscience and Remote Sensing
Hyperspectral unmixing (HU) is a crucial step in the hyperspectral image (HSI) analysis. It aims at decomposing the observed spectrum at each pixel into a collection of constituent endmembers, weighted by their abundances. In a close spatial neighborhood, due to spatial autocorrelation, the abundances of an endmember tend to be similar to each other. Therefore, the spectra at the neighboring pixels are also very much alike. Recently, many studies have focused on graph-regularized nonnegative matrix factorization (NMF) approaches to address the blind HU problem. This is mainly because graph structures allow spatial-spectral relations to be effectively embedded in the NMF framework. This article takes one step further by defining each abundance map as a signal on a suitable graph, which enables the HU problem to be analyzed for the first time from a graph signal processing perspective. This article introduces a novel Laplacian regularizer based on the ₁-norm, where graph spectral analysis is utilized to show that the regularizer has natural piecewise smooth (PWS) signal promotion and noise rejection capabilities. A graph-based blind HU algorithm is developed by incorporating this regularizer and an l1/2-abundance sparsity constraint into the NMF problem. Since the featured regularizer exploits the PWS property of abundance maps, the proposed method is effective in HU. The experiments conducted on synthetic and real HSIs demonstrate that it has superior performance compared with several popular HU algorithms.
26 June 2024 in IEEE Transactions on Automatic Control
This paper introduces the first observer-based periodic event-triggered control (PETC) and self-triggered control (STC) for boundary control of a class of parabolic PDEs using PDE backstepping control. We introduce techniques to convert a certain class of continuous-time event-triggered control into PETC and STC, eliminating the need for continuous evaluation of the triggering function. For the PETC, the triggering function requires only periodic evaluations to detect events, while the STC proactively computes the time of the next event right at the current event time using the system model and the continuously available measurements. For both strategies, the control input is updated exclusively at events and is maintained using a zero-order hold between events. We demonstrate that the closed-loop system is Zeno-free. We offer criteria for selecting an appropriate sampling period for the PETC and for determining the time until the next event under the STC. We prove the system's global exponential convergence to zero in the spatial $L^{2}$ norm for both anti-collocated and collocated sensing and actuation under the PETC. For the STC, local exponential convergence to zero in the spatial $L^{2}$ norm for collocated sensing and actuation is proven. Simulations are provided to illustrate the theoretical claims.
4 March 2025 in IEEE Transactions on Automatic Control
For stabilizing stop-and-go oscillations in traffic flow by actuating a variable speed limit (VSL) at a downstream boundary of a freeway segment, we introduce event-triggered PDE backstepping designs employing the recent concept of performance-barrier event-triggered control (P-ETC). Our design is for linearized hyperbolic Aw-Rascle-Zhang (ARZ) PDEs governing traffic velocity and density. Compared to continuous feedback, ETC provides a piecewise-constant VSL commands—more likely to be obeyed by human drivers. Unlike the existing “regular” ETC (R-ETC), which enforces conservatively a strict decrease of a Lyapunov function, our performance-barrier (P-ETC) approach permits an increase, as long as the Lyapunov function remains below a performance barrier, resulting in fewer control updates than R-ETC. To relieve VSL from continuously monitoring the triggering function, we also develop periodic event-triggered (PETC) and self-triggered (STC) versions of both R-ETC and P-ETC. These are referred to as R/P-PETC and R/P-STC, respectively, and we show that they both guarantee Zeno-free behavior and exponential convergence in the spatial $L^{2}$ norm. With comparative simulations, we illustrate the benefits of the performance-barrier designs through traffic metrics (driver comfort, safety, travel time, fuel consumption). The proposed algorithms reduce discomfort nearly in half relative to driver behavior without VSL, while tripling the driver safety, measured by the average dwell time, relative to the R-ETC frequent-switching VSL schedule.