arXiv subjects

Hampei Sasahara

Publications and source records attributed to Hampei Sasahara.

At least 19 recordsLinked to original sources

arXiv2026

Scalable Outer Approximation of Minkowski Sums of Matrix Ellipsoids for Data-Driven Control

Matrix ellipsoids provide a standard framework for representing bounded uncertainties in data-driven control. Since noise models for sequential observations are naturally represented as the Minkowski sum of multiple matrix ellipsoids, applying existing robust control methods, which typically assume a single ellipsoidal set, requires a tight outer approximation. While techniques based on linear matrix inequalities (LMI) are applicable, their computational cost grows quadratically with the data length, limiting their scalability. This paper investigates the optimal outer approximation problem under two criteria: the sum of squared semi-axes and the volume. We propose an LMI-free approach by introducing a parameterized family of bounding matrix ellipsoids. Specifically, we derive an exact analytical solution for the first criterion and develop an efficient majorization-minimization (MM) algorithm for the second. The proposed MM algorithm employs a first-order approximation of the log-determinant function to provide closed-form update rules, ensuring monotonic convergence to the set of stationary points. Numerical experiments demonstrate that our method offers significantly higher computational efficiency and scalability than standard interior-point solvers.

math.OC↗

arXiv2026

Adversarial Destabilization Attacks to Direct Data-Driven Control

This study explores the vulnerability of direct data driven control, particularly in the linear quadratic regulator (LQR) problem, to adversarial perturbations in offline collected data. We focus on stealthy attacks that subtly alter training data to destabilize the closed-loop system while evading detection. To craft such attacks, we propose Directed Gradient Sign Method (DGSM) and its iterative variant (I-DGSM), which adapt techniques from adversarial machine learning to align perturbations with the gradient of the closed-loop spectral radius. A key technical contribution is an efficient and exact gradient computation method using implicit differentiation through the Karush-Kuhn-Tucker conditions of the underlying semidefinite program. For defense, we introduce two strategies: (i) regularization to reduce controller sensitivity, and (ii) robust data-driven control that ensures stability under bounded perturbations. Experiments across benchmark systems reveal that even imperceptibly small perturbations, up to ten times smaller than random noise, can lead to instability, while the proposed defenses significantly reduce attack success rates with minimal performance loss. We also assess transferability under partial knowledge, demonstrating the importance of protecting training data. This work highlights critical security risks in data driven control and proposes practical methods for both attack and defense.

eess.SY↗

arXiv2026

Structural Monotonicity in Transmission Scheduling for Remote State Estimation with Hidden Channel Mode

This study treats transmission scheduling for remote state estimation over unreliable channels with a hidden mode. A local Kalman estimator selects scheduling actions, such as power allocation and resource usage, and communicates with a remote estimator based on acknowledgement feedback, balancing estimation performance and communication cost. The resulting problem is naturally formulated as a partially observable Markov decision process (POMDP). In settings with observable channel modes, it is well known that monotonicity of the value function can be established via investigating order-preserving property of transition kernels. In contrast, under partial observability, the transition kernels generally lack this property, which prevents the direct application of standard monotonicity arguments. To overcome this difficulty, we introduce a novel technique, referred to as state-space folding, which induces transformed transition kernels recovering order preservation on the folded space. This transformation enables a rigorous monotonicity analysis in the partially observable setting. As a representative implication, we focus on an associated optimal stopping formulation and show that the resulting optimal scheduling policy admits a threshold structure.

eess.SY↗

arXiv2025

Resilient Distribution Network Planning against Dynamic Malicious Power Injection Attacks

Active distribution networks facilitating bidirectional power exchange with renewable energy resources are susceptible to cyberattacks due to integration of a diverse array of cyber components. This study introduces a grid-level defense strategy aimed at enhancing attack resiliency based on distribution network planning. Our proposed framework imposes a security requirement into existing planning methodologies, ensuring that voltage deviation from its rated value remains within a tolerable range against dynamically and maliciously injected power at end-user nodes. Unfortunately, the formulated problem in its original form is intractable because it is an infinite-dimensional bi-level optimization problem over a function space. To address this complexity, we develop an equivalent transformation into a tractable form as mixed-integer linear program leveraging linear dynamical system theory and graph theory. Notably, our investigation reveals that the severity of potential attacks hinges solely on the cumulative reactances over the path from the substation to the targeted node, thereby reducing the problem to a finite-dimensional problem. Further, the bi-level optimization problem is reduced to a single-level optimization problem by using a technique utilized in solving the shortest path problem. Through extensive numerical simulations conducted on a 54-node distribution network benchmark, our proposed methodology exhibits a noteworthy 29.3% enhancement in the resiliency, with a mere 2.1% uptick in the economic cost.

