{"title":"基于自适应蚁群算法的空间机器人路径规划","authors":"Wen Ye, Dengwu Ma, Hong-da Fan","doi":"10.1109/ISSCAA.2006.1627696","DOIUrl":null,"url":null,"abstract":"Path planning is an important problem in space robot control. The self-adaptive ant colony algorithm is a new class of population basic algorithm. In this paper, obstacle avoidance path planning for space robot is realized by use of the self-adaptive ant colony algorithm. Based on the traditional ant colony algorithm, measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, which can find better path at higher convergence speed. Simulation results using Matlab toolbox show that the method is effective and feasible","PeriodicalId":275436,"journal":{"name":"2006 1st International Symposium on Systems and Control in Aerospace and Astronautics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Path planning for space robot based on the self-adaptive ant colony algorithm\",\"authors\":\"Wen Ye, Dengwu Ma, Hong-da Fan\",\"doi\":\"10.1109/ISSCAA.2006.1627696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Path planning is an important problem in space robot control. The self-adaptive ant colony algorithm is a new class of population basic algorithm. In this paper, obstacle avoidance path planning for space robot is realized by use of the self-adaptive ant colony algorithm. Based on the traditional ant colony algorithm, measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, which can find better path at higher convergence speed. Simulation results using Matlab toolbox show that the method is effective and feasible\",\"PeriodicalId\":275436,\"journal\":{\"name\":\"2006 1st International Symposium on Systems and Control in Aerospace and Astronautics\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 1st International Symposium on Systems and Control in Aerospace and Astronautics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCAA.2006.1627696\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 1st International Symposium on Systems and Control in Aerospace and Astronautics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCAA.2006.1627696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Path planning for space robot based on the self-adaptive ant colony algorithm
Path planning is an important problem in space robot control. The self-adaptive ant colony algorithm is a new class of population basic algorithm. In this paper, obstacle avoidance path planning for space robot is realized by use of the self-adaptive ant colony algorithm. Based on the traditional ant colony algorithm, measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, which can find better path at higher convergence speed. Simulation results using Matlab toolbox show that the method is effective and feasible