Date: 2026-06-11 · Pipeline: deep-research workflow (108 agents; 6 angles; 25 sources; 121 claims extracted; 25 adversarially verified 3-0, 0 refuted; 8 synthesized findings)
Corpus status: every citation below is web-verified but
locally [UNVERIFIED] — none of these papers is yet
in sources/Markdown_Papers. Per project policy they must be
ingested through the research-assistant pipeline before appearing in
thesis prose. See the acquisition queue at the end.
For risk-aware planning and control of free-flying space manipulators performing inspection under state, actuation, and camera-pose uncertainty: compare CVaR-based formulations against chance-constrained formulations. When is CVaR justified over chance constraints (tail-severity vs violation-probability semantics, conservatism, tractability/convexity, sample complexity)? What precedents exist in spacecraft/space-robotics or adjacent robotics literature for each?
CVaR is justified over chance constraints when the severity of a constraint violation matters, not just whether it occurs: a chance constraint is mathematically a VaR/quantile constraint that bounds only violation probability and is invariant to how bad outcomes get beyond the threshold, whereas CVaR is the conditional expectation of the tail and thus penalizes severity. CVaR upper-bounds VaR (VaR ≤ CVaR ≤ EVaR), so a CVaR constraint at level β implies the corresponding chance constraint and is strictly more conservative — but it is the tightest convex conservative approximation, and unlike VaR it is coherent (subadditive, hence convex), with the Rockafellar–Uryasev minimization formula reducing CVaR optimization to convex programming (an LP under sampling with linear losses), while generic chance-constrained programs are nonconvex and can be computationally intractable.
The convexity advantage is not free in practice: in receding-horizon robotics formulations with nonconvex keep-out geometry, CVaR constraints yield multi-level stochastic programs made tractable only via sample-average approximation plus mixed-integer convex reformulation (the integer structure coming from the geometry, not CVaR itself); conversely, Gaussian individual chance constraints admit exact convex SOCP reformulations, so for purely boolean failure events under Gaussian uncertainty chance constraints remain semantically appropriate and less conservative.
Direct space precedents exist on both sides: JPL’s joint chance-constrained dynamic programming for Mars EDL and lunar landing (Ono, Pavone et al., Auton. Robots 2015) for violation-probability semantics, and adjacent robotics precedents for CVaR/coherent-risk MPC with recursive-feasibility and finite-time guarantees (Hakobyan–Kim–Yang RA-L 2019; Dixit–Ahmadi–Burdick AIJ 2023; Majumdar–Pavone ISRR 2017; Akella et al. 2024 survey) — though no verified precedent addresses a free-flying space manipulator inspecting under camera-pose uncertainty specifically. That gap is the thesis opportunity.
A chance constraint is equivalent to a VaR (quantile) constraint — VaR_α(Z) ≤ 0 iff P[Z > 0] ≤ α — bounding only the probability of violation, while β-CVaR is the conditional expectation of losses beyond the β-quantile, i.e., tail severity. Chance-constrained formulations explicitly tolerate a small violation probability and encode no information about violation magnitude.
Chance constraints suit boolean failure events (collision yes/no) but are insensitive to how severe the cost gets beyond the threshold; CVaR additionally limits the expected magnitude of violation among the ε-worst outcomes — the literature’s core motivation for CVaR in safety-critical settings. Converse conceded by the sources themselves: for purely boolean failure events chance constraints remain semantically appropriate and less conservative; the argument for CVaR is conditional on severity mattering.
Enforcing CVaR_β(X) ≤ 0 is sufficient for P(X ≤ 0) ≥ 1−β; a CVaR constraint at the same level is strictly more conservative than the matched chance constraint, but it is the tightest convex conservative approximation (Nemirovski–Shapiro SIOPT 2006), so its extra conservatism is the minimum achievable convexly. Risk-aware MPC sits between often-too-optimistic chance-constrained stochastic MPC and often-too-conservative worst-case robust MPC. Thesis implication: at fixed β, CVaR buys severity control at the price of extra conservatism; fair comparisons must account for this or retune levels.
Generic chance-constrained programs can be intractable (feasible sets nonconvex; joint chance constraints NP-hard in general); VaR lacks subadditivity/convexity and can exhibit multiple local extrema. CVaR is coherent (satisfies all six Majumdar–Pavone distortion-risk axioms; VaR fails subadditivity A4, and A3+A4 imply convexity), and the Rockafellar–Uryasev auxiliary function F_β(x,α) = α + (1−β)⁻¹E[f(x,y)−α]⁺ makes CVaR minimization a single convex program in (x,α) for convex losses, with VaR recovered as a byproduct. Key counter-caveat preserved by the verifiers: individual linear chance constraints under Gaussian uncertainty reformulate exactly as convex SOCP constraints — common in spacecraft GNC — so the intractability argument applies to general/joint/non-Gaussian cases (which is where multimodal camera-pose uncertainty pushes the problem).
Under Monte Carlo sampling the CVaR objective stays convex (piecewise-linear in α; an elementary LP for linear losses). However, directly imposing CVaR constraints in receding-horizon control with distance-to-safe-set losses yields a triple-level stochastic program; the published tractable route (Hakobyan et al.) is CVaR-constraint reformulation → sample average approximation → linearly constrained mixed-integer convex program. The integer variables stem from nonconvex obstacle/keep-out geometry, not from CVaR itself — a chance-constrained formulation of the same geometry faces the same combinatorial burden. CVaR’s convexity does not translate to off-the-shelf tractability in inspection-style problems.
Coherent risk measures admit a dual representation as worst-case expectation over a convex, closed risk envelope of distributions, so a CVaR formulation interpolates between expectation-based stochastic planning (α→0) and worst-case robust planning — a principled robustness-to-distribution-misspecification reading that chance constraints lack. Directly relevant when state/camera-pose uncertainty distributions are themselves only estimated.
Joint chance-constrained dynamic programming — violation-probability semantics only (verifiers searched the full text: zero mentions of CVaR/severity). Joint chance constraints are non-additive and incompatible with standard constrained DP; conservatively reformulated via Boole’s inequality and Lagrangian duality. Demonstrated on path planning, Mars EDL, and lunar landing with real Mars terrain (~4M discrete states/step), simulation only. Later CVaR work (Ahmadi/Ono at JPL) cites the probability-only limitation as motivation. Caveat: planetary EDL/rover planning — a direct spacecraft precedent, but adjacent to free-flying manipulation.
sources/Markdown_Papers; ingest before citing in
thesis text.sources/Markdown_Papers
ingestion)6 angles · 25 sources fetched (5 URL dupes filtered, 6 dropped on budget) · 121 claims extracted · top 25 verified, 25 confirmed, 0 killed · 8 findings after synthesis · 108 agent calls · ~34 min · 0 permission pings.