 Any-angle path planning

Any-angle path planning refers to a class of algorithms and methods used in robotics and computer graphics to find the shortest or optimal path from a starting point to a destination point in an environment that may include obstacles, while allowing for movement in any direction rather than being restricted to predefined grid or discrete points. Traditional path planning methods often operate on a grid, meaning they can only consider movements along the grid lines.