Speed planning by minimizing travel time and energy consumption
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909695502974976 |
|---|---|
| author | Ardizzoni, Stefano Consolini, Luca Laurini, Mattia Locatelli, Marco |
| author_facet | Ardizzoni, Stefano Consolini, Luca Laurini, Mattia Locatelli, Marco |
| contents | 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 suitable constraints (maximum allowed speed, maximum traction or braking force, maximum power consumption). The resulting mathematical model is a non--convex optimization problem. We prove that, under some mild assumptions, a convex reformulation of the non--convex problem is exact. In particular, the convex reformulation is a Second Order Cone Programming (SOCP) problem, for which efficient solvers exist. Through the numerical experiments we confirm that the convex relaxation can be solved very efficiently and, moreover, we also provide the Pareto front of the trade-off between the two objectives (travel time and energy consumption). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09468 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Speed planning by minimizing travel time and energy consumption Ardizzoni, Stefano Consolini, Luca Laurini, Mattia Locatelli, Marco Optimization and Control 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 suitable constraints (maximum allowed speed, maximum traction or braking force, maximum power consumption). The resulting mathematical model is a non--convex optimization problem. We prove that, under some mild assumptions, a convex reformulation of the non--convex problem is exact. In particular, the convex reformulation is a Second Order Cone Programming (SOCP) problem, for which efficient solvers exist. Through the numerical experiments we confirm that the convex relaxation can be solved very efficiently and, moreover, we also provide the Pareto front of the trade-off between the two objectives (travel time and energy consumption). |
| title | Speed planning by minimizing travel time and energy consumption |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2502.09468 |