eess.SY↗

arXiv2025

Data Informativity under Data Perturbation

Data informativity provides a theoretical foundation for determining whether collected data are sufficiently informative to achieve specific control objectives in data-driven control frameworks. In this study, we investigate the data informativity subject to noise characterized by quadratic matrix inequalities (QMIs), which describe constraints through matrix-valued quadratic functions. We introduce a generalized noise model, referred to as data perturbation, under which we derive necessary and sufficient conditions formulated as tractable linear matrix inequalities for data informativity with respect to stabilization and performance guarantees via state feedback, as well as stabilization via output feedback. Our proposed framework encompasses and extends existing analyses that consider exogenous disturbances and measurement noise, while also relaxing several restrictive assumptions commonly made in prior work. A central challenge in the data perturbation setting arises from the non-convexity of the set of systems consistent with the data, which renders standard matrix S-procedure techniques inapplicable. To resolve this issue, we develop a novel matrix S-procedure that does not rely on convexity of the system set by exploiting geometric properties of QMI solution sets. Furthermore, we derive sufficient conditions for data informativity in the presence of multiple noise sources by approximating the combined noise effect through the QMI framework. The proposed results are broadly applicable to a wide class of noise models and subsume several existing methodologies as special cases.

math.OC↗

arXiv2024

Data Informativity for Quadratic Stabilization under Data Perturbation

Assessing data informativity, determining whether the measured data contains sufficient information for a specific control objective, is a fundamental challenge in data-driven control. In noisy scenarios, existing studies deal with system noise and measurement noise separately, using quadratic matrix inequalities. Moreover, the analysis of measurement noise requires restrictive assumptions on noise properties. To provide a unified framework without any restrictions, this study introduces data perturbation, a novel notion that encompasses both existing noise models. It is observed that the admissible system set with data perturbation does not meet preconditions necessary for applying the key lemma in the matrix S-procedure. Our analysis overcomes this limitation by developing an extended version of this lemma, making it applicable to data perturbation. Our results unify the existing analyses while eliminating the need for restrictive assumptions made in the measurement noise scenario.

math.OC↗

arXiv2023

Asymptotic Security using Bayesian Defense Mechanism with Application to Cyber Deception

This paper addresses the question whether model knowledge can guide a defender to appropriate decisions, or not, when an attacker intrudes into control systems. The model-based defense scheme considered in this study, namely Bayesian defense mechanism, chooses reasonable reactions through observation of the system's behavior using models of the system's stochastic dynamics, the vulnerability to be exploited, and the attacker's objective. On the other hand, rational attackers take deceptive strategies for misleading the defender into making inappropriate decisions. In this paper, their dynamic decision making is formulated as a stochastic signaling game. It is shown that the belief of the true scenario has a limit in a stochastic sense at an equilibrium based on martingale analysis. This fact implies that there are only two possible cases: the defender asymptotically detects the attack with a firm belief, or the attacker takes actions such that the system's behavior becomes nominal after a finite time step. Consequently, if different scenarios result in different stochastic behaviors, the Bayesian defense mechanism guarantees the system to be secure in an asymptotic manner provided that effective countermeasures are implemented. As an application of the finding, a defensive deception utilizing asymmetric recognition of vulnerabilities exploited by the attacker is analyzed. It is shown that the attacker possibly stops the attack even if the defender is unaware of the exploited vulnerabilities as long as the defender's unawareness is concealed by the defensive deception.

cs.CR↗

arXiv2023

Adversarial Attacks to Direct Data-driven Control for Destabilization

This study investigates the vulnerability of direct data-driven control to adversarial attacks in the form of a small but sophisticated perturbation added to the original data. The directed gradient sign method (DGSM) is developed as a specific attack method, based on the fast gradient sign method (FGSM), which has originally been considered in image classification. DGSM uses the gradient of the eigenvalues of the resulting closed-loop system and crafts a perturbation in the direction where the system becomes less stable. It is demonstrated that the system can be destabilized by the attack, even if the original closed-loop system with the clean data has a large margin of stability. To increase the robustness against the attack, regularization methods that have been developed to deal with random disturbances are considered. Their effectiveness is evaluated by numerical experiments using an inverted pendulum model.

