Pith. sign in

REVIEW 2 major objections 4 minor 20 references

Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures

T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A single affine inequality on Bézier control points certifies every trajectory a layered planner-tracker system can safely track, turning long-horizon planning into polytope intersections.

desk verdict Good certificate idea, but the reachable-set claim in Section V is an inner approximation for p>2γ−1; the paper overstates it. read the letter →

arxiv 2411.13506 v1 pith:TOSG7F7D submitted 2024-11-20 cs.RO cs.SYeess.SY

Noel Csomay-Shanklin , Aaron D. Ames This is my paper · ORCID
classification cs.ROcs.SYeess.SY MSC 93B0393C8568T40
keywords Béziercurvesreachablepolytopeslayeredcontrolarchitecturesmotionplanningtrackingcertificatesconstraintsatisfactiongraphsearchhoppingrobot
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that for a robot controlled by a layered architecture—a planner that emits Bézier polynomial trajectories and a low-level feedback tracker—the set of trajectories the low level can track while respecting state and input limits is certified by one affine inequality on the Bézier control points. If the inequality holds, tracking keeps the closed-loop system inside the safe state set and the actuator commands inside their allowed box for every instant. This turns long-horizon planning into checking linear constraints and intersecting polytopes rather than solving expensive boundary-value problems. The authors demonstrate the idea on a simulated pendulum swing-up and on a physical 3D hopping robot.

What carries the argument

The central object is the Bézier Reachable Polytope: a polytope in the space of terminal or initial conditions cut out by an affine inequality $F\vec{p} \leq G$ on Bézier control points. The construction combines three ingredients: the convex-hull property of Bézier curves, so linear inequalities on control points bound the entire continuous curve; a tracking certificate $E$ that bounds closed-loop error as a function of the planning input; and Lipschitz bounds on $\Pi$, $\Psi$, $e$, $k$, $g_d^{-1}$, and $f_d$. Lemma 3 is the technical core: it rewrites the nonlinear norm terms that appear in the state and input constraints as a finite system of linear inequalities, using projection onto the positive semidefinite cone and a closed-form set-containment step.

What would settle it

Simulate a Bézier trajectory that passes the certificate on the hopping robot's full hybrid dynamics; if any closed-loop sample violates the state or input bounds, the claimed equivalence between $F\vec{p}\leq G$ and constraint satisfaction is false for those constants.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: given a planning model with a tracking certificate, there exist matrices $F$ and $G$ such that any Bézier curve $B:I\to X_d$ whose control points satisfy $F\vec{p} \leq G$, when tracked, yields $\Pi(x_{cl}(t))\in C_X$ and $k(x_{cl}(t),x_d(t))\in C_U$ for all $t\in I$. Because boundary conditions enter linearly through the matrix $D$, the set $F(x_0)=\{x_T \mid F D^\dagger [x_0^\top\ x_T^\top]^\top \leq G\}$ of terminal conditions for which a feasible curve exists is a polytope. This gives a constructive certificate of reachability for the combined planner-tracker system.

Load-bearing premise

The certificate is only as strong as the tracking error bound supplied by the low-level controller and the six smoothness constants the paper assumes without showing how to compute them—if those constants are wrong or missing, the polytope stops certifying anything.

Editorial extensions

