● SLAM SYSTEM ONLINE  |  360° RAYCASTING LIDAR ACTIVE  |  BAYESIAN LOG-ODDS OCCUPANCY GRID ESTIMATING  |  EKF 3x3 ERROR COVARIANCE P DYNAMIC ELLIPSE ONLINE  |  MONTE CARLO MCL 500 PARTICLES FILTERING  |  SCAN-MATCHING LOOP CLOSURE DETECTING  |  A* PROXIMITY PATHFINDING NOMINAL  |  60 FPS WEBGL POINT CLOUD RENDERER      ● SLAM SYSTEM ONLINE  |  360° RAYCASTING LIDAR ACTIVE  |  BAYESIAN LOG-ODDS OCCUPANCY GRID ESTIMATING  |  EKF 3x3 ERROR COVARIANCE P DYNAMIC ELLIPSE ONLINE  |  MONTE CARLO MCL 500 PARTICLES FILTERING  |  SCAN-MATCHING LOOP CLOSURE DETECTING  |  A* PROXIMITY PATHFINDING NOMINAL  |  60 FPS WEBGL POINT CLOUD RENDERER     
ROBOAI SUITE // ROBOTIC PERCEPTION SIMULATOR

SLAM
PERCEPTION

LiDAR Mapping, Bayesian Grids & EKF Sensor Fusion

A real-time WebGL robotics perception simulation cockpit engineered for LiDAR rangefinding, Bayesian log-odds occupancy grids, Extended Kalman Filter (EKF-SLAM) covariance propagation, Monte Carlo particle filters, and autonomous frontier exploration.

360°
RAYCASTING LIDAR
2σ Ellipse
EKF COVARIANCE
500
MCL PARTICLES
60 FPS
3D POINT CLOUD
● ROBOT-01 // SLAM ONLINE
POSE X:1.24 m
POSE Y:-0.86 m
HEADING:42.8°
COV det(P):0.014 m²
EXPLORED:84.6%
Drag Mouse / Touch TO ORBIT 3D ROBOT & POINT CLOUD

Built for Autonomous Perception

SLAM bridges physical range sensor physics with probabilistic state estimation and multi-layer spatial maps.

01 // SPATIAL MAPPING
🗺️
Bayesian Occupancy Grid

Evaluates cell occupancy using recursive log-odds updates: $L(m_i | z_{1:t}) = L(m_i | z_{1:t-1}) + L(m_i | z_t) - L_0$. Uses Bresenham line ray voting with fog-of-war revelation.

LOG-ODDS MEMORY
02 // SENSOR FUSION
📐
EKF 2σ Uncertainty Ellipses

Propagates state covariance $\mathbf{P}_{t|t-1} = \mathbf{F}\mathbf{P}\mathbf{F}^T + \mathbf{Q}$ and corrects on landmark observations via Kalman gain $\mathbf{K}$. Renders live $2\sigma$ error confidence ellipses.

KALMAN GAIN CORRECTION
03 // LOCALIZATION
👥
Monte Carlo Localization (MCL)

Maintains 50 to 500 hypotheses across the state space. Weights particles against LiDAR range likelihoods and executes low-variance resampling to resolve kidnapped robot scenarios.

NON-PARAMETRIC FILTER
04 // DRIFT ELIMINATION
🔄
Scan-Matching Loop Closure

Maintains keyframe scan fingerprints. Compares historical observation footprints to detect visited topologies, snapping accumulated odometric drift back into global alignment.

POSE-GRAPH ADJUSTMENT

TEST SENSORS & FILTERS IN REAL TIME

Experiment with simulated range sensor noise, observation landmark updates, and path planning directly on this page.

01 // EKF-SLAM 2σ UNCERTAINTY ELLIPSE
KALMAN FILTER
±0.25m
±0.15m
02 // 2D LIDAR RAYCASTING & OCCUPANCY
RANGE SENSOR
90 rays
150 px

