01 — PATHFINDING, MADE VISIBLE
Find a way
through the noise.
Move the start or goal, add fixed barriers, and run A* while three obstacles move through the workspace. The route is recalculated as they shift.
A* search with live replanning around moving hazards.
Plan a route
Ready when you are. Place some obstacles and find a path.
A NOTE ON THE MODEL
Clear rules.
Useful limits.
This browser model uses a 30 × 18, four-neighbor grid. A* ranks cells by path cost plus Manhattan distance. Three deterministic moving hazards advance along sinusoidal tracks; the planner recomputes its route several times per second as their positions change.
This is a 2D point/workspace study, not the 7-DOF arm and not a joint-space planner. It omits robot geometry, 3D collision volumes, velocity/acceleration limits, sensing delay, and hardware control. The dynamic obstacles are grid cells rather than physical 3D objects.
IN
STEPS✳