A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

State Feedback Control and Pole Placement

Research Depth 135 in the knowledge graph I know this Set as goal
4topics build on this
912prerequisites beneath it
See this on the map →
Controllability and ObservabilityState-Space Representation+1 moreAdaptive Control TheoryModel Predictive Control (Advanced)+2 more
state-feedback pole-placement state-space design

Core Idea

State feedback u = -Kx moves closed-loop poles to arbitrary locations (if system is controllable) by feeding back weighted state variables. Unlike transfer function design, state feedback directly assigns poles without iterative methods. Design involves: (1) specifying desired closed-loop poles from performance specs, (2) computing feedback gain K using pole placement, (3) verifying stability and margins.

Explainer

You already know that a system in state-space form evolves as ẋ = Ax + Bu. The matrix A determines the open-loop poles — the eigenvalues of A — which govern whether the natural response decays, grows, or oscillates. If those eigenvalues are in the right half-plane, the system is unstable. The core idea of state feedback is that you can modify those eigenvalues by feeding the state back through a gain matrix K, setting u = −Kx. Substituting into the state equation gives ẋ = (A − BK)x, so the closed-loop poles are the eigenvalues of (A − BK). By choosing K appropriately, you move those eigenvalues to wherever you want them.

This is where controllability — your other prerequisite — becomes essential. The pole placement theorem states that you can assign the eigenvalues of (A − BK) to any set of locations in the complex plane if and only if the system is controllable. A system fails controllability if some mode of the dynamics is completely disconnected from the input — no choice of K can affect an uncontrollable mode because the control signal never reaches it. Once you've confirmed controllability, you translate your performance specifications (desired settling time, damping ratio, bandwidth) into a set of desired closed-loop pole locations, then solve for K. For low-order systems (2nd or 3rd order), you can do this by hand by matching characteristic polynomials; for higher-order systems, Ackermann's formula or numerical methods are standard.

The design trade-off is cost of control effort. Placing poles far into the left half-plane gives fast, well-damped responses, but requires large gains in K, which means large actuator commands. High-gain feedback amplifies sensor noise and can saturate actuators, causing real systems to behave very differently from the linear model. A useful intuition: each unit of speed you demand from your closed-loop system tends to cost proportionally more in control energy. A well-designed state feedback controller balances response speed against the practical limits of the actuator.

Consider an inverted pendulum — unstable open-loop, with a pole in the right half-plane. The control task is to compute the cart force u at each instant based on the full state (cart position, cart velocity, angle, angular rate) to keep the pendulum upright. With full state feedback u = −Kx, you choose K so that all four closed-loop poles land in the left half-plane at locations that give acceptable transient response. This is precisely what happens in practice with self-balancing robots: they measure the complete state many times per second and apply state feedback to stay upright. The mathematical design step — selecting K — is elegant, but real engineering challenges lie in obtaining the full state (which motivates the observer design that builds on this topic).

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication 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 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-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 IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionDouble 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 FieldsWork and CirculationLine Integrals of Scalar and Vector FunctionsFundamental Theorem for Line IntegralsConservative Vector FieldsConservative Vector Fields and Potential FunctionsCurl and Divergence of Vector FieldsCurl and DivergenceDivergence TheoremElectric Flux and Divergence TheoremGauss's Law: Integral Form and MeaningSolving Problems with Gauss'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 CircuitsFirst-Order Transient Circuit ResponseSecond-Order Transient Circuit ResponseFeedback Control FundamentalsLaplace Transform Methods for ControlTransfer Functions and System ModelingPoles, Zeros, and System StabilityCharacteristic Equation and Closed-Loop StabilityRouth-Hurwitz Stability CriterionRoot Locus MethodRoot Locus Construction RulesRoot Locus Gain DesignRoot Locus Method and Pole Placement DesignState Feedback Control and Pole Placement

Longest path: 136 steps · 912 total prerequisite topics

Prerequisites (3)

Leads To (4)