Minimum-time Speed Optimisation over a Fixed Path
Abstract¶
In this paper we investigate the problem of optimising the speed of a vehicle over a fixed path for minimum time traversal. We utilise a change of variables that has been known since the 1980s, although the resulting convexity of the problem was not noted until recently. The contributions of this paper are three fold. First, we extend the convexification of the problem to a more general framework. Second, we identify a wide range of vehicle models and constraints which can be included in this expanded framework. Third, we develop and implement an algorithm that allows these problems to be solved in real time, on embedded systems, with a high degree of accuracy.
Summary¶
Formulates minimum-time speed planning along a fixed geometric path as a convex optimization problem.