GPU-Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control

This work considers the dual gradient-projection algorithm (GPAD), a lightweight quadratic programming (QP) solver for real-time embedded model predictive control (MPC) applications, and investigates the use of massively parallel processors in expediting its computation. Furthermore, we expand on the initial parallel implementation by taking into consideration the advantages that come with ELLPACK (ELL) matrix compression, using the GPU's shared memory, and caching our constants of interest. Our findings demonstrate that storing linear time-invariant (LTI) matrices in constant memory, combined with coalesced memory accesses, significantly reduces computation time, achieving a 38.9x speedup compared to the CPU implementation. Reduction and warp-level tiling introduce further timing improvements.

Authors

Institutions

Publication Details

Published
2025-04-05
DOI
https://doi.org/10.1109/icmi65310.2025.11141179
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPU-Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control

Shadi Alawneh, Luke Nuculaj, Joseph Volcic
Advanced Control Systems Optimization
article

GPU-Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control

Shadi Alawneh, Luke Nuculaj, Joseph Volcic
article en

Abstract

This work considers the dual gradient-projection algorithm (GPAD), a lightweight quadratic programming (QP) solver for real-time embedded model predictive control (MPC) applications, and investigates the use of massively parallel processors in expediting its computation. Furthermore, we expand on the initial parallel implementation by taking into consideration the advantages that come with ELLPACK (ELL) matrix compression, using the GPU's shared memory, and caching our constants of interest. Our findings demonstrate that storing linear time-invariant (LTI) matrices in constant memory, combined with coalesced memory accesses, significantly reduces computation time, achieving a 38.9x speedup compared to the CPU implementation. Reduction and warp-level tiling introduce further timing improvements.

Oakland University (US)
Openalex Percentile: Top 71%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.