3 SELECTABLE DRIVE PLATFORMS

Switch between three distinct vehicle drive kinematics models, each with dedicated odometry equations and motion matrices.

01 // TANK DRIVE UNICYCLE MODEL
Differential Drive

Two independent drive wheels with passive castor. Capable of zero-radius in-place turns ($v_L = -v_R$). Non-holonomic velocity constraints.

Kinematics$\dot{x} = v \cos\theta, \dot{y} = v \sin\theta$
In-Place RotationYes (Zero radius)
ConstraintNon-holonomic
02 // CAR-LIKE BICYCLE MODEL
Ackermann Steering

Automotive front-wheel steering geometry. Enforces non-zero minimum turning radius $R = L / \tan\delta$, modeling autonomous road vehicles.

Kinematics$\dot{\theta} = \frac{v}{L} \tan\delta$
In-Place RotationNo ($R_{min} > 0$)
ConstraintSteering angle bound
03 // OMNI-WHEEL 3-DOF PLANAR
Holonomic Omni Drive

Equipped with mecanum/omni rollers. Capable of arbitrary instantaneous translation in any direction $(\dot{x}, \dot{y})$ independent of heading $\theta$.

KinematicsFull 3-DOF planar motion
In-Place RotationYes + Crab walk
ConstraintUnconstrained holonomic

TECHNICAL SPECIFICATIONS

Summary of mathematical algorithms, sensor modeling, and browser runtime performance metrics.

SUBSYSTEM IMPLEMENTATION SPECIFICATION DETAILS
3D Point Cloud Renderer Three.js WebGL (r128 / r183) Distance false-color gradient, ground grid, 2σ uncertainty ellipse visualizer, 60 FPS
2D LiDAR Simulator Bresenham Raycasting Engine 30 to 360 rays, Gaussian range noise ($\mu=0, \sigma^2$), dynamic obstacle occlusion
Occupancy Grid Bayesian Log-Odds Grid Bresenham ray voting with fog-of-war revelation, probability thresholds for free/occupied
Sensor Fusion Filter Extended Kalman Filter (EKF-SLAM) Analytical 3x3 error covariance matrix $\mathbf{P}$ with dynamic 2σ (95.4% confidence) ellipse
Global Localization Monte Carlo Localization (MCL) 50-500 particle swarm with odometric motion sampling and low-variance resampling
Path Planning Algorithms A* (Proximity Weighted) + Dijkstra + Bug2 TypedArray min-heap priority queue with wall proximity safety cost buffer
Autonomous Exploration Frontier Detection & Clustering Automatic identification and routing to boundaries between explored free space and unknown territory
TOP

SYSTEM INQUIRIES

// FREQUENTLY ASKED QUESTIONS //
What are the WebGL requirements for the simulators? ▼
RoboAI Suite requires a modern browser with WebGL 2.0 support. Hardware acceleration must be enabled in your browser settings to ensure 60fps performance during 3D point cloud rendering and 6-DOF kinematics.
How does LiDAR raycasting operate client-side? ▼
The SLAM simulator uses a highly optimized 2D line-line intersection algorithm. It casts 360 rays from the robot's center against all wall line segments in the environment grid. Gaussian noise is injected into the distance readings to simulate real-world sensor inaccuracies.
How does NEXUS handle kinematics singularity? ▼
The inverse kinematics (IK) solver uses Damped Least Squares (DLS) with Levenberg-Marquardt damping. When the Jacobian determinant approaches zero (Yoshikawa manipulability index drops), the damping factor prevents joint velocities from tending to infinity, ensuring stable trajectories near singularity zones.
What is Space-Time A* in HIVE Logistics? ▼
Space-Time A* is a 4D pathfinding algorithm (x, y, rotation, time) used in HIVE. It manages a global reservation table so autonomous mobile robots (AMRs) can plan collision-free paths by factoring in the projected future positions of all other active units in the swarm.