The phenomenon you’re noticing is one common to basically all machines (and all systems) that need to move to several locations. It’s very processor-intensive to calculate the shortest path that passes through many locations. This is called the “Traveling Salesman Problem” and here’s a comment Dan made a long time ago that I found amusing…