Name
Title | ||
|---|---|---|
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. |
Abstract | ||
|---|---|---|
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and to the linear subcase. With numerical experiments, in the linear case we show that the proposed algorithms outperform generic commercial solvers. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10589-019-00070-4 | Comp. Opt. and Appl. |
Keywords | Field | DocType |
Computational methods, Acceleration of convergence, Dynamic programming, Linear programming, Complete lattices, 90C35, 90-08, 90-04, 65B99, 90C39, 06B23 | Graph,Dynamic programming,Mathematical optimization,Algorithm,Linear programming,Robot manipulator,Optimization problem,Monotone polygon,Mobile robot,Mathematics | Journal |
Volume | Issue | ISSN |
73 | 1 | 1573-2894 |
Citations | PageRank | References |
2 | 0.38 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Consolini | 1 | 276 | 31.16 |
| Mattia Laurini | 2 | 3 | 2.77 |
| Marco Locatelli | 3 | 926 | 80.28 |