Im trying to build a definition (potentially using Galapagos) that could optimize a path along a surface (topography).
I basically want to go from points A to B along the surface and find the most "comfortable" path for doing so. This means being within a tolerable distance in Z from the previous point while eventually finding your way to destination B.
So far Ive tried populating the surface with a grid of points and testing neighbors for potential next point destinations along the route.
Do you think Galapagos is the right tool for this? My problem is that
1. I cannot loop the next point along after the first iteration
2. With only one fitness criteria I dont know that out of the potential points along the route its picking up the one that gets me to B eventually.
The other thing I thought of was to instantiate random routes along the grid from A to B and then testing for a desired average slope but I'm having trouble getting that to work as well (new to galapagos).
Thanks in advance for your time and efforts