NexvioraINTERACTIVE LAB · NAVIGATION
Grid path planning. Explore it.
Edit obstacles and compute a shortest four-neighbour path.
Educational browser model
Calculations run on this device. This does not execute ROS, Gazebo or hardware commands.
Explore the model
Choose Run calculations to enable grid editing. Pause locks edits while preserving the route. Toggle cells to add obstacles. Start and goal are fixed. Each move costs one; there is no diagonal travel, robot footprint or dynamic obstacle model.
Ready. Choose Run calculations to begin.
Calculated result
Route found: 18 moves.
Breadth-first search finds a shortest route for this uniform-cost, four-neighbour grid.
What to investigate
Create a wall, then a single gap. Explain why a shortest cell path may still be too narrow for a physical robot. The model uses uniform move costs and fixed start/goal cells.