---
title: Prescribed Performance Control
url: https://www.emergentmind.com/topics/prescribed-performance-control-ppc
type: topic
---

# Prescribed Performance Control

Prescribed Performance Control (PPC) is a control design paradigm that constrains tracking errors to evolve within designer-specified time-varying bounds, often described as performance envelopes or funnels, so that transient and steady-state requirements such as maximum overshoot, convergence rate, and terminal accuracy are encoded directly in the control problem. Across the formulations reported for strict-feedback nonlinear systems, underactuated aerial vehicles, spacecraft attitude dynamics, heterogeneous multi-agent systems, underwater gliders, sampled-data systems, and systems with delays, PPC is used to guarantee inequalities of the form $|e(t)|<\rho(t)$ or their asymmetric counterparts, while the controller is designed on transformed or normalized errors so that the original constrained error remains inside the prescribed set for all relevant times [2206.06275], [2210.06038], [2602.14382].

## 1. Core formulation and prescribed-performance envelopes

At its most standard, PPC specifies a scalar tracking-error constraint by prescribing a positive performance function and requiring the error to remain inside it:
\[
-\rho(t)<e(t)<\rho(t),\qquad t\ge 0,
\]
or, more generally, an asymmetric bound such as
\[
-\delta_{L,i}P_i(t)<e_i(t)<\delta_{R,i}P_i(t).
\]
The function $\rho(t)$ or $P_i(t)$ is smooth, positive, and usually decreasing, thereby encoding initial admissible error, transient contraction, and a nonzero terminal bound [2206.06275], [2512.20748].

A common exponential choice is
\[
\rho(t)=(\rho_0-\rho_\infty)e^{-\lambda t}+\rho_\infty,
\]
with $\rho_0>\rho_\infty>0$ and $\lambda>0$. This directly specifies the initial envelope, the contraction rate, and the steady-state accuracy. Closely related exponential envelopes appear in spacecraft pointing, unknown strict-feedback systems with input constraints, and hybrid-gain sliding-mode designs [2602.14382], [2210.06038], [2209.05801].

The same idea is also used in funnel-control language. For reentry vehicles, the admissible set is written as
\[
\Gamma_{\varphi_i}:=\{(t,e_i)\mid \varphi_i(t)|e_i|<1\},
\]
with $\bar\rho_i(t)=1/\varphi_i(t)$ interpreted as the funnel boundary. In that formulation, prescribed performance means that the tracking error remains within a time-varying funnel whose width can itself be redesigned during maneuver phases [2308.00367].

The envelope need not be symmetric or fixed-shape. In heterogeneous UAV–UGV formation control, the position error is constrained by
\[
-\underline\delta_i(t)\rho_{\varepsilon_i}(t)<\varepsilon_{pi}<\bar\delta_i(t)\rho_{\varepsilon_i}(t),
\]
where the time-varying bounds $\underline\delta_i(t)$ and $\bar\delta_i(t)$ adapt to actuator saturation. In underwater-glider path following, different left and right margins are used through $\delta_{L,i}$ and $\delta_{R,i}$, so that PPC explicitly accommodates asymmetric overshoot allowances [2504.07668], [2512.20748].

These formulations indicate a unifying viewpoint: PPC does not primarily prescribe a controller structure, but rather a state-dependent inequality that must remain true throughout closed-loop evolution.

## 2. Error normalization, transformations, and performance-function design

The basic PPC mechanism introduces a normalized error, typically
\[
\xi(t)=\frac{e(t)}{\rho(t)},
\]
or one of its asymmetric generalizations, and then maps the constrained interval for $\xi$ into an unconstrained variable. A canonical choice is the logarithmic barrier-type mapping
\[
\epsilon=\frac{1}{2}\ln\!\left(\frac{1+\xi}{1-\xi}\right),
\]
which appears in observer and formation-error transformations for heterogeneous multi-agent systems and in standard PPC constructions for underactuated quadrotors [2504.07668], [2206.06275].

