Convex MPC in the Browser
An interactive WebAssembly viewer for convex model-predictive control and quadruped locomotion.
An interactive WebAssembly viewer for convex model-predictive control and quadruped locomotion.
A WebGL and WebAssembly playground for forward kinematics, inverse kinematics, planning, and dynamics.
A compact summary of the full Modern Robotics series, connecting rigid-body motion, screw theory, Jacobians, inverse kinematics, dynamics, and motion planning into one coherent picture.
A mathematically grounded introduction to Modern Robotics, covering rigid-body motion, twists, screw axes, and the Product of Exponentials formulation behind robot kinematics.
A detailed mathematical walkthrough of screw axes, twists, and the exponential map in Modern Robotics, forming the basis for robot kinematics and Jacobian computation.
A continuation of the screw-theory introduction, focusing on spatial vs. body frames, Lie group/Lie algebra intuition, and the connection to Jacobian construction.
A detailed derivation of the Jacobian from screw axes and twists, showing how end-effector velocity is computed from joint rates and why singularities arise.
A deeper look at Jacobian-based velocity control, manipulability measures, and pseudoinverse methods for achieving task-space motion under constraints.
A detailed explanation of inverse kinematics using Jacobian-based methods, analytic solutions, and iterative numerical strategies for robot pose solving.
A deep-dive connecting kinematics, twist-based motion generation, and dynamics to task-space control and robot motion generation.
A continuation of the kinematics-to-planning story, focused on trajectory generation, time scaling, constraints, and the geometry behind motion planning.
A compact map of the Optimal Parking planner, from the kinematic bicycle model and RRT* seed to sequential QP refinement and browser execution.
The parking problem, its state and input variables, and the five-state kinematic bicycle model used by the planner.
Why RRT* is used to generate a collision-free geometric path before trajectory optimization.
The optimal-control formulation behind parking trajectories, including cost functions, constraints, MPC, and the role of SQP.
How the planner refines an initial route through sequential quadratic programs solved with OSQP.
How vehicle bounds, input limits, obstacle constraints, and penalties shape a feasible parking trajectory.
How the native planner is organized and exposed through WebAssembly for interactive browser experiments.