Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding Algorithms and Search Strategies - Coggle Diagram
Pathfinding Algorithms and Search Strategies
Pathfinding Algorithms
Techniques to find the shortest path between two points in a graph or grid.
Search Tree
Structure representing the exploration of possible paths in a search algorithm.
The Frontier
Set of nodes or paths to be explored during the search process.
Warnings
Cautionary notes or considerations when implementing pathfinding algorithms.
Infrastructure of Search Algorithm
Components and framework used to implement search algorithms.
Measuring Performance
Metrics used to evaluate the efficiency and effectiveness of pathfinding algorithms.
Graph Search
Algorithmic approach to traverse graphs to find optimal paths.
Uninformed Search (Blind)
Search algorithms that do not use knowledge about the goal or problem domain.
Informed Search (Uses Heuristic)
Search algorithms that utilize domain-specific knowledge to guide the search process.
Types of Informed Search
Best First Search
Dijkstra’s Algorithm
Greedy Best First Search
A*
Dijkstra’s Algorithm
Initialization
Priority Queue
Relaxation
Termination
Example Applications
Greedy Best First Search
Heuristic-based search algorithm focusing on immediate gains.
A* Algorithm
Informed search algorithm combining cost and heuristic functions for optimal pathfinding.
Heuristics
Approximate methods or rules used to guide search algorithms towards the goal.
Genetic Algorithms
Evolutionary computation techniques inspired by natural selection to solve optimization problems.
Pathfinding in Games
Application of pathfinding algorithms in video games for character movement and navigation.
Slime Mould
Biological example of emergent behavior used for pathfinding.
Web links
http://letsmakerobots.com/node/40756
http://qiao.github.io/PathFinding.js/visual/
http://www.yaldex.com/gamesprogramming/0672323699_ch12lev1sec7.html
http://www.redblobgames.com/pathfinding/tower-defense/