Several works depart from this logarithmic form. One line uses barrier Lyapunov functions directly on the normalized error instead of an explicit logarithmic state transformation. For spacecraft reduced-attitude pointing, the barrier term
\[
V_B(\varepsilon_q)=gF\ln\!\big[\cosh(\varepsilon_q/F)\big]
\]
is defined on
\[
\varepsilon_q=\frac{x_e}{\rho_q},
\]
so that the PPC layer is combined with obstacle-avoidance logic without relying on the standard PPC logarithmic map [2209.05801].

Another line embeds the constraint through a smooth inverse-error-function representation:
\[
x(t)=\rho(t)\,\mathrm{erf}(\xi(t)),\qquad 
\xi(t)=\mathrm{erf}^{-1}\!\left(\frac{x(t)}{\rho(t)}\right).
\]
Because $\mathrm{erf}(\cdot)\in(-1,1)$ for finite arguments, boundedness of $\xi$ implies $|x(t)|<\rho(t)$. This construction is central to the prescribed-performance-aware hybrid-gain finite-time sliding-mode controller [2602.14382].

Funnel-control variants use barrier factors directly in the feedback gain. For reentry vehicles,
\[
\varpi_i(t)=\varphi_i(t)e_i(t),\qquad 
k_i(t)=\frac{1}{1-\varpi_i^2(t)},
\]
so the gain diverges as the normalized error approaches the funnel boundary, preventing boundary crossing. That paper further replaces the usual monotone funnel by a time-triggered non-monotonic boundary built from exponential and cubic segments, allowing temporary widening during planned maneuvers [2308.00367].

A distinct singularity-avoidance route is the shear mapping-based error transformation
\[
\varepsilon_{si}=\mathcal{R}\big(z_{si}-\varepsilon_{si}\tan\theta\big),
\]
introduced for perturbed high-order systems. The purpose is global non-singularity: even if the normalized error temporarily leaves the conventional admissible interval because of abrupt reference changes, the transformed variable remains well defined [2508.13726].

Performance functions themselves also vary substantially across the literature. In addition to the exponential form, reported designs include:

\[
\rho_i(t)=
\begin{cases}
\rho_\infty \csc\!\left(\dfrac{\pi t}{2T}\right), & t\le T,\\[4pt]
\rho_\infty, & t>T,
\end{cases}
\]
for multi-agent observer and formation errors, which permits arbitrarily large initial errors and then enforces a prescribed steady-state bound after time $T$ [2504.07668];

\[
P(t)=
\begin{cases}
\mathrm{sech}\!\left(\mathrm{sech}(P_0)\,\dfrac{T}{T-t}\right)+P_\infty, & 0\le t<T,\\[4pt]
P_\infty, & t\ge T,
\end{cases}
\]
for finite-time performance in underwater gliders, where the bound reaches its final value at a preset time and then stays constant [2512.20748];

and a freezing performance-rate function for prescribed-time PPC,
\[
\mu(t)=
\begin{cases}
\mu_T+\dfrac{(\mu_0-\mu_T)(T-t)^2}{(\upsilon_\mu^2+1)t^2+T^2-2Tt}, & t\in[0,T),\\[6pt]
\mu_T, & t\in[T,\infty),
\end{cases}
\]
which is used both as a performance function and as a rate function, with $\dot\mu(0)=0$ to reduce initial control effort [2601.14882].

Taken together, these designs suggest that PPC is better understood as a family of envelope-generation and constraint-embedding mechanisms than as a single normalized-error formula.

## 3. Controller architectures built around PPC

PPC is commonly embedded in backstepping, dynamic surface control, sliding-mode, and gradient-based architectures. In underactuated quadrotor tracking, a hierarchical PPC structure is used: position PPC generates a reference velocity, velocity PPC generates thrust and tilt-map commands, attitude PPC tracks tilt-map and yaw, and angular-rate PPC closes the inner loop, all without using model parameters or disturbance estimates [2206.06275].

