{"title":"Generalization of Optimal Geodesic Curvature Constrained Dubins’ Path on Sphere With Free Terminal Orientation","authors":"Deepak Prakash Kumar;Swaroop Darbha;Satyanarayana Gupta Manyam;David Casbeer","doi":"10.1109/LCSYS.2024.3520026","DOIUrl":null,"url":null,"abstract":"In this letter, motion planning for a Dubins vehicle on a unit sphere to attain a desired final location is considered. The radius of the Dubins path on the sphere is lower bounded by r, where r represents the radius of the tightest left or right turn the vehicle can take on the sphere. Noting that <inline-formula> <tex-math>$r \\in $ </tex-math></inline-formula> (0, 1) and can affect the trajectory taken by the vehicle, it is desired to determine the candidate optimal paths for r ranging from nearly zero to close to one to attain a desired final location. In a previous study, this problem was addressed, wherein it was shown that the optimal path is of type <inline-formula> <tex-math>$CG, CC$ </tex-math></inline-formula>, or a degenerate path of the CG and CC paths, which includes C, G paths, for <inline-formula> <tex-math>$r \\leq {}\\frac {1}{2}$ </tex-math></inline-formula>. Here, <inline-formula> <tex-math>$C~\\in $ </tex-math></inline-formula> {<inline-formula> <tex-math>$L, R$ </tex-math></inline-formula>} denotes an arc of a tight left or right turn of minimum turning radius r, and G denotes an arc of a great circle. In this letter, the candidate paths for the same problem are generalized to model vehicles with a larger turning radius. In particular, it is shown that the candidate optimal paths are of type <inline-formula> <tex-math>$CG, CC$ </tex-math></inline-formula>, or a degenerate path of the CG and CC paths for <inline-formula> <tex-math>$r \\leq {}\\frac {\\sqrt {3}}{2}$ </tex-math></inline-formula>. Noting that at most two LG paths and two RG paths can exist for a given final location, this letter further reduces the candidate optimal paths by showing that only one LG and one RG path can be optimal, yielding a total of seven candidate paths for <inline-formula> <tex-math>$r \\leq {}\\frac {\\sqrt {3}}{2}$ </tex-math></inline-formula>. Additional conditions for the optimality of CC paths are also derived in this letter.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2991-2996"},"PeriodicalIF":2.4000,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10806797/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In this letter, motion planning for a Dubins vehicle on a unit sphere to attain a desired final location is considered. The radius of the Dubins path on the sphere is lower bounded by r, where r represents the radius of the tightest left or right turn the vehicle can take on the sphere. Noting that $r \in $ (0, 1) and can affect the trajectory taken by the vehicle, it is desired to determine the candidate optimal paths for r ranging from nearly zero to close to one to attain a desired final location. In a previous study, this problem was addressed, wherein it was shown that the optimal path is of type $CG, CC$ , or a degenerate path of the CG and CC paths, which includes C, G paths, for $r \leq {}\frac {1}{2}$ . Here, $C~\in $ {$L, R$ } denotes an arc of a tight left or right turn of minimum turning radius r, and G denotes an arc of a great circle. In this letter, the candidate paths for the same problem are generalized to model vehicles with a larger turning radius. In particular, it is shown that the candidate optimal paths are of type $CG, CC$ , or a degenerate path of the CG and CC paths for $r \leq {}\frac {\sqrt {3}}{2}$ . Noting that at most two LG paths and two RG paths can exist for a given final location, this letter further reduces the candidate optimal paths by showing that only one LG and one RG path can be optimal, yielding a total of seven candidate paths for $r \leq {}\frac {\sqrt {3}}{2}$ . Additional conditions for the optimality of CC paths are also derived in this letter.