eess.SY↗

arXiv2023

Attack Impact Evaluation for Stochastic Control Systems through Alarm Flag State Augmentation

This note addresses the problem of evaluating the impact of an attack on discrete-time nonlinear stochastic control systems. The problem is formulated as an optimal control problem with a joint chance constraint that forces the adversary to avoid detection throughout a given time period. Due to the joint constraint, the optimal control policy depends not only on the current state, but also on the entire history, leading to an explosion of the search space and making the problem generally intractable. However, we discover that the current state and whether an alarm has been triggered, or not, is sufficient for specifying the optimal decision at each time step. This information, which we refer to as the alarm flag, can be added to the state space to create an equivalent optimal control problem that can be solved with existing numerical approaches using a Markov policy. Additionally, we note that the formulation results in a policy that does not avoid detection once an alarm has been triggered. We extend the formulation to handle multi-alarm avoidance policies for more reasonable attack impact evaluations, and show that the idea of augmenting the state space with an alarm flag is valid in this extended formulation as well.

math.OC↗

arXiv2022

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

This paper introduces a "green" routing game between multiple logistic operators (players), each owning a mixed fleet of internal combustion engine vehicle (ICEV) and electric vehicle (EV) trucks. Each player faces the cost of delayed delivery (due to charging requirements of EVs) and a pollution cost levied on the ICEVs. This cost structure models: 1) limited battery capacity of EVs and their charging requirement; 2) shared nature of charging facilities; 3) pollution cost levied by regulatory agency on the use of ICEVs. We characterize Nash equilibria of this game and derive a condition for its uniqueness. We also use the gradient projection method to compute this equilibrium in a distributed manner. Our equilibrium analysis is useful to analyze the trade-off faced by players in incurring higher delay due to congestion at charging locations when the share of EVs increases versus a higher pollution cost when the share of ICEVs increases. A numerical example suggests that to increase marginal pollution cost can dramatically reduce inefficiency of equilibria.

eess.SY↗

arXiv2022

Attack Impact Evaluation by Exact Convexification through State Space Augmentation

We address the attack impact evaluation problem for control system security. We formulate the problem as a Markov decision process with a temporally joint chance constraint that forces the adversary to avoid being detected throughout the considered time period. Owing to the joint constraint, the optimal control policy depends not only on the current state but also on the entire history, which leads to the explosion of the search space and makes the problem generally intractable. It is shown that whether an alarm has been triggered or not, in addition to the current state is sufficient for specifying the optimal decision at each time step. Augmentation of the information to the state space induces an equivalent convex optimization problem, which is tractable using standard solvers.

eess.SY↗

arXiv2021

Disconnection-aware Attack Detection and Isolation with Separation-based Detector Reconfiguration

This study addresses incident handling during an adverse event for dynamical networked control systems. Incident handling can be divided into five steps: detection, analysis, containment, eradication, and recovery. For networked control systems, the containment step can be conducted through physical disconnection of an attacked subsystem. In accordance with the disconnection, the equipped attack detection unit should be reconfigured to maintain its detection capability. In particular, separating the detection subunit associated with the disconnected subsystem is considered as a specific reconfiguration scheme in this study. This paper poses the problem of disconnection-aware attack detection and isolation with the separation-based detector reconfiguration. The objective is to find an attack detection unit that preserves its detection and isolation capability even under any possible disconnection and separation. The difficulty arises from network topology variation caused by disconnection that can possibly lead to stability loss of the distributed observer inside the attack detection unit. A solution is proposed based on an existing controller design technique referred to as retrofit control. Furthermore, an application to low-voltage power distribution networks with distributed generation is exhibited. Numerical examples evidence the practical use of the proposed method through a benchmark distribution network.

eess.SY↗

arXiv2021

Parameterization of All Output-Rectifying Retrofit Controllers

This study investigates a parameterization of all output-rectifying retrofit controllers for distributed design of a structured controller. It has been discovered that all retrofit controllers can be characterized as a constrained Youla parameterization, which is difficult to solve analytically. For synthesis, a tractable and insightful class of retrofit controllers, referred to as output-rectifying retrofit controllers, has been introduced. An unconstrained parameterization of all output-rectifying retrofit controllers can be derived under a technical assumption on measurability of particular signals. The aim of this note is to reveal the structure of all output-rectifying retrofit controllers in the general output-feedback case. It is found out that the existing developments can be generalized based on the notions of state projection and an inverse system. The result leads to the conclusion that output-rectifying retrofit controllers can readily be designed even in the general case.

