A Julia package to compute the Dubins Paths
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
docs
examples
src
test
.gitignore
.travis.yml
CHANGELOG.md
LICENSE
README.md
REQUIRE

README.md

Dubins.jl

Release: Dubins Dubins

Dev: Build Status codecov

Dubins.jl is a Julia package for computing the shortest path between two configurations for the Dubins' vehicle (see Dubins, 1957). The shortest path algorithm, implemented in this package, uses the algebraic solution approach in the paper "Classification of the Dubins set" by Andrei M. Shkel and Vladimir Lumelsky.

All the unit tests and the data structures in this Julia implementation is borrowed from the C implementation and its corresponding python wrapper.

Bugs and support

Please report any issues or feature requests via the Github issue tracker.

Documentation

The detailed API documentation with examples can be found here.

License

MIT License. See LICENSE.txt for details.