Skip to content

Latest commit

 

History

History
16 lines (9 loc) · 722 Bytes

README.md

File metadata and controls

16 lines (9 loc) · 722 Bytes

Dubins' Curves implemented in Python

In 1957, Lester Dubins mathematically proved that the shortest distance between two waypoints (x, y, psi) can be calculated as a combination of straight lines and circular arcs, requiring only three segments.

Running the Code

Pretty straight forward...pull or copy the python file, and download the necessary libraries (numpy, matplotlib, etc) Then, at the bottom, you can configure your own waypoints. The waypoint structure is (x, y, psi), where Psi is a bearing in NED coordinates (Due north = 0 deg)

Here's an example output:

pt1 = Waypoint(0,0,0)
pt2 = Waypoint(6000,7000,260)

Dubins Curve