If this is right

  • Long-horizon plans can be certified without closed-loop simulation: a plan is feasible if its Bézier control points pass the linear check $F\vec{p} \leq G$.
  • The forward and backward reachable sets $F(x_0)$ and $B(x_T)$ are polytopes, so graph-search planners can connect sampled states by checking polytope intersection instead of solving two-point boundary-value problems.
  • Refining the time interval with piecewise-constant reference points reduces conservatism at the cost of more polytope faces, giving an explicit tightness-versus-computation tradeoff.
  • The same certificate can serve as a model-predictive layer, since the refined certificate is written as linear constraints around a sequence of reference points.
  • The input bound $u_{max}$ and horizon $T$ reshape the reachable polytope predictably, so task difficulty is reflected directly in the number of graph-search steps required.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The construction is likely an under-approximation of the true feasible set: the Lipschitz bounding and the single reference point add conservatism, so some feasible Bézier curves may be rejected by $F\vec{p} \leq G$; practitioners should treat the polytope as a safety certificate rather than the exact reachable set.
  • The same affine inequality could be embedded directly as constraints in trajectory optimization or model-predictive control, replacing heuristic penalty terms with a closed-form feasibility oracle.
  • The derivation relies mainly on the convex-hull property, so a similar certificate may extend to other convex basis parameterizations or B-splines, though the exact linear boundary-condition structure would need to be re-derived.
  • A natural quantitative test is to measure the actual tracking error on the hopping robot and compare it with the assumed tracking certificate; if the real error exceeds the certificate, the polytope must be recomputed with the measured error bound.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper introduces Bézier Reachable Polytopes as certificates for layered planner-tracker architectures. The authors show that by enforcing affine inequalities on Bézier control points, one can guarantee that the closed-loop system satisfies state and input constraints over continuous time (Theorem 1). They combine this with boundary-value constraints to define forward and backward reachable polytopes in the planning state space, and demonstrate the approach on pendulum swing-up and on the ARCHER 3D hopping robot. The core mechanism is the convex hull property of Bézier curves, which reduces continuous-time constraint enforcement to checking control-point inequalities.

Significance. The central idea is appealing: if the construction is valid, it provides a computationally efficient, certificate-based interface between a decision-making layer, a planner, and a tracking controller. The convex-hull argument (Property 2) and the sufficient-condition framework are sound and correctly applied. The paper ships code, which is a strength. However, the exactness claim for the reachable polytope in Section V is not correct for the general case allowed in the paper, and the construction depends on Lipschitz constants and a closed-form solution that are not provided. The underlying sufficient-condition certificate remains valuable after revision.

major comments (2)
  1. [Section V, definition of F(x0)] The statement that F(x0) = {xT | F D† [x0^T xT^T]^T ≤ G} represents all terminal conditions for which a feasible Bézier polynomial exists is false when p > 2γ−1, a case explicitly permitted by Property 3 and Remark 1. In this regime the boundary constraint D⃗p = v is underdetermined: the control points are ⃗p = D†v + Ny with N spanning the nullspace of D. Substituting only the minimum-norm solution is sufficient but not necessary. For example, with γ=1, m=1, p=2, x0=0, xT=2 and the constraint b1 ≤ −1, the minimum-norm solution (b0,b1,b2)=(0,0,2) violates the constraint, yet the control points (0,−2,2) satisfy the same boundary conditions and the constraint. Thus F(x0) is an inner approximation, not the exact reachable set. This affects the graph-search edge condition in Section VI.A, which may miss feasible connections. Please either restrict the construction to p = 2γ−1, compute the projection eliminating the nullspace variable y, or explicitly reframe F(x0) as an under-approximation.
  2. [Lemma 3 and Assumption 3] The constructive claim of Theorem 1 depends on Lipschitz constants LΠ, LΨ, Le, Lk, LG, Lf from Assumption 3 and Lemma 3, and on a 'closed form' solution to the set containment problem whose details are deferred to reference [19], a code repository. The paper does not provide these constants for the pendulum or ARCHER experiments, nor a procedure for computing them, nor a derivation of the closed-form solution. Since the certificate is only useful if the matrices F and G can actually be built, this missing support is load-bearing. Please supply the derivation or a citable reference, and state how the constants are obtained in the experiments.
minor comments (4)
  1. [Introduction] The phrase 'is is extremely common' should be corrected to 'is extremely common'.
  2. [Lemma 3 proof] The notation cM for the projection of M onto the positive semidefinite cone is not defined; a clearer notation such as M+ would help.
  3. [Corollary 1 proof] The line 'Taking bG = bG' appears to be a typo, and the definition of the refinement matrices ⃗Qi should be made explicit so that the step from (16) to (17) is verifiable.
  4. [Property 4] The definition of BQ(t) is ambiguous: it is not clear which subinterval [Ti−1, Ti] is used when writing BQ(t) ≜ B(Ti + t/T (Ti+1 − Ti)).

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: Theorem 1 is a parameter-free sufficient-condition construction; the only self-citation is to an elementary prior lemma, and Section V's D† projection is a correctness concern, not circularity.

