Yanbing Mao

Yanbing Mao

Auto-generated profile, based on publicly available information

Yanbing Mao

Engineering Technology Division, Wayne State University, Detroit, MI, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 May 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YMYanbing Mao
Yanbing Mao
HJHamidreza Jafarnejadsani
Hamidreza Jafarnejadsani
PZPan Zhao
Pan Zhao
EAEmrah Akyol
Emrah Akyol
Naira HovakimyanNaira Hovakimyan
Naira Hovakimyan
This article studies novel attack and defense strategies, based on a class of stealthy attacks, namely the zero-dynamics attack (ZDA), for multiagent control systems. ZDA poses a formidable security challenge since its attack signal is hidden in the null space of the state-space representation of the control system and hence it can evade conventional detection methods. An intuitive defense strategy builds on changing the aforementioned representation via switching through a set of carefully crafted topologies. In this article, we propose realistic ZDA variations where the attacker is aware of this topology-switching strategy, and hence employs the following policies to avoid detection: first, pause, update, and resume ZDA according to the knowledge of switching topologies; and second, cooperate with a concurrent stealthy topology attack that alters network topology at switching times, such that the original ZDA is feasible under the corrupted topology. We first systematically study the proposed ZDA variations, and then develop defense strategies against them under the realistic assumption that the defender has no knowledge of attack starting, pausing, and resuming times and the number of misbehaving agents. Particularly, we characterize conditions for detectability of the proposed ZDA variations, in terms of the network topologies to be maintained, the set of agents to be monitored, and the measurements of the monitored agents that should be extracted, while simultaneously preserving the privacy of the states of the nonmonitored agents. We then propose an attack detection algorithm based on the Luenberger observer, using the characterized detectability conditions. We provide numerical simulation results to demonstrate our theoretical findings.

26 October 2018 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YMYanbing Mao
Yanbing Mao
SBSadegh Bolouki
Sadegh Bolouki
EAEmrah Akyol
Emrah Akyol
This paper provides a model to investigate information spread over cyber-social network of agents. The cyber-social network considered here comprises individuals and information sources. Each individual holds an opinion represented by a scalar that evolves over time. The information sources are stubborn, in the sense that their opinions are time-invariant. Individuals receive the opinions of information sources that are closer to their belief, confirmation bias is explicitly incorporated into the model. The proposed dynamics of cyber-social networks is adopted from DeGroot-Friedkin model, where an individual's opinion update mechanism is a convex combination of her innate opinion, her neighbors' opinions at the previous time step (obtained from the social network), and the opinions passed along by information sources from cyber layer which she follows. The characteristics of the interdependent social and cyber networks are significantly different here: the social network relies on trust and hence static, while influences from information sources to individuals are highly dynamic since they are weighted as a function of the distance between an individual state and the state of information source to account for confirmation bias. The conditions for convergence of the aforementioned dynamics to a unique equilibrium point are characterized. The estimation and exact computation of the steady-state values under non-linear and linear state-dependent weight functions are provided. Finally, the impact of polarization in the opinions of information sources on the public opinion evolution is numerically analyzed in the context of the well-known Krackhardt's advice network.

14 December 2020
Verified
Conference Paper
Closed access
PZPan Zhao
Pan Zhao
YMYanbing Mao
Yanbing Mao
CTChuyuan Tao
Chuyuan Tao
Naira HovakimyanNaira Hovakimyan
Naira Hovakimyan
XWXiaofeng Wang
Xiaofeng Wang
This paper presents adaptive robust quadratic program (QP) based control using control Lyapunov and barrier functions for nonlinear systems subject to time-varying and state-dependent uncertainties. An adaptive estimation law is proposed to estimate the pointwise value of the uncertainties with pre-computable estimation error bounds. The estimated uncertainty and the error bounds are then used to formulate a robust QP, which ensures that the actual uncertain system will not violate the safety constraints defined by the control barrier function. Additionally, the accuracy of the uncertainty estimation can be systematically improved by reducing the estimation sampling time, leading subsequently to reduced conservatism of the formulated robust QP. The proposed approach is validated in simulations on an adaptive cruise control problem and through comparisons with existing approaches.

14 April 2016 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
YMYanbing Mao
Yanbing Mao
HZHongbin Zhang
Hongbin Zhang
ZZZiang "John" Zhang
Ziang "John" Zhang
This paper investigates the finite-time exponential stability analysis and stabilization problem of discrete-time switched nonlinear systems without stable subsystems. In the stability analysis, the Takagi-Sugeno (T-S) fuzzy model is employed to approximate nonlinear subsystems. With two level functions, namely, crisp switching functions and local fuzzy weighting functions, we introduce switched fuzzy systems with approximation errors, which inherently contain both the features of the switched systems and T-S fuzzy systems. By constructing the “decreasing-jump” piecewise Lyapunov-like functions and minimum dwell time technique, a finite-time exponential stability of switched fuzzy systems with bounded approximation errors is obtained. Then, based on the finite-time exponential stability, a multiobjective evolution algorithm (nondominated sorting genetic algorithm, NSGA-II), which considers two conflicting objectives, such as the average convergence error and the average switching cost, is proposed to generate tradeoff switching sequences to stabilize the discrete-time switched nonlinear systems over a finite-time interval. A numerical example and a practical example are provided to illustrate the effectiveness of the stability and the algorithm, respectively.

8 January 2021 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
YMYanbing Mao
Yanbing Mao
EAEmrah Akyol
Emrah Akyol
Naira HovakimyanNaira Hovakimyan
Naira Hovakimyan
This article investigates the impact of confirmation bias on competitive information spread in the social network that comprises individuals in a social network and competitive information sources at a cyber layer. We formulate the problem of information spread as a zero-sum game, which admits a unique Nash equilibrium in pure strategies. We characterize the dependence of pure Nash equilibrium on the public's innate opinions, the social network topology, as well as the parameters of confirmation bias. We uncover that confirmation bias moves the equilibrium toward the center only when the innate opinions are not neutral, and this move does not occur for the competitive information sources simultaneously. Numerical examples in the context of well-known Krackhardt's advice network are provided to demonstrate the correctness of theoretical results.

31 January 2023 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
YMYanbing Mao
Yanbing Mao
YGYuliang Gu
Yuliang Gu
Naira HovakimyanNaira Hovakimyan
Naira Hovakimyan
LSLui Sha
Lui Sha
PVPetros Voulgaris
Petros Voulgaris
This article proposes a novel extension of the Simplex architecture with model switching and model learning to achieve safe velocity regulation of self-driving vehicles in dynamic and unforeseen environments. To guarantee the reliability of autonomous vehicles, an ℒ1adaptive controller that compensates for uncertainties and disturbances is employed by the Simplex architecture as a verified high-assurance controller (HAC) to tolerate concurrent software and physical failures. Meanwhile, the safe switching controller is incorporated into the HAC for safe velocity regulation in the dynamic (prepared) environments, through the integration of the traction control system and anti-lock braking system. Due to the high dependence of vehicle dynamics on the driving environments, the HAC leverages the finite-time model learning to timely learn and update the vehicle model for ℒ1adaptive controller, when any deviation from the safety envelope or the uncertainty measurement threshold occurs in the unforeseen driving environments. With the integration of ℒ1adaptive controller, safe switching controller and finite-time model learning, the vehicle’s angular and longitudinal velocities can asymptotically track the provided references in the dynamic and unforeseen driving environments, while the wheel slips are restricted to safety envelopes to prevent slipping and sliding. Finally, the effectiveness of the proposed Simplex architecture for safe velocity regulation is validated by the AutoRally platform.