Planning Algorithms For AI Agents
Planning Algorithms For AI Agents
Goal: Find a sequence of actions that leads from the current state to the desired goal state.
Example:
- Plan: 'Stand up -> Walk to the door -> Open door -> Walk to kitchen.'
- Breadth-First Search (BFS): Explores all actions level by level. Guaranteed to find the shortest
path, but slow for large problems.
- Depth-First Search (DFS): Explores one path deeply before trying others. Faster but might miss
- A*: Uses both cost (past actions) + heuristic (future guess) to find the best path efficiently. Very
popular!
How A* works:
At each step, A* picks the path with the lowest f(n) to explore next!
Summary