An Approximation Algorithm for a Shortest Dubins Path Problem.
Sivakumar RathinamPramod P. KhargonekarPublished in: CoRR (2016)
Keyphrases
- np hard
- dynamic programming
- improved algorithm
- times faster
- k means
- closed form
- optimal solution
- matching algorithm
- optimization algorithm
- significant improvement
- genetic algorithm
- worst case
- experimental evaluation
- search space
- preprocessing
- learning algorithm
- computational cost
- high accuracy
- recognition algorithm
- detection algorithm
- shortest path
- objective function
- path length
- error bounds
- convex hull
- tree structure
- segmentation algorithm
- maximum likelihood
- linear programming
- probabilistic model