Minimum-time trajectory planning for an inchworm-like climbing robot based on quantum-behaved particle swarm optimization
Jianjun Yao, Yuxuan Huang, Zhenshuai Wan, Le Zhang, Cheng Sun, Xiaodong Zhang
- 发表年份
- 2016
- 引用次数
- 8
摘要
Since inchworm-like robots can exhibit excellent mobility in unstructured environments, it will be widely applied in agriculture, forestry, and high-altitude operations. Trajectory planning is an important issue for a climbing robot. This paper focuses on an inchworm-like climbing robot to plan its trajectory. The climbing process of the robot, especially the transitional gait when the robot is planned to climb over tree branches, is analyzed. Based on the gait analysis, the robot’s geometrical path is determined, and its waypoints are described by joint angles. 3-5-3 type polynomial interpolation function is adopted to fit the robot’s motion trajectory. To save the climbing time for the robot, its climbing transitional gaits for climbing over tree branches are optimized by using quantum-behaved particle swarm optimization algorithm to minimize the climbing time. Simulations are carried out to verify the developed trajectory planning, and the optimal results obtained from quantum-behaved particle swarm optimization are compared with the optimal solutions obtained by particle swarm optimization and genetic algorithm to further validate the effectiveness of the proposed method.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002