Anders Rantzer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anders Rantzer has a total of 187 co-authors. Here are the top co-authors by number of shared publications:
- Richard Pates
Department of Automatic Control and the ELLIIT Strategic Research Area, Lund University, Lund, Sweden
5 shared publications Ahmet Murat
Information Technology
3 shared publicationsAnders Hansson
Department of Electrical Engineering, Linköping University, Linköping, Sweden
3 shared publications- Andreas Weisshaar
Information Technology
3 shared publications - Carolina Bergeling
Department of Mathematics and Natural Sciences, Blekinge Institute of Technology, Karlskrona, Sweden
3 shared publications - Catherine Rosenberg
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada
3 shared publications
Latest Publications
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 481-486
Model Predictive Control for Constrained Linear Positive Systems on Graphs
Positive systems describing networks with inherently non-negative states and inputs arise naturally in routing, logistics, and compartmental modelling. We consider problems modelled as positive linear systems in incidence form with linear cost. The addition of capacity constraints on states (storage) and inputs (flows between nodes) significantly increases the problem complexity. Leveraging the analytic structure of the unconstrained problem, an explicit suboptimal admissible controller is constructed. This yields graph-computable performance bounds and a minimum stabilising horizon length for a model predictive controller without terminal conditions. A convex program enables efficient computation of the optimal bound and horizon. These results highlight how system structure enables explicit MPC guarantees that are typically not available.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 481-486
Model Predictive Control for Constrained Linear Positive Systems on Graphs
Positive systems describing networks with inherently non-negative states and inputs arise naturally in routing, logistics, and compartmental modelling. We consider problems modelled as positive linear systems in incidence form with linear cost. The addition of capacity constraints on states (storage) and inputs (flows between nodes) significantly increases the problem complexity. Leveraging the analytic structure of the unconstrained problem, an explicit suboptimal admissible controller is constructed. This yields graph-computable performance bounds and a minimum stabilising horizon length for a model predictive controller without terminal conditions. A convex program enables efficient computation of the optimal bound and horizon. These results highlight how system structure enables explicit MPC guarantees that are typically not available.
- Open Access
- 14 April 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 213
Data-driven sampled-data LQR: Certainty-equivalence control via lifted cost and Riccati analysis
- 14 April 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 213
Open AccessData-driven sampled-data LQR: Certainty-equivalence control via lifted cost and Riccati analysis
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1573-1578
L 1 Optimal Control of Continuous-Time Stochastic Positive Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1573-1578
L 1 Optimal Control of Continuous-Time Stochastic Positive Systems
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 1413-1420
Duality-Based Dynamical Optimal Transport of Discrete Time Systems
We study dynamical optimal transport of discrete time systems with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces this to a straightforward maximization. In addition, the proposed algorithm is highly amenable to parallelization. For linear systems with Gaussian marginals, we provide a semidefinite programming formulation based on our theory. Finally, we validate the approach with a simulation example.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 1413-1420
Duality-Based Dynamical Optimal Transport of Discrete Time Systems
We study dynamical optimal transport of discrete time systems with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces this to a straightforward maximization. In addition, the proposed algorithm is highly amenable to parallelization. For linear systems with Gaussian marginals, we provide a semidefinite programming formulation based on our theory. Finally, we validate the approach with a simulation example.
- Open Access
Linear Regulator-Based Synchronization of Positive Multi-Agent Systems
This paper addresses the positive synchronization of interconnected systems on undirected graphs. For homogeneous positive systems, a static feedback protocol design is proposed, based on the Linear Regulator problem. The solution to the algebraic equation associated to the stabilizing policy can be found using a linear program. Necessary and sufficient conditions on the positivity of each agent's trajectory for all nonnegative initial conditions are also provided. Simulations on large regular graphs with different nodal degree illustrate the proposed results.
Open AccessLinear Regulator-Based Synchronization of Positive Multi-Agent Systems
This paper addresses the positive synchronization of interconnected systems on undirected graphs. For homogeneous positive systems, a static feedback protocol design is proposed, based on the Linear Regulator problem. The solution to the algebraic equation associated to the stabilizing policy can be found using a linear program. Necessary and sufficient conditions on the positivity of each agent's trajectory for all nonnegative initial conditions are also provided. Simulations on large regular graphs with different nodal degree illustrate the proposed results.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2841-2846
Data-Driven Adaptive Dispatching Policies for Processing Networks
This letter presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2841-2846
Data-Driven Adaptive Dispatching Policies for Processing Networks
This letter presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.
- 28 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (12) , 8738-8750
Exact Dynamic Programming for Positive Systems With Linear Optimal Cost
Recent work [20] formulated a class of optimal control problems involving positive linear systems, linear stage costs, and elementwise constraints on control. It was shown that the problem admits linear optimal cost and the associated Bellman's equation can be characterized by a finite-dimensional nonlinear equation, which is solved by linear programming. In this work, we report exact dynamic programming (DP) theories for the same class of problems. Moreover, we extend the results to a related class of problems where the norms of control are bounded while the optimal costs remain linear. In both cases, we provide conditions under which the solutions are unique, investigate properties of the optimal policies, study the convergence of value iteration, policy iteration, and optimistic policy iteration applied to such problems, and analyze the boundedness of the solution to the associated optimization programs. Apart from a form of the Frobenius-Perron theorem, the majority of our results are built upon generic DP theory applicable to problems involving nonnegative stage costs.
- 28 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (12) , 8738-8750
Exact Dynamic Programming for Positive Systems With Linear Optimal Cost
Recent work [20] formulated a class of optimal control problems involving positive linear systems, linear stage costs, and elementwise constraints on control. It was shown that the problem admits linear optimal cost and the associated Bellman's equation can be characterized by a finite-dimensional nonlinear equation, which is solved by linear programming. In this work, we report exact dynamic programming (DP) theories for the same class of problems. Moreover, we extend the results to a related class of problems where the norms of control are bounded while the optimal costs remain linear. In both cases, we provide conditions under which the solutions are unique, investigate properties of the optimal policies, study the convergence of value iteration, policy iteration, and optimistic policy iteration applied to such problems, and analyze the boundedness of the solution to the associated optimization programs. Apart from a form of the Frobenius-Perron theorem, the majority of our results are built upon generic DP theory applicable to problems involving nonnegative stage costs.
- Open Access
- 24 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Optimal control of linear cost networks
- 24 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Open AccessOptimal control of linear cost networks
- 30 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7104-7111
Stability Analysis of Trajectories on Manifolds With Applications to Observer and Controller Design
This paper examines the local exponential stability (LES) of trajectories for nonlinear systems on Riemannian manifolds. We present necessary and sufficient conditions for LES of a trajectory on a Riemannian manifold by analyzing the complete lift of the system along the given trajectory. These conditions are coordinate-free which reveal fundamental relationships between exponential stability and incremental stability in a local sense. We then apply these results to design tracking controllers and observers for Euler-Lagrangian systems on manifolds; a notable advantage of our design is that it visibly reveals the effect of curvature on system dynamics and hence suggests compensation terms in the controller and observer. Additionally, we revisit some well-known intrinsic observer problems using our proposed method, which largely simplifies the analysis compared to existing results.
- 30 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7104-7111
Stability Analysis of Trajectories on Manifolds With Applications to Observer and Controller Design
This paper examines the local exponential stability (LES) of trajectories for nonlinear systems on Riemannian manifolds. We present necessary and sufficient conditions for LES of a trajectory on a Riemannian manifold by analyzing the complete lift of the system along the given trajectory. These conditions are coordinate-free which reveal fundamental relationships between exponential stability and incremental stability in a local sense. We then apply these results to design tracking controllers and observers for Euler-Lagrangian systems on manifolds; a notable advantage of our design is that it visibly reveals the effect of curvature on system dynamics and hence suggests compensation terms in the controller and observer. Additionally, we revisit some well-known intrinsic observer problems using our proposed method, which largely simplifies the analysis compared to existing results.