Leonardo Pedroso
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
Leonardo Pedroso has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Pedro Batista
Institute for Systems and Robotics, Instituto Superior Tcnico, Universidade de Lisboa, Lisboa, Portugal
9 shared publications Pedro Batista
3 shared publicationsH. Lopes
DEM ISEP, Instituto Politécnico do Porto Porto Portugal
2 shared publications- Jose Viriato Araujo dos Santos
IDMEC, Instituto Superior Técnico, Universidade de Lisboa, 1049-001 Lisboa, Portugal
2 shared publications A. Arco
IDMEC Instituto Superior Técnico, Universidade de Lisboa Lisboa Portugal
1 shared publication- António Arco
University of Lisbon
1 shared publication
Latest Publications
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
A Unified Family-optimal Solution to Covariance Intersection Problems with Semidefinite Programming
Covariance intersection (CI) methods provide a principled approach to fusing estimates with unknown cross-correlations by minimizing a worst-case measure of uncertainty that is consistent with the available information. This paper shows that a generalized CI framework, called overlapping covariance intersection (OCI), unifies several existing CI formulations within a single optimization-based framework. This unification enables the characterization of family-optimal solutions for multiple CI variants, including standard CI and split covariance intersection (SCI), as solutions to a semidefinite program, for which efficient off-the-shelf solvers are available. When specialized to the corresponding settings, the proposed family-optimal solutions recover the state-of-the-art family-optimal solutions previously reported for CI and SCI. The resulting formulation facilitates the systematic design and real-time implementation of CI-based fusion methods in large-scale distributed estimation problems, such as cooperative localization.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
A Unified Family-optimal Solution to Covariance Intersection Problems with Semidefinite Programming
Covariance intersection (CI) methods provide a principled approach to fusing estimates with unknown cross-correlations by minimizing a worst-case measure of uncertainty that is consistent with the available information. This paper shows that a generalized CI framework, called overlapping covariance intersection (OCI), unifies several existing CI formulations within a single optimization-based framework. This unification enables the characterization of family-optimal solutions for multiple CI variants, including standard CI and split covariance intersection (SCI), as solutions to a semidefinite program, for which efficient off-the-shelf solvers are available. When specialized to the corresponding settings, the proposed family-optimal solutions recover the state-of-the-art family-optimal solutions previously reported for CI and SCI. The resulting formulation facilitates the systematic design and real-time implementation of CI-based fusion methods in large-scale distributed estimation problems, such as cooperative localization.
- Open Access
- 8 April 2025
- Published by Elsevier in Annual Reviews in Control
- Vol. 59
Distributed design of ultra large-scale control systems: Progress, Challenges, and Prospects
- 8 April 2025
- Published by Elsevier in Annual Reviews in Control
- Vol. 59
Open AccessDistributed design of ultra large-scale control systems: Progress, Challenges, and Prospects
- Open Access
- 5 October 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 169
Feedback–feedforward signal control with exogenous demand estimation in congested urban road networks
- 5 October 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 169
Open AccessFeedback–feedforward signal control with exogenous demand estimation in congested urban road networks
- Open Access
- 19 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 906-917
A Time-Invariant Network Flow Model for Ride-Pooling in Mobility-on-Demand Systems
This paper presents a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network flow model, a linear problem, which can be solved in polynomial time. In order to compute the ride-pooling assignment, which is the matching between two or more users so that they can be pooled together, we devise a polynomial-time knapsack-like algorithm that is optimal w.r.t. the minimum vehicle travel time with users on-board. Finally, we conduct two case studies of Sioux Falls and Manhattan, where we validate our models against state-of-the-art results, and we quantitatively highlight the effects that maximum waiting time and maximum delay thresholds have on the vehicle hours traveled, overall pooled rides and actual delay experienced. Last, we show that allowing for four people ride-pooling can significantly boost the performance of the system.
- 19 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 906-917
Open AccessA Time-Invariant Network Flow Model for Ride-Pooling in Mobility-on-Demand Systems
This paper presents a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network flow model, a linear problem, which can be solved in polynomial time. In order to compute the ride-pooling assignment, which is the matching between two or more users so that they can be pooled together, we devise a polynomial-time knapsack-like algorithm that is optimal w.r.t. the minimum vehicle travel time with users on-board. Finally, we conduct two case studies of Sioux Falls and Manhattan, where we validate our models against state-of-the-art results, and we quantitatively highlight the effects that maximum waiting time and maximum delay thresholds have on the vehicle hours traveled, overall pooled rides and actual delay experienced. Last, we show that allowing for four people ride-pooling can significantly boost the performance of the system.
- Open Access
Distributed decentralized receding horizon control for very large-scale networks with application to satellite mega-constellations
The implementation feasibility of control algorithms over very large-scale networks calls for hard constraints regarding communication, computational, and memory requirements. In this paper, the decentralized receding horizon control problem for very large-scale networks of dynamically decoupled systems with a common, possibly time-varying, control objective is addressed. Each system is assumed to be modeled by linear time-varying dynamics, which can be leveraged to approximate nonlinear systems about successive points of operation. A distributed and decentralized receding horizon control solution is put forward, which: i) takes communication delays into account; ii) allows local communication exclusively; and iii) whose computational and memory requirements in each computational unit do not scale with the dimension of the network. The scalability of the proposed solution enables emerging very large-scale applications of swarm robotics and networked control. This approach is applied to the orbit control problem of low Earth orbit mega-constellations, featuring high-fidelity numerical simulations for the Starlink mega-constellation.
Open AccessDistributed decentralized receding horizon control for very large-scale networks with application to satellite mega-constellations
The implementation feasibility of control algorithms over very large-scale networks calls for hard constraints regarding communication, computational, and memory requirements. In this paper, the decentralized receding horizon control problem for very large-scale networks of dynamically decoupled systems with a common, possibly time-varying, control objective is addressed. Each system is assumed to be modeled by linear time-varying dynamics, which can be leveraged to approximate nonlinear systems about successive points of operation. A distributed and decentralized receding horizon control solution is put forward, which: i) takes communication delays into account; ii) allows local communication exclusively; and iii) whose computational and memory requirements in each computational unit do not scale with the dimension of the network. The scalability of the proposed solution enables emerging very large-scale applications of swarm robotics and networked control. This approach is applied to the orbit control problem of low Earth orbit mega-constellations, featuring high-fidelity numerical simulations for the Starlink mega-constellation.
- Open Access
- 4 October 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 141
Distributed decentralized receding horizon control for very large-scale networks with application to satellite mega-constellations
- 4 October 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 141
Open AccessDistributed decentralized receding horizon control for very large-scale networks with application to satellite mega-constellations
- Open Access
- 25 March 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 135
Distributed decentralized EKF for very large-scale networks with application to satellite mega-constellations navigation
- 25 March 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 135
Open AccessDistributed decentralized EKF for very large-scale networks with application to satellite mega-constellations navigation
- 10 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (4) , 1855-1866
Decentralized Moving Horizon Estimation for Large-Scale Networks of Interconnected Unconstrained Linear Systems
This paper addresses the problem of designing a decentralized state estimation solution for a large-scale network of interconnected unconstrained linear time invariant (LTI) systems. The problem is tackled in a novel moving horizon estimation (MHE) framework, while taking into account the limited communication capabilities and the restricted computational power and memory, which are distributed across the network. The proposed design is motivated by the fact that, in a decentralized setting, a Luenberguer-based framework is unable to leverage the full potential of the available local information. A method is derived to solve a relaxed version of the resulting optimization problem. It can be synthesized offline and its stability can be assessed prior to deployment. It is shown that the proposed approach allows for significant improvement on the performance of recent Luenberger-based filters. Furthermore, we show that a state-of-the-art distributed MHE solution with comparable requirements underperforms in comparison to the proposed solution.
- 10 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (4) , 1855-1866
Decentralized Moving Horizon Estimation for Large-Scale Networks of Interconnected Unconstrained Linear Systems
This paper addresses the problem of designing a decentralized state estimation solution for a large-scale network of interconnected unconstrained linear time invariant (LTI) systems. The problem is tackled in a novel moving horizon estimation (MHE) framework, while taking into account the limited communication capabilities and the restricted computational power and memory, which are distributed across the network. The proposed design is motivated by the fact that, in a decentralized setting, a Luenberguer-based framework is unable to leverage the full potential of the available local information. A method is derived to solve a relaxed version of the resulting optimization problem. It can be synthesized offline and its stability can be assessed prior to deployment. It is shown that the proposed approach allows for significant improvement on the performance of recent Luenberger-based filters. Furthermore, we show that a state-of-the-art distributed MHE solution with comparable requirements underperforms in comparison to the proposed solution.
- Open Access
- 5 September 2022
- Published by Elsevier in Journal of Process Control
- Vol. 118, 82-94
Reproducible low-cost flexible quadruple-tank process experimental setup for control educators, practitioners, and researchers
- 5 September 2022
- Published by Elsevier in Journal of Process Control
- Vol. 118, 82-94
Open AccessReproducible low-cost flexible quadruple-tank process experimental setup for control educators, practitioners, and researchers
- 26 December 2021
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 53 (6) , 1334-1351
Discrete-time distributed Kalman filter design for networks of interconnected systems with linear time-varying dynamics
This paper addresses the problem of designing distributed state estimation solutions for a network of interconnected systems modelled by linear time-varying (LTV) dynamics in a discrete-time framework. The problem is formulated as a classical optimal estimation problem, for the global system, subject to a given sparsity constraint on the filter gain, which reflects the distributed nature of the network. Two methods are presented, both of them able to compute a sequence of well-performing stabilising gains. Moreover, both methods are validated by resorting to simulations of: (i) a randomly generated synthetic LTV system; and (ii) a large-scale nonlinear network of interconnected tanks. One of the proposed methods relies on a computationally efficient solution, thus it is computed very rapidly. The other achieves better performance, but it is computationally more expensive and requires that a window of the future dynamics of the system is known. When implemented to a nonlinear network, approximated by an LTV system, the proposed methods are able to compute well-performing gains that stabilise the estimation error dynamics. Both algorithms are scalable, being adequate for implementation in large-scale networks.
- 26 December 2021
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 53 (6) , 1334-1351
Discrete-time distributed Kalman filter design for networks of interconnected systems with linear time-varying dynamics
This paper addresses the problem of designing distributed state estimation solutions for a network of interconnected systems modelled by linear time-varying (LTV) dynamics in a discrete-time framework. The problem is formulated as a classical optimal estimation problem, for the global system, subject to a given sparsity constraint on the filter gain, which reflects the distributed nature of the network. Two methods are presented, both of them able to compute a sequence of well-performing stabilising gains. Moreover, both methods are validated by resorting to simulations of: (i) a randomly generated synthetic LTV system; and (ii) a large-scale nonlinear network of interconnected tanks. One of the proposed methods relies on a computationally efficient solution, thus it is computed very rapidly. The other achieves better performance, but it is computationally more expensive and requires that a window of the future dynamics of the system is known. When implemented to a nonlinear network, approximated by an LTV system, the proposed methods are able to compute well-performing gains that stabilise the estimation error dynamics. Both algorithms are scalable, being adequate for implementation in large-scale networks.