REVIEW
A Minimum-Footprint Implementation of Discrete-Time ADRC
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
A Minimum-Footprint Implementation of Discrete-Time ADRC
read the original abstract
To foster the adoption of active disturbance rejection control (ADRC) and support its deployment even on low-cost embedded systems, this article introduces the most efficient implementation of linear discrete-time ADRC to date. While maintaining all features and the exact performance characteristics of the state-space form, computational efforts and storage requirements are reduced to a minimum compared to all existing implementations. This opens up new possibilities to use ADRC in applications with high sample rates, tight timing constraints, or low computational power.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.