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 more→→Adaptive 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Double Integrals: Definition and Setup → Iterated Integrals and Fubini's Theorem → Double Integrals over Rectangular Regions → Double Integrals over General Regions → Applications of Double Integrals: Area, Mass, and Moments → Triple Integrals in Cartesian Coordinates → Triple Integrals in Cylindrical and Spherical Coordinates → Change of Variables and the Jacobian Determinant → Applications of Triple Integrals: Volume and Mass → Vector Fields and Their Representations → Line Integrals of Vector Fields → Work and Circulation → Line Integrals of Scalar and Vector Functions → Fundamental Theorem for Line Integrals → Conservative Vector Fields → Conservative Vector Fields and Potential Functions → Curl and Divergence of Vector Fields → Curl and Divergence → Divergence Theorem → Electric Flux and Divergence Theorem → Gauss's Law: Integral Form and Meaning → Solving Problems with Gauss's Law → Conductors in Electrostatic Equilibrium → Capacitance and Capacitors → Dielectrics → Dielectric Constant and Relative Permittivity → Electric Field Inside Dielectric Materials → Dielectric Materials and Polarization → Dielectric Susceptibility and Permittivity → Energy Density in Electric Fields → Electric Current and Current Density → Electrical Resistance and Resistivity → Ohm's Law and Circuit Elements → Electromotive Force (EMF) and Batteries → Kirchhoff's Circuit Laws: Voltage and Current → DC Circuit Network Analysis Methods → Transient Response in RC Circuits → RC Circuits → First-Order Transient Circuit Response → Second-Order Transient Circuit Response → Feedback Control Fundamentals → Laplace Transform Methods for Control → Transfer Functions and System Modeling → Poles, Zeros, and System Stability → Characteristic Equation and Closed-Loop Stability → Routh-Hurwitz Stability Criterion → Root Locus Method → Root Locus Construction Rules → Root Locus Gain Design → Root Locus Method and Pole Placement Design → State Feedback Control and Pole Placement

Longest path: 136 steps · 912 total prerequisite topics

Prerequisites (3)

Leads To (4)