Backstepping remains one of the most common realizations. For spacecraft reduced-attitude pointing under forbidden directions, the first-layer error is the normalized pointing error, the virtual control is a desired angular velocity that blends PPC attraction and artificial-potential-field terms, and the second layer uses the backstepping error
\[
e_2=\omega_s-v
\]
with torque injection along both the PPC and APF gradient directions [2209.05801].

Dynamic surface control is used to avoid the repeated differentiation of virtual controls. In practical prescribed-time PPC with asymptotic convergence, the transformed first-layer error is
\[
z_1=\frac{x_1-\alpha_0^c}{\rho(t)},
\]
higher-order errors are defined recursively, and nonlinear filters
\[
\dot{\alpha}_i^c
=
-\varsigma_{\omega_i}\sigma_1(t)\omega_i
-\kappa_i\omega_i
-\frac{\hat{\gamma}_i^2\omega_i}{\sqrt{\hat{\gamma}_i^2\omega_i^2+\varepsilon^2}}
\]
replace direct differentiation of virtual controls [2601.14882].

Sliding-mode-based PPC designs are also prominent. In heterogeneous UAV–UGV systems, the transformed formation error is used to define a sliding surface
\[
s_i=\lambda_{si}\epsilon_i+\dot\epsilon_i,
\]
and the distributed controller is synthesized so that the surface dynamics reduce to
\[
\dot s_i=r_{si}(-k_{si}s_i+\tilde z_{vi}),
\]
thereby guaranteeing prescribed bounds on formation and observer errors despite communication failures and actuator saturation [2504.07668].

The prescribed-performance-aware hybrid-gain finite-time sliding-mode controller combines PPC with a hybrid gain law. In the first-order case,
\[
u(t)=\dot\rho(t)\Psi(\xi(t))-\frac{1}{\chi(t,\xi(t))}G_{\mathrm{hyb}}(\xi)\,\mathrm{sgn}(\xi),
\]
and in the second-order case the sliding variable is
\[
s(t)=e_2(t)+c\,\Psi(\xi(t)).
\]
The hybrid gain is piecewise, with outer and inner regions, so that finite-time convergence and bounded control effort are obtained simultaneously [2602.14382].

Other reported architectures include fixed-time sliding-mode disturbance observers paired with PPC for underwater gliders [2512.20748], I\&I adaptive composite controllers for reduced-attitude spacecraft alignment [2305.19645], approximation-free nested tangent–arctangent mappings for unknown strict-feedback systems with prescribed input constraints [2210.06038], and derivative-free sample-and-hold output feedback for relative-degree-two systems, where the sample-based proxy
\[
E(t_k)=\varphi(t_k)\frac{e(t_k)-e(t_k-\tau)}{\tau}+\alpha(\|e_1(t_k)\|^2)e_1(t_k)
\]
replaces any direct use of $\dot y$ [2402.05688].

## 4. Constraint handling, compatibility management, and robustness mechanisms

A central theme in recent PPC work is that prescribed error envelopes may conflict with actuator limits, safety constraints, delays, or communication failures. Several papers therefore replace fixed-envelope PPC by compatibility-aware or correction-based designs.

For unknown nonlinear strict-feedback systems with prescribed input constraints, PPC and actuator limits are treated jointly through a nested barrier–saturation mapping:
\[
\mathcal{T}(z)=\tan\!\left(\frac{\pi}{2}z\right),\qquad
\mathcal{S}(w)=\frac{2\bar\upsilon}{\pi}\arctan\!\left(\frac{\pi}{2\bar\upsilon}w\right),
\]
leading to a controller that satisfies both $|e(t)|<\psi(t)$ and $|\upsilon(t)|<\bar\upsilon$, provided an explicit feasibility condition is met [2210.06038].

