Orchestrators for nearest alternative goals

[seveibar]

• [ ] Nearest Goal
• [ ] Multi-autorouter breadth-first goal search
• [ ] Multi-autorouter astar goal search
  • Premise: Each autorouter is treated as a node, it's best g/h is used as g/h, incorporate iterations as a g penalty
  • Autorouters can also be cloned and evaluate going after different goals with the existing path

[homie-gg[bot]]

Here are some pull requests that might be helpful reference for this task:

• Gridless Point of Interest Approach
• Check and Regenerate Problems that have overlapping pads
• ijump-max (ijump v2) algorithm, enhancements to logging, refactor infinite grid autorouter

[homie-gg[bot]]

This might have already been done via: Alternative Goal Boxes Part 2/3 (math utilities, calculation of goal boxes, snapshot "worst case" example to fix).

[homie-gg[bot]]

This might have already been done via: finish goal box implementation (net shortcuts).