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

Luca Consolini (), Mattia Laurini () and Marco Locatelli ()
Additional contact information
Luca Consolini: Università degli Studi di Parma
Mattia Laurini: Università degli Studi di Parma
Marco Locatelli: Università degli Studi di Parma

Computational Optimization and Applications, 2019, vol. 73, issue 1, No 4, 128 pages

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

Keywords: Computational methods; Acceleration of convergence; Dynamic programming; Linear programming; Complete lattices; 90C35; 90-08; 90-04; 65B99; 90C39; 06B23 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00070-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:73:y:2019:i:1:d:10.1007_s10589-019-00070-4

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-019-00070-4

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().