Name
Abstract | ||
|---|---|---|
This paper addresses the problem of finding time-optimal trajectories in two-dimensional space, where the mover's speed monotonically decreases or increases in one of the space's coordinates. We address such problems in different settings for the velocity function and in the presence of obstacles. First, we consider the problem without any obstacles. We show that the problem with linear speed decrease is reducible to the de l'Hôpital's problem, and that, for this case, the time-optimal trajectory is a circular segment. Next, we show that the problem with linear speed decreases and rectilinear obstacles can be solved in polynomial time by a dynamic program. Finally, we consider the case without obstacles, where the medium is non-uniform and the mover's velocity is a piecewise linear function. We reduce this problem to that of solving a system of polynomial equations of fixed degree, for which algebraic elimination theory allows us to solve the problem to optimality. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10957-014-0590-y | Journal of Optimization Theory and Applications |
Keywords | Field | DocType |
dynamic programming,optimization | Dynamic programming,Monotonic function,Mathematical optimization,Elimination theory,Mathematical analysis,System of polynomial equations,Cutting stock problem,Circular segment,Time complexity,Piecewise linear function,Mathematics | Journal |
Volume | Issue | ISSN |
165 | 2 | 1573-2878 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| André Berger | 1 | 81 | 7.59 |
| Alexander Grigoriev | 2 | 203 | 24.23 |
| Ralf L. M. Peeters | 3 | 62 | 22.61 |
| Natalya Usotskaya | 4 | 2 | 1.72 |