arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.01959math.OC
收藏

基于格理论的最小时间速度规划问题的求解

A solution of the minimum-time velocity planning problem based on lattice theory

Luca Consolini, Mattia Laurini, Marco Locatelli, Andrea Minari

摘要:

对于指定路径上的车辆,我们找到满足运动学和动力学约束的最小时间速度法,与最大速度和最大切向和横向加速度有关。我们提出了一个充要条件的可行性问题和一个简单的运营商,基于两个常微分方程的解决方案,计算的最优解。从理论上证明了问题的可行集如果不为空,则是一个格,其上确界元素对应于问题的最优解。

英文摘要:

For a vehicle on an assigned path, we find the minimum-time speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential and transversal acceleration. We present a necessary and sufficient condition for the feasibility of the problem and a simple operator, based on the solution of two ordinary differential equations, which computes the optimal solution. Theoretically, we show that the problem feasible set, if not empty, is a lattice, whose supremum element corresponds to the optimal solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