FAME-QP:用於即時模型預測控制的GPU加速二次規劃求解器
FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control
研究速讀
作者提出FAME-QP,一個針對線性模型預測控制中稠密二次規劃問題的GPU加速求解器。它結合依賴約束的算子表示與經CUDA圖重播的融合單核與雙核迭代,並透過裝置校準與問題特定計時自動選擇執行配置;同時以快取算子庫選擇初始懲罰值,並在問題矩陣變動時延遲更新算子。作者稱基準測試與模擬人形及四旋翼控制實驗顯示延遲低於其他GPU求解器,且維持解精度與控制表現。
值得留意
- 方法結合依賴約束的算子表示、融合單核與雙核迭代,並以CUDA圖重播執行。
- 透過裝置校準與問題特定計時自動選擇執行配置,並用快取算子庫選擇初始懲罰值。
- 作者稱數值基準與模擬人形、四旋翼控制實驗顯示延遲降低,同時維持解精度與控制表現。
閱讀限制
僅依標題與摘要整理,未讀全文,無法核實實驗設定、基準求解器、延遲數據與精度指標,也未知是否公開程式碼或經同儕審查。
原始摘要 [EN]
We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control. FAME-QP combines constraint-dependent operator representations with fused single- and two-kernel iterations replayed through CUDA graphs, automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change. Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.
AI 摘要僅根據公開標題與摘要整理;研究結論來自作者,請以原文為準。