Please enable JavaScript.
Coggle requires JavaScript to display documents.
Goal-based agents - pathfinding
Pathfinding is the process of finding the…
Goal-based agents - pathfinding
Pathfinding is the process of finding the best route from a starting point to a destination, considering obstacles and constraints. Pathfinding algorithms help determine the most efficient path based on factors like distance and cost.
Types of searches
Depth-First Search(DFS)
A graph traversal technique called DFS (Depth-First Search) explores as much as possible along each branch before turning around.
-
Before locating a shorter one, it might discover a longer one.
-
-
-
Breadth First Search(BFS)
A graph traversal technique called BFS (Breadth-First Search) investigates every node's neighbors before going up a level.
-
Assures the fastest route. Nodes are investigated in order of their separation from the source node.
Employs a queue and the First-In-First-Out (FIFO) principle to keep track of the nodes that need to be visited.
-
Given that the graph is finite, the problem is complete and will locate a solution if one exists.
A* Search
The A* Search algorithm uses a priority queue and a heuristic function to discover the best course of action while taking into account both real and expected expenses.
-
-
-
-
-
A finite state machine(FSM)
mathematical model for systems that can transition between a finite number of states in response to particular inputs or events.
-
-
Digraph
-
Between vertices, the directed edges provide both one-way and two-way connections.
-
-