arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.08020cs.ROcs.SYeess.SY

具有可扩展预测时域的鲁棒机动规划:一种移动阻塞方法

Robust Maneuver Planning With Scalable Prediction Horizons: A Move Blocking Approach

Institute of Flight Systems, German Aerospace Center (DLR)(德国航空航天中心飞行系统研究所);Institute for Production Technology and Systems, Leuphana University of Lueneburg(吕讷堡勒法纳大学生产技术与系统研究所)

Philipp Schitz, Johann C. Dauer, Paolo Mercorelli

AI总结:

针对计算资源有限硬件上长距离机动MPC难以部署的问题,提出基于移动阻塞的管域收缩时域MPC及约束削减方法,可在轨迹成本小幅增加的前提下将计算时间降低一个数量级,支持长预测时域的鲁棒机动规划。

摘要:

在计算资源有限的硬件上实现模型预测控制(MPC)仍是一项挑战。尤其是对于需要小采样时间的长距离机动,所需的时域长度使其无法在机载计算机上应用。本文提出了一种计算高效的基于管域的收缩时域MPC,可扩展至长预测时域。通过移动阻塞(move blocking)方法,我们确保在整个机动过程中高效利用给定数量的决策输入。接着,本文介绍了一种可大幅减少约束数量的方法。该方法通过直升机在倾斜平台上着陆的场景进行验证,采用300步的预测时域。约束减少方法将计算时间降低了一个数量级,仅带来轨迹成本的小幅上升。

英文摘要:

Implementation of Model Predictive Control (MPC) on hardware with limited computational resources remains a challenge. Especially for long-distance maneuvers that require small sampling times, the necessary horizon lengths prevent its application on onboard computers. In this paper, we propose a computationally efficient tubebased shrinking horizon MPC that is scalable to long prediction horizons. Using move blocking, we ensure that a given number of decision inputs is efficiently used throughout the maneuver. Next, a method to substantially reduce the number of constraints is introduced. The approach is demonstrated with a helicopter landing on an inclined platform using a prediction horizon of 300 steps. The constraint reduction decreases the computation time by an order of magnitude with a slight increase in trajectory cost.

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

↑