Stefano Ardizzoni

According to our database, Stefano Ardizzoni authored at least 15 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Multi-agent pathfinding on strongly connected digraphs: Feasibility and solution algorithms.

Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Bernhard Nebel, Irene Saccani

Artif. Intell., 2025

Generalized Least Squares for Vehicle Traffic Estimation.

Mattia Laurini, Irene Saccani, Nadia Naz, Stefano Ardizzoni, Luca Consolini, Marco Locatelli

Proceedings of the 33rd Mediterranean Conference on Control and Automation, 2025

2024

An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees.

Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel

J. Artif. Intell. Res., 2024

Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs.

Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli

CoRR, 2024

Constrained Motion Planning and Multi-Agent Path Finding on directed graphs.

Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani

Autom., 2024

A Dynamic Programming Approach for Road Traffic Estimation.

Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli

Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

Identification of Cyclists' Route Choice Criteria.

Stefano Ardizzoni, Mattia Laurini, Rafael Praxedes, Luca Consolini, Marco Locatelli

Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

2023

Solution Algorithms for the Bounded Acceleration Shortest Path Problem.

Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli

IEEE Trans. Autom. Control., March, 2023

Local Optimization of MAPF Solutions on Directed Graphs.

Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022

Constrained Multi-Agent Path Finding on Directed Graphs.

Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani

CoRR, 2022

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms.

Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli

CoRR, 2022

Shortest path with acceleration constraints: complexity and approximation algorithms.

Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli

Comput. Optim. Appl., 2022

Multi-Agent Path Finding on Strongly Connected Digraphs.

Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms.

Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli

CoRR, 2021

Efficient solution algorithms for the Bounded Acceleration Shortest Path problem.

Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021