Traction: collision, contact, wheels, tracks, terrain
8,898 words20 subsections14 tablesPlan version 1.1
On this page20
Crate: frob-contact (layer 3). Traction reads scene packs (§19) and actuator and interface cards (§15), is
called by the step of §16, and reaches FrankenSim's fs-query, fs-contact and fs-tribo through the airlock.
18.1 What Traction owns
- Geometry for contact: distance fields for what is static, convex primitives for what moves, and a mesh path with one-sided enclosures for certificates and thin geometry (§18.3).
- Detection: samples, broad and narrow phase, the speculative margin, swept bounds, witness pairs and their migration (§18.4).
- Contact laws CL-1, CL-2, CL-M and CL-H (§18.5), the friction cone in four dimensions (§18.6), joint-level rows for stiction and backlash (§18.7) and film friction for wet and greasy floors (§18.8).
- Wheels, tyres, tracks and hybrids (§18.9) and terrain mechanics (§18.10).
- Contact capacity and the rule against capacity bias (§18.11).
- The precision posture of the contact solve: diagonal scaling, and why half precision is rejected (§18.12).
Traction does not own the scene compiler or its fields (§19), the cards themselves (§15), the orchestration of the solve (§16), or building-scale clearance complexes (§19), for which it supplies the pairwise predicate.
18.2 Decisions
| ADR | Decision | Reason |
|---|---|---|
| ADR-TRAC-01 | On the throughput tiers everything static is a distance field and everything that moves is a union of convex primitives. | A field answers "how far, and which way" in constant time for any query point, which is what thousands of worlds need. |
| ADR-TRAC-02 | A mesh path with a bounding-volume hierarchy and one-sided enclosures exists beside the fields, for clearance certificates and for thin geometry. | A field cannot represent a feature thinner than about two voxels, and a certificate needs a two-sided answer that a single nominal surface cannot give. |
| ADR-TRAC-03 | Contact friction is one cone in four dimensions: normal, two tangential, spin. No production law uses a pyramid. | Sliding and spinning share one friction budget; independent rows grant both in full. A four-sided pyramid grants √2·μ along its diagonals. |
| ADR-TRAC-04 | The convex compliant law is the default on the throughput tiers. The hard-contact complementarity law CL-H is the written specification of the referee and an optional Frontier batch law. | The convex solve has one solution, a per-step error bound and a fixed shape. The complementarity problem has none of the three at a fixed iteration count, and is what "exact Coulomb" means. |
| ADR-TRAC-05 | Stiction, backlash and hard stops are rows of the same solve as ground contact. | A stuck joint changes how contact impulses distribute, and a backlash gap opens when a foot unloads. Solving them apart is the tied-sliders error of §16.5. |
| ADR-TRAC-06 | A friction coefficient that depends on state (film thickness, sliding speed, temperature) is evaluated from committed state and held constant inside a solve. | The step stays strictly convex (PO-KIN-01). The lag is one step and is a measured quantity in the fidelity ledger. |
| ADR-TRAC-07 | Single precision with power-of-two diagonal scaling on devices. Half precision is not built. | §18.12 gives the calculation. |
| ADR-TRAC-08 | No contact is removed to fit a capacity, and a comparison whose arms overflowed unequally is labeled. | Removing over-cap contacts biases exactly the robots a studio exists to compare: tracks overflow where point feet finish. |
18.3 Geometry: fields, primitives, and a mesh path with enclosures
- Everything static is a distance field. A scene compiles to a signed-distance field (dense bricks, with a sparse brick tree as Frontier), an optional heightfield for open terrain, and maps of material and friction (§19). A distance field answers "how far, and which way" in constant time for any query point, which is what thousands of worlds need.
- Everything that moves is a union of convex primitives. Spheres, capsules, boxes, cylinders and rounded boxes, with convex hulls as Frontier. A robot's collision primitives are fitted from its link Regions by the model compiler with a recorded fitting error, or authored.
FACT: FrankenSim's narrow phase is convex-against-convex for primitives through a certified Frank–Wolfe
separation in fs-query, with signed-distance pairs, heightfields and mesh manifolds refused as
MissingCapability. The batched collision path is therefore new work in frob-contact, checked against
fs-query where both apply (upstream work item FD-FSIM-03).
Every gap carries an error bound ε_g: the brick's interpolation bound, the primitive's fitting error and the field's quantization. FACT (arithmetic, Appendix H): 16 bits over a ±10 m range resolve 0.3 mm, which is 30 N at a contact stiffness of 10⁵ N/m; the stored range is therefore truncated near surfaces or scaled per brick (§19), and the bound that results enters ε_g.
The mesh path S on the CPU tiers, F on GPUs. Triangle meshes in a bounding-volume hierarchy, built deterministically (Morton order with total-order tie keys, fixed fan-out, stored in the scene pack by digest; movers refit under explicit epochs). It serves two needs the fields cannot.
Clearance certificates with one-sided enclosures. Each body and each obstacle is bound to two sets: an outer enclosure that contains it under every admitted registration error, pose uncertainty and interpolation error over the sweep, and an inner enclosure that it contains. Then:
| Observation, per time slab of the sweep | Answer | Evidence |
|---|---|---|
| The outer enclosures are disjoint | clear |
A certificate: the separating data per slab, checkable offline (§12) |
| The inner enclosures intersect at one time and pose in one jointly admissible world | penetrates |
A witness: time, pose and the intersecting pair |
| Neither | unknown, with the slab and the error term to refine |
None; the answer is not a claim |
Counterexample, hand-checkable: a nominal gap of 6 mm with 4 mm of outward error on each side leaves the outer
enclosures overlapping by 2 mm. The nominal gap is not clearance; the answer is unknown until an error term is
reduced. A second trap: two swept volumes can overlap in space while the bodies never touch, because they
occupy the shared region at different times; the test is per time slab, never on whole-sweep volumes. The strict
inequalities that decide clear are evaluated with outward rounding or in the exact-integer kernel class on
quantized coordinates (§35), never by the sign of an f32 residual.
Thin geometry. A trilinear field on a 2 cm grid cannot hold a 2 mm plate: the plate vanishes or is thickened to
the grid. The scene compiler detects features thinner than two fine voxels and routes them: to thin
primitives where they fit (plates as boxes, cords and wires as capsule chains, rails as cylinders), evaluated
analytically by K-np-thin on every tier S; to triangle patches in the hierarchy on the CPU tiers; and to the
hierarchy on GPUs only as Frontier. A thin feature with no route is refused at scene compile (FROB-REF-320).
Pilot before funding the GPU hierarchy: traversal cost and shape stability on the thin-feature corpus of §19 on
batch-cpu. Ceiling: none on speed; it is a coverage feature. ✖ KILL-MESHGPU: traversal breaks fixed shapes or
adds more than 15% to the step; fallback, GPUs see thin geometry as analytic primitives only and meshes stay on
the CPU tiers for certificates and audits.
18.4 Detection, swept bounds and witnesses
- Moving against static. Each primitive carries sample spheres (a foot has four to eight; a wheel has rim
samples chosen by curvature). A sample at point c with radius r is in contact when φ(c) − r is below the margin,
with normal ∇φ(c). Field values are trilinear in
f32with a stated interpolation error bound per brick. - Moving against moving. Per world: a deterministic sort-and-sweep along a fixed axis or a uniform grid, then analytic pair tests. Self-collision pairs are a precomputed filter list from adjacency and nominal clearance; excluded pairs stay inspectable.
- Speculative margin. On the lockstep tiers the margin grows with approach speed, at least v·h + ε_g, so fast feet do not tunnel thin geometry between steps. The referee's audit (§16.12) measures what is still missed.
- Swept bounds. Under a transactional profile the broad phase runs on bounds swept over the sub-interval, and the narrow phase returns features, normal, witnesses, material pair, signed gap and ε_g (§16.5, step T4.2).
Counterexample for endpoint tests, hand-checkable: a sample sphere of radius 2 mm moves at 5 m/s with h = 2 ms, so it travels 10 mm in a step. A 2 mm plate lies 1 mm ahead. Clearing the plate takes 1 + 4 + 2 = 7 mm, so at the end of the step the sphere is 3 mm beyond the far face. Both endpoints are clear and the step encloses a collision. This is the thin-barrier fixture; the mutation that must fail is the endpoint-only query.
Witness pairs and their migration S. A contact carries a witness pair (one point on each body, in body
coordinates), a contact frame, and tangential memory: the stick anchor of a regularized law, accumulated
tangential displacement, and the warm-start impulse. FrankenSim's sustained step assumes the witnesses and the
frame are fixed (§16.4); a wheel rolling over a lip, a sliding sole and a rocking foot violate that. At every
redetection frob-contact:
- re-localizes the witnesses by closest features, with one consistent world contact point at touching;
- classifies the change as
same-feature,adjacent-feature(face to edge to face around a lip) ornew-contact; - keeps the tangential memory on the same feature; for an adjacent feature whose world contact point moved continuously (inside a tolerance δ_w), transports it: rotates it by the minimal rotation that takes the old normal to the new one and projects it onto the new tangent plane;
- for a new contact, or when the contact point jumped, resets the tangential memory to zero and emits a
witness-resetevent.
Tangential memory is never kept silently on a changed feature (INV-TRAC-06). A law with no anchor (exact Coulomb) transports warm starts only. The fixture is a torque-driven wheel climbing a sharp sill, flat to edge to top: work, impulse and the feature sequence are compared under step refinement, and no couple appears that the contact forces do not explain.
18.5 Contact laws
ContactLaw is a trait whose implementations are convex potentials ℓ_c (C-06), with one exception, CL-H, which
is a complementarity problem and says so. The law is part of the StepPlanId (§16.6).
| Law | Contents | Tier |
|---|---|---|
| CL-1 | Linear compliant normal with a dissipation time; regularized Coulomb friction with a stated stiction speed. | S, default on lockstep tiers |
| CL-2 | Hunt–Crossley normal law and regularized friction in convex form. | F |
| CL-M | A mapping of MuJoCo's soft-contact parameters, for importing reference models. The mapping is lossy and the loss report says so. | S, parity only |
| CL-H | Hard contact: Signorini complementarity on the normal, Coulomb friction with maximum dissipation on the cone of §18.6, non-associated. | S as the referee's specification; F as a batch law |
Contact parameters come from a card for the pair of surface materials and their condition (dry, wet, greasy, dusty), following FrankenSim's rule that friction belongs to an interface system and not to an unordered pair of materials (FACT: expansion charter §5.3). Stiffness, dissipation time and friction coefficients are physical parameters; the stiction speed of a regularized law is a numerical parameter, reported, and never changed by a step variant (ADR-KIN-05). Penetration is an error under CL-H and a state under CL-1 and CL-2; an evaluator is told which law produced a gap.
CL-H, the written specification of the referee. At a contact with relative velocity u = (uₙ, u_T), where u_T collects the two tangential components and the spin component scaled by the effective radius, impulse λ = (λₙ, λ_T) and restitution e:
- normal: 0 ≤ λₙ ⊥ uₙ⁺ + e·uₙ⁻ ≥ 0, with the multi-contact applicability of e recorded;
- friction: ‖λ_T‖ ≤ μ·λₙ, and λ_T = −μ·λₙ·u_T/‖u_T‖ whenever u_T ≠ 0 (maximum dissipation);
- in cone form: with û = (uₙ + μ·‖u_T‖, u_T), the impulse lies in 𝒦_μ, û lies in the dual cone, and λ ⊥ û.
The term μ·‖u_T‖ is what makes the law non-associated: the conditions are not the optimality conditions of one convex program. Dropping it gives the associated model, whose artifact is known: a sliding contact acquires a separation velocity μ·‖u_T‖. CL-1 has that artifact in compliant form and the fidelity ledger measures it. Solvers: a fixed-point iteration on s = μ·‖u_T‖ with a convex cone program inside each pass, which reuses stage 8 of §16.6; projected Gauss–Seidel with exact cone projection; proximal ADMM; and semismooth Newton on the referee through FrankenSim. The residual is the natural-map residual ‖λ − Π_𝒦(λ − û)‖ in consistent units, TARGET at most 10⁻⁶ for evaluation and 10⁻⁴ for training.
As a batch law F, CL-H runs a fixed number of outer passes under masks, and a world over the residual bound is
Degraded: unconverged. Nothing guarantees convergence at a fixed count. Pilot before funding: on batch-cpu,
10⁴ contact states sampled from the standard battery, counting passes to a residual of 10⁻⁴; falsifier, more than
a tenth of states need over eight passes. Ceiling: negative on throughput, since each pass costs one CL-1 solve;
the benefit is the removal of creep and of the associated-flow artifact, valued by how often the model-form check
of §16.9 flips. ✖ KILL-HARDCONTACT: GATE-TRAC-09 fails after one repair cycle; fallback, per-island ADMM or
Gauss–Seidel at fixed iterations with a residual flag on batch-cpu only, and CL-H remains the referee's
specification and a model-form arm under strict.
Response batches on a fixed active set F. At a converged step the factor of H is reused to solve many right-hand sides: counterfactual impulses, adjoint columns, the stencil of §17.13 at one state. Each column carries the bound ‖x̂ − x*‖ ≤ (‖b − H·x̂‖ + ρ)/λ_lo, with ρ the rounding margin of the computed residual (§18.19), for a certified lower bound λ_lo on the smallest eigenvalue, and a guard that sends any column crossing a stick, slip or open boundary back to the full solve. It is a diagnostic query, not a stepping path. Ceiling: against a baseline that also factors once, none in flops; what the mechanism adds is the per-column bound and the mode guard. Against a full re-solve per query the flop ratio is about 14 for 64 columns at 96 rows, and only for queries of that shape. Pilot before funding: the share of columns the guard reroutes on battery states. ✖ KILL-RESPONSE: guards reroute more than half the columns; fallback, full solves. The anchor, the acceptance rule, the known answers and the gate (GATE-TRAC-11) are in §18.19.
Barrier contact stays FrankenSim's lane (FD-FSIM-02) and is not built here.
18.6 Friction, and the cone in four dimensions
Isotropic cones by default. Anisotropic elliptic cones for mecanum rollers, treads and skates. Rolling resistance for feet and wheels is an extra row. The stiction speed of the regularized law is a reported parameter, and creep under it is one of the quantities in the fidelity ledger. Velocity-dependent dry friction (Stribeck) uses the lagged-coefficient mechanism of ADR-TRAC-06 and stays Frontier until it has cards with provenance.
Torsional friction is the fourth dimension of the contact cone S, not a separate row. For a contact with effective patch radius r_eff the impulse (λₙ, λ_t1, λ_t2, λ_s) satisfies
√(λ_t1² + λ_t2² + (λ_s / r_eff)²) ≤ μ·λₙ,
and in the anisotropic case √((λ_t1/μ₁)² + (λ_t2/μ₂)² + (λ_s/(μ_s·r_eff))²) ≤ λₙ. Both are linear images of the
second-order cone in ℝ⁴, so the Cone abstraction of C-06 (Jordan product, spectral decomposition, projection,
barrier) serves them unchanged and no kernel family is added. A contact with r_eff = 0 masks its spin row and is
the three-dimensional cone.
- Where r_eff comes from. For uniform pressure on a disk of radius a the torsional capacity is (2/3)·μ·N·a, so r_eff = 2a/3; for a Hertzian pressure it is 3π·a/16, about 0.59·a. The value comes from the sample geometry or the interface card (OPEN-TRAC-2).
- Why one cone. With sliding speed v and spin ω, maximum dissipation on this cone gives a tangential force of μ·N·v/√(v² + (r_eff·ω)²). At v = r_eff·ω it is μ·N/√2. Independent rows would grant μ·N of sliding friction and μ·N·r_eff of torsional friction at once, 41% more in magnitude than the surface can supply, and a foot that pivots while it slides would hold where it should slip.
- What is approximated. The cone is an ellipsoidal approximation of the true limit surface of a patch. Its error is measured against patch quadrature on the referee and recorded in the fidelity ledger.
- Patches. One four-dimensional contact can stand for a small patch. A patch that must carry a tilting moment keeps at least three non-collinear contacts. A pressure distribution is never inferred from one resultant wrench; where it matters, the patch defines its centre of pressure and its quadrature.
18.7 Joint-level rows: stiction, backlash and hard stops S
- Hard stops are the unilateral limit rows already in stage 7.
- Stiction. The friction torque of a joint lies in [−τ_s, τ_s] and opposes motion: a one-dimensional cone. On the lockstep tiers it is a convex potential with a stated stiction speed, the same regularization as CL-1; under a transactional profile it is an exact row with located stick and slip events. τ_s comes from the actuator card (§15) and may depend on load and temperature through the lag of ADR-TRAC-06.
- Backlash. With rotor angle θ, joint angle q, ratio N and gap β, the relative angle is δ = θ/N − q, the sign
convention of §15.6, and the rows are −β/2 ≤ δ ≤ β/2: two unilateral rows on the relative angle between the rotor,
which is its own degree of freedom at the card levels that carry rotor state (§15), and the output. Gap closure is
an impact: an event under a transactional profile and a compliant row on the lockstep tiers. β is a per-world
parameter and may grow with wear (§31). Requesting backlash rows for a card with no rotor state is refused
(
FROB-REF-241).
Counterexample for the plausible shortcut: backlash modeled as a dead zone on the torque command produces no impact when the gap closes and no hunting in a position loop, the two effects a backlash model exists to show. Known answers, hand-checkable: under a torque ramp τ = k·t a stuck joint breaks away at t = τ_s/k. A rotor of inertia J = 10⁻⁴ kg·m² turning at 5 rad/s behind a ratio of 10 crosses a gap of 0.5° in β·N/ω₀ = 17.5 ms and, closing inelastically on an output of inertia 0.05 kg·m², leaves it at J·N·ω₀/(J·N² + I_out) = 0.083 rad/s.
18.8 Film friction for wet and greasy floors S
A constant coefficient per floor texel misses one effect that decides slips: on a lubricated floor, friction depends on how long and how hard the foot has pressed. The law below captures it at the contact, with no fluid solver. Films that the robot spreads, slosh and coupled fluid islands are §19's Frontier and Moonshot items; they write the film field this law reads.
- Inputs. From the interface card for the floor's condition: viscosity η, initial film thickness h₀ (from the scene's film field), combined roughness σ, the boundary-lubricated coefficient μ_b, and the dry coefficient μ_d that applies where there is no film.
- State. A film thickness h per contact, held in contact memory and in the restore set of §16.5.
- Squeeze. Under a normal load N on a patch of radius a the film thins by Stefan's law, dh/dt = −2·N·h³/(3π·η·a⁴), which integrates to 1/h² − 1/h₀² = 4·N·t/(3π·η·a⁴).
- Coefficient. A share ψ(h/σ) of the load rides on asperities and the rest on the film, with ψ = 1 for h ≤ σ, ψ = 0 for h ≥ 3σ and a monotone blend between: μ_eff = ψ·μ_b + (1 − ψ)·η·v·π·a²/(h·N). The second term is Couette shear, F = η·v·A/h. With h₀ = 0 the law returns μ_d exactly. A squeezed film recovers to μ_b, not to μ_d: a wiped wet floor is still not a dry one.
- Regime indicator. The Hersey number Π = η·v/(p·a) with p = N/(π·a²) is reported per contact. The card
declares the range of Π and h/σ over which it was calibrated; outside it the result is flagged
extrapolated, or refused under--strict-data(FROB-REF-242). - In the solve. μ_eff is computed from committed state and held constant inside the step (ADR-TRAC-06).
- Evidence. The law is semi-empirical and its outputs are classed
Estimated. FACT:fs-tribohasresistive_filmandstribeck_frictionmodules, which the referee uses as a cross-check.
Worked values, hand-checkable from the integrated law, to 10 µm from a thick film: water (1 mPa·s) under a patch of radius 2 cm carrying 100 N, 0.038 s; cooking oil (60 mPa·s) under the same patch, 2.3 s; water under a patch of radius 6 cm carrying 400 N, 0.76 s. Against a stance of 0.3 s, a small foot on water reaches boundary friction almost at once, while oil and large flat feet ride a film for the whole stance. A map of constant coefficients cannot represent that difference.
✖ KILL-FILM: on the wet-floor battery (an oil patch and a water patch, one wheeled and one legged robot, 200 randomized episodes each) the law changes fewer than 10% of episode outcomes against a constant-coefficient patch at μ_b, or adds more than 5% to step time. Fallback: static condition cards with one coefficient per texel on the lockstep tiers; the film law is kept on the transactional profiles for audits.
18.9 Wheels, tracks and hybrids
- Wheels. A wheel is a body, a revolute joint and a cylinder or torus collider. Contact and friction do the rest, so slip, traction limits and climbing a threshold come from the physics and not from a kinematic rule.
- Omnidirectional wheels. Mecanum and omni wheels are an anisotropic friction ellipse aligned with the roller axis in the wheel frame. Individual rollers are not simulated.
- Tyre laws F. Brush and Fiala models as constitutive laws from slip ratio and slip angle to contact force, for vehicles where carcass compliance matters. The lateral brush law has ‖F_y‖ = μ·N·(3ζ − 3ζ² + ζ³) for ζ = C_α·‖tan α‖/(3·μ·N) ≤ 1 and μ·N beyond, which fixes two known answers: the initial slope C_α and saturation at tan α = 3·μ·N/C_α.
- Tracks F. A track is a set of road wheels plus a belt modeled as a contact surface with prescribed tangential velocity and an anisotropic friction ellipse, with distributed patches along the belt and yaw scrub. A full link-chain track is a Moonshot.
- Hybrids. A wheel-leg robot or a stair-climbing wheel cluster is a composition of the above and needs no new mechanism (C-12).
- The nonholonomic model of C-07 is not what the simulator integrates. It is the planning model, the static analysis model, and the known-answer oracle for rolling.
Counterexample for treating a tracked base as a rolling constraint, hand-checkable: exact lateral no-slip at contact stations a ahead of and behind the centre requires v_y + a·ω = 0 and v_y − a·ω = 0, hence ω = 0. A skid-steer or tracked base turns only by slipping, so its turning is a property of the friction law.
The oracle for rolling is the closed form Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)) with δ = ω·Δt and
sinc(0) = 1. FACT-to-recheck: a near-straight integration defect is reported in fs-mbd::planar_drive at the
pinned commit (heading 32 rad, wheel speeds 1 and 1 + 6·10⁻¹³ m/s, track 0.5 m, 400 steps of 1/400 s return zero
translation where about (0.8342, 0.5514) m is correct). It is an admission test at INT-FSIM-01 and an upstream
work item (FD-FSIM-11); planar_drive is not used as an oracle until it passes.
18.10 Terrain mechanics
| Ground | Model | Tier |
|---|---|---|
| Rigid floor with a friction map (tile, concrete, wood, wet patch, grease) | CL-1 with per-texel interface cards; the film law of §18.8 where the card carries a film | S |
| Compliant coverings (carpet, mats) | CL-1 with covering stiffness and a rolling-resistance row | S |
| Soft soil under wheels and tracks | Bekker–Wong pressure-sinkage and Janosi–Hanamoto shear | F |
| Granular media under legs | Resistive force theory | F |
| Terrain that deforms and stays deformed | Rut and footprint fields | M |
Soft soil. Pressure and sinkage: p = (k_c/b + k_φ)·zⁿ for a contact of width b, so a plate under pressure p
sinks z = (p/(k_c/b + k_φ))^(1/n). Shear: τ = (c + σ·tan φ)·(1 − exp(−j/K)) for shear displacement j. For a track
of length L and ground area A under weight W at slip i, with j = i·x along the track, the thrust is
F = (A·c + W·tan φ)·(1 − (K/(i·L))·(1 − exp(−i·L/K))). Illustrative substitutions: b = 0.1 m, k_c = 1 kPa/mⁿ⁻¹,
k_φ = 1,500 kPa/mⁿ, n = 1.1 and p = 20 kPa give z = 19.6 mm; two tracks of 0.5 m by 0.1 m under 500 N with
c = 1 kPa, φ = 30° and K = 25 mm give a limit of 389 N and 293 N at 20% slip. A soil card declares the ranges of
pressure, slip and sinkage over which it holds, and a query outside them is refused (FROB-REF-243). The values
a gate pins are derived on file from a cited soil table read at its primary source (Appendix H); no value is
taken from a script that is not in the repository.
Persistent deformation M. Ruts and footprints live in a per-world mutable buffer over shared static tiles. A rut made in one episode must have no effect on another; reset and checkpoint fixtures detect the leak.
18.11 Contact capacity and the rule against capacity bias
Capacity is exposed per solver and revision: the lockstep capacities of §16.6 and the referee's cap of 21 (§16.4). It is checked twice: at model compile, from the static maximum of simultaneously active samples, and at run time. Three responses to an overflow are allowed, and removing contacts is not one of them:
- a documented patch reduction with its qualification fixture: the samples of a small patch become one four-dimensional contact with the patch's torsional capacity, provided the remaining contacts still carry the tilting moments the scenario needs;
- a larger admitted solve (an upstream work item for the referee, FD-FSIM-13; a higher capacity and a new
StepPlanIdfor the lockstep tiers); - a named refusal (
FROB-REF-721,FROB-REF-722).
Capacity bias. A comparison between designs is honest only if both arms were simulated. DESIGN: when the
arms of a comparison differ by more than one percentage point of worlds in Degraded or capacity-refused
episodes, the verdict is labeled capacity-biased, the envelope prints the overflow of each arm, and the result
cannot be established (FROB-REF-822 if cited). Fixture: a tracked design against a point-foot design under an
artificially low cap must return capacity-biased and no winner.
18.12 Precision: diagonal scaling, and why half precision is rejected
Diagonal scaling S. Stage 8 solves the Newton system in scaled variables: Ĥ = S·H·S with S diagonal and each sᵢ
= 2^(−⌈eᵢ/2⌉), with eᵢ the binary exponent of Hᵢᵢ, which is the rule of §35.10 (K-scale-diag here and K-scale
there are one kernel). Reasons:
- Units. Degrees of freedom mix metres and radians and their diagonal entries differ by orders of magnitude. One tolerance on the unscaled gradient is a dimension error. In scaled variables the gradient norm is dimensionless and one tolerance means the same thing for every robot.
- Conditioning that matters. FACT (computed estimates on one humanoid, Appendix H): the condition number of H is 3 × 10⁴ to 10⁵ raw and 2 × 10³ to 9 × 10³ with unit-diagonal scaling at default compliant settings, and 2 to 3 × 10⁶ raw and 2 to 5 × 10⁵ scaled with near-rigid contact. With single-precision round-off u = 6.0 × 10⁻⁸, κ·u is 0.12 to 0.18 raw and 0.01 to 0.03 scaled in the near-rigid case. The scaled figure governs the accuracy of the solve and the convergence of every iterative component (the passes of CL-H, stopping tests, line-search thresholds).
- Exactness. Multiplying by powers of two changes exponents only, so the scaling introduces no rounding and costs no determinism class; κ(Ĥ) is within a factor of four of the unit-diagonal value, because the scaled diagonal entries span a ratio of up to four.
Counterexample for a plausible claim: scaling does not make the Cholesky factor more accurate. Without pivoting,
the computed factor of S·H·S is S times the computed factor of H bit for bit, absent overflow and underflow
(PO-TRAC-03), because its rounding errors are already those of the scaled problem. What scaling repairs is
everything around the factor. Admission: a card whose stiffness puts the estimated scaled κ·u above 0.05 on an
f32 tier is refused there (FROB-REF-244) and runs on batch-cpu in f64 (TARGET bound, OPEN-TRAC-4).
Half precision is rejected. The proposal was to factor H in half precision on matrix accelerators and recover accuracy by refinement in single precision. The refuting calculation:
- Conditioning. Half precision has round-off u₁₆ ≈ 4.9 × 10⁻⁴, and refinement contracts only if κ·u₁₆ < 1. Take a rank-one contact operator W with the proximal shift ρ = 10⁻²·tr(W)/48 for 16 contacts: its largest eigenvalue is tr(W), so κ = 1 + 48/0.01 = 4,801 and κ·u₁₆ = 2.34. FACT (emulated in software on three reference models, Appendix H): after unit-diagonal scaling, κ·u₁₆ ≥ 1 in 37 to 64% of sampled contact states, and a half-precision factor with single-precision refinement fails in 9 to 18% of them.
- Cost. A single-precision Cholesky costs n³/3 flops and each refinement step about 3n², so k steps cost 9k/n times the factor they replace: 2.3 at n = 27 with seven steps, 1.5 at n = 35 with six, 3.0 at n = 18 with six. Refinement alone costs more than the factorization it was meant to cheapen, and the ratio falls below a quarter only above about 200 unknowns.
- Hardware. Matrix accelerators speed large products; a per-world matrix of 18 to 64 rows is smaller than one panel, and Apple GPUs have none. The published gains were measured against double precision at 22,000 unknowns, and the theory promises at most a factor of two against a single-precision baseline.
Nothing about contact solves survives. A request for half-precision solve or state storage is refused
(FROB-REF-245). Matrix accelerators are not adopted for policy networks of a few hundred units either (§23.8).
18.13 Verbs
| Verb | Kind | First milestone | What it returns |
|---|---|---|---|
contact.laws |
read | M1 | The admitted laws per tier and profile, their parameters by class (physical or numerical) and the cards in use |
contact.probe |
read | M1 | A law, cone or film evaluated at a stated contact state: impulse, regime, μ_eff, Hersey number, validity flags |
contact.capacity |
read | M2 | Static contact maxima of a design against lockstep capacities and the referee's cap, with the patch reductions that apply |
contact.audit |
run | M2 | The tunnelling audit on sampled windows with certified collision detection: missed contacts per 10⁶ world-steps, by scene class |
contact.clearance |
run | M3 | clear with a certificate, penetrates with a witness, or unknown with what to refine, for a body sweep against obstacles |
contact.soil |
read | M4 | Sinkage and thrust of a wheel or track on a soil card, with validity |
contact.response |
run | M4 | The response batch of §18.5 F, with per-column bounds and reroutes |
18.14 Refusals
| Code | Name | Raised when | Ranked repairs |
|---|---|---|---|
FROB-REF-240 |
Invalid cone | μ < 0, r_eff < 0 or a non-positive anisotropy | Fix the card |
FROB-REF-241 |
No rotor state | Backlash rows requested at a card level without a rotor degree of freedom | Raise the card level (§15) |
FROB-REF-242 |
Film law out of domain | Π or h/σ outside the card's calibrated range under --strict-data |
Use a calibrated card; accept extrapolated |
FROB-REF-243 |
Soil or tyre law out of range | Pressure, slip or sinkage outside the card's validity range | Another card; the rigid-floor model |
FROB-REF-244 |
Stiffness beyond single precision | Estimated scaled κ·u above the admission bound on an f32 tier |
batch-cpu in f64; a softer qualified card |
FROB-REF-245 |
Half precision | A half-precision solve or state buffer is requested | None; not offered |
FROB-REF-246 |
Law not admitted | A law requested on a tier or profile where its gate has not passed | The admitted law; strict |
FROB-REF-320 |
Thin feature | Scene geometry thinner than two fine voxels with no thin route | A thin primitive; a finer brick; the mesh path |
FROB-REF-321 |
No enclosure | A clearance certificate requested with no registered error bounds for a body or scene | Register bounds; accept unknown |
FROB-REF-822 |
Capacity-biased verdict | A capacity-biased comparison is cited as a verdict |
Raise capacity; apply a qualified patch reduction to both arms |
18.15 Invariants and proof obligations
| ID | Statement | How it is checked |
|---|---|---|
| INV-TRAC-01 | Every law on a lockstep tier is a convex potential, or is CL-H and reports its residual. | Hessian positive semidefinite by construction (T-08); residual in every receipt |
| INV-TRAC-02 | Friction parameters come from interface cards; a state-dependent coefficient is constant inside a solve. | Card provenance in the model; digest of coefficients before and after stage 8 |
| INV-TRAC-03 | An outer enclosure contains its body and an inner enclosure is contained in it under every admitted error. clear uses only disjoint outers; penetrates uses only intersecting inners. |
Randomized bodies with known truth; the 6 mm case |
| INV-TRAC-04 | No contact is removed to fit a capacity; a comparison with unequal overflow is labeled. | Forced overflow; the capacity-bias fixture |
| INV-TRAC-05 | Impulses and forces are typed apart; no tolerance applies to both. | The kernel dimension checker (C-14) |
| INV-TRAC-06 | Tangential memory is transported or reset at every witness change and each reset is an event. | The sill fixture; a mutation that keeps memory on a changed feature |
| INV-TRAC-07 | The film law returns the dry card exactly when no film is present, μ_b for h ≤ σ and pure Couette shear for h ≥ 3σ, and is continuous in h between. | Bit comparison at h₀ = 0; limits and continuity on 10⁴ random states |
| ID | Obligation | Class and route |
|---|---|---|
| PO-TRAC-01 | The four-dimensional cone is a linear image of the second-order cone; projection and Moreau identities hold (T-07 extended). | Certified by polynomial identity; G0 property tests |
| PO-TRAC-02 | The integrated Stefan law follows from dh/dt = −2·N·h³/(3π·η·a⁴). | Derivation on file; FrankenSymPy check |
| PO-TRAC-03 | Cholesky of S·H·S equals S times Cholesky of H bit for bit for power-of-two S, absent overflow and underflow. | Proved (scale invariance of rounding under the radix); tested on 10⁵ systems |
| PO-TRAC-04 | The torsional capacities (2/3)·μ·N·a and (3π/16)·μ·N·a follow from the uniform and Hertzian pressure integrals. | Derivation on file |
18.16 Known-answer battery
| Case | Truth |
|---|---|
| Block on an incline | Stays if tan α < μ and slides if tan α > μ; the measured threshold is within 1% of μ, and creep below it is at most the stated stiction speed. |
| Sphere rolling down an incline | Acceleration (5/7)·g·sin α without slip. |
| Disk rolling on a plane | v = ω·r within 0.1%; the nonholonomic trajectory of C-07 against the closed form of §18.9. |
| Box stack, ten high | At rest for 10 s with drift below 1 mm. |
| Dropped body, inelastic law | Total mechanical energy never increases. |
| Capsule against a spherical distance field | Gap error at most the interpolation bound. |
| Mecanum base commanded sideways | Moves sideways with yaw below 1°. |
| Ring on a cone | Slides if and only if tan α > μ (the garment analogue in FrankenTextiles §11.9, FACT). |
| Painlevé rod | The referee reports the indeterminate configuration instead of returning a number. |
| Disk spinning in place, uniform pressure | Stops at t = 3·a·ω₀/(4·μ·g): 0.153 s for a = 0.05 m, ω₀ = 20 rad/s, μ = 0.5. |
| Sliding and spinning at v = r_eff·ω | Tangential force μ·N/√2. |
| Thin ring sliding and spinning (r_eff = a, I = m·a²) | v/(a·ω) stays constant and both stop at t = √(v₀² + a²·ω₀²)/(μ·g): 0.288 s for v₀ = a·ω₀ = 1 m/s, μ = 0.5. |
| Traction along a diagonal | Maximum friction is μ·N in every direction; the pyramid mutation gives √2·μ·N. |
| Joint stiction under a torque ramp | Breakaway at t = τ_s/k. |
| Backlash crossing and closure | 17.5 ms and 0.083 rad/s for the values of §18.7. |
| Stefan squeeze | The three times of §18.8 within 2%. |
| Sled on a full film | F = η·v·A/h. |
| Film law with no film | The dry card, bit for bit. |
| Thin barrier | Zero missed hits under transactional profiles; the endpoint-only mutation misses. |
| Wheel over a sharp sill | Feature sequence flat, edge, top; work and impulse converge under step halving; no unexplained couple. |
| Clearance with errors | 6 mm nominal with 4 mm per side: unknown. 10 mm nominal with 4 mm per side: clear with 2 mm to spare. |
| Sole straddling a low-grip strip (μ 0.25 inside, 0.8 outside, uniform pressure) | With the boundary at offset z from the centre of a sole of width w the high-grip share is clip(½ + z/w, 0, 1): capacity 0.525·N at z = 0 for any width; at z = 12 mm, 0.690·N for w = 40 mm and 0.619·N for w = 70 mm. Area alone does not predict traction. |
| Load-weighted slip metric | Duplicating a quadrature point and halving its weights changes nothing. |
| Plate sinkage and track thrust | The closed forms of §18.10. |
| Lateral tyre force | Slope C_α at zero slip; saturation μ·N at tan α = 3·μ·N/C_α. |
| Skid-steer under exact lateral no-slip at two stations | Yaw rate zero. |
| Rut isolation | A rut made in one episode is absent from every other. |
18.17 Gates and kill gates
| Gate | Claim | Threshold (TARGET) | Earliest |
|---|---|---|---|
| GATE-TRAC-01 | Known answer | Every row of §18.16 that tests a Solid mechanism passes on strict and on batch-cpu, and on referee for the rows FrankenSim's solve can express (the list is recorded with the gate); rows for the fast law pass on GPU tiers within the stated creep. |
M1 and M2 |
| GATE-TRAC-02 | Parity | Primitive pair distances and normals agree with fs-query within 10⁻⁹ m (f64) on 10⁶ random pairs. |
M1 |
| GATE-TRAC-03 | Fidelity | Tunneling audit: on the M2 battery the fast tiers miss fewer than 1 contact per 10⁶ world-steps that the certified detector finds. | M2 |
| GATE-TRAC-04 | Known answer | Cone and joint rows: spin stop, ring co-stop, stiction breakaway and backlash values within 1%; coupled and diagonal forces within 0.5% of μ·N/√2 and μ·N; the pyramid and independent-row mutations fail. | M2 |
| GATE-TRAC-05 | Known answer | Film law: Stefan times within 2%; Couette force within 10⁻⁶ relative in f64; the dry limit bit-identical; the limits at h ≤ σ and h ≥ 3σ and continuity between them on 10⁴ random states. |
M3 |
| GATE-TRAC-06 | Known answer | Fixtures: zero missed hits in 10⁶ randomized thin-barrier crossings under transactional profiles and the endpoint-only mutation caught; on the sill, work and impulse within 1% of their refined values at h/4 and no couple above 10⁻⁹ N·m in f64; the capacity-bias comparison labeled. |
M1 (referee); M2 (strict) |
| GATE-TRAC-07 | Known answer | Enclosures: on 10⁴ generated pairs with known truth, no false clear and no false penetrates; the 6 mm case answers unknown; every certificate re-checked offline (§12). |
M3 |
| GATE-TRAC-08 | Known answer | Soil, track and tyre: law evaluations match the closed forms within 10⁻⁶ in f64; simulated plate sinkage and drawbar pull within 2% of them; rut leak zero over 10³ resets. |
M4 |
| GATE-TRAC-09 | Fidelity | CL-H on batch-cpu: residual at most 10⁻⁴ within eight passes on at least 95% of battery contact states and 10⁻⁶ under strict; zero creep on the incline below threshold; no separation velocity on a sliding block; agreement with the referee on the Solid rows of §18.16. |
M5; GPU at M6 |
| GATE-TRAC-10 | Known answer (numerics) | Scaling: bit-identical solutions with and without S on 10⁵ sampled systems; f32 against f64 Newton-step error at most 0.5% at default cards and 5% at near-rigid cards; cards over the bound refused. |
M2 |
| ✖ KILL-CONTACT | — | Trigger: GATE-FID-01 fails on slip or creep after parameter mapping and one repair cycle. Fallback: CL-2 becomes the default with a published lower throughput; if that also fails, locomotion claims are restricted to the referee tier and the fast tiers are labeled exploratory. | M2 |
| Kill | Trigger | Fallback |
|---|---|---|
| ✖ KILL-FILM | §18.8 | Static condition cards on lockstep tiers; the law on transactional profiles only |
| ✖ KILL-HARDCONTACT | §18.5 | Fixed-iteration island solvers on batch-cpu with a residual flag; CL-H as specification and model-form arm |
| ✖ KILL-MESHGPU | §18.3 | Analytic thin primitives on GPUs; meshes on CPU tiers |
| ✖ KILL-RESPONSE | §18.5 | Full solves per query |
| ✖ KILL-SOIL | GATE-TRAC-08 fails after one repair cycle, or no soil card can be sourced with provenance | A rigid floor with rolling resistance and a drag card labeled assumed; soft-ground results labeled exploratory |
Frontier and Moonshot items not covered above, each with the pilot that precedes funding and its ceiling:
| Item | Tier | Pilot and falsifier | Ceiling | Kill and fallback |
|---|---|---|---|---|
| CL-2 | F | Battery rows under CL-2 on batch-cpu; falsifier, no reduction in slip or impulse disagreement against CL-1 |
A fidelity gain only; throughput falls | Stays the KILL-CONTACT fallback |
| Tyre laws | F | Law evaluation against the closed forms; one vehicle scene; falsifier, rankings unchanged against a rigid wheel on the vehicle corpus | Fidelity for vehicles with carcass compliance | Dropped to rigid wheels with a rolling-resistance row |
| Belt tracks | F | Skid-steer turning radius and thrust against §18.10 on batch-cpu; falsifier, error above 10% |
Coverage of a robot class | KILL-SOIL's rigid fallback; road wheels with anisotropic friction |
| Granular media under legs | F | Plate drag and intrusion fixtures; falsifier, error above 20% against published curves | Coverage | Soft-soil law with a card labeled assumed |
| Persistent ruts | M | The leak fixture on batch-cpu |
Coverage of repeated-pass tasks | Off; terrain resets each episode |
| Link-chain tracks | M | Chain of 40 links on the referee; falsifier, contact count beyond every admitted capacity | Obstacle fidelity for grousers | Belt model |
| Tactile micro-patches | M | A fingertip pad as 2 × 2 and 4 × 4 four-dimensional contacts feeding the sensors of §20, on strict; falsifier, no change in grasp-slip outcomes against one patch |
Tactile sensing realism | One patch per pad |
18.18 Open questions
- OPEN-TRAC-1. Dense bricks or a sparse brick tree for interior scenes at 1 cm resolution. Default: dense bricks with a coarse outer level; revisit with measured memory at M3.
- OPEN-TRAC-2. The source of r_eff: sample geometry, a pressure assumption per material, or a card field. Default: 2a/3 from sample geometry, overridden by a card. Decided with GATE-TRAC-04.
- OPEN-TRAC-3. Provenance for film and soil cards: which measured tables are admitted. Default: generic
ranges labeled
assumed, which keep every resultEstimated. Owner: project lead. Blocks claims of realism for wet floors and soft ground, not validity. - OPEN-TRAC-4. The admission bound on scaled κ·u for
f32tiers. Default: 0.05. Decided by GATE-TRAC-10. - OPEN-TRAC-5. Witness-migration tolerances: δ_w and the largest normal rotation transported. Default: the sample radius and 30°. Decided on the sill fixture at M1; fail-closed default is reset with an event.
18.19 Response batches: anchor, acceptance, known answers, gate
What it adds. F. This subsection extends the paragraph "Response batches on a fixed active set" of §18.5,
which states the mechanism, its ceiling, its pilot and KILL-RESPONSE, and leaves four things unspecified: the
identity a batch is bound to, the tests a column must pass, the source of λ_lo, and a gate. Owner:
frob-contact. Verb: contact.response.
Anchor (DESIGN). A batch is keyed by an anchor digest over everything its factor depends on, at one converged step of one world: the configuration, the mass matrix, the constraint Jacobian, the regularization, the cone parameters, and the active set with a stick or slip label per row. A batch is served only against the anchor it was factored for. Any other request refactors (refusal otherwise: response batch requested against a stale anchor).
Per-column acceptance. A column b is accepted only when all four hold, each evaluated in the precision of the step that produced the anchor:
- the residual r̂ = b − H·x̂ is formed explicitly in the working precision, not estimated from the solve, together with a bound ρ on the rounding error of forming it: ρ = γ·‖ |H|·|x̂| + |b| ‖₂ with γ = (n + 1)·u/(1 − (n + 1)·u), n the row length and u the unit roundoff (2⁻²⁴ in single precision); a residual formed in a wider format uses that format's u;
- every sticking row remains strictly inside its cone, and the slack is reported;
- no open row closes and no active normal force changes sign;
- the bound ‖x̂ − x*‖₂ ≤ (‖r̂‖₂ + ρ)/λ_lo is attached to the column. Without ρ the expression is not a bound: in single precision H = 3 and b = 1 give x̂ = 0.33333334, a computed residual of exactly 0 and a true error of 9.9 × 10⁻⁹; with ρ = 2.4 × 10⁻⁷ the bound is 7.9 × 10⁻⁸.
A column that fails test 2 or test 3 is rerouted to the full solve of §16.6 and counted.
The lower bound λ_lo. H = A + JᵀGJ with G positive semidefinite (§16.6), so a lower bound on the smallest
eigenvalue of A is one for H. λ_lo is a shift s for which A − s·I is shown positive definite by the
rational-ldlt proof kind of §12, computed once per anchor on the host; A depends on the configuration and
not on the active set, so the certificate serves every column of the batch. Where a tighter value is wanted the
same proof kind is applied to H − s·I. A batch whose λ_lo has no certificate reports its bounds as class
Estimated.
Known answers, by hand.
- The bound, at equality. H = [[2, 1], [1, 2]] has eigenvalues 1 and 3, so λ_lo = 1. For b = (3, 3) the solution is (1, 1). The perturbed x̂ = (1.01, 0.99) has residual (−0.01, 0.01) of norm 0.01414, and its true error also has norm 0.01414: the error lies along the eigenvector of the smallest eigenvalue. A bound formed with λ = 3 would claim 0.00471 and is violated; that mutation must be caught.
- The mode guard. A block rests on a floor with μ·N = 5 N and the anchor is in stick. A counterfactual tangential load of 4 N is accepted: friction answers 4 N and the block stays. A load of 6 N must be rerouted: on the frozen sticking set the linear response reports no motion, and the true response slides under a net force of 1 N.
- The flop count. At n = 96 unknowns and 64 columns, a full solve per column costs n³/3 + 2n² = 294,912 + 18,432 = 313,344 flops, 20,054,016 in all. One factor and 64 solves cost 294,912 + 64 × 18,432 = 1,474,560. The ratio is 13.6, and it reaches 10 from 23 columns. Against a baseline that also factors once it is 1, which is the ceiling §18.5 already states.
Gate.
| Gate | Claim | Threshold (TARGET) | Earliest |
|---|---|---|---|
| GATE-TRAC-11 | Known answer | The three fixtures reproduce and the λ = 3 mutation is caught. On 10⁴ battery contact states with 64 random columns each, solved in f32 and compared with a full f64 re-solve of every column: zero accepted columns whose true error exceeds the attached bound, and zero accepted columns whose re-solve has a different active set or stick label. The rerouted share is reported per robot class. A batch requested against a changed anchor is refused. |
M4 |
✖ KILL-RESPONSE gains a second trigger: a bound violation or a false mode acceptance that survives one repair cycle. Its fallback is unchanged: full solves per query.
18.20 Swept bounds enclose arcs
What it is. S The construction of the swept bounds that §18.4 and step T4.2 of §16.5 name. A bound swept over a
sub-interval encloses the path of the geometry, and a link that rotates does not move along the chord between its end
positions. A pair discarded in the broad phase never reaches the narrow phase, so an undersized bound is a missed
contact with no later chance of detection. Owner: frob-contact. Verbs: contact.audit, contact.clearance.
Counterexample. A 1 m arm turns from −60° to +60° about a fixed pivot at the origin. Its tip is a sphere of radius 5 cm, and an obstacle sits at (1, 0) m. The tip's end positions are (0.5, ∓0.866) m, their chord lies on x = 0.5 m, and the chord padded by the radius reaches x = 0.55 m. The tip passes through (1, 0).
Construction. DESIGN. For a sample of radius r with end positions A and B over the sub-interval:
- One revolute joint. For a rotation by an angle Δθ of magnitude at most π at orbital radius R, the bound is the segment AB dilated by the sagitta R·(1 − cos(Δθ/2)) plus r. In the counterexample the sagitta is 0.5 m and the bound reaches x = 1.05 m.
- Any admitted motion. Let L be an upper bound on the length of the sample's path: the sum over the moving ancestors of the joint-speed limit times the largest lever arm of the sample about that joint, plus the base speed bound, times the duration. Every point X of the path satisfies ‖X − A‖ + ‖X − B‖ ≤ L, so the path lies in the segment AB dilated by ½·√(L² − ‖B − A‖²), plus r. For the counterexample L = 2π/3 m and the dilation is 0.589 m, which contains the sagitta bound.
- Where a speed limit is missing. The bound uses the speed at the start of the sub-interval plus the largest change that the actuator and load limits allow over it. A model that supplies neither is refused at admission (refusal: swept bound requested without a speed bound).
FACT (frankensim/crates/fs-contact/src/broad_phase.rs:146–156 at 483d09c682f2, read 2026-11-21): the suite's
swept_sphere_aabb documents that it "encloses straight centre motion only" and leaves curved trajectories to the
caller. It is used for prismatic and ballistic segments and not for a sample on a rotating link.
| GATE-TRAC-12 | Known answer. The arc fixture is detected on 1,000 of 1,000 seeded variants (radius 0.2 to 2 m, angle up to π, sphere radius 1 to 10 cm, an obstacle on the arc and outside the padded chord); the chord-only mutant fails the gate. On 10⁴ random two- and three-joint sweeps the bound of the second item contains 1,000 sampled path points per sweep with no exception. In the tunnelling audit (contact.audit) no missed contact is attributed to a broad-phase rejection. M1 on the referee, M2 on the transactional batch profile. |