Stefano Ardizzoni

Orcid: 0000-0003-1426-0834

According to our database1, Stefano Ardizzoni authored at least 10 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees.
J. Artif. Intell. Res., 2024

A Dynamic Programming Approach for Road Traffic Estimation.
CoRR, 2024

2023
Solution Algorithms for the Bounded Acceleration Shortest Path Problem.
IEEE Trans. Autom. Control., March, 2023

Local Optimization of MAPF Solutions on Directed Graphs.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Constrained Multi-Agent Path Finding on Directed Graphs.
CoRR, 2022

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

Shortest path with acceleration constraints: complexity and approximation algorithms.
Comput. Optim. Appl., 2022

Multi-Agent Path Finding on Strongly Connected Digraphs.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

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

Efficient solution algorithms for the Bounded Acceleration Shortest Path problem.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021


  Loading...