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.
Bugs and support
Please report any issues or feature requests via the Github issue tracker.
The detailed API documentation with examples can be found here.
MIT License. See LICENSE file for details.