Exact algorithm for kinodynamic planning in the plane
Publication
, Journal Article
Canny, J; Rege, A; Reif, J
January 1, 1990
A long-standing open problem in robotics has been that of devising algorithms for generating time-optimal motions under kinodynamic constraints. This problem has been considered previously in the literature and approximation algorithms have been provided for the two and three dimensional cases but with the exception of the one-dimensional case, no exact algorithms have been given. In this paper, we provide the first exact algorithm for time-optimal kinodynamic motion planning in the two-dimensional case.
Duke Scholars
Citation
APA
Chicago
ICMJE
MLA
NLM
Canny, J., Rege, A., & Reif, J. (1990). Exact algorithm for kinodynamic planning in the plane, 271–280. https://doi.org/10.1145/98524.98584
Canny, J., A. Rege, and J. Reif. “Exact algorithm for kinodynamic planning in the plane,” January 1, 1990, 271–80. https://doi.org/10.1145/98524.98584.
Canny J, Rege A, Reif J. Exact algorithm for kinodynamic planning in the plane. 1990 Jan 1;271–80.
Canny, J., et al. Exact algorithm for kinodynamic planning in the plane. Jan. 1990, pp. 271–80. Scopus, doi:10.1145/98524.98584.
Canny J, Rege A, Reif J. Exact algorithm for kinodynamic planning in the plane. 1990 Jan 1;271–280.