Hideaki Ishii

Hideaki Ishii


Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

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

Representative Publications

View All Publications
22 February 2019 in Entropy
Verified
Journal Article
Open access
PDF file
ACAhmet Cetinkaya
Ahmet Cetinkaya
HIHideaki Ishii
Hideaki Ishii
THTomohisa Hayakawa
Tomohisa Hayakawa
In this paper, we provide an overview of recent research efforts on networked control systems under denial-of-service attacks. Our goal is to discuss the utility of different attack modeling and analysis techniques proposed in the literature for addressing feedback control, state estimation, and multi-agent consensus problems in the face of jamming attacks in wireless channels and malicious packet drops in multi-hop networks. We discuss several modeling approaches that are employed for capturing the uncertainty in denial-of-service attack strategies. We give an outlook on deterministic constraint-based modeling ideas, game-theoretic and optimization-based techniques and probabilistic modeling approaches. A special emphasis is placed on tail-probability based failure models, which have been recently used for describing jamming attacks that affect signal to interference-plus-noise ratios of wireless channels as well as transmission failures on multi-hop networks due to packet-dropping attacks and non-malicious issues. We explain the use of attack models in the security analysis of networked systems. In addition to the modeling and analysis problems, a discussion is provided also on the recent developments concerning the design of attack-resilient control and communication protocols.

9 November 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SDSeyed Mehran Dibaji
Seyed Mehran Dibaji
HIHideaki Ishii
Hideaki Ishii
RTRoberto Tempo
Roberto Tempo
We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication links. The goal of the healthy normal agents is to form consensus in their state values, which may be disturbed by the non-normal, malicious agents. We develop update schemes to be equipped by the normal agents whose interactions are asynchronous and subject to non-uniform and time-varying time delays. In particular, we employ a variant of the so-called mean subsequence reduced (MSR) algorithms, which have been long studied in computer science, where each normal agent ignores extreme values from its neighbors. We solve the resilient quantized consensus problems in the presence of totally/locally bounded adversarial agents and provide necessary and sufficient conditions in terms of the connectivity notion of graph robustness. Furthermore, it will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner.

23 October 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MWMasashi Wakaiki
Masashi Wakaiki
ACAhmet Cetinkaya
Ahmet Cetinkaya
HIHideaki Ishii
Hideaki Ishii
This paper addresses quantized output feedback stabilization under Denial-of-Service (DoS) attacks. First, assuming that the duration and frequency of DoS attacks are averagely bounded and that an initial bound of the plant state is known, we propose an output encoding scheme that achieves exponential convergence with finite data rates. Next we show that a suitable state transformation allows us to remove the assumption on the DoS frequency. Finally, we discuss the derivation of state bounds under DoS attacks and obtain sufficient conditions on the bounds of DoS duration and frequency for achieving Lyapunov stability of the closed-loop system.

16 March 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SFShuai Feng
Shuai Feng
ACAhmet Cetinkaya
Ahmet Cetinkaya
HIHideaki Ishii
Hideaki Ishii
PTPietro Tesi
Pietro Tesi
CPClaudio De Persis
Claudio De Persis

1 January 2007 in European Journal of Control
Verified
Journal Article
Closed access
RTRoberto Tempo
Roberto Tempo
HIHideaki Ishii
Hideaki Ishii
In this paper, we present an introduction to Monte Carlo and Las Vegas randomized algorithms for systems and control. Specific applications of these algorithms include stability analysis, Lyapunov functions, and distributed consensus problems.

2 May 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ACAhmet Cetinkaya
Ahmet Cetinkaya
HIHideaki Ishii
Hideaki Ishii
THTomohisa Hayakawa
Tomohisa Hayakawa
We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on the average number of times each mode becomes active in the long run and, in particular, utilizes their lower- and upper-bounds. This setup is motivated by cyber security issues for networked control systems in the presence of packet losses due to malicious jamming attacks where the attacker's strategy is not known a priori. We derive a sufficient condition for almost sure asymptotic stability of the switched systems which can be examined by solving a linear programming problem. Our approach exploits the dynamics of an equivalent system that describes the evolution of the switched system's state at every few steps; the stability analysis may become less conservative by increasing the step size. The computational efficiency is further enhanced by exploiting the structure in the stability analysis problem, and we introduce an alternative linear programming problem that has fewer variables. We demonstrate the efficacy of our results by analyzing ne