2D Dubins Path in Environments with Obstacle
Joint Authors
Sun, Huafei
Yang, Dongxiao
Li, Didong
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-11-11
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
We recapitulate the achievement about the Dubins path as well as some precise proofs which are important but omitted by Dubins.
Then we prove that the shortest path (R*-geodesic) in environments with an obstacle consists of no more than five segments, each of which is either an arc or a straight line.
To obtain such R*-geodesic, an effective algorithm is presented followed by a numerical simulation as verification.
American Psychological Association (APA)
Yang, Dongxiao& Li, Didong& Sun, Huafei. 2013. 2D Dubins Path in Environments with Obstacle. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-1008951
Modern Language Association (MLA)
Yang, Dongxiao…[et al.]. 2D Dubins Path in Environments with Obstacle. Mathematical Problems in Engineering No. 2013 (2013), pp.1-6.
https://search.emarefa.net/detail/BIM-1008951
American Medical Association (AMA)
Yang, Dongxiao& Li, Didong& Sun, Huafei. 2D Dubins Path in Environments with Obstacle. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-1008951
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1008951