{"title":"非完整机器人两任意构形间平滑无碰撞路径生成的极多项式曲线","authors":"X. Lai, A. Mamun, S. Ge","doi":"10.1109/ISIC.2007.4450861","DOIUrl":null,"url":null,"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 realtime path planning. Finally, extensive simulation experiments are carried out to verify the proposed method.","PeriodicalId":184867,"journal":{"name":"2007 IEEE 22nd International Symposium on Intelligent Control","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Polar Polynomial Curve for Smooth, Collision-free Path Generation Between Two Arbitrary Configurations for Nonholonomic Robots\",\"authors\":\"X. Lai, A. Mamun, S. Ge\",\"doi\":\"10.1109/ISIC.2007.4450861\",\"DOIUrl\":null,\"url\":null,\"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 realtime path planning. Finally, extensive simulation experiments are carried out to verify the proposed method.\",\"PeriodicalId\":184867,\"journal\":{\"name\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.2007.4450861\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 22nd International Symposium on Intelligent Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.2007.4450861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Polar Polynomial Curve for Smooth, Collision-free Path Generation Between Two Arbitrary Configurations for Nonholonomic Robots
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 realtime path planning. Finally, extensive simulation experiments are carried out to verify the proposed method.