# Grassfire Algorithm

The destination cell is marked 0 and the adjacent cells are marked in an increasing number sequence until we reach the starting cell. These numbers indicate the minimum number of steps required to reach the destination cell from that current cell.

![](/files/-LVP9hvXZBcHAq4w99DL)

![](/files/-LVP9m6I7Q2EYL62JLyF)

The computational complexity of this algorithm increases linearly with the number of cells. For example, if for a 2D grid of size 100 X 100 the compute time is  $$10^4$$ , for a similiar grid of size 1000 X 1000 it would be $$10^6$$ 

For more information view:

{% embed url="<https://www.coursera.org/lecture/robotics-motion-planning/1-2-grassfire-algorithm-ZxAgg>" %}


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wiki.ariitk.in/wiki/concepts/path-planning/untitled.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.