Pith. sign in

REVIEW

FGLQR: Factor Graph Accelerator of LQR Control for Autonomous Machines

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 2308.02768 v1 pith:ZGHMFVA5 submitted 2023-08-05 cs.AR

FGLQR: Factor Graph Accelerator of LQR Control for Autonomous Machines

classification cs.AR
keywords autonomouscontrolfactorgraphfglqrabstractionacceleratoraccuracy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Factor graph represents the factorization of a probability distribution function and serves as an effective abstraction in various autonomous machine computing tasks. Control is one of the core applications in autonomous machine computing stacks. Among all control algorithms, Linear Quadratic Regulator (LQR) offers one of the best trade-offs between efficiency and accuracy. However, due to the inherent iterative process and extensive computation, it is a challenging task for the autonomous systems with real-time limits and energy constrained. In this paper, we present FGLQR, an accelerator of LQR control for autonomous machines using the abstraction of a factor graph. By transforming the dynamic equation constraints into least squares constraints, the factor graph solving process is more hardware friendly and accelerated with almost no loss in accuracy. With a domain specific parallel solving pattern, FGLQR achieves 10.2x speed up and 32.9x energy reduction compared to the software implementation on an advanced Intel CPU.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.