Stefano Ardizzoni

Orcid: 0000-0003-1426-0834

According to our database¹, Stefano Ardizzoni authored at least 12 papers between 2021 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ 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.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

A Dynamic Programming Approach for Road Traffic Estimation.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

Autom., 2024

2023

Solution Algorithms for the Bounded Acceleration Shortest Path Problem.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., March, 2023

Local Optimization of MAPF Solutions on Directed Graphs.

[BibT_eX]

[DOI]

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

2022

Constrained Multi-Agent Path Finding on Directed Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Shortest path with acceleration constraints: complexity and approximation algorithms.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2022

Multi-Agent Path Finding on Strongly Connected Digraphs.

[BibT_eX]

[DOI]

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

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Efficient solution algorithms for the Bounded Acceleration Shortest Path problem.

[BibT_eX]

[DOI]

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

Stefano Ardizzoni

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...