Francesco Vitale
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Francesco Vitale has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Claudio Roncoli
KU Leuven
5 shared publications - Chaopeng Tan
Technische Universität Dresden
1 shared publication - Charalampos Sipetas
Department of Built Environment, Aalto University, Espoo, Finland
1 shared publication - Christophe Feltus
Luxembourg Institute of Science and Technology (LIST)
1 shared publication - Farhad Khalilzadeh
Department of Computer Engineering, Hacettepe University, Ankara, Turkey
1 shared publication - Heqi Wang
School of Civil Engineering Chongqing University, Chongqing, 400044, China
1 shared publication
Latest Publications
- 18 August 2026
- Published by Springer Nature
- p. 74-92
A Unified Privacy-Preserving Federated Learning Framework for Horizontal and Vertical Data Partitioning
- 18 August 2026
- Published by Springer Nature
- p. 74-92
A Unified Privacy-Preserving Federated Learning Framework for Horizontal and Vertical Data Partitioning
- Open Access
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 285-303
Distributed Signal-Free Intersection Optimization via Iterative Time Slots Adjustment for Connected and Automated Vehicles
We propose a novel control strategy for signal-free intersection management through trajectory optimization for connected and automated vehicles. Such methodology is designed to be employed in a distributed manner, hence with no need for central units or specific tasks for leading vehicles, while only a limited amount of information needs to be exchanged and processed. The approach relies on an iterative distributed allocation and subsequent optimization of the time slots to cross the intersection. The distributed allocation aims to identify the constraints for the optimization problem to be solved, which enables the formulation of uncoupled subproblems that can be solved by each vehicle independently. The iterative algorithm initially allows the allocated time slots to overlap via a violation function that gradually decreases to zero as the algorithm progresses. This provides the optimization problem with enough flexibility to allow vehicles to resize their time slots and make them more suitable to meet their own requirements of trajectory smoothness and error minimization. We include simulation results and sensitivity analyses to demonstrate the effectiveness of our approach.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 285-303
Open AccessDistributed Signal-Free Intersection Optimization via Iterative Time Slots Adjustment for Connected and Automated Vehicles
We propose a novel control strategy for signal-free intersection management through trajectory optimization for connected and automated vehicles. Such methodology is designed to be employed in a distributed manner, hence with no need for central units or specific tasks for leading vehicles, while only a limited amount of information needs to be exchanged and processed. The approach relies on an iterative distributed allocation and subsequent optimization of the time slots to cross the intersection. The distributed allocation aims to identify the constraints for the optimization problem to be solved, which enables the formulation of uncoupled subproblems that can be solved by each vehicle independently. The iterative algorithm initially allows the allocated time slots to overlap via a violation function that gradually decreases to zero as the algorithm progresses. This provides the optimization problem with enough flexibility to allow vehicles to resize their time slots and make them more suitable to meet their own requirements of trajectory smoothness and error minimization. We include simulation results and sensitivity analyses to demonstrate the effectiveness of our approach.
- Open Access
- 7 June 2024
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2678 (12) , 980-998
Cooperative Traffic Dispersion through Rerouting of Connected and Automated Vehicles in Urban Networks
In this paper, we propose a novel cost function to be embedded in a distributed algorithm for cooperative rerouting of connected and automated vehicles (CAVs) in urban networks. The computation is performed by intersection units managing the portion of the network for which they are in charge by sending updated routes to follow to the CAVs there. Moreover, the intersection units communicate among each other to be updated on the situation of the (in general nonhomogeneous) links of the network. The proposed approach allows the decomposition of the problem into subproblems, which are resolved distributively with little information exchange. The problems are constructed to obtain a fair compromise between user equilibrium and system optimum, taking advantage of the strengths and coping with the limitations of both. We 1) show the results obtained by running simulations with CAVs on the Sioux Falls network compared with a baseline scenario; 2) analyze the results obtained with different penetration rates of CAVs; and 3) provide a sensitivity analysis to investigate how parameters in our approach affect the results of the experiments.
- 7 June 2024
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2678 (12) , 980-998
Open AccessCooperative Traffic Dispersion through Rerouting of Connected and Automated Vehicles in Urban Networks
In this paper, we propose a novel cost function to be embedded in a distributed algorithm for cooperative rerouting of connected and automated vehicles (CAVs) in urban networks. The computation is performed by intersection units managing the portion of the network for which they are in charge by sending updated routes to follow to the CAVs there. Moreover, the intersection units communicate among each other to be updated on the situation of the (in general nonhomogeneous) links of the network. The proposed approach allows the decomposition of the problem into subproblems, which are resolved distributively with little information exchange. The problems are constructed to obtain a fair compromise between user equilibrium and system optimum, taking advantage of the strengths and coping with the limitations of both. We 1) show the results obtained by running simulations with CAVs on the Sioux Falls network compared with a baseline scenario; 2) analyze the results obtained with different penetration rates of CAVs; and 3) provide a sensitivity analysis to investigate how parameters in our approach affect the results of the experiments.
- Open Access
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (2) , 1200-1214
Reference Tracking Optimization With Obstacle Avoidance via Task Prioritization for Automated Driving
Obstacle avoidance is a fundamental operation for automated driving and its formulation traditionally originates from robotics and decision making control fields. Given the high complexity required to compute an obstacle-free trajectory, this operation is usually demanded to a lower frequency planning layer that provides then a trajectory reference to be followed by a higher frequency control layer. As a result, whenever replanning is needed (for example, due to a new detected obstacle), the control layer must wait for a new planned trajectory to be generated. In this paper, we propose a novel methodology to approach obstacle avoidance already in the control layer, which allows a prompter response. In particular, we show how obstacle avoidance and reference tracking can be integrated, thus with no need to switch among different controllers, based on a null-space based behavioral control approach, implemented in a (possibly nonlinear) model predictive control scheme. We demonstrate practical implementation of the proposed methodology employing two different vehicle dynamic models and in four different (urban and highway) scenarios. Furthermore, we provide a sensitivity analysis to understand how parameters choice affects the automated vehicle behavior.
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (2) , 1200-1214
Open AccessReference Tracking Optimization With Obstacle Avoidance via Task Prioritization for Automated Driving
Obstacle avoidance is a fundamental operation for automated driving and its formulation traditionally originates from robotics and decision making control fields. Given the high complexity required to compute an obstacle-free trajectory, this operation is usually demanded to a lower frequency planning layer that provides then a trajectory reference to be followed by a higher frequency control layer. As a result, whenever replanning is needed (for example, due to a new detected obstacle), the control layer must wait for a new planned trajectory to be generated. In this paper, we propose a novel methodology to approach obstacle avoidance already in the control layer, which allows a prompter response. In particular, we show how obstacle avoidance and reference tracking can be integrated, thus with no need to switch among different controllers, based on a null-space based behavioral control approach, implemented in a (possibly nonlinear) model predictive control scheme. We demonstrate practical implementation of the proposed methodology employing two different vehicle dynamic models and in four different (urban and highway) scenarios. Furthermore, we provide a sensitivity analysis to understand how parameters choice affects the automated vehicle behavior.
- Open Access
- 2 August 2022
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 55 (13) , 198-203
Distributed Formation Control for Managing CAV Overtaking and Intersection Maneuvers
- 2 August 2022
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 55 (13) , 198-203
Open AccessDistributed Formation Control for Managing CAV Overtaking and Intersection Maneuvers