Periodic motion planning for an under-actuated system is rather difficult due to differential dynamic constraints imposed by passive dynamics, and it becomes more difficult for a system with higher underactuation degr...Periodic motion planning for an under-actuated system is rather difficult due to differential dynamic constraints imposed by passive dynamics, and it becomes more difficult for a system with higher underactuation degree, that is with a higher difference between the number of degrees of freedom and the number of independent control inputs. However, from another point of view, these constraints also mean some relation between state variables and could be used in the motion planning.We consider a double rotary pendulum, which has an underactuation degree 2. A novel periodic motion planning is presented based on an optimization search. A necessary condition for existence of the whole periodic trajectory is given because of the higher underactuation degree of the system. Moreover this condition is given to make virtual holonomic constraint(VHC) based control design feasible. Therefore, an initial guess for the optimization of planning a feasible periodic motion is based on this necessary condition. Then, VHCs are used for the system transformation and transverse linearization is used to design a static state feedback controller with periodic matrix function gain. The controller gain is found through another optimization procedure. The effectiveness of initial guess and performance of the closed-loop system are illustrated through numerical simulations.展开更多
蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的...蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。展开更多
基金supported by China Scholarship Council (201504980073) for Zeguo Wang to visit Umea University
文摘Periodic motion planning for an under-actuated system is rather difficult due to differential dynamic constraints imposed by passive dynamics, and it becomes more difficult for a system with higher underactuation degree, that is with a higher difference between the number of degrees of freedom and the number of independent control inputs. However, from another point of view, these constraints also mean some relation between state variables and could be used in the motion planning.We consider a double rotary pendulum, which has an underactuation degree 2. A novel periodic motion planning is presented based on an optimization search. A necessary condition for existence of the whole periodic trajectory is given because of the higher underactuation degree of the system. Moreover this condition is given to make virtual holonomic constraint(VHC) based control design feasible. Therefore, an initial guess for the optimization of planning a feasible periodic motion is based on this necessary condition. Then, VHCs are used for the system transformation and transverse linearization is used to design a static state feedback controller with periodic matrix function gain. The controller gain is found through another optimization procedure. The effectiveness of initial guess and performance of the closed-loop system are illustrated through numerical simulations.
文摘蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。
