Pathfinding
Related terms: A*, navmesh, navigation
Finding a route from A to B around obstacles. A* (A-star) is the classic algorithm. It explores a graph of positions, always expanding the one that looks closest to the goal, and returns the shortest path.
In 2D the graph is often a grid. In 3D it is usually a navmesh: a simplified mesh of the walkable floor, built from the level geometry.