Jump to content

Connect SuperML | Leeroopedia MCP: Equip your AI agents with best practices, code verification, and debugging knowledge. Powered by Leeroo — building Organizational Superintelligence. Contact us at founders@leeroo.com.

Principle:Google deepmind Mujoco Forward Dynamics

From Leeroopedia
Knowledge Sources
Domains Physics_Simulation, Rigid_Body_Dynamics, Robotics
Last Updated 2026-02-15 06:00 GMT

Overview

Computational pipeline that evaluates all derived quantities (positions, velocities, forces, contacts) from the current generalized state without advancing time.

Description

Forward Dynamics computes the full state of the physics simulation given current positions and velocities. Unlike mj_step which also integrates forward in time, mj_forward only evaluates derived quantities: Cartesian positions from joint angles (forward kinematics), velocities, actuator forces, collision detection, constraint forces, and accelerations. This is the computational core shared by both stepping and visualization.

The pipeline follows MuJoCo's staged computation model: position-dependent → velocity-dependent → actuation → acceleration → constraint solving.

Usage

Use this principle when you need to compute the full simulation state without advancing time. Common use cases include: initial state computation after setting qpos/qvel, visualization updates, and evaluating the dynamics at a specific state for control or learning.

Theoretical Basis

The forward dynamics pipeline computes:

M(q)q¨+c(q,q˙)=τ+JTf

Where:

  • M(q) is the joint-space inertia matrix
  • c(q,q˙) is the bias force (Coriolis, gravity, springs)
  • τ is the applied generalized force (actuators)
  • JTf is the constraint force mapped to joint space

The pipeline stages are:

  1. Position: Forward kinematics, collision detection, composite inertias
  2. Velocity: Coriolis/centrifugal forces, damping
  3. Actuation: Actuator forces from control signals
  4. Acceleration: Unconstrained acceleration
  5. Constraint: Contact and equality constraint solving (PGS/CG/Newton)

Related Pages

Implemented By

Page Connections

Double-click a node to navigate. Hold to expand connections.
Principle
Implementation
Heuristic
Environment