Trajectory Optimization with Particle Swarm Optimization for Manipulator Motion Planning

Industrial Informatics, IEEE Transactions  (2015)

引用 123|浏览30
暂无评分
摘要
Optimization-based methods have been recently proposed to solve motion planning problems with complex constraints. Previous methods have used optimization methods that may converge to a local minimum. In this study, particle swarm optimization (PSO) is proposed for trajectory optimization. PSO is a population-based stochastic global optimization method inspired by group behaviors in wildlife and has the advantages of simplicity and fast convergence. Trajectory modifications are encoded in particles that are optimized with PSO. The normalized step cost (NSC) concept is used for the initialization of the particles in PSO. A method for reusing previously optimized parameters is also developed. The optimized parameters are stored together with corresponding NSC vectors, and when a constraint violation occurs, the parameters associated with an NSC vector that is similar to the query NSC vector are selected. The selected vector is used for initializing the particles. The reuse of the previously optimized parameters improves the convergence of the PSO in motion planning. The effectiveness of these methods is shown with simulations and an experiment using a threedimensional problem with constraints. The proposed algorithm successfully optimized a trajectory while satisfying the constraints and is less likely to converge to a local minimum.
更多
查看译文
关键词
manipulator,motion planning,particle swarm optimization,trajectory optimization,planning,path planning,informatics,trajectory,optimization,vectors
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要