Change search
Link to record
Permanent link

Direct link
BETA
Nekouei, Ehsan
Publications (9 of 9) Show all publications
Pirani, M., Nekouei, E., Sandberg, H. & Johansson, K. H. (2019). A game-theoretic framework for security-aware sensor placement problem in networked control systems. In: Proceedings of the American Control Conference: . Paper presented at 2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019 (pp. 114-119). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8814443.
Open this publication in new window or tab >>A game-theoretic framework for security-aware sensor placement problem in networked control systems
2019 (English)In: Proceedings of the American Control Conference, Institute of Electrical and Electronics Engineers (IEEE), 2019, p. 114-119, article id 8814443Conference paper, Published paper (Refereed)
Abstract [en]

This paper studies the sensor placement problem in a networked control system for improving its security against cyber-physical attacks. The problem is formulated as a zero-sum game between an attacker and a detector. The attacker's decision is to select f nodes of the network to attack whereas the detector's decision is to place f sensors to detect the presence of the attack signals. In our formulation, the attacker minimizes its visibility, defined as the system L2 gain from the attack signals to the deployed sensors' outputs, and the detector maximizes the visibility of the attack signals. The equilibrium strategy of the game determines the optimal locations of the sensors. The existence of Nash equilibrium for the attacker-detector game is studied when the underlying connectivity graph is a directed or an undirected tree. When the game does not admit a Nash equilibrium, it is shown that the Stackelberg equilibrium of the game, with the detector as the game leader, can be computed efficiently. Our results show that, under the optimal sensor placement strategy, an undirected topology provides a higher security level for a networked control system compared with its corresponding directed topology.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Series
Proceedings of the American Control Conference, ISSN 07431619
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-262596 (URN)2-s2.0-85072277874 (Scopus ID)9781538679265 (ISBN)
Conference
2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019
Note

QC 20191016

Available from: 2019-10-16 Created: 2019-10-16 Last updated: 2019-10-16Bibliographically approved
Pirani, M., Nekouei, E., Dibaji, S. M., Sandberg, H. & Johansson, K. H. (2019). Design of Attack-Resilient Consensus Dynamics: A Game-Theoretic Approach. In: Proceedings 2019 18th European Control Conference (ECC): . Paper presented at 18th European Control Conference (ECC), Naples, ITALY, JUN 25-28, 2019 (pp. 2227-2232). IEEE
Open this publication in new window or tab >>Design of Attack-Resilient Consensus Dynamics: A Game-Theoretic Approach
Show others...
2019 (English)In: Proceedings 2019 18th European Control Conference (ECC), IEEE , 2019, p. 2227-2232Conference paper, Published paper (Refereed)
Abstract [en]

We propose a game-theoretic framework for improving the resilience of multi-agent consensus dynamics in the presence of a strategic attacker. In this game, the attacker selects a set of network nodes to inject the attack signals. The attacker's objective is to minimize the required energy for steering the consensus towards its desired direction. This energy is captured by the trace of controllability Gramian of the system when the input is the attack signal. The defender improves the resilience of dynamics by adding self-feedback loops to certain nodes of the system and its objective is to maximize the trace of controllability Gramian. The Stackelberg equilibrium of the game is studied with the defender as the game leader. When the underlying network topology is a tree and the defender can select only one node, we show that the optimal strategy of the defender is determined by a specific distance-based network centrality measure, called network's f-center. In addition, we show that the degree-based centralities solutions may lead to undesirable payoffs for the defender. At the end, we discuss the case of multiple attack and defense nodes on general graphs.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-263390 (URN)10.23919/ECC.2019.8796291 (DOI)000490488302041 ()2-s2.0-85071562919 (Scopus ID)9783907144008 (ISBN)
Conference
18th European Control Conference (ECC), Naples, ITALY, JUN 25-28, 2019
Note

QC 20191114

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2019-11-14Bibliographically approved
Nekouei, E., Tanaka, T., Skoglund, M. & Johansson, K. H. (2019). Information-theoretic approaches to privacy in estimation and control. Annual Reviews in Control, 47, 412-422
Open this publication in new window or tab >>Information-theoretic approaches to privacy in estimation and control
2019 (English)In: Annual Reviews in Control, ISSN 1367-5788, E-ISSN 1872-9088, Vol. 47, p. 412-422Article, review/survey (Refereed) Published
Abstract [en]

Network control systems (NCSs) heavily rely on information and communication technologies for sharing information between sensors and controllers as well as controllers and actuators. When estimation, control or actuation tasks in a NCS are performed by an untrusted party, sharing information might result in the leakage of private information. The current paper reviews some of the recent results on the privacy-aware decision-making problems in NCSs. In particular, we focus on static and dynamic decision-making problems wherein privacy is measured using information-theoretic notions. We also review the applications of these problems in smart buildings and smart grids. 

Place, publisher, year, edition, pages
PERGAMON-ELSEVIER SCIENCE LTD, 2019
Keywords
Privacy, Information theory, Networked control systems
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-255503 (URN)10.1016/j.arcontrol.2019.04.006 (DOI)000474680200028 ()2-s2.0-85064542337 (Scopus ID)
Note

