{"title":"运动规划的一种新方法","authors":"Huixin. Cheng, Heng-Da Cheng","doi":"10.1109/IROS.1993.583193","DOIUrl":null,"url":null,"abstract":"The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.","PeriodicalId":299306,"journal":{"name":"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel approach for motion planning\",\"authors\":\"Huixin. Cheng, Heng-Da Cheng\",\"doi\":\"10.1109/IROS.1993.583193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.\",\"PeriodicalId\":299306,\"journal\":{\"name\":\"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.1993.583193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1993.583193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.