Pathfinding with mandatory points

Question

Algorithms

Please tell me what to look for.

There are points on the map, as well as a path for the object, but this path is not completely written.
that is, there is a way: point 1; point 2; point 4; point 6;
But what to pass a way, I should make such way: point 1; point 2; point 58; point 4; point 17; point 6;

Answer 1

This problem obviously reduces to the problem of finding the optimal path between two points, without restrictions on mandatory points.
But the solution of the second problem already depends on what a “map” is, what are the optimality criteria, etc.

Answer 2

If you need to figure out the algorithm, then there is not enough information. How are the missing points described? As I understand it, there is a way, but it needs to be supplemented with dots? Then what are the criteria for including the missing points in each segment of the path? Etc.

Answer 3

Sequential pathfinding from point to point using "A*" algorithm?
http://en.wikipedia.org/wiki/A*_search_algorithm

Answer 4

If the points cannot be visited several times, then here. Let the points that are already known lie in the points array. Then, using the wave or A*, we find all the shortest distances from points[i] to points[i+1] and put them in the paths[i,j] array, where j is the j-th path from points[i] to points[i+ one]. Then, by enumeration (or you can also consider paths on a graph of paths), we try to build a common path from all paths, such that no point is visited twice. Those. if in a stupid way: we take paths[1,1] and iterate over all paths[2,1], etc.
If points can be visited several times, then as mentioned above: sequential search for a path from point to point.

Answer 5

George everything is simple - contact me (Sizenko Dmitry) and let's finish the job. I advise you to get in touch and answer messages on VK, skype or mail

Answer 6

George, contact me urgently, your silence will not lead to anything good.