Pith. sign in

REVIEW 1 cited by

Neuromorphic quadratic programming for efficient and scalable model predictive control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.14885 v3 pith:PJEUZHXN submitted 2024-01-26 cs.NE cs.ETcs.RO

classification cs.NEcs.ETcs.RO
keywords problemsarchitecturescontrolneuromorphicoptimizationapplicationscomparededge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Applications in robotics or other size-, weight- and power-constrained autonomous systems at the edge often require real-time and low-energy solutions to large optimization problems. Event-based and memory-integrated neuromorphic architectures promise to solve such optimization problems with superior energy efficiency and performance compared to conventional von Neumann architectures. Here, we present a method to solve convex continuous optimization problems with quadratic cost functions and linear constraints on Intel's scalable neuromorphic research chip Loihi 2. When applied to model predictive control (MPC) problems for the quadruped robotic platform ANYmal, this method achieves over two orders of magnitude reduction in combined energy-delay product compared to the state-of-the-art solver, OSQP, on (edge) CPUs and GPUs with solution times under ten milliseconds for various problem sizes. These results demonstrate the benefit of non-von-Neumann architectures for robotic control applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal Preconditioning for Online Quadratic Cone Programming

    math.OC 2025-01 accept novelty 5.0 of 10

    For quadratic cone programs with strongly convex objectives, choosing the objective scaling factor as sqrt(sigma_min / 2) provably minimizes the KKT condition number, and packaging this with hypersphere and row-normal...

Pith tools