Trajectory Generation using Spatial Pythagorean Hodograph Bezier Curves

Author(s):  
Ronald Choe ◽  
Javier Puig ◽  
Venanzio Cichella ◽  
Enric Xargay ◽  
Naira Hovakimyan
2016 ◽  
Vol 39 (8) ◽  
pp. 1744-1763 ◽  
Author(s):  
Ronald Choe ◽  
Javier Puig-Navarro ◽  
Venanzio Cichella ◽  
Enric Xargay ◽  
Naira Hovakimyan

2020 ◽  
Vol 53 (2) ◽  
pp. 9276-9281
Author(s):  
Bahareh Sabetghadam ◽  
Rita Cunha ◽  
António Pascoal

2016 ◽  
Vol 11 (1) ◽  
pp. 1-10
Author(s):  
Władysław Koc ◽  
Katarzyna Palikowska

The paper presents a new general method of modelling route segments curvature using differential equations. The method enables joining of route segments of different curvature. Transitional curves of linear and nonlinear curvatures have been identified in the case of joining two circular arcs by S-shaped and C-oval transitions. The obtained S-shaped curves have been compared to the cubic C-Bezier curves and to the Pythagorean hodograph quantic Bezier curve using the Lateral Change of Acceleration diagram and the dynamic model. The analysis of dynamic properties has showed an advantage of the obtained transition curve of nonlinear curvature over Bezier curves.


Author(s):  
Kenneth Renny Simba ◽  
Naoki Uchiyama ◽  
Mohammad Aldibaja ◽  
Shigenori Sano

This paper proposes an obstacle avoidance trajectory generation method that provides a smooth trajectory in real time. The trajectory is generated from an environmental top-view image, where a fisheye lens is used to capture a wide area at low height. Corners of the obstacles are detected and corrected using the log-polar transform and are used to generate a simple configuration space that reduces the computation time. An optimal path is computed by using the A[Formula: see text] algorithm and replaced by a smooth trajectory generated based on piecewise quintic Bézier curves. Based on the established goal and visual information, a method for generating the first and second derivatives at the start and end points of each Bézier segment is proposed to generate a continuous curvature trajectory. The method is simple and easy to implement and has an average computation time of 1.17s on a PC (CPU: 1.4 GHz) for a workspace containing five to six obstacles. Experimental results verify that the proposed method is effective for real-time motion planning of autonomous mobile robots.


2021 ◽  
Author(s):  
Satyanarayana G. Manyam ◽  
David Casbeer ◽  
Isaac E. Weintraub ◽  
Dzung M. Tran ◽  
Justin M. Bradley ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document