About
This software finds the shortest paths between configurations for the Dubin’s car, the forward only car-like vehicle with a constrained turning radius.
Installing
You can install the latest stable version from PyPI
$ pip install dubins
Or, you can install the latest development version from GitHub
$ pip install git+git://github.com/AndrewWalker/pydubins.git
Example
Sampling of a Dubin’s path at finite size sizes
import dubins
q0 = (x0, y0, theta0)
q1 = (x1, y1, theta1)
r = turning_radius
step_size = 0.5
qs, _ = dubins.sample_dubins_path(q0, q1, r, step_size)
Method
A good description of the equations and basic strategies for doing this are described in the book Planning Algorithms, by Steven LaValle
The approach adopted here is based on the algebraic solutions to the equations published by Shkel and Lumelsky “Classification of the Dubins set”, however, rather than using the symmetry approach described in that work, a less efficient generate and test approach is used.
Various revisions of this code have been used in:
@phdthesis{ Walker:2011,
title = "Hard Real-Time Motion Planning for Autonomous Vehicles",
author = "Andrew Walker",
school = "Swinburne University of Technology",
year = "2011"
}
and in
@phdthesis{ Smart:2008,
title = "Evolutionary Control of Autonomous Underwater Vehicles",
author = "Royce Smart",
school = "RMIT",
year = "2008"
}
Metadata
Release files for dubins 0.8.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| dubins-0.8.1.tar.gz | 28.4 kB | Details |
Release files / dubins-0.8.1.tar.gz
| Download URL | dubins-0.8.1.tar.gz |
|---|---|
| Size | 28.4 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
18b149fcfe020f86b1d565929bdded162ea45841d7bbd61b35ff01e385253959
|
|
BLAKE2b-256 checksum How to use checksums |
c87b3daf647da852559cf086c9e6235677aa9f8e5925e91910d1eee99da5c960
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |