arXiv subjects

Jiwei Wang

Publications and source records attributed to Jiwei Wang.

13 recordsLinked to original sources

arXiv2026

An Adaptive Longitudinal Platooning Design Based On Concurrent Learning

This work proposes a new adaptive longitudinal platooning strategy in the framework of concurrent learning. Adaptive refers to vehicles facing uncertainty in powertrain parameters via on-line estimation; concurrent learning refers to using both current and past data in the estimation. The proposed platooning strategy advances existing ones since convergence to the true powertrain parameters is guaranteed without imposing persistence of excitation on the vehicle behavior: it suffices the presence of a single non-zero data sample. Meanwhile, the concurrent learning proof we give advances existing ones since it takes into account an extra unknown gain in the error dynamics.

eess.SY↗

arXiv2026

Correct Online Estimation of the Powertrain Time Constants in Adaptive Vehicular Platooning

In longitudinal platooning, some key sources of uncertainty are the powertrain time constants of the vehicles. Because such time constants appear in the input matrix of the platooning dynamics, their correct estimation is either impractical with methods requiring persistence of excitation, or impossible with methods requiring the input matrix to be known. This work proposes a novel adaptive longitudinal platooning method with correct estimation of the powertrain time constants. To achieve correct estimation, the composite adaptive control framework and its stability analysis are suitably modified to handle the time constant uncertainty in the design of the adaptive law. The result is a platooning protocol that guarantees convergence of the estimated time constants to their true values without the need for persistence of excitation: it is sufficient the derivative of the acceleration to be nonzero over a possibly short transient, an extremely relaxed excitation condition. Comparisons with state-of-the-art platooning solutions reveal advantages such as no required measurements of acceleration derivative nor collection of past data. The robustness and practicality of the proposed design is also verified with CarSim-based platooning experiments.

eess.SY↗

arXiv2026

Fault Diagnosis and Prognosis in Partially-Observed Discrete Event Systems with Delayed Observations

Fault diagnosis and prognosis in discrete event systems are studied in the scenario where the observations are possibly received with delay. To address this scenario, two conditions for diagnosis and prognosis with delayed observations are proposed, where we show that the state-of-the-art notion of prognosability must be revised to avoid conservativeness. Diagnosability and prognosability conditions are then verified by introducing a delay observer and a new verification function. Theoretical analysis indicates the effectiveness of the verification method for fault diagnosis and prognosis in the system.

math.OC↗

arXiv2026

Enforcing Opacity in Discrete Event Systems via Delayed Observations

Artificially introducing a delay in the observations of a system can be an effective mechanism to mask the system itself, with the goal to increase its opacity and thus its security. This work investigates opacity in discrete event systems with delayed observations. We focus on two questions: how to verify opacity under delayed observations, and how to synthesize sensor activation policies that guarantee opacity under such delayed conditions. To address these questions, we first introduce the definition of opacity under delayed observation and develop a corresponding verification method. We then extend such analysis tool into a synthesis tool by proposing an optimization approach for designing sensor activation policies guaranteeing opacity under delayed observations. An example is used to illustrate the analysis and synthesis procedures.

math.OC↗

arXiv2026

Distributed Fault Diagnosis in Discrete Event Systems with Transmission Delay Impairments

This note studies the distributed fault diagnosis problem in partially-observed discrete event systems, where the system is monitored by a group of agents to cooperatively diagnose faults within a finite number of steps. The novelty of this work is the creation of a methodology to verify when the faults can be diagnosed even in the presence of transmission delay impairments. To address this scenario, a new distributed diagnosability condition is proposed, which extends decentralized diagnosability conditions proposed in the literature. Such distributed diagnosability condition is then verified via a novel structure named delay recorder and a new diagnosis function. Theoretical analysis shows that the verification method can successfully determine whether the faults can be diagnosed.

math.OC↗

arXiv2026

Data-Driven Robust Model Reference Adaptive Control with Parameter Convergence

This paper provides a data-driven design guaranteeing parameter convergence in model reference adaptive control (MRAC) when the to-be-controlled system is subject to process noise. In the context of MRAC, parameter convergence refers to ensuring convergence of the adaptive gains to a solution of the matching equations, or to an approximate solution when noise is present. In classical MRAC, even small noise may induce parameter drift, thus lacking robustness to noise. Meanwhile, existing robust MRAC methods cannot ensure parameter convergence without imposing excitation conditions on data. A key feature of the proposed framework is to ensure convergence of the adaptive gains to an approximate solution of the matching equations without relying on persistently exciting signals. Furthermore, the matching error can be explicitly characterized as a function of the noise. This explicit characterization allows to establish a necessary and sufficient condition on the noise characteristics under which the limit closed-loop system matrix is Hurwitz. In the noise-free case, the proposed framework results in exact parameter convergence. Notably, as compared to existing methods achieving exact parameter convergence in the noise-free case, the condition on data in the proposed framework is weaker.

math.OC↗

arXiv2026

Topological bounds on the dynamical growth rate of chemical reaction networks

Growth and decay are system-level properties of chemical reaction networks (CRNs) relevant from prebiotic chemistry to cellular metabolism. Their properties are typically analyzed through the kinetics of particular models, which requires specification of the full set of kinetic laws and parameters. In this work, assuming a steady balanced-growth regime, we derive stoichiometry-based constraints on the growth (or shrinkage) rate. The resulting bounds are controlled by a topological quantity, the maximum amplification factor, defined via a von Neumann max-min problem over feasible fluxes as illustrated by numerical tests on random-network ensembles of CRNs. We argue for the relevance of our results in the context of origins of life studies and the design of synthetic chemical reaction networks.

q-bio.MN↗

arXiv2025

Online experiment design for continuous-time systems using generalized filtering

The goal of experiment design is to select the inputs of a dynamical system in such a way that the resulting data contain sufficient information for system identification and data-driven control. This paper investigates the problem of experiment design for continuous-time systems under piecewise constant input signals. To obviate the need for measuring time derivatives of (data) trajectories, we introduce a generalized filtering framework. Our main result is to establish conditions on the input and the filter functions under which the filtered data are informative for system identification, i.e., they satisfy a certain rank condition. We assume that the filter functions are piecewise continuously differentiable, encompassing several filter functions that have appeared in the literature. Building on the proposed filtering framework, we develop an experiment design procedure, adapted from experiment design results for discrete-time systems, where the piecewise constant input signal is designed online during system operation. This method is shown to be sample efficient, in the sense that it deals with the least possible number of filtered data samples for system identification. Notably, the designed input signal is such that the data capture the system's dynamics at all times between sampling instants, thus establishing a connection with a continuous-time version of Willems et al.'s fundamental lemma.

math.OC↗

arXiv2025

Bridging Model Reference Adaptive Control and Data Informativity

The goal of model reference adaptive control (MRAC) is to ensure that the trajectories of an unknown dynamical system track those of a given reference model. This is done by means of a feedback controller that adaptively changes its gains using data collected online from the closed-loop system. One of the approaches to solve the MRAC problem is to impose conditions on the data that guarantee convergence of the gains to a solution of the so-called matching equations. In the literature, various extensions of the concept of persistent excitation have been proposed in an effort to weaken the conditions on the data required for this convergence. Despite these efforts, it is not well-understood what conditions are necessary and sufficient for ensuring convergence of MRAC to a solution of the matching equations. In this paper, we propose a new framework to study the MRAC problem, using the concept of data informativity. Our main contribution is to provide \emph{necessary and sufficient} conditions for the existence of an adaptive law that guarantees convergence of the gains to a solution of the matching equations, and to provide a recipe for its construction. While existing excitation conditions imply that the system can be uniquely identified from the collected data, our results show that this is not necessary for the convergence of the feedback gains.

math.OC↗

arXiv2023

Necessary and Sufficient Conditions for Data-driven Model Reference Control

The objective of model reference control is to design a controller that regulates the system's behavior so as to match a specified reference model. This paper investigates necessary and sufficient conditions for model reference control from a data-driven perspective, when only a set of data generated by the system is utilized to directly accomplish the matching. Noiseless and noisy data settings are both considered. Notably, all methods we propose build on the concept of data informativity and do not rely on persistently exciting data.

math.OC↗

arXiv2023

Use neural networks to recognize students' handwritten letters and incorrect symbols

Correcting students' multiple-choice answers is a repetitive and mechanical task that can be considered an image multi-classification task. Assuming possible options are 'abcd' and the correct option is one of the four, some students may write incorrect symbols or options that do not exist. In this paper, five classifications were set up - four for possible correct options and one for other incorrect writing. This approach takes into account the possibility of non-standard writing options.

cs.CV↗

arXiv2020

Deep-HOSeq: Deep Higher Order Sequence Fusion for Multimodal Sentiment Analysis

Multimodal sentiment analysis utilizes multiple heterogeneous modalities for sentiment classification. The recent multimodal fusion schemes customize LSTMs to discover intra-modal dynamics and design sophisticated attention mechanisms to discover the inter-modal dynamics from multimodal sequences. Although powerful, these schemes completely rely on attention mechanisms which is problematic due to two major drawbacks 1) deceptive attention masks, and 2) training dynamics. Nevertheless, strenuous efforts are required to optimize hyperparameters of these consolidate architectures, in particular their custom-designed LSTMs constrained by attention schemes. In this research, we first propose a common network to discover both intra-modal and inter-modal dynamics by utilizing basic LSTMs and tensor based convolution networks. We then propose unique networks to encapsulate temporal-granularity among the modalities which is essential while extracting information within asynchronous sequences. We then integrate these two kinds of information via a fusion layer and call our novel multimodal fusion scheme as Deep-HOSeq (Deep network with higher order Common and Unique Sequence information). The proposed Deep-HOSeq efficiently discovers all-important information from multimodal sequences and the effectiveness of utilizing both types of information is empirically demonstrated on CMU-MOSEI and CMU-MOSI benchmark datasets. The source code of our proposed Deep-HOSeq is and available at https://github.com/sverma88/Deep-HOSeq--ICDM-2020.

cs.AI↗

arXiv2019

A Mobile Cloud Collaboration Fall Detection System Based on Ensemble Learning

Falls are one of the important causes of accidental or unintentional injury death worldwide. Therefore, this paper presents a reliable fall detection algorithm and a mobile cloud collaboration system for fall detection. The algorithm is an ensemble learning method based on decision tree, named Falldetection Ensemble Decision Tree (FEDT). The mobile cloud collaboration system can be divided into three stages: 1) mobile stage: use a light-weighted threshold method to filter out the activities of daily livings (ADLs), 2) collaboration stage: transmit data to cloud and meanwhile extract features in the cloud, 3) cloud stage: deploy the model trained by FEDT to give the final detection result with the extracted features. Experiments show that the performance of the proposed FEDT outperforms the others' over 1-3% both on sensitivity and specificity, and more importantly, the system can provide reliable fall detection in practical scenario.

eess.SP↗