AccelMPC: High-Rate, Low-Power FPGA-Accelerated Model Predictive Control for Tiny Drones

• URL: http://arxiv.org/abs/2609.09380v1
• Date: Tue, 08 Sep 2026 19:27:13 GMT
• Title: AccelMPC: High-Rate, Low-Power FPGA-Accelerated Model Predictive Control for Tiny Drones
• Abstract summary: AccelMPC is an end-to-end co-design approach that jointly optimize the solver algorithm, numerical representation, hardware mapping, and physical integration.<n> Hardware experiments demonstrate 1 kHz onboard constrained MPC with dynamic obstacles, up to 15.6x faster solve times and 195.4x improvement in energy-delay product over state-of-the-art embedded microcontroller-based solvers.<n>We release our PCB design files, firmware, and FPGA solver code open source.
• Score: 8.687394126824639
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unlocking the potential of tiny aerial robots requires order of magnitude improvements in the performance of embedded edge control. In particular, although recent cached model predictive control (MPC) solvers can handle the fast system dynamics and complex constraints required for agile drone flight, their computational demands remain prohibitive for resource-constrained robots, forcing prior implementations to operate at reduced control rates. AccelMPC overcomes this challenge through an end-to-end co-design approach that jointly optimizes the solver algorithm, numerical representation, hardware mapping, and physical integration. AccelMPC pairs a co-designed FPGA-accelerated alternating direction method of multipliers (ADMM)-based MPC solver with a custom 6g PCB, providing high-bandwidth communication for deployment on a 35g Crazyflie. Hardware experiments demonstrate 1 kHz onboard constrained MPC with dynamic obstacles, up to 15.6x faster solve times and 195.4x improvement in energy-delay product over state-of-the-art embedded microcontroller-based solvers, all while scaling to optimization problems with over 20,000 optimization variables and a comparable number of constraints. We release our PCB design files, firmware, and FPGA solver code open source.

Related papers

• Device-Conditioned Neural Architecture Search for Efficient Robotic Manipulation [16.017058636822025]
  We propose a unified framework named textbfDevice-textbfConditioned textbfQuantization-textbfFor-textbfAll (DC-QFA)<n>DC-QFA amortizes deployment effort with the device-conditioned quantization-aware training and hardware-constrained architecture search.
  arXiv  Detail & Related papers  (2026-04-11T11:36:16Z)
• OpenACMv2: An Accuracy-Constrained Co-Optimization Framework for Approximate DCiM [12.339184350839451]
  Digital Compute-in-Memory (DCiM) accelerates neural networks by reducing data movement.<n>DCiM can further improve power-performance-area ( PPA), but demands accuracy-constrained co-optimization.<n>We present OpenACMv2, an open framework that operationalizes ACCO via two-level optimization.
  arXiv  Detail & Related papers  (2026-03-13T14:50:52Z)
• Real-Time, Energy-Efficient, Sampling-Based Optimal Control via FPGA Acceleration [8.086534156824486]
  We present an FPGA-optimized MPPI design that exposes fine-grained parallelism and eliminates synchronization bottlenecks.<n>This results in an average 3.1x to 7.5x speedup over optimized implementations on an embedded GPU and CPU, respectively, while simultaneously achieving a 2.5x to 5.4x reduction in energy usage.
  arXiv  Detail & Related papers  (2026-01-23T23:47:09Z)
• Adaptive Reinforcement and Model Predictive Control Switching for Safe Human-Robot Cooperative Navigation [10.614812216110673]
  This paper addresses the challenge of human-guided navigation for mobile collaborative robots under simultaneous proximity regulation and safety constraints.<n>We introduce Adaptive Reinforcement and Model Predictive Control Switching (ARMS), a hybrid learning-control framework.<n>We show that ARMS achieves an 82.5 percent success rate in highly cluttered environments.
  arXiv  Detail & Related papers  (2026-01-23T12:02:18Z)
• Fine-Tuning of Neural Network Approximate MPC without Retraining via Bayesian Optimization [81.35990332700389]
  Approximate model-predictive control (AMPC) aims to imitate an MPC's behavior with a neural network.<n>During deployment, the parameters of the underlying MPC must usually be fine-tuned.<n>Recent work addresses this problem by adapting AMPC without retraining using approximated sensitivities of the MPC's optimization problem.
  arXiv  Detail & Related papers  (2025-12-16T12:24:08Z)
• Cost Minimization for Space-Air-Ground Integrated Multi-Access Edge Computing Systems [60.586531406445744]
  Space-air-ground integrated multi-altitude edge computing (SAGIN-MEC) provides a promising solution for the rapidly developing low-altitude economy.<n>We present a SAGIN-MEC architecture that enables the coordination between user devices (UDs), uncrewed aerial vehicles (UAVs) and satellites.
  arXiv  Detail & Related papers  (2025-10-24T15:03:07Z)
• Joint Transmit and Pinching Beamforming for Pinching Antenna Systems (PASS): Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed.<n>It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs)<n>The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design [66.39546326221176]
  Attention-based neural networks have become pervasive in many AI tasks. The use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources. This paper proposes a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs.
  arXiv  Detail & Related papers  (2022-09-20T09:28:26Z)
• An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformers [11.811907838840712]
  We propose an algorithm-hardware co-optimized framework to flexibly and efficiently accelerate Transformers by utilizing general N:M sparsity patterns. We present a flexible and efficient hardware architecture, namely STA, to achieve significant speedup when deploying N:M sparse Transformers. Experimental results show that compared to other methods, N:M sparse Transformers, generated using IDP, achieves an average of 6.7% improvement on accuracy with high training efficiency.
  arXiv  Detail & Related papers  (2022-08-12T04:51:49Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.