首页 | 本学科首页   官方微博 | 高级检索  
     


Multi-objective dynamic optimal trajectory planning of robot manipulators in the presence of obstacles
Authors:S Ramabalan  R Saravanan  C Balamurugan
Affiliation:1. Faculty of CAD/CAM (P.G.Course), J. J. College of Engineering and Technology, Trichy-620006,, Tamilnadu, India
2. Department of Mechatronics Engineering, Kumaraguru College of Technology, Coimbatore - Pin: 641 006, Tamil nadu, India
3. Faculty of CAD/CAM (P.G.Course), J. J. College of Engineering and Technology, Tiruchirapalli-Pin: 620 009, Tamil nadu, India
Abstract:In this paper, a real-world test problem is presented and made available for the use of evolutionary multi-objective community. The generation of manipulator trajectories by considering multiple objectives and obstacle avoidance is a non-trivial optimisation problem. In this paper two multi-objective evolutionary algorithms viz., elitist non-dominated sorting genetic algorithm (NSGA-II) and multi-objective differential evolution (MODE) algorithm are proposed to address this problem. Multiple criteria are optimised to two simultaneous objectives. Simulations results are presented for industrial robots with two degrees of freedom (Cartesian robot (PP) with two prismatic joints) and six degrees of freedom (PUMA 560 robot), by considering two objectives optimisation. Two methods (normalized weighting objective functions and average fuzzy membership function) are used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find computational effort of NSGA-II and MODE algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号