Any-angle path planning

Any-angle path planning is a way of finding a path for something (like a robot or a person) to get from one place to another without having to turn too much. For example, imagine you are standing at one end of a field and you want to get to the other end. With any-angle path planning, the computer will look at the field to figure out the shortest and easiest path that you can take to get to the other side without having to turn too much. The computer will figure out which way you should go in order to get there quickly and with the least amount of turning.