arXiv:2411.01286eess.SYcs.RO2024-11被引 10

用混合区域表示法加速自动驾驶规划,实现实时优化。

Mixed-Integer MPC-Based Motion Planning Using Hybrid Zonotopes with Tight Relaxations

  • 用混合区域表示非凸约束,构建分阶段整数二次规划模型。
  • 在多数情况下,求解速度比商用求解器快十倍以上。
  • 适合需要实时安全规划的嵌入式自动驾驶系统。

自动驾驶运动规划常涉及非凸约束,严重阻碍模型预测控制(MPC)在嵌入式硬件上的实时应用。本文提出一种基于混合区域表示障碍物自由空间的混合整数MPC高效求解方法。将MPC优化问题建模为多阶段混合整数二次规划(MIQP),利用混合区域对非凸约束进行表示,并在代价函数中为障碍物自由空间不同区域分配成本,实现风险感知规划。设计了一种利用混合区域结构的多阶段MIQP求解器;对于某些混合区域表示,其凸松弛是紧的(即等于凸包)。结合自动驾驶场景中的逻辑约束,该性质被用于分支定界整数求解器内生成紧致二次规划(QP)子问题。进一步利用混合区域结构减少QP子问题中的矩阵分解次数。仿真研究基于多面体地图和占用网格,验证了避障与风险感知规划的有效性。多数情况下,所提求解器找到最优解的速度比先进商业求解器快一个数量级。处理器在环测试表明该求解器适用于嵌入式硬件的实时实现。

原文摘要 · Abstract (English)

Autonomous vehicle (AV) motion planning problems often involve non-convex constraints, which present a major barrier to applying model predictive control (MPC) in real time on embedded hardware. This paper presents an approach for efficiently solving mixed-integer MPC motion planning problems using a hybrid zonotope representation of the obstacle-free space. The MPC optimization problem is formulated as a multi-stage mixed-integer quadratic program (MIQP) using a hybrid zonotope representation of the non-convex constraints. Risk-aware planning is supported by assigning costs to different regions of the obstacle-free space within the MPC cost function. A multi-stage MIQP solver is presented that exploits the structure of the hybrid zonotope constraints. For some hybrid zonotope representations, it is shown that the convex relaxation is tight, i.e., equal to the convex hull. In conjunction with logical constraints derived from the AV motion planning context, this property is leveraged to generate tight quadratic program (QP) sub-problems within a branch-and-bound mixed-integer solver. The hybrid zonotope structure is further leveraged to reduce the number of matrix factorizations that need to be computed within the QP sub-problems. Simulation studies are presented for obstacle-avoidance and risk-aware motion planning problems using polytopic maps and occupancy grids. In most cases, the proposed solver finds the optimal solution an order of magnitude faster than a state-of-the-art commercial solver. Processor-in-the-loop studies demonstrate the utility of the solver for real-time implementations on embedded hardware.

自动驾驶MPC整数规划实时优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。