{"title":"基于自适应遗传算法的粒子群优化工业机械臂避障轨迹优化","authors":"Yu Chen, Liping Chen, J. Ding","doi":"10.1109/ICARCE55724.2022.10046592","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an obstacle avoidance algorithm, which selects a point of the obstacle avoidance path as the chromosome, constructs the fitness function together with the path length, joint angle increment, and movement time as evaluation indexes, and performs scale transformation on the fitness to improve the competitiveness of the population. The algorithm cycles through the process of optimizing the velocity term in the chromosome in the first step with a particle swarm algorithm; selection in the second step; and crossover and mutation operations on individuals in the third step, in order to avoid the population falling into premature maturity, where the crossover and mutation probabilities vary adaptively with the results of the previous generation. The final smooth and continuous obstacle avoidance trajectory is obtained.","PeriodicalId":416305,"journal":{"name":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive Genetic Algorithm Based Particle Swarm Optimization for Industrial Robotic Arm Obstacle Avoidance Trajectory Optimization\",\"authors\":\"Yu Chen, Liping Chen, J. Ding\",\"doi\":\"10.1109/ICARCE55724.2022.10046592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an obstacle avoidance algorithm, which selects a point of the obstacle avoidance path as the chromosome, constructs the fitness function together with the path length, joint angle increment, and movement time as evaluation indexes, and performs scale transformation on the fitness to improve the competitiveness of the population. The algorithm cycles through the process of optimizing the velocity term in the chromosome in the first step with a particle swarm algorithm; selection in the second step; and crossover and mutation operations on individuals in the third step, in order to avoid the population falling into premature maturity, where the crossover and mutation probabilities vary adaptively with the results of the previous generation. The final smooth and continuous obstacle avoidance trajectory is obtained.\",\"PeriodicalId\":416305,\"journal\":{\"name\":\"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARCE55724.2022.10046592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCE55724.2022.10046592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive Genetic Algorithm Based Particle Swarm Optimization for Industrial Robotic Arm Obstacle Avoidance Trajectory Optimization
In this paper, we propose an obstacle avoidance algorithm, which selects a point of the obstacle avoidance path as the chromosome, constructs the fitness function together with the path length, joint angle increment, and movement time as evaluation indexes, and performs scale transformation on the fitness to improve the competitiveness of the population. The algorithm cycles through the process of optimizing the velocity term in the chromosome in the first step with a particle swarm algorithm; selection in the second step; and crossover and mutation operations on individuals in the third step, in order to avoid the population falling into premature maturity, where the crossover and mutation probabilities vary adaptively with the results of the previous generation. The final smooth and continuous obstacle avoidance trajectory is obtained.