Input saturation motivates adaptive envelope scheduling in other formulations. In self-adjusting PPC for nonlinear systems with saturation, the decay rate $\delta(t)$ of the performance function is increased when the error remains inside a performance index function and decreased when the error approaches the outer prescribed envelope. The reported effect is that the controller can reduce decay rates when necessary to avoid violation of the PFs and increase them when there is remaining control capacity [2404.13714].

Spacecraft pointing under forbidden directions introduces another kind of incompatibility: rapid prescribed convergence can conflict with obstacle avoidance. One solution is a switched prescribed performance function with a freeze mechanism,
\[
\dot\rho_q
=
-k_\rho(\rho_q-\rho_\infty)(1-\Omega_s)
+\left(\frac{\dot e}{e}\right)\rho_q\,\Omega_s,
\]
so that when $\Omega_s=1$,
\[
\dot\varepsilon_q=0.
\]
The normalized PPC error is then frozen while the artificial potential field takes precedence [2209.05801]. Closely related spacecraft attitude work describes this as Compatible Performance Control, using contradiction detection based on a Zeroing Barrier Function and a projection-operator-governed envelope-modification signal [2305.19627]. Reduced-attitude boresight alignment extends the same principle through a Switched Prescribed Performance Function that monitors forbidden cones, angular-velocity limits, and the PPC state itself [2305.19645].

Delays and communication failures introduce further modifications. For higher-order uncertain nonlinear systems with state-measurement and input delays, the normalized errors are built from delayed measurements together with a delay-dependent correction chain:
\[
\dot I_{i,j}=I_{i,j+1}-\alpha I_{i,j},\qquad
\dot I_{i,n}
=
-\alpha I_{i,n}
+
\sum_{k=1}^m s_{i,k}\big(u_k(t)-u_k(t-\tau_s-\tau_u(t-\tau_s))\big).
\]
The correction vanishes in the zero-delay limit, and the controller reduces to the nominal PPC envelope [2509.08601]. In distributed multi-agent control under faulty directed graphs, prescribed bounds are retained by combining PPC transformations with a distributed observer based on the faulty Laplacian $\mathcal{L}^f$ [2504.07668].

Sampled-data settings require another adaptation. In derivative-free sample-and-hold PPC, only $y(t_k)$ and $y(t_k-\tau)$ are used, and a sufficient uniform sampling-rate condition is derived so that the funnel inequality $\varphi(t)\|e(t)\|<1$ remains valid globally under zero-order hold [2402.05688].

These constructions show that PPC does not automatically solve compatibility problems; rather, recent work increasingly builds explicit contradiction detection, envelope relaxation, freezing, adaptation, or correction mechanisms around the performance function itself.

## 5. Domains of application and task formulations

The reported applications are unusually broad. In spacecraft control, PPC has been used for full attitude tracking with prescribed performance and singularity avoidance [2206.12761], reduced-attitude boresight alignment under forbidden directions [2209.05801], adaptive reduced-attitude control under safety constraints and uncertainty [2305.19645], and attitude control with angular-velocity limitation, input saturation, and time-varying parameter uncertainty through Compatible Performance Control [2305.19627].

In aerial robotics, PPC has been adapted to underactuated quadrotors by introducing virtual references that compensate for the thrust-direction coupling and by structuring the controller as nested PPC loops for position, velocity, attitude, and angular velocity [2206.06275]. In atmospheric reentry, PPC appears in a funnel-control formulation with a time-triggered non-monotonic funnel that widens during rapid trajectory changes and then contracts again [2308.00367].

Networked and heterogeneous systems form another major application class. In directed UAV–UGV multi-agent systems, PPC is used simultaneously for leader-state observation and formation tracking, with variable prescribed performance boundaries that react to actuator saturation and with explicit handling of communication link failures [2504.07668]. For uncertain higher-order systems with delays, PPC is extended to measurement-delay and input-delay channels through delay-dependent envelope correction [2509.08601]. In derivative-free sampled-data output tracking, the same prescribed-performance objective is retained despite zero-order hold and the absence of derivative measurements [2402.05688].

