MasterSplinter
New member
- Joined
- Jul 22, 2015
- Messages
- 9
Hi everyone. I am trying to figure out a way to find the most efficient way to travel from a certain group of points to another group of points:
On the picture above I want all the points on the left side of the red line to connect with a point on the right side by drawing a straight line. Lets assume the length of this straight line is travel distance. If the line is short, so is the distance, and if the line is long, the distance would also be long. What I want to do is to make all the distances as close to the average distance as possible. If a man walks from each point on the left side of the red line to a point on the right side of the red line, how can you calculate which point each man would have to walk towards to make sure they all arrive at close as possible to the same time. This assumes that they all start at the same time and walk at the same speed. Nobody can start or end up at the same point.
I think this problem can be solved by using derivation, but I am not quite sure how. Is there a general way to solve these kind of problems (meaning I could use the same method for different coords/points)?
Any help would be appreciated! If something is unclear, please tell me!
EDIT: I see that the picture is rather small, but since I am looking for the method regardless of what the point values are, it should not be a problem.
On the picture above I want all the points on the left side of the red line to connect with a point on the right side by drawing a straight line. Lets assume the length of this straight line is travel distance. If the line is short, so is the distance, and if the line is long, the distance would also be long. What I want to do is to make all the distances as close to the average distance as possible. If a man walks from each point on the left side of the red line to a point on the right side of the red line, how can you calculate which point each man would have to walk towards to make sure they all arrive at close as possible to the same time. This assumes that they all start at the same time and walk at the same speed. Nobody can start or end up at the same point.
I think this problem can be solved by using derivation, but I am not quite sure how. Is there a general way to solve these kind of problems (meaning I could use the same method for different coords/points)?
Any help would be appreciated! If something is unclear, please tell me!
EDIT: I see that the picture is rather small, but since I am looking for the method regardless of what the point values are, it should not be a problem.
Attachments
Last edited: