| 1. |
- Bassi, Germán, et al.
(författare)
-
Statistical Parameter Privacy
- 2020
-
Ingår i: Privacy in Dynamical Systems. - Singapore : Springer Nature. ; , s. 65-82
-
Bokkapitel (refereegranskat)abstract
- We investigate the problem of sharing the outcomes of a parametric source with an untrusted party while ensuring the privacy of the parameters. We propose privacy mechanisms which guarantee parameter privacy under both Bayesian statistical as well as information-theoretic privacy measures. The properties of the proposed mechanisms are investigated and the utility-privacy trade-off is analyzed.
|
|
| 2. |
- Johansson, Alexander, et al.
(författare)
-
Multi-Fleet Platoon Matching : A Game-Theoretic Approach
- 2018
-
Ingår i: 2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC). - : IEEE. - 9781728103235 ; , s. 2980-2985
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 3. |
- Johansson, Alexander, et al.
(författare)
-
Platoon Coordination in Large-Scale Networks : A Game Theoretic Approach
- 2023
-
Ingår i: Systems and Control. - : Springer Nature. ; , s. 79-100
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- The emerging commercial rollout of heavy-duty vehicle platooning necessitates the development of efficient platoon coordination solutions. The commercial vehicle fleet consists of vehicles owned by different transportation companies with different objectives. To capture their strategic behavior, we study platoon coordination that aims to maximize profits for individual vehicles. The interaction among vehicles is modeled as a non-cooperative game. In our cyber-physical system, we consider a large number of vehicles with fixed routes in a transportation network that can wait at hubs along their routes to form platoons. Each vehicle aims to maximize its utility function, which includes a reward for platooning and a cost for waiting. We propose open-loop coordination solutions when the vehicles decide on their waiting times at the beginning of their trips and do not update their decisions during their trips. It is shown that the corresponding game admits at least one Nash equilibrium. We also propose feedback solutions in which the vehicles are allowed to update their decisions along their routes. In a simulation study over the Swedish road network, we compare the proposed platoon coordination solutions and evaluate the benefits of non-cooperative platooning at a societal scale.
|
|
| 4. |
- Johansson, Alexander, et al.
(författare)
-
Truck Platoon Formation at Hubs : An Optimal Release Time Rule
- 2020
-
Ingår i: Ifac papersonline. - : Elsevier BV. - 2405-8963. ; , s. 15312-15318
-
Konferensbidrag (refereegranskat)abstract
- We consider a hub-based platoon coordination problem in which vehicles arrive at a hub according to an independent and identically distributed stochastic arrival process. The vehicles wait at the hub, and a platoon coordinator, at each time-step, decides whether to release the vehicles from the hub in the form of a platoon or wait for more vehicles to arrive. The platoon release time problem is modeled as a stopping rule problem wherein the objective is to maximize the average platooning benefit of the vehicles located at the hub and there is a cost of having vehicles waiting at the hub. We show that the stopping rule problem is monotone and the optimal platoon release time policy will therefore be in the form of a one time-step look-ahead rule. The performance of the optimal release rule is numerically compared with (i) a periodic release time rule and (ii) a non-causal release time rule where the coordinator knows all the future realizations of the arrival process. Our numerical results show that the optimal release time rule achieves a close performance to that of the non-causal rule and outperforms the periodic rule, especially when the arrival rate is low.
|
|
| 5. |
- Masoumzadeh, Amin, et al.
(författare)
-
Impact of Optimal Storage Allocation on Price Volatility in Energy-Only Electricity Markets
- 2018
-
Ingår i: IEEE Transactions on Power Systems. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0885-8950 .- 1558-0679. ; 33:2, s. 1903-1914
-
Tidskriftsartikel (refereegranskat)abstract
- Recent studies show that the fast growing expansion of wind power generation may lead to extremely high levels of price volatility in wholesale electricity markets. Storage technologies, regardless of their specific forms, e.g., pump-storage hydro, large-scale, or distributed batteries, are capable of alleviating the extreme price volatility levels due to their energy usage time shifting, fast-ramping, and price arbitrage capabilities. In this paper, we propose a stochastic bilevel optimization model to find the optimal nodal storage capacities required to achieve a certain price volatility level in a highly volatile energy-only electricity market. The decision on storage capacities is made in the upper level problem and the operation of strategic/regulated generation, storage, and transmission players is modeled in the lower level problem using an extended stochastic (Bayesian) Cournot-based game. The South Australia (SA) electricity market, which has recently experienced high levels of price volatility, and a 30-bus IEEE system are considered as the case studies. Our numerical results indicate that 50% price volatility reduction in the SA electricity market can be achieved by installing either 430-MWh regulated storage or 530-MWh strategic storage. In other words, regulated storage firms are more efficient in reducing the price volatility than strategic storage firms.
|
|
| 6. |
- Masoumzadeh, Amin, et al.
(författare)
-
Wind Versus Storage Allocation for Price Management in Wholesale Electricity Markets
- 2020
-
Ingår i: IEEE Transactions on Sustainable Energy. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1949-3029 .- 1949-3037. ; 11:2, s. 817-827
-
Tidskriftsartikel (refereegranskat)abstract
- This paper investigates the impacts of installing regulated wind and electricity storage on average price and price volatility in electricity markets. A stochastic bi-level optimization model is developed, which computes the optimal allocation of new wind and battery capacities, by minimizing a weighted sum of the average market price and price volatility. A fixed budget is allocated on wind and battery capacities in the upper-level problem. The operation of strategic/regulated generation, storage, and transmission players is simulated in the lower-level problem using a stochastic (Bayesian) Cournot-based game model. Australia's national electricity market, which is experiencing occasional price peaks, is considered as the case study. Our simulation results quantitatively illustrate that the regulated wind is more efficient than storage in reducing the average price, while the regulated storage more effectively reduces the price volatility. According to our numerical results, the storage-only solution reduces the average price at most by 9.4%, and the wind-only solution reduces the square root of price volatility at most by 39.3%. However, an optimal mixture of wind and storage can reduce the mean price by 17.6% and the square root of price volatility by 48.1%. It also increases the consumer surplus by 1.52%. Moreover, the optimal mixture of wind and storage is a profitable solution unlike the storage-only solution.
|
|
| 7. |
- Nekouei, Ehsan, et al.
(författare)
-
A Randomized Filtering Strategy Against Inference Attacks on Active Steering Control Systems
- 2022
-
Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 17, s. 16-27
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we develop a framework against inference attacks aimed at inferring the values of the controller gains of an active steering control system (ASCS). We first show that an adversary with access to the shared information by a vehicle, via a vehicular ad hoc network (VANET), can reliably infer the values of the controller gains of an ASCS. This vulnerability may expose the driver as well as the manufacturer of the ASCS to severe financial and safety risks. To protect controller gains of an ASCS against inference attacks, we propose a randomized filtering framework wherein the lateral velocity and yaw rate states of a vehicle are processed by a filter consisting of two components: a nonlinear mapping and a randomizer. The randomizer randomly generates a pair of pseudo gains which are different from the true gains of the ASCS. The nonlinear mapping performs a nonlinear transformation on the lateral velocity and yaw rate states. The nonlinear transformation is in the form of a dynamical system with a feedforward-feedback structure which allows real-time and causal implementation of the proposed privacy filter. The output of the filter is then shared via the VANET. The optimal design of randomizer is studied under a privacy constraint that determines the protection level of controller gains against inference attacks, and is in terms of mutual information. It is shown that the optimal randomizer is the solution of a convex optimization problem. By characterizing the distribution of the output of the filter, it is shown that the statistical distribution of the filter's output depends on the pseudo gains rather than the true gains. Using information-theoretic inequalities, we analyze the inference ability of an adversary in estimating the control gains based on the output of the filter. Our analysis shows that the performance of any estimator in recovering the controller gains of an ASCS based on the output of the filter is limited by the privacy constraint. The performance of the proposed privacy filter is compared with that of an additive noise privacy mechanism. Our numerical results show that the proposed privacy filter significantly outperforms the additive noise mechanism, especially in the low distortion regime.
|
|
| 8. |
|
|
| 9. |
- Nekouei, Ehsan, et al.
(författare)
-
Impact of quantized inter-agent communications on game-theoretic and distributed optimization algorithms
- 2018
-
Ingår i: Uncertainty in Complex Networked Systems. - Cham : Birkhauser. ; , s. 501-532
-
Bokkapitel (refereegranskat)abstract
- 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.
|
|
| 10. |
- Nekouei, Ehsan, et al.
(författare)
-
Information-theoretic approaches to privacy in estimation and control
- 2019
-
Ingår i: Annual Reviews in Control. - : PERGAMON-ELSEVIER SCIENCE LTD. - 1367-5788 .- 1872-9088. ; 47, s. 412-422
-
Forskningsöversikt (refereegranskat)abstract
- 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.
|
|