Marine applications include fixed-time prescribed-performance path following of underwater gliders. There PPC is integrated with an iLOS guidance law and a fixed-time sliding-mode disturbance observer, with the finite-time performance function reaching its terminal value at a preset time and then remaining constant [2512.20748].

Formal-task control provides a different interpretation of PPC. For signal temporal logic specifications, PPC is applied directly to the robustness of predicates, so that a funnel on $\rho^\psi(x,t)$ is leveraged to satisfy formulas such as $\mathbf{F}_{[a,b]}\psi$ and $\mathbf{G}_{[a,b]}\psi$ [1703.07094]. A reinforcement-learning extension uses a PPC base law to guide exploration in PI$^2$, combining
\[
\hat u(x,t)=\sum_{i=1}^M \beta_i u_{\phi_i}(x,t)
\]
with a robustness-penalized objective to improve task-satisfaction learning [1903.04340].

This breadth suggests that PPC is not domain-specific. What changes across domains is the envelope definition, the transformation, and the mechanism used to reconcile performance with physical or logical constraints.

## 6. Guarantees, trade-offs, and recurring limitations

The strongest attraction of PPC is that the control objective is stated as an inequality on the original error. Depending on the architecture, the reported guarantees include funnel invariance $|e(t)|<\rho(t)$ for all $t$, no-overshoot with respect to the prescribed envelope, terminal accuracy such as
\[
\limsup_{t\to\infty}|e(t)|\le \rho_\infty,
\]
practical asymptotic stability, fixed-time convergence to residual sets, and prescribed-time entry into a desired region followed by asymptotic convergence [2209.05801], [2602.14382], [2601.14882].

At the same time, the literature repeatedly emphasizes trade-offs. Tight envelopes, small steady-state bounds, or large contraction rates improve nominal precision but can sharply increase control effort, aggravate saturation, and induce over-control near the boundary [2206.12761], [2404.13714]. For simultaneous PPC and input constraints, arbitrary prescription is explicitly ruled out; a feasibility condition is required [2210.06038]. Delay-dependent correction mechanisms can be conservative because the admissible-delay bound enters the stability margin directly [2509.08601]. In prescribed-time and finite-time variants, feasibility is still constrained by available control authority and disturbance bounds [2601.14882], [2602.14382].

Several common misconceptions are directly contradicted by the reported results. PPC is not limited to one transformation; logarithmic barriers, BLFs, erf maps, funnel gains, and shear mappings all appear in the literature [2504.07668], [2209.05801], [2602.14382], [2508.13726]. PPC also does not automatically resolve conflicts with safety or actuator limits; obstacle avoidance, angular-velocity constraints, saturation, and delay often require switched envelopes, freeze mechanisms, variable boundaries, or compatibility analysis [2209.05801], [2305.19627], [2404.13714], [2509.08601].

The limitations are equally consistent across papers. Many designs assume known control direction or positive input gain [2602.14382], measurable full state or disturbance terms [2308.00367], bounded disturbances and known inertia structure [2209.05801], or stable zero dynamics and sufficient sampling rates [2402.05688]. Some formulations acknowledge conservative conditions, such as the trade-off inequality in maneuvering reentry tracking [2308.00367] or the delay-dependent smallness condition in higher-order systems with delays [2509.08601]. Others explicitly note scope restrictions: matched disturbances for the hybrid-gain PPC–SMC design [2602.14382], or the absence of a separate convex-hull proof in heterogeneous containment despite the formation construction [2504.07668].

Overall, the published developments portray PPC as an envelope-centric methodology for control design. Its enduring technical content lies in specifying a performance corridor first, transforming the constrained problem into a stabilizable one second, and then modifying the corridor itself whenever safety, saturation, delays, sampling, or formal-task semantics make a fixed funnel incompatible with the actual closed-loop physics.

Source: https://www.emergentmind.com/topics/prescribed-performance-control-ppc