arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.12641math.OCcs.RO
收藏

基于Optimization的轨迹规划与控制中避碰约束的有效表达

Efficient Formulation of Collision Avoidance Constraints in Optimization Based Trajectory Planning and Control

Kiel University(基尔大学)

Max Lutz, Thomas Meurer

摘要:

为了适用于现实世界的情况下,移动自主系统的轨迹规划方案必须能够有效地处理在操作区域中的障碍物。在基于优化的轨迹规划和控制的背景下,可以在文献中找到许多不同的方法来制定防撞约束。在这里,本工作的贡献是双重的。首先,最流行的方法来表示障碍物,即简单的椭球表示,构造性立体几何(CSG)的方法,以及直接和间接实现的符号距离为基础的方法进行了总结。制剂的特点是相对于最优化问题的复杂性的影响,以及满足不同的问题要求的能力。其次,这项工作提出了一种新的变形CSG方法来描述避碰约束。它是非常高效的,由于一个非常低的数量的非线性不等式约束所需的一个给定数量的障碍物和样本点,并与原来的CSG制定允许考虑受控系统的形状。通过与先前提到的替代品的比较,证明了所提出的制剂的良好性能。为此,将制定为非线性规划问题的海洋水面船舶最佳轨迹规划用作基准示例,其中该场景是基于德国基尔的海事测试场设计的。

英文摘要:

To be applicable to real world scenarios trajectory planning schemes for mobile autonomous systems must be able to efficiently deal with obstacles in the area of operation. In the context of optimization based trajectory planning and control a number of different approaches to formulate collision avoidance constraints can be found in the literature. Here the contribution of the present work is twofold. First, the most popular methods to represent obstacles are summarized, namely the simple ellipsoidal representation, the constructive solid geometry (CSG) method as well as a direct and an indirect implementation of a signed distance based approach. The formulations are characterized with respect to the impact on the complexity of the optimization problem, as well as the ability to meet different problem requirements. Second, this work presents a novel variant of the CSG method to describe collision avoidance constraints. It is highly efficient due to a very low number of nonlinear inequality constraints required for a given number of obstacles and sample points and in contrast to the original CSG formulation allows to consider the controlled system's shape. The good performance of the proposed formulation is demonstrated by a comparison to the previously mentioned alternatives. To this end optimal trajectory planning for marine surface vessels formulated as a nonlinear programming problem is used as a benchmark example where the scenario is designed based on the maritime test field in Kiel, Germany.

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

↑