| 1. |
|
|
| 2. |
- Milosevic, Jezdimir, et al.
(författare)
-
A Security Index for Actuators Based on Perfect Undetectability : Properties and Approximation
- 2019
-
Ingår i: 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781538665961 ; , s. 235-241
-
Konferensbidrag (refereegranskat)abstract
- A novel security index based on the definition of perfect undetectability is proposed. The index is a tool that can help a control system operator to localize the most vulnerable actuators in the network. In particular, the security index of actuator i represents the minimal number of sensors and actuators that needs to be compromised in addition to i, such that a perfectly undetectable attack is possible. A method for computing this index for small scale systems is derived, and difficulties with the index once the system is of large scale are outlined. An upper bound for the index that overcomes these difficulties is then proposed. The theoretical developments are illustrated on a numerical example.
|
|
| 3. |
- Tanaka, Takashi, et al.
(författare)
-
Linearly Solvable Mean-Field Road Traffic Games
- 2018
-
Ingår i: 56th Annual Allerton Conference on Communication, Control, and Computing. - : IEEE. - 9781538665961 ; , s. 283-289
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
