Graph-based algorithms for the efficient solution of a class of optimization problems
arXiv:1809.01970 · doi:10.1007/s10589-019-00070-4
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, we show that the proposed algorithms outperform generic commercial solvers.
27 pages, 9 figures, 1 table