QC 20190926

Available from: 2019-09-26 Created: 2019-09-26 Last updated: 2019-09-26Bibliographically approved
Umsonst, D., Nekouei, E., Teixeira, A. & Sandberg, H. (2019). On the confidentiality of linear anomaly detector states. In: Proceedings of the American Control Conference: . Paper presented at 2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019 (pp. 397-403). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8814731.
Open this publication in new window or tab >>On the confidentiality of linear anomaly detector states
2019 (English)In: Proceedings of the American Control Conference, Institute of Electrical and Electronics Engineers (IEEE), 2019, p. 397-403, article id 8814731Conference paper, Published paper (Refereed)
Abstract [en]

A malicious attacker with access to the sensor channel in a feedback control system can severely affect the physical system under control, while simultaneously being hard to detect. A properly designed anomaly detector can restrict the impact of such attacks, however. Anomaly detectors with an internal state (stateful detectors) have gained popularity because they seem to be able to mitigate these attacks more than detectors without a state (stateless detectors). In the analysis of attacks against control systems with anomaly detectors, it has been assumed that the attacker has access to the detector's internal state, or designs its attack such that it is not detected regardless of the detector's state. In this paper, we show how an attacker can realize the first case by breaking the confidentiality of a stateful detector state evolving with linear dynamics, while remaining undetected and imitating the statistics of the detector under nominal conditions. The realization of the attack is posed in a convex optimization framework using the notion of Kullback-Leibler divergence. Further, the attack is designed such that the maximum mean estimation error of the Kalman filter is maximized at each time step by exploiting dual norms. A numerical example is given to illustrate the results.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Series
Proceedings of the American Control Conference, ISSN 0743-1619
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-262592 (URN)2-s2.0-85072298320 (Scopus ID)9781538679265 (ISBN)
Conference
2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019
Projects
CERCES
Note

QC 20191022

Available from: 2019-10-22 Created: 2019-10-22 Last updated: 2019-11-26Bibliographically approved
Wei, J., Nekouei, E., Wu, J., Cvetkovic, V. D. & Johansson, K. H. (2019). Steady-state analysis of a human-social behavior model: A neural-cognition perspective. In: Proceedings of the American Control Conference: . Paper presented at 2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019 (pp. 199-204). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8814786.
Open this publication in new window or tab >>Steady-state analysis of a human-social behavior model: A neural-cognition perspective
Show others...
2019 (English)In: Proceedings of the American Control Conference, Institute of Electrical and Electronics Engineers (IEEE), 2019, p. 199-204, article id 8814786Conference paper, Published paper (Refereed)
Abstract [en]

We consider an extension of the Rescorla-Wagner model which bridges the gap between conditioning and learning on a neural-cognitive, individual psychological level, and the social population level. In this model, the interaction among individuals is captured by a Markov process. The resulting human-social behavior model is a recurrent iterated function system which behaves differently from the classical Rescorla-Wagner model due to randomness. A sufficient condition for the convergence of the forward process starting with arbitrary initial distribution is provided. Furthermore, the ergodicity properties of the internal states of agents in the proposed model are studied.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Series
Proceedings of the American Control Conference, ISSN 0743-1619
Keywords
Decision making, Markovian jump system, Neural cognition, Social networks, Stochastic process
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-262590 (URN)2-s2.0-85072299741 (Scopus ID)9781538679265 (ISBN)
Conference
2019 American Control Conference, ACC 2019; Philadelphia; United States; 10 July 2019 through 12 July 2019
Note

QC 20191022

Available from: 2019-10-22 Created: 2019-10-22 Last updated: 2019-10-22Bibliographically approved
Yoo, J., Nekouei, E. & Johansson, K. H. (2018). Event-based Observer and MPC with Disturbance Attenuation using ERM Learning. In: 2018 European Control Conference, ECC 2018: . Paper presented at 16th European Control Conference, ECC 2018, Limassol, Cyprus, 12 June 2018 through 15 June 2018 (pp. 1894-1899). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8550289.
Open this publication in new window or tab >>Event-based Observer and MPC with Disturbance Attenuation using ERM Learning
2018 (English)In: 2018 European Control Conference, ECC 2018, Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 1894-1899, article id 8550289Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents a learning-based approach for disturbance attenuation for a non-linear dynamical system with event-based observer and model predictive control (MPC). Using the empirical risk minimization (ERM) method, we can obtain a learning error bound which is function of the number of samples, learning parameters, and model complexity. It enables us to analyze the closed-loop stability in terms of the learning property, where the state estimation error by the ERM learning is guaranteed to be bounded. Simulation results underline the learning's capability, the control performance and the event-triggering efficiency in comparison to the conventional event-triggered control scheme.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-241510 (URN)10.23919/ECC.2018.8550289 (DOI)2-s2.0-85059811243 (Scopus ID)9783952426982 (ISBN)
Conference
16th European Control Conference, ECC 2018, Limassol, Cyprus, 12 June 2018 through 15 June 2018
Note

QC 20190123

