Benita Nortmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Benita Nortmann has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Thulasi Mylvaganam
Department of Aeronautics Imperial College London SW7 2AZ London UK
4 shared publications - Mario Sassano
University of Rome Tor Vergata
2 shared publications - Andrea Monti
Dipartimento di Ingegneria Civile ed Ingegneria Informatica (DICII), Universit degli Studi di Roma Tor Vegata Roma, Italy
1 shared publication - M. L. Scarpa
Department of Aeronautics, Imperial College London, London, U.K.
1 shared publication
Latest Publications
- 6 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1451-1456
Feedback Nash Equilibrium Solutions of Two-Player LQ Differential Games: Synthesis and Analysis via a State/Costate Interpretation
Linear quadratic differential games and their feedback Nash equilibrium (F-NE) solutions are considered. First, it is shown that F-NE strategies can be derived from the restriction to an invariant subspace of a system that is reminiscent of the state/costate dynamics arising in the context of open-loop NE solutions. Second, in terms of synthesis, it is shown that the equilibrium subspace can be rendered externally stable via virtual inputs without modifying the underlying F-NE strategies. Building upon these findings, we propose a gradient descent algorithm to determine a solution of the coupled Algebraic Riccati Equations associated with F-NE, which are generally challenging to solve. Finally, in terms of analysis, we show that the F-NE strategy of each player can be interpreted as the output of a passive Port-Controlled Hamiltonian system, and that the behaviour of the original system under the action of the F-NE strategies can be interpreted as an interconnection of these.
- 6 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1451-1456
Feedback Nash Equilibrium Solutions of Two-Player LQ Differential Games: Synthesis and Analysis via a State/Costate Interpretation
Linear quadratic differential games and their feedback Nash equilibrium (F-NE) solutions are considered. First, it is shown that F-NE strategies can be derived from the restriction to an invariant subspace of a system that is reminiscent of the state/costate dynamics arising in the context of open-loop NE solutions. Second, in terms of synthesis, it is shown that the equilibrium subspace can be rendered externally stable via virtual inputs without modifying the underlying F-NE strategies. Building upon these findings, we propose a gradient descent algorithm to determine a solution of the coupled Algebraic Riccati Equations associated with F-NE, which are generally challenging to solve. Finally, in terms of analysis, we show that the F-NE strategy of each player can be interpreted as the output of a passive Port-Controlled Hamiltonian system, and that the behaviour of the original system under the action of the F-NE strategies can be interpreted as an interconnection of these.
- Open Access
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 6561-6575
Nash Equilibria for Linear Quadratic Discrete-Time Dynamic Games via Iterative and Data-Driven Algorithms
Determining feedback Nash equilibrium solutions of nonzero-sum dynamic games is generally challenging. In this paper, we propose four different iterative algorithms to find Nash equilibrium strategies for discrete-time linear quadratic games. The strategy update laws are based on the solution of either Lyapunov or Riccati equations for each player. Local convergence criteria are discussed. Motivated by the fact that in many practical scenarios each player in the game may have access to different (incomplete) information, we also introduce purely data-driven implementations of the algorithms. This allows the players to reach a Nash equilibrium solution of the game via scheduled experiments and without knowledge of each other's performance criteria or of the system dynamics. The efficacy of the presented algorithms is illustrated via numerical examples and a practical example involving human-robot interaction.
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 6561-6575
Open AccessNash Equilibria for Linear Quadratic Discrete-Time Dynamic Games via Iterative and Data-Driven Algorithms
Determining feedback Nash equilibrium solutions of nonzero-sum dynamic games is generally challenging. In this paper, we propose four different iterative algorithms to find Nash equilibrium strategies for discrete-time linear quadratic games. The strategy update laws are based on the solution of either Lyapunov or Riccati equations for each player. Local convergence criteria are discussed. Motivated by the fact that in many practical scenarios each player in the game may have access to different (incomplete) information, we also introduce purely data-driven implementations of the algorithms. This allows the players to reach a Nash equilibrium solution of the game via scheduled experiments and without knowledge of each other's performance criteria or of the system dynamics. The efficacy of the presented algorithms is illustrated via numerical examples and a practical example involving human-robot interaction.
- Open Access
Direct data-driven control of LTV systems
Considering discrete-time linear time-varying systems with unknown dynamics, controllers guaranteeing bounded closed-loop trajectories, optimal performance and robustness to process and measurement noise are designed via convex feasibility and optimisation problems involving purely data-dependent linear matrix inequalities. For the special case of periodically time-varying systems, infinite-horizon guarantees are achieved based on finite-length data sequences.
Open AccessDirect data-driven control of LTV systems
Considering discrete-time linear time-varying systems with unknown dynamics, controllers guaranteeing bounded closed-loop trajectories, optimal performance and robustness to process and measurement noise are designed via convex feasibility and optimisation problems involving purely data-dependent linear matrix inequalities. For the special case of periodically time-varying systems, infinite-horizon guarantees are achieved based on finite-length data sequences.
- 16 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (8) , 4888-4895
Direct Data-Driven Control of Linear Time-Varying Systems
Considering discrete-time linear time-varying systems with unknown dynamics, controllers guaranteeing bounded closed-loop trajectories, optimal performance and robustness to process and measurement noise are designed via convex feasibility and optimisation problems involving purely data-dependent linear matrix inequalities. For the special case of periodically time-varying systems, infinite-horizon guarantees are achieved based on finite-length data sequences.
- 16 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (8) , 4888-4895
Direct Data-Driven Control of Linear Time-Varying Systems
Considering discrete-time linear time-varying systems with unknown dynamics, controllers guaranteeing bounded closed-loop trajectories, optimal performance and robustness to process and measurement noise are designed via convex feasibility and optimisation problems involving purely data-dependent linear matrix inequalities. For the special case of periodically time-varying systems, infinite-horizon guarantees are achieved based on finite-length data sequences.