full rationale

The paper's main derivation, Theorem 1 and Corollary 1, is self-contained in the following sense: given a tracking certificate and Lipschitz constants (Assumption 3, Lemma 3), it constructs affine-in-control-point matrices F and G that imply state and input constraint satisfaction. No parameter is fit to the constraints it is said to predict; the constraints are enforced as sufficient linear conditions via Bézier convex hull (Property 2) and explicit Lipschitz bounds. This is not a fitted input renamed as a prediction. The Section V reachable set F(x0) is obtained algebraically by substituting the minimum-norm boundary solution D†[x0; xT] into F p ≤ G. This is not circular, but it is an under-approximation when p > 2γ−1 because the nullspace of the boundary map is discarded; the text's phrase 'represents all terminal conditions for which there exists a feasible Bézier polynomial' is therefore an overclaim. That is a correctness concern, not an equivalence-by-construction. The only load-bearing citation to the authors' own prior work is [12], used for the Bernstein derivative matrix H and for Lemma 4 (the ball-to-box bound used in Lemma 2). These are elementary, parameter-free facts with stated assumptions that do not include the target result, and the paper restates enough of the surrounding argument that the dependency does not reduce to an unverified self-citation. No uniqueness theorem is imported from the authors' prior work, and no known empirical result is renamed. Thus the circularity score is low; the 2 reflects the presence of a minor self-citation, not a circular derivation.

Assumptions & free parameters 6 free parameters · 7 assumptions · 0 invented entities

The result is conditioned on Assumptions 1-3, on a pre-existing tracking certificate E, and on an unproven closed-form computation in Lemma 3. The Lipschitz constants are hidden parameters: their values determine F and G but none are reported. No constants are fitted to data, so the free-parameter list contains assumed-but-unquantified bounds rather than fitted values.

free parameters (6)
  • Lipschitz constant L_Pi of Pi = not reported
    Assumption 3 requires Pi Lipschitz with constant L_Pi on C_X; the constant multiplies the tracking-error bound in Lemma 2 and is needed to build the polytope, but no value or computation method is given, including in the ARCHER experiment.
  • Lipschitz constant L_Psi of Psi = not reported
    Same assumption; enters Lemma 1's input bound.
  • Lipschitz constant Le of e = not reported
    e(u_d), the upper bound of the tracking certificate, is assumed Lipschitz with constant Le; Le is used in Lemmas 1 and 2. The function e itself is not specified for the hardware example.
  • Lipschitz constant Lk of controller = not reported
    Used in Lemma 1 to bound the input k. No value reported.
  • Lipschitz constant LG of g_d^{-1} = not reported
    Used in Lemma 3 to bound the inverse of the actuation matrix; finite on compact C_X, but never computed.
  • Lipschitz constant Lf of drift f_d = not reported
    Used in Lemma 3 to bound q_d^{(gamma)} - f_d(x_d).
assumptions (7)
  • domain assumption Assumption 1: planning system fully actuated with g_d(x_d) invertible on X_d and f_d(0)=0
    Required to define input u_d = g_d^{-1}(q_d^{(gamma)} - f_d(x_d)) in Section III and to bound ||g^{-1}|| in Lemma 3.
  • domain assumption Assumption 2: state constraint set is a polytope C_X = {xd | Cxd <= d} and input constraint set is a box ||u||_inf <= u_max
    The linear inequality reformulations in Lemmas 1-3 and Property 2 rely on these shapes.
  • domain assumption Assumption 3: Pi, Psi, e are Lipschitz with finite constants
    Bounds in Lemma 1 and Lemma 2 require these constants; no construction or values are supplied.
  • domain assumption Existence of a tracking certificate E with upper bound e(u_d) that is locally Lipschitz
    The entire result is conditional on a pre-existing tracking certificate; for nonlinear systems this is an active research problem and is not derived here.
  • standard math Bezier convex hull and subdivision properties (Properties 1, 2, 4)
    Standard properties of Bernstein/Bezier polynomials, referenced to [18].
  • domain assumption Lemma 4 of [12]: ball constraint C(xd+v) <= d for all v with ||v|| <= rho reduces to Cxd <= d - rho sqrt(diag(CC^T))
    The paper 'appeals to Lemma 4 in [12]' in Lemma 2; this lemma is from the authors' previous preprint and is not reproduced.
  • ad hoc to paper The set-containment problem in Lemma 3 has a closed-form solution as claimed in [19]
    The proof of Lemma 3 rests on this unstated computation; the paper gives no derivation and points to a code repository.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures." pith.science (2026). https://pith.science/paper/TOSG7F7D

