# Difference between revisions of "Pathing"

Jump to navigation
Jump to search

(Created page with " Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. * https://en.w...") |
|||

Line 1: | Line 1: | ||

− | Pathfinding or pathing is the | + | Pathfinding or pathing is the [[Recommendation]] of routes between two points based on a criteria. The criteria can be based on different objectives. Pathing can be applied to various aspects of [[Data Science]] |

+ | * Shortest Time | ||

+ | * Shortest Distance | ||

+ | * Least Cost | ||

+ | * Highest Satisfaction | ||

+ | * etc... | ||

+ | ==Types== | ||

+ | * Static Pathing | ||

+ | * Dynamic Pathing | ||

+ | ** Based on current state | ||

+ | ** Re-calculate path to future state | ||

+ | |||

+ | |||

+ | ==Links== | ||

* https://en.wikipedia.org/wiki/Pathfinding | * https://en.wikipedia.org/wiki/Pathfinding | ||

## Revision as of 18:41, 14 February 2019

Pathfinding or pathing is the Recommendation of routes between two points based on a criteria. The criteria can be based on different objectives. Pathing can be applied to various aspects of Data Science

- Shortest Time
- Shortest Distance
- Least Cost
- Highest Satisfaction
- etc...

## Types

- Static Pathing
- Dynamic Pathing
- Based on current state
- Re-calculate path to future state