Please enable JavaScript.
Coggle requires JavaScript to display documents.
Goal - Based Agents - pathfinding - Coggle Diagram
Goal - Based Agents - pathfinding
pathfinding
Pathfinding is the process of identifying potential routes between nodes in a network or graph to reach a specific destination.
FSM – Finite State Machine
A system is a mechanism that responds to inputs or events by alternating between fixed states.
Types
Moore Machine: The state is the sole provider of this service.
Mealy Device: The output is determined by the state and input.
Types of Graphs
• Founded on algorithms for graph searches - This system utilizes graph search algorithms to determine the most efficient route to a destination by analyzing the paths between points.
• The process begins in a specific location and utilizes connections (edges) to progress towards a specific objective - The procedure starts at a specific location and moves along edges or connections to reach a predetermined destination.
• Considers rules like direction, distance, or cost - The algorithm determines the most efficient method to achieve an objective by considering factors like cost, distance, or orientation.
Digraph (Directed Graph)
The system records nodes and edges, occasionally including additional information like type or cost.
Edges can only be one-way, such as uphill.
Roads that only allow one mode of travel are a practical example of this.
Searching Algorithms
DFS (Depth-First Search)
The individual thoroughly explores a road before turning around.
This tool is excellent for efficiently navigating complex environments and identifying various paths.
If not cautious, individuals can become trapped in loops.
BFS (Breadth-First Search)
The investigation is conducted on a level-by-level basis, examining all nearby nodes.
The function determines the shortest direction of the unweighted graph.
The statement is more memory-intensive than DFS.
A (A-Star Search)
The organization employs a cost-based heuristic to determine the most effective course of action.
The technology is highly efficient and fast in many real-world jobs.
The user may encounter difficulties with complex or large maps.
Applications
The coin-operated turnstile can be locked or unlocked.
State-specific traffic lights are red, yellow, and green.
The locker system consists of one unlocked state and multiple locked states.
Network
A network is a network of interconnected items, including nodes and edges, that enable movement between them.
Types of Networks
Undirected: A directionless graph type allows for both directions of movement between connected nodes due to its directionless edges.
Directed: A fixed-direction graph allows only one node to move in a specific direction due to its fixed edges.
Weighted: A graph is a visual representation of a network, with each edge weighted to indicate the time, cost, or distance required to move between nodes.
Examples
maps featuring crossroads and roads
Link architectures are essential for creating efficient and effective websites.
Circuits that utilize electronics
Web Links
https://how.dev/answers/what-is-a-goal-based-agent
https://www.doc.ic.ac.uk/project/examples/2005/163/g0516334/gba.html
https://milvus.io/ai-quick-reference/what-is-the-difference-between-goalbased-and-utilitybased-agents