Available from: 2019-01-23 Created: 2019-01-23 Last updated: 2019-11-14Bibliographically approved
Nekouei, E., Alpcan, T. & Evans, R. J. (2018). Impact of quantized inter-agent communications on game-theoretic and distributed optimization algorithms. In: Uncertainty in Complex Networked Systems: (pp. 501-532). Birkhauser
Open this publication in new window or tab >>Impact of quantized inter-agent communications on game-theoretic and distributed optimization algorithms
2018 (English)In: Uncertainty in Complex Networked Systems, Birkhauser , 2018, p. 501-532Chapter in book (Refereed)
Abstract [en]

Quantized inter-agent communications in game-theoretic and distributed optimization algorithms generate uncertainty that affects the asymptotic and transient behavior of such algorithms. This chapter uses the information-theoretic notion of differential entropy power to establish universal bounds on the maximum exponential convergence rates of primal-dual and gradient-based Nash seeking algorithms under quantized communications. These bounds depend on the inter-agent data rate and the local behavior of the agents’ objective functions, and are independent of the quantizer structure. The presented results provide trade-offs between the speed of exponential convergence, the agents’ objective functions, the communication bit rates, and the number of agents and constraints. For the proposed Nash seeking algorithm, the transient performance is studied and an upper bound on the average time required to settle inside a specified ball around the Nash equilibrium is derived under uniform quantization. Furthermore, an upper bound on the probability that the agents’ actions lie outside this ball is established. This bound decays double exponentially with time.

Place, publisher, year, edition, pages
Birkhauser, 2018
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-247443 (URN)10.1007/978-3-030-04630-9_15 (DOI)2-s2.0-85059011685 (Scopus ID)
Note

QC20190412

Available from: 2019-04-12 Created: 2019-04-12 Last updated: 2019-04-12Bibliographically approved
Tanaka, T., Nekouei, E. & Johansson, K. H. (2018). Linearly Solvable Mean-Field Road Traffic Games. In: 56th Annual Allerton Conference on Communication, Control, and Computing: . Paper presented at 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018; Allerton Park and Retreat CenterMonticello; United States; 2 October 2018 through 5 October 2018 (pp. 283-289). IEEE
Open this publication in new window or tab >>Linearly Solvable Mean-Field Road Traffic Games
2018 (English)In: 56th Annual Allerton Conference on Communication, Control, and Computing, IEEE , 2018, p. 283-289Conference paper, Published paper (Refereed)
Abstract [en]

We analyze the behavior of a large number of strategic drivers traveling er an urban traffic network using the mean-field game framework. We sume an incentive mechanism for congestion mitigation under which each iver selecting a particular route is charged a tax penalty that is fine in the logarithm of the number of agents selecting the same ute. We show that the mean-field approximation of such a rge-population dynamic game leads to the so-called linearly solvable rkov decision process, implying that an open-loop epsilon-Nash uilibrium of the original game can be found simply by solving a nite-dimensional linear system.

Place, publisher, year, edition, pages
IEEE, 2018
Series
Annual Allerton Conference on Communication Control and Computing, ISSN 2474-0195
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-248120 (URN)10.1109/ALLERTON.2018.8636077 (DOI)000461021200040 ()2-s2.0-85062891323 (Scopus ID)978-1-5386-6596-1 (ISBN)
Conference
56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018; Allerton Park and Retreat CenterMonticello; United States; 2 October 2018 through 5 October 2018
Note

QC 20190426

Available from: 2019-04-26 Created: 2019-04-26 Last updated: 2019-04-26Bibliographically approved
Johansson, A., Nekouei, E., Johansson, K. H. & Mårtensson, J. (2018). Multi-Fleet Platoon Matching: A Game-Theoretic Approach. In: 2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC): . Paper presented at 21st IEEE International Conference on Intelligent Transportation Systems (ITSC), NOV 04-07, 2018, Maui, HI (pp. 2980-2985). IEEE
Open this publication in new window or tab >>Multi-Fleet Platoon Matching: A Game-Theoretic Approach
2018 (English)In: 2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), IEEE , 2018, p. 2980-2985Conference paper, Published paper (Refereed)
Abstract [en]

We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles belong to different fleet owners and their strategic interaction is modeled as a non-cooperative game where the vehicle actions are their departure times. Each truck has a preferred departure time and its utility function is defined as the difference between its benefit from platooning and the cost of deviating from its preferred departure time. We show that the platoon matching game is an exact potential game. An algorithm based on best response dynamics is proposed for finding a Nash equilibrium of the game. At a Nash equilibrium, vehicles with the same departure time are matched to form a platoon. Finally, the total fuel reduction at the Nash equilibrium is studied and compared with that of a cooperative matching solution where a common utility function for all vehicles is optimized.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE International Conference on Intelligent Transportation Systems-ITSC, ISSN 2153-0009
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-244584 (URN)000457881302149 ()2-s2.0-85060477254 (Scopus ID)978-1-7281-0323-5 (ISBN)
Conference
21st IEEE International Conference on Intelligent Transportation Systems (ITSC), NOV 04-07, 2018, Maui, HI
Note

QC 20190306

Available from: 2019-03-06 Created: 2019-03-06 Last updated: 2019-03-06Bibliographically approved
Organisations

Search in DiVA

Show all publications