activity
20212025
most citedMulti-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

9 citations · 28 across the 10 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021★ 8 cited

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms

Stefano Ardizzoni, Luca Consolini, Mattia Laurini +1

The purpose of this work is to introduce and characterize the Bounded Acceleration Shortest Path (BASP) problem, a generalization of the Shortest Path (SP) problem. This problem is…