Polar polynomial curve for smooth, collision-free path generation between two arbitrary configurations for nonholonomic robots

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies a geometric-based method for smooth path generation for nonholonomic mobile robots, which are subject to dynamic and curvature constraints. It first studies polar polynomial curve and its properties for it to be used in curvature-smooth transition. In the design of such a path, it is examinable whether the robot constraints and curvature requirement are satisfied. Then, connection using such a curve is extended to the case that the robot is performing rotation at its start position. Next, a computationally efficient way is proposed for collision test of the curve in order to achieve real-time path planning. Finally, extensive simulation experiments are carried out to verify the proposed method. © 2007 IEEE.

Cite

CITATION STYLE

APA

Lai, X. C., Mamun, A. A., & Ge, S. S. (2007). Polar polynomial curve for smooth, collision-free path generation between two arbitrary configurations for nonholonomic robots. In 22nd IEEE International Symposium on Intelligent Control, ISIC 2007. Part of IEEE Multi-conference on Systems and Control (pp. 59–64). IEEE Computer Society. https://doi.org/10.1109/ISIC.2007.4450861

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free