Graph-based algorithms for the efficient solution of optimization problems involving monotone functions

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 l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational optimization and applications Ročník 73; číslo 1; s. 101 - 128
Hlavní autoři: Consolini, Luca, Laurini, Mattia, Locatelli, Marco
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2019
Springer Nature B.V
Témata:
Algorithms
Convex and Discrete Geometry
Dynamic programming
Management Science
Mathematics
Mathematics and Statistics
Monotone functions
Operations Research
Operations Research/Decision Theory
Optimization
Robot arms
Solvers
Statistics
06B23
65B99
Computational methods
90-04
90C35
Acceleration of convergence
90-08
90C39
Linear programming
Dynamic programming
Complete lattices
ISSN:0926-6003, 1573-2894
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-019-00070-4