eess.SY↗

arXiv2021

Epistemic Signaling Games for Cyber Deception with Asymmetric Recognition

This study provides a model of cyber deception with asymmetric recognition represented by private beliefs. Signaling games, which are often used in existing works, are built on the implicit premise that the receiver's belief is public information. However, this assumption, which leads to symmetric recognition, is unrealistic in adversarial decision making. For a precise evaluation of risks arising from cognitive gaps, this paper proposes epistemic signaling games based on the Mertens-Zamir model, which explicitly quantifies players' asymmetric recognition. Equilibria of the games are analytically characterized with an interpretation.

cs.CR↗

arXiv2021

Power Injection Attacks in Smart Distribution Grids with Photovoltaics

In order to protect smart distribution grids from intrusions, it is important to understand possible risks and impacts of attacks. We study the worst-case attack strategy of a power injection attack against the physical layer of a smart distribution grid with a high penetration of photovoltaic resources. We derive both the worst attack signal and worst attack location: The worst attack signal is a step function which switches its sign at the final stage, and the worst attack location is the node with the largest impedance to the grid substation. Numerical examples on a European benchmark model verify the developed results. Finally, both theoretical and numerical results are used to discuss feasible defense strategies against power injection attacks.

eess.SY↗

arXiv2021

Asymptotic Security by Model-based Incident Handlers for Markov Decision Processes

This study investigates general model-based incident handler's asymptotic behaviors in time against cyber attacks to control systems. The attacker's and the defender's dynamic decision making is modeled as an equilibrium of a dynamic signaling game. It is shown that the defender's belief on existence of an attacker converges over time for any attacker's strategy provided that the stochastic dynamics of the control system is known to the defender. This fact implies that the rational behavior of the attacker converges to a harmless action as long as the defender possesses an effective counteraction. The obtained result supports the powerful protection capability achieved by model-based defense mechanisms.

eess.SY↗

arXiv2020

Distributed Design of Glocal Controllers via Hierarchical Model Decomposition

This paper proposes a distributed design method of controllers having a glocal (global/local) information structure for large-scale network systems. Distributed design, independent design of all subcontrollers that constitute a structured controller, facilitates scalable controller synthesis. While existing distributed design methods confine attention to the decentralized or distributed information structures, this study addresses distributed design of glocal-structured controllers. Glocal control exploits the nature that network system's behavior can typically be represented as a superposition of spatially local fluctuations and global interarea oscillations by incorporating a global coordinating subcontroller with local decentralized subcontrollers. The key idea to distributed design of glocal controllers is to represent the original network system as a hierarchical cascaded system composed of reduced-order models representing the global and local dynamics, referred to as hierarchical model decomposition. Distributed design is achieved by independently designing and implementing subcontrollers for the reduced-order models while preserving the cascade structure. This paper provides a condition for existence of the hierarchical model decomposition, a specific representation of the hierarchical system, a clustering method appropriate for the proposed approach, and a robust extension. Numerical examples of a power grid evidence the practical relevance of the proposed method.

eess.SY↗

arXiv2020

Modularity-in-Design of Dynamical Network Systems: Retrofit Control Approach

In this paper, we develop a modular design method of decentralized controllers for linear dynamical network systems, where multiple subcontroller designers aim at individually regulating their local control performance with accessibility only to their respective subsystem models. First, we derive a constrained version of the Youla parameterization that characterizes all retrofit controllers for a single subcontroller, defined as an add-on type subcontroller that manages a subsystem. The resultant feedback system is kept robustly stable for any variation in the neighboring subsystems, other than the subsystem of interest, provided that the original system is stable prior to implementing the retrofit control. Subsequently, we find out a unique internal structure of the retrofit controllers, assuming that the interaction input signal from the neighboring subsystems is measurable. Furthermore, we show that the simultaneous implementation of multiple retrofit controllers, designed by individual subcontroller designers, can improve the upper bound of the overall control performance. Finally, the practical significance of the method is demonstrated via an illustrative example of frequency regulation using the IEEE 68-bus power system model.

eess.SY↗