AI Disaster Rescue Planning System

Algorithm Control

Search Algorithm:

Map Elements (Click to Place)

How it works

Breadth First Search (BFS)

Explores all neighboring cells at the present depth prior to moving on to the nodes at the next depth level. Guarantees the shortest path in an unweighted grid.

Simulation Results

⏱️

Time Taken 0 ms

🔍

Nodes Explored 0

📏

Path Length 0

📡

Status Ready

Map Legend

Rescue Base
Victim
Blocked Road
Safe Road
Explored Area
Optimal Route