Pole Placement via State Feedback and Observer Design

Research Depth 114 in the knowledge graph I know this Set as goal
Unlocks 10 downstream topics
pole-placement state-feedback observer eigenvalue-assignment

Core Idea

If system is controllable, state feedback u = -Kx can place closed-loop poles at arbitrary locations. Observer estimates unmeasured states from y; if observable, observer poles can be placed arbitrarily. Pole-placement design trade-off: faster response requires higher gain and larger control effort; observer poles typically placed faster than controller poles (separation principle).

Explainer

From your study of eigenvalues and eigenvectors, you know that the time evolution of a linear system ẋ = Ax is governed by the eigenvalues of A — they determine whether the system is stable, how fast it decays, and whether it oscillates. From observability and controllability, you know when it is *possible* in principle to steer the system's states and observe them. Pole placement is the design method that turns those theoretical possibilities into a concrete algorithm: choose a feedback gain matrix K so that the closed-loop eigenvalues — the poles — are exactly where you need them.

The algebra is direct. Applying full-state feedback u = −Kx to the system ẋ = Ax + Bu gives the closed-loop system ẋ = (A − BK)x. The eigenvalues of A − BK are the closed-loop poles, and they depend on K. If the system is controllable, the Cayley-Hamilton theorem guarantees that K can be chosen (via Ackermann's formula or direct comparison) to make A − BK have any desired characteristic polynomial — meaning any desired set of eigenvalues. The desired poles encode your performance objectives: poles on the real axis give non-oscillatory response; complex conjugate pairs give damped oscillation with frequency ω_n and damping ratio ζ; poles further left in the complex plane give faster decay. The tradeoff is unavoidable: faster poles require larger entries in K, which means larger control inputs u = −Kx, which eventually saturates actuators, amplifies sensor noise, and makes the design sensitive to modeling errors.

The catch is that full-state feedback requires knowing all n states x(t) at every instant, but you typically only measure the output y = Cx — a low-dimensional projection of the state. An observer (Luenberger observer) solves this problem by running a software copy of the system in parallel: x̂̇ = Ax̂ + Bu + L(y − Cx̂). The observer gets the same input u and has access to the measurement y. The correction term L(y − Cx̂) is the innovation — the discrepancy between the actual measured output and the model's predicted output — multiplied by the observer gain matrix L. If the system is observable, you can choose L to make the estimation error e = x − x̂ decay at any desired rate: the error dynamics ė = (A − LC)e have eigenvalues set by L exactly as the controller eigenvalues were set by K. The rule of thumb is to place observer poles two to five times faster than the controller poles, so the estimated states converge before the controller dynamics are visible.

The separation principle is the elegant result that makes this two-piece architecture coherent. When you connect the observer to the controller — using x̂ instead of x in the feedback law u = −Kx̂ — the combined closed-loop system's eigenvalues are simply the union of the controller poles (from K) and the observer poles (from L). They do not interact. This means you can design K and L independently — first choose K to achieve the desired closed-loop response assuming perfect state knowledge, then choose L to make the estimated state converge fast enough that the approximation holds — and the resulting combined system behaves as intended. The separation principle is the theoretical justification for the standard control engineering workflow: specify response, design state feedback, design observer, implement together. It transforms a hard joint optimization into two independent, tractable design steps.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIterated Integrals and Fubini's TheoremDouble Integrals in Cartesian CoordinatesDouble Integrals over Rectangular RegionsDouble Integrals in Polar CoordinatesDouble Integrals: Definition and SetupIterated Integrals and Fubini's TheoremDouble Integrals over Rectangular RegionsDouble Integrals over General RegionsApplications of Double Integrals: Area, Mass, and MomentsTriple Integrals in Cartesian CoordinatesTriple Integrals in Cylindrical and Spherical CoordinatesChange of Variables and the Jacobian DeterminantApplications of Triple Integrals: Volume and MassVector Fields and Their RepresentationsLine Integrals of Vector FieldsGreen's TheoremSurface Integrals and Flux of Vector FieldsSurface Integrals and Flux of Vector FieldsDivergence Theorem: Flux and OutflowDivergence TheoremElectric FluxGauss's LawConductors in Electrostatic EquilibriumCapacitance and CapacitorsDielectricsDielectric Constant and Relative PermittivityElectric Field Inside Dielectric MaterialsDielectric Materials and PolarizationDielectric Susceptibility and PermittivityEnergy Density in Electric FieldsElectric Current and Current DensityElectrical Resistance and ResistivityOhm's Law and Circuit ElementsElectromotive Force (EMF) and BatteriesKirchhoff's Circuit Laws: Voltage and CurrentDC Circuit Network Analysis MethodsTransient Response in RC CircuitsRC CircuitsLC and RLC CircuitsSecond-Order Transient Circuit ResponseFeedback Control FundamentalsLaplace Transform Methods for ControlTransfer Functions and System ModelingState-Space RepresentationState-Space to Transfer Function ConversionState-Space Canonical Forms: Controllable and Observable FormsState Transformations and Similarity TransformationsTests for Controllability and ObservabilityPole Placement via State Feedback and Observer Design

Longest path: 115 steps · 618 total prerequisite topics

Prerequisites (3)

Leads To (1)