@misc{pith2026241113506,
  author       = {Pith},
  title        = {Pith review of: Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TOSG7F7D}},
  note         = {Machine review of arXiv:2411.13506}
}
read the original abstract

Control architectures are often implemented in a layered fashion, combining independently designed blocks to achieve complex tasks. Providing guarantees for such hierarchical frameworks requires considering the capabilities and limitations of each layer and their interconnections at design time. To address this holistic design challenge, we introduce the notion of Bezier Reachable Polytopes -- certificates of reachable points in the space of Bezier polynomial reference trajectories. This approach captures the set of trajectories that can be tracked by a low-level controller while satisfying state and input constraints, and leverages the geometric properties of Bezier polynomials to maintain an efficient polytopic representation. As a result, these certificates serve as a constructive tool for layered architectures, enabling long-horizon tasks to be reasoned about in a computationally tractable manner.

Figures

Figures reproduced from arXiv: 2411.13506 by the authors.

Figure 1
Figure 1. A depiction of the layered architectures investigated in this work, [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. A visual guide to the properties of Bézier curves. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. A selection of Bézier curves and forward reachable sets. The top [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: A depiction of the forward reachable sets as a function of system [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: The proposed method applied to the pendulum swingup problem. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Hardware results on the 3D hopping robot, ARCHER. When commanded to cross the room, a naive decision making layer provides a setpoint [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 15 canonical work pages

  1. [12]

    Multi-Rate Planning and Control of Uncertain Nonlinear Systems: Model Predictive Control and Control Lyapunov Functions

    N. Csomay-Shanklin, A. J. Taylor, U. Rosolia, and A. D. Ames, “Multi-rate planning and control of uncertain nonlinear sys- tems: Model predictive control and control lyapunov functions,” arXiv:2204.00152, 2022

    work page Pith review arXiv 2022

  2. [19]

    [Online]

    “Code,” 2024. [Online]. Available: https://github.com/noelc-s/ BezierTubes

    work page 2024

  3. [1]

    A quantitative framework for layered multirate control: Toward a theory of control architecture,

    N. Matni, A. D. Ames, and J. C. Doyle, “A quantitative framework for layered multirate control: Toward a theory of control architecture,” IEEE Control Systems Magazine , vol. 44, no. 3, pp. 52–94, 2024

    2024

  4. [2]

    Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot,

    S. Kuindersma, R. Deits, M. Fallon, A. Valenzuela, H. Dai, F. Per- menter, T. Koolen, P. Marion, and R. Tedrake, “Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot,” Autonomous robots, vol. 40, pp. 429–455, 2016

    2016

  5. [3]

    Perceptive locomotion through nonlinear model-predictive control,

    R. Grandia, F. Jenelten, S. Yang, F. Farshidian, and M. Hutter, “Perceptive locomotion through nonlinear model-predictive control,” IEEE Transactions on Robotics, vol. 39, no. 5, pp. 3402–3421, 2023

    2023

  6. [4]

    Hierarchically consistent control systems,

    G. Pappas, G. Lafferriere, and S. Sastry, “Hierarchically consistent control systems,” IEEE Transactions on Automatic Control , vol. 45, no. 6, pp. 1144–1160, 2000

    work page 2000

  7. [5]

    Hierarchical control system design using approximate simulation,

    A. Girard and G. J. Pappas, “Hierarchical control system design using approximate simulation,” Automatica, vol. 45, no. 2, pp. 566–571, 2009

    2009

  8. [6]

    Equivalence of dynamical systems by bisimula- tion,

    A. van der Schaft, “Equivalence of dynamical systems by bisimula- tion,” IEEE Transactions on Automatic Control , vol. 49, no. 12, pp. 2160–2172, 2004

    work page 2004

Show all 20 references
  1. [7]

    Rawlings, D

    J. Rawlings, D. Mayne, and M. Diehl, Model Predictive Control: Theory, Computation, and Design . Nob Hill Publishing, 2017

    2017

  2. [8]

    Robust model predic- tive control of constrained linear systems with bounded disturbances,

    D. Q. Mayne, M. M. Seron, and S. V . Rakovi´c, “Robust model predic- tive control of constrained linear systems with bounded disturbances,” Automatica, vol. 41, no. 2, pp. 219–224, 2005

    2005

  3. [9]

    Fastrack:a modular framework for real-time motion planning and guaranteed safe tracking,

    M. Chen, S. L. Herbert, H. Hu, Y . Pu, J. F. Fisac, S. Bansal, S. Han, and C. J. Tomlin, “Fastrack:a modular framework for real-time motion planning and guaranteed safe tracking,” IEEE Transactions on Automatic Control , vol. 66, no. 12, pp. 5861–5876, 2021

    2021

  4. [10]

    R3t: Rapidly-exploring random reachable set tree for optimal kinodynamic planning of nonlinear hybrid systems,

    A. Wu, S. Sadraddini, and R. Tedrake, “R3t: Rapidly-exploring random reachable set tree for optimal kinodynamic planning of nonlinear hybrid systems,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) , 2020, pp. 4245–4251

    2020

  5. [11]

    Input to state stability: Basic concepts and results,

    E. D. Sontag, “Input to state stability: Basic concepts and results,” in Nonlinear and Optimal Control Theory . Springer, 2008, pp. 163– 220

    2008

  6. [13]

    Kinodynamic motion planning,

    B. Donald, P. Xavier, J. Canny, and J. Reif, “Kinodynamic motion planning,” Journal of the ACM , vol. 40, no. 5, pp. 1048–1066, Nov. 1993

    1993

  7. [14]

    Randomized Kinodynamic Plan- ning,

    S. M. LaValle and J. J. Kuffner, “Randomized Kinodynamic Plan- ning,” The International Journal of Robotics Research, vol. 20, no. 5, pp. 378–400, May 2001

    2001

  8. [15]

    Kinodynamic RRT*: Asymptoti- cally optimal motion planning for robots with linear dynamics,

    D. J. Webb and J. van den Berg, “Kinodynamic RRT*: Asymptoti- cally optimal motion planning for robots with linear dynamics,” in 2013 IEEE International Conference on Robotics and Automation . Karlsruhe, Germany: IEEE, May 2013, pp. 5054–5061

    2013

  9. [16]

    Fast Path Planning Through Large Collections of Safe Boxes,

    T. Marcucci, P. Nobel, R. Tedrake, and S. Boyd, “Fast Path Planning Through Large Collections of Safe Boxes,” May 2023, arXiv:2305.01072 [cs, eess]

    2023 arXiv

  10. [17]

    Real-time trajectory generation for con- strained nonlinear dynamical systems using non-uniform rational b-spline basis functions,

    M. E. Flores Contreras, “Real-time trajectory generation for con- strained nonlinear dynamical systems using non-uniform rational b-spline basis functions,” Ph.D. dissertation, California Institute of Technology, 2008

    2008

  11. [18]

    A primer on bézier curves,

    M. Kamermans, “A primer on bézier curves,” (online book) , 2020. [Online]. Available: https://pomax.github.io/bezierinfo/

    2020

  12. [20]

    Creating ARCHER: A 3D Hopping Robot with Fly- wheels for Attitude Control,

    E. R. Ambrose, “Creating ARCHER: A 3D Hopping Robot with Fly- wheels for Attitude Control,” Ph.D. dissertation, California Institute of Technology, 2022

    2022

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.