10 citations · 55 across the 19 of their papers we have counts for
22 papers
Hidden convexity property of a speed planning problem
Stefano Ardizzoni, Luca Consolini, Mattia Laurini +1
In this paper we address the speed planning problem for a vehicle along a predefined path. A weighted average of two (conflicting) terms, energy consumption and travel time, is min…
Speed planning by minimizing travel time and energy consumption
Stefano Ardizzoni, Luca Consolini, Mattia Laurini +1
In this paper we address the speed planning problem for a vehicle over an assigned path with the aim of minimizing a weighted sum of travel time and energy consumption under suitab…
Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs
Irene Saccani, Stefano Ardizzoni, Luca Consolini +1
Among sub-optimal Multi-Agent Path Finding (MAPF) solvers, rule-based algorithms are particularly appealing since they are complete. Even in crowded scenarios, they allow finding a…
A Dynamic Programming Approach for Road Traffic Estimation
Mattia Laurini, Irene Saccani, Stefano Ardizzoni +2
We consider a road network represented by a directed graph. We assume to collect many measurements of traffic flows on all the network arcs, or on a subset of them. We assume that…
A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs
Giulia Di Credico, Luca Consolini, Mattia Laurini +4
We address the problem of parameter identification for the standard pharmacokinetic/pharmacodynamic (PK/PD) model for anesthetic drugs. Our main contribution is the development of…
Identification of Cyclists' Route Choice Criteria
Stefano Ardizzoni, Mattia Laurini, Rafael Praxedes +2
The behavior of cyclists when choosing the path to follow along a road network is not uniform. Some of them are mostly interested in minimizing the travelled distance, but some oth…