The calculus of smooth motion. Solving for robotic snap

Anyone who has ever deployed a heavy industrial manipulator knows the sound of 'robotic snap'. It is the violent, shuddering crack that occurs when a high-torque actuator is given an abrupt change in trajectory. In the digital realm, a command can change instantly. In the physical realm, it collides with inertia.

In a simulation, a foundation model can easily output a piecewise trajectory. The arm is at Point A, and in the next timestep, it is told to be at Point B. Many early Vision-Language-Action (VLA) implementations treated robot pathing like digital drawing, connecting dots with straight lines. When these discrete, angular paths are fed directly into the high-gain feedback loops of physical motor controllers, the result is crippling mechanical stress, jitter, and rapid hardware degradation.

Moving a physical mass smoothly requires respecting the calculus of motion. It is not enough to guarantee continuous position ($C^0$ continuity) or even continuous velocity ($C^1$ continuity). To avoid snapping a gearbox or dropping a payload, the control system must ensure continuous acceleration ($C^2$ continuity) and manage the rate of change of acceleration, known as jerk.

This turns trajectory generation from a simple geometric problem into a non-linear optimal control problem involving higher-order derivatives of position with respect to time. Mathematically, true fluidity requires minimizing an objective function that penalizes abruptness, the most common being the integral of squared jerk:

subject to the boundary conditions of initial and final position, velocity, and acceleration. Applying the calculus of variations and Pontryagin's Minimum Principle to this functional reveals that the unconstrained optimal trajectory in 1D space is a fifth-order (quintic) polynomial:

The coefficients $\{a_0, \dots, a_5\}$ strictly depend on the boundary states. However, in physical robotics, the problem is highly constrained. We must enforce hard limits on joint velocities $\dot{q}_{max}$, accelerations $\ddot{q}_{max}$, and torques $\tau_{max}$. Thus, the true constrained optimization problem becomes:

This requires solving inverse kinematics (mapping task-space $\mathbf{x}$ to joint-space $\mathbf{q}$ via the Jacobian $\mathbf{J}(\mathbf{q})$) and recursive Newton-Euler dynamics at high frequency.

When a neural network outputs discrete action chunks, it is fundamentally ignorant of these continuous-time constraints. It proposes where the arm should go, not the physics of how it gets there.

This is exactly why a foundation model should never directly command a motor. At Xolver, we structure our control spine to respect this boundary.

In our architecture, the foundation model acts as an intent engine. It operates at a relatively low frequency (e.g., 10 Hz), outputting a sequence of semantic waypoints or latent action chunks based on its interpretation of the scene.

These discrete outputs are then intercepted by the Deterministic Enforcement Layer. This layer acts as an algorithmic shock absorber. It takes the rough, probabilistic waypoints and fits a physically realizable, $C^2$-continuous spline interpolation that strictly respects the hardware's maximum torque, velocity, and jerk envelopes.

The enforcement layer effectively translates the VLA's step-functions into smooth, drivable trajectories. It then streams this optimized signal to the edge runtime and hardware controllers at high frequency (e.g., 500 Hz or 1000 Hz). The physical robot never feels the 'thought process' of the neural network, it only feels the mathematically verified momentum.

Intelligence without physical grounding is destructive. By architecturally separating the 'nervous system' that plans from the 'spinal cord' that executes, we ensure that the scale and complexity of modern foundation models do not destroy the machinery they are tasked to operate.

At Xolver, we believe that true physical AI must speak the language of continuous calculus, not just discrete representation.