Skip to content

fgabbert/dubins_py

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 

Repository files navigation

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

About

Python implementation of Dubin's curves

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages