{"title":"基于全局搜索和梯度法的机械臂无碰撞最小时间轨迹规划","authors":"Motoji Yamamoto, Y. Isshiki, A. Mohri","doi":"10.1109/IROS.1994.407564","DOIUrl":null,"url":null,"abstract":"A method for a time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of the nonlinearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches the time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this is an effective approach to the time optimal collision free trajectory planning problem.<<ETX>>","PeriodicalId":437805,"journal":{"name":"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Collision free minimum time trajectory planning for manipulators using global search and gradient method\",\"authors\":\"Motoji Yamamoto, Y. Isshiki, A. Mohri\",\"doi\":\"10.1109/IROS.1994.407564\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for a time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of the nonlinearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches the time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this is an effective approach to the time optimal collision free trajectory planning problem.<<ETX>>\",\"PeriodicalId\":437805,\"journal\":{\"name\":\"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.1994.407564\",\"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 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1994.407564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Collision free minimum time trajectory planning for manipulators using global search and gradient method
A method for a time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of the nonlinearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches the time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this is an effective approach to the time optimal collision free trajectory planning problem.<>