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

Full description

Saved in:
Bibliographic Details
Published inComputational optimization and applications Vol. 73; no. 1; pp. 101 - 128
Main Authors Consolini, Luca, Laurini, Mattia, Locatelli, Marco
Format Journal Article
LanguageEnglish
Published New York Springer US 01.05.2019
Springer Nature B.V
Subjects
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
Online AccessGet full text
ISSN0926-6003
1573-2894
DOI10.1007/s10589-019-00070-4

Cover

More Information
Summary: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.
Bibliography: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