Name
Abstract | ||
|---|---|---|
Range reduction techniques often considerably enhance the performance of algorithmic approaches for the solution of nonconvex problems. In this paper we propose a range reduction technique for a class of optimization problems with some special structured constraints. The procedure explores and updates the values associated to the nodes of a suitably defined graph. Convergence of the procedure and some efficiency issues, in particular related to the order into which the nodes of the graph are explored. The proposed technique is applied to solve problems arising from a relevant practical application, namely velocity planning along a given trajectory. The computational experiments show the efficiency of the procedure and its ability of returning solutions within times much lower than those of nonlinear solvers and compatible with real-time applications. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10589-017-9978-6 | Comp. Opt. and Appl. |
Keywords | Field | DocType |
Range reduction,Velocity planning,Minimum-time problems,Local search | Convergence (routing),Graph,Mathematical optimization,Nonlinear system,Local search (optimization),Optimization problem,Trajectory,Mathematics | Journal |
Volume | Issue | ISSN |
70 | 1 | 0926-6003 |
Citations | PageRank | References |
1 | 0.39 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Cabassi | 1 | 1 | 0.39 |
| Luca Consolini | 2 | 276 | 31.16 |
| Marco Locatelli | 3 | 926 | 80.28 |