Adaptive clearance sampling 2026-11-05
Adaptive clearance sampling spends more collision detection queries on portions of a trajectory that are difficult to certify, instead of accepting a path merely because a fixed set of samples is clear. Its guarantee comes from a bound on motion between samples. A configuration space path must satisfy the geometric constraints continuously.[ref]
Robotic Systems by Kris Hauser. Chapter 8, Stating the motion planning problem; Chapter 9, clearance
Represent the body by a nonempty compact set and the fixed obstacles by a nonempty closed set. Let be their nonnegative set distance, and suppose a known Lipschitz continuity bound gives . On an interval of duration with endpoint clearances , each time is at most from one endpoint. Hence an endpoint certificate for continuous collision clearance isIf this lower bound is strictly positive, the entire interval is clear. For a required clearance margin , require the bound to exceed instead. Otherwise query the midpoint and subdivide. A sharper certificate uses both endpoint cones; when and the distances satisfy the assumed bound, its minimum is . The simpler bound is sufficient for the example below.
For a translating and rotating rigid body, a valid speed estimate is , where is a bounding radius for rigid-body clearance, provided these are bounds over the whole interval and the obstacles stay fixed. The angular clearance bound for a rotating body proves the rotational contribution. A distance-estimation error bounded by can be accommodated by replacing each reported endpoint distance by its lower bound .
In an original point-motion example, with and passes the obstacle point . Its exact clearance is and suffices. Require . The initial endpoint certificate is positive but below this required margin, so more queries are needed. Recursive midpoint sampling certifies long intervals away from the obstacle and refines only near the closest approach. The stated midpoint rule uses 15 distance queries and certifies 14 intervals. The figure shows the exact function alongside the sampled certificate; the formula is known here only because the example is constructed.
Adaptive endpoint certificates for a trajectory passing 0.01 m from a point obstacle, with a required clearance of 0.005 m. Original exact geometry and recursive midpoint calculation.
Details. Unresolved intervals in adaptive collision checking must remain unresolved if a chosen depth or time budget is exhausted: failure to certify positive clearance does not establish a collision. Conversely, a query with exact zero set distance establishes contact or intersection. A sampled positive distance at or below violates the requested margin but does not establish contact. With exact queries, a valid finite and a trajectory whose clearance has a positive lower bound, subdivision eventually certifies every interval for ; a positive requested margin requires a positive surplus above that margin. Without positive clearance, finite termination is not promised.
Angular clearance bound for a rotating body 2026-11-05
A rigid body can hit an obstacle while its reference point stays fixed. An angular clearance bound for a rotating body controls the motion of every body point, allowing a collision detection calculation to reason about orientations between sampled poses.
Let a compact set lie within a bounding radius for rigid-body clearance of a fixed pivot. For a planar rotation matrix , a point moves by a chord of a circle:The same correspondence bounds the Hausdorff distance between the two body sets. For a fixed nonempty closed set of obstacles , let be the nonnegative set distance between and . The triangle inequality, applied to each point pair and then to their infima, givesThis is an explicit Lipschitz continuity bound. It concerns a fixed obstacle and the specified rigid geometry, rather than a universal constant for every robot.
To cover every intermediate orientation with excursion at most from a sampled pose, use , or the simpler . The cap matters because the sine is not increasing beyond . With translation displacement bounded by , the triangle inequality gives the sufficient clearance reduction .
For an original example, a body with rotating by at most moves any point by at most . An exact sampled clearance of leaves at least throughout that angular excursion when the pivot and obstacles stay fixed.
The whole excursion must be bounded, not just the difference between endpoint orientations modulo . A full revolution has identical endpoint orientations but can sweep through an obstacle. Likewise, a unit half-length rod rotating from to about its center clears an obstacle point at by at both endpoints but touches it midway. Adaptive clearance sampling therefore uses bounds on the actual interpolated motion. Configuration-space orientation and clearance are central to the continuous-path planning problem.[ref]
Robotic Systems by Kris Hauser. Chapter 9, rotational configuration-space obstacles and planning in SE(2)
Aubin property Created 2026-10-06 Updated 2026-10-14
Near in a graph, this property requires neighborhoods and a finite such that for all . Nearby solutions can be matched under nearby perturbations with linear displacement control. Single-valued maps reduce to local Lipschitz continuity.
Bernoulli power substitution Created 2026-10-14 Updated 2026-10-25
For arbitrary real , work first on an interval where . Define exponentiation by , using the real logarithm. The change of variable is differentiable and invertible there, and the chain rule givesMultiplying the Bernoulli differential equation by yields the first-order linear differential equationThis is an exact transformation of nonzero solutions of a differential equation on the chosen branch; it is valid far from any reference state and does not discard higher powers as a local linearization would.
Given the initial condition , the integrating factor and transformed solution of a differential equation areThe product rule verifies . Recover only on the connected component of containing , inside the original coefficient interval. The first-order linear differential equation can have a longer existence interval than this inverse transformation allows.[ref]
1.4 Linear equations and the integrating factor. Notes on Diffy Qs, §1.4 Linear equations and the integrating factor: product derivative, formula (1.4), and Remark 1.4.1 on existence throughout a coefficient-continuity interval
Negative values need a separately justified real branch. For integer , the required powers are real and differentiable for too, but the inverse must retain the sign selected by the initial condition. For , represents either or ; both square roots are taken of positive . For , retains the sign directly. For a general noninteger exponent, use the positive branch unless a specific differentiable real negative branch has been established. Never evaluate a real fractional power of a negative value merely because the linear formula has become negative.
Division by excludes . When and the original real power is defined at zero, is an additional solution of a differential equation and must be checked in the original equation. When , the equation as written is undefined at zero. On a positive branch the right-hand side is locally Lipschitz in , so the Picard-Lindelöf theorem gives local uniqueness. At zero, the same hypothesis needs a fresh check: it holds for the polynomial example, whereas for a nonzero power coefficient prevents local Lipschitz continuity there. If , the inverse sends for , but sends for . The latter endpoint can lead to finite-time extinction in a sublinear Bernoulli equation, where the original equation determines how to join to zero.
Bounded diffusion coefficient gives square martingales Created 2026-10-14 Updated 2026-11-05
Let and , with measurable satisfying , and suppose a solution is given. The equation has zero drift. The Itô isometry gives , so is a true martingale on every finite horizon. The Itô formula givesThe expected integrated square of the last integrand is at most , so this is also a true square-integrable martingale. No continuity or Lipschitz continuity of is needed once the solution exists. A nonzero drift would add a further term and invalidate the displayed compensation.
Bounded-Lipschitz metric Created 2026-10-06 Updated 2026-11-05
The bounded-Lipschitz metric tests probability measures against a uniformly bounded Lipschitz class. It metrizes weak convergence of probability measures on separable metric spaces. With a complete compatible base metric, it is complete on the probability measures of a Polish space. Replacing the sum norm by the maximum norm changes the metric only by uniform constant factors.
Bounded slope condition Created 2026-09-24 Updated 2026-11-05
Boundary data satisfy the bounded slope condition with constant if, at every boundary point , there are affine functions and such thatand . Both the touching condition and the common slope bound matter; arbitrary affine upper/lower bounds would be much weaker.
An affine datum satisfies the condition with , using that same affine function for both supports. For a suitable convex variational problem on a convex domain, these supports serve as barriers through the comparison principle for convex variational integrals. Translation comparisons then produce a global Lipschitz continuity bound. This consequence requires the structural and boundary hypotheses of the variational problem, rather than following from the boundary inequalities alone.
Bounding radius for rigid-body clearance 2026-11-05
A bounding radius for rigid-body clearance bounds the distance of every point of a rigid body from the reference point used to describe its motion. It converts angular motion into a bound on point displacement, so collision detection can account for the whole body between sampled poses rather than only its reference point.
Let be a nonempty compact set in body coordinates and let be the chosen pivot in those coordinates. A valid radius satisfiesThe maximum exists by compactness and continuity of the Euclidean norm. A bound larger than is conservative; a smaller one does not cover the specified geometry. For a convex polytope with vertices , it is sufficient and exact to use : expressing a point as a convex combination and applying the triangle inequality proves that no interior point is farther away than the farthest vertex.
For an original rectangular-body example, take side lengths and . A pivot at the centre gives . A pivot at a corner instead gives . For a rotation about the respective fixed pivot, the angular clearance bound for a rotating body isThe smaller radius cannot be used for the corner-pivot motion unless the changed motion of the reference point is also included. A convenient geometric centre does not automatically remain stationary.
For a moving reference point with speed at most and angular speed at most , a point-speed bound is . This supplies a Lipschitz continuity constant for clearance against fixed obstacles. The role of body geometry and orientation in configuration space is developed in the primary planning text.[ref]
Robotic Systems by Kris Hauser. Chapter 9, Translating robots, C-obstacles for rotational motion and Motion planning in SE(2)
The modeled body must include attached tools and protrusions relevant to the query. Uncertainty in a rigid-body bounding radius can be accommodated with a conservative geometric enlargement. This radius controls motion around the declared reference point; it does not replace the separate required clearance margin for uncertain obstacle locations or tracking errors.
Causal curve 2026-10-06
A causal curve has an everywhere nonspacelike tangent of consistent time orientation; its smooth segments are timelike or null. More generally, curves with local Lipschitz continuity and future causal tangent almost everywhere are allowed. The causal future and causal past are defined by reachability along these curves.
Compatibility of bounded endpoint distance queries asks whether two uncertain distance readings could arise from any nonnegative clearance function obeying a stated motion bound. It tests consistency of the observations and assumptions; it does not itself prove that the entire motion is collision-free.
Suppose endpoint queries yield intervals and for the true set distances, with . Let the interval duration be and clearance have Lipschitz continuity constant . Write . Compatibility means there exist and satisfying . The exact condition isalong with the two intervals being nonempty and nonnegative. Equivalently, the gap between the two intervals, , must not exceed .
Necessity follows because , and , with the reversed argument for the other inequality. For sufficiency, overlapping intervals allow at any common point. If they are disjoint, choose their nearest endpoints; the boxed condition bounds that separation by . Linear interpolation between the selected nonnegative endpoints has slope at most , proving that at least one admissible continuous clearance function exists.
The feasible endpoint intervals can be tightened toThese are the exact projections of the feasible endpoint-pair set onto each coordinate. A large difference between the lower bounds alone is not a contradiction: lower bounds are not exact distances.
For an original example, take , and . Their nearest endpoints differ by , so the data are compatible. Tightening gives and . By contrast, and have a minimum gap and are incompatible with the same motion bound.
Incompatibility means that some query enclosure, motion bound, timing or model assumption is wrong. It is not evidence that a collision occurred. Compatibility also need not certify separation: exact endpoint distances of over one second with permit both constant clearance and a V-shaped clearance touching zero halfway through. The clearance certificate with bounded distance-query error evaluates a lower envelope over the full interval to answer that additional question.
For , compatibility reduces to overlap of the intervals because clearance is constant. With more query times, multi-sample consistency of distance-query intervals must preserve one common clearance model rather than checking unrelated pairs with incompatible bounds. The primary motion-planning formulation requires constraints along a continuous path, motivating these between-sample checks.[ref]
Robotic Systems by Kris Hauser. Chapter 8, Point-to-point path planning; Chapter 9, configuration-space obstacles
A proposed checker retains query lower and upper bounds, the clock interval, geometry version and motion allowance. It should report inconsistent inputs separately from undecided clearance intervals and certified margin violations. Tight numerical arithmetic alone cannot turn an unsupported standard uncertainty into a deterministic distance enclosure.
Consistency of a numerical method Created 2026-09-28 Updated 2026-10-14
For a one-step approximation to an ordinary differential equation, insert the exact solution and define the unscaled local truncation errorConsistency of a numerical method requires uniformly on the finite interval being approximated, under the stated smoothness assumptions. Merely asking is too weak: the useless update has defect , which tends to zero but generally fails the scaled test. Here denotes Big O notation. MIT uses this division-by-step convention.[ref]
https://ocw.mit.edu/courses/18-330-introduction-to-numerical-analysis-spring-2012/a9d2bd9be098f0ada172af40379a17cc_MIT18_330S12_Chapter5.pdf. Laurent Demanet, MIT 18.330, Chapter 5, Definition 6, 2012
For the Euler method, Taylor's theorem gives . A bounded second derivative therefore gives local truncation error and a scaled defect . Under a uniform Lipschitz continuity assumption on in , within a region containing the exact and numerical solutions, numerical stability controls accumulation over about steps. This yields global error with exact starting data. Consistency of a numerical method checks each step; numerical stability controls their combination.
Continuity of a characteristic function Created 2026-09-29 Updated 2026-10-18
Every characteristic function is uniformly continuous and satisfies and . Continuity follows from the dominated convergence theorem applied to .
More explicitly, if , then pointwise and . Apply the dominated convergence theorem to the real part and imaginary part separately. There is no finite moment hypothesis. For uniform continuity, the stronger estimatefollows by factoring out , whose absolute value is one. The integrand tends pointwise to zero and is bounded by two, so the dominated convergence theorem applies again. The bound is independent of , which supplies uniform continuity on the entire real line.[ref]
If the first absolute moment is finite, additionally gives , a Lipschitz continuity estimate. The earlier argument matters because continuity survives even when this expected value is infinite. For convergence in distribution, the separate Lévy continuity theorem concerns limits of whole sequences of characteristic functions; the argument here establishes continuity of one characteristic function.
Continuous dependence on forcing 2026-10-25
Solutions depend continuously on their forcing when convergence of the forcing in a specified norm implies convergence of solutions in a specified solution norm, with boundary conditions fixed. A uniform estimate is a stronger quantitative form, namely Lipschitz continuity of the solution map. The monotonicity energy estimate for a semilinear Dirichlet problem is an example.
A real convex function locally bounded on an open convex set has a continuous supporting linear functional at every interior point. Apply the dominated Hahn-Banach theorem to its sublinear directional derivative to obtain . Increasing secant slopes imply whenever the endpoint is in the domain. A local Lipschitz continuity bound gives both and , proving continuity.
Contraction mapping theorem Created 2026-09-24 Updated 2026-10-14
A contraction mapping on a nonempty complete metric space has exactly one fixed point , and the sequence converges to from every . The same constant must satisfy for all . The statement applies to metric spaces, including closed subsets of a Banach space; neither linearity nor a vector space structure is required.[ref]
https://maths.dur.ac.uk/users/norbert.peyerimhoff/analysis0708/dirknotes.pdf. Dirk Schütz, Analysis III/IV, page 13: contraction mapping theorem
The force of the result is that existence, uniqueness, and a practical approximation procedure arrive together. Repeated application produces corrections bounded by a geometric series, hence a Cauchy sequence; completeness supplies its limit. The Lipschitz continuity of makes that limit a fixed point. Two different fixed points would have their positive distance multiplied by at most while remaining unchanged, which is impossible.
Convergence by synchronous coupling for bounded continuous test functions Created 2026-10-06 Updated 2026-11-05
If two coupled processes approach each other in L2 and one family of marginals is uniformly tight, then their expectations of any bounded continuous test function approach each other. On a large compact set use uniform continuity; outside it use boundedness; control excessive coupling separation by the second-moment Markov bound. A constant expectation for one process then identifies the other limit. No global derivative or Lipschitz bound is necessary.
Coordinate Lipschitz continuity 2026-10-25
The displayed estimate, for all and real , defines a coordinate Lipschitz constant for the partial derivative in coordinate . It implies the coordinate descent lemmaby the fundamental theorem of calculus and integration of the Lipschitz continuity estimate. Subtracting an affine function leaves these constants unchanged.
The apparently weaker estimate along the singleton negative gradient direction is equivalent when every real step size is allowed: if the initial partial derivative is nonzero, any displacement can be written ; if it is zero but the final partial derivative is nonzero, reverse the endpoints; if both vanish the estimate is trivial.
Target: gradient-descent.bigb, under Lipschitz gradient. Cubic gradient nonlinearity Created 2026-09-28 Updated 2026-11-05
On a fixed bounded smooth three-dimensional domain, the nonlinear mapsends into . The Sobolev embedding theorem gives , and Holder inequality yieldsThe domain regularity is part of the embedding hypotheses.
For real , write . The difference identityand the same embeddings giveThus its local Lipschitz continuity constant on a ball of radius is . Composing this small nonlinear bound with a bounded linear elliptic inverse gives a contraction mapping on a sufficiently small ball, which is the mechanism of small-data existence for a nonlinear elliptic Dirichlet problem.
Delayed solutions of a square-root differential equation Created 2026-10-14 Updated 2026-10-20
This initial value problem uses a square root and absolute value to define a continuous function on all of . For every finite waiting time , a forward solution of a differential equation on isThe constant solution of a differential equation is another choice. For example, at , waits give values . These are dimensionless mathematical trajectories; no measured physical waiting time is being supplied.
Verification uses the original ordinary differential equation, including the join. Before departure, both and vanish. For , their common value is . For , the difference quotient at the join isThus the derivative exists at , equals the rate law there, and is continuous across the join. For the same computation gives the right derivative at the starting endpoint. For , the left and right second derivatives at departure are and : these forward solutions of a differential equation are continuously differentiable functions, without being twice differentiable at departure. The local two-sided statement of the Peano existence theorem is separate from this explicitly forward family.
The rate law tends to zero as , but its secant slopes from zero are unbounded:No finite local Lipschitz constant exists at zero. At the quotient is , even though the rates are shrinking to zero. Continuity controls the rate itself; Lipschitz continuity would control its change relative to the state displacement.
There is also a numerical lesson. The forward Euler method starting exactly at zero gives at every step. It reproduces the constant solution of a differential equation for every positive step size, while the moving trajectories remain equally valid. A computation producing one trajectory cannot establish uniqueness. Likewise, the separable differential equation calculation that divides by only describes the moving pieces: checking the original equation recovers the zero pieces and their joins.
Divisibility of Lebesgue measure Created 2026-10-05 Updated 2026-10-06
If is a Lebesgue measurable set and , some measurable subset has Lebesgue measure . The function has Lipschitz continuity with constant , starts at and ends at ; the intermediate value theorem proves the assertion. Applying the assertion successively to remaining portions of gives pairwise disjoint measurable pieces with any finite list of nonnegative measures whose sum is at most . This is a concrete consequence of non-atomic measure structure, which fails for general measures containing an atom of a measure.

