Return to Question

Hoping someone may be able to point me in the right direction so I can research this topic further.

Scenario: You have a vector field (either 2D or 3D) and you wish to find the shortest path between two points located within the vector field. For example imagine an object floating on the ocean surface. The object has a simple rudder that allows it to steer. How can we find a path that will get the object from its current location (point on vector field) to (or as close to as possible) the destination point.

The relation between the vector field and the path is that there exists a constraint that you can only move along the vector field. While it may not be possible to find an exact path connecting the two points, I am interested in finding a path that gets as close to the 2nd point in the vector field as possible.

Can anyone offer any suggestions/hints around how this could be calculated?

Note: Post has been edited to improve clarity of question.

Hoping someone may be able to point me in the right direction so I can research this topic further.

Scenario: You have a vector field (either 2D or 3D) and you wish to find the shortest path between two points located within the vector field. 

For example imagine an object floating on the ocean surface. The object has a simple rudder that allows it to steer. How can we find a path that will get the object from its current location (point on vector field) to (or as close to as possible) the destination point.

In this scenario the vector field would represent ocean currents in a 2D space and the desired path should make optimal use of these currents to reach it's final destination (or a point as close to the final destination as possible).

Can anyone offer any suggestions/hints around how this could be calculated?

Note: Post has been edited to improve clarity of question.

Hoping someone may be able to point me in the right direction so I can research this topic further.

Scenario: You have a vector field (either 2D or 3D) and you wish to find the shortest path between two points located within the vector field.

note: The relation between the vector field and the path is that there exists a constraint that you can only move along the vector field. While it may not be possible to find an exact path connecting the two points, I am interested in finding a path that gets as close to the 2nd point in the vector field as possible.

Can anyone offer any suggestions/hints around how this could be calculated?

Hoping someone may be able to point me in the right direction so I can research this topic further.

Scenario: You have a vector field (either 2D or 3D) and you wish to find the shortest path between two points located within the vector field. For example imagine an object floating on the ocean surface. The object has a simple rudder that allows it to steer. How can we find a path that will get the object from its current location (point on vector field) to (or as close to as possible) the destination point.

The relation between the vector field and the path is that there exists a constraint that you can only move along the vector field. While it may not be possible to find an exact path connecting the two points, I am interested in finding a path that gets as close to the 2nd point in the vector field as possible.

Can anyone offer any suggestions/hints around how this could be calculated?

Note: Post has been edited to improve clarity of question.