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

被引：4

作者：

Consolini, Luca ^{[1
]}

Laurini, Mattia ^{[1
]}

Locatelli, Marco ^{[1
]}

机构：

[1] Univ Parma, Dipartimento Ingn & Architettura, Parco Sci 181-A, I-43124 Parma, Italy

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2019年 / 73卷 / 01期

关键词：

Computational methods; Acceleration of convergence; Dynamic programming; Linear programming; Complete lattices;

D O I：

10.1007/s10589-019-00070-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：101 / 128

页数：28

共 18 条

[1] Discrete-time nonlinear HJB solution using approximate dynamic programming: Convergence proof [J].