1. Offshore Heavy Industries Design & Research Institute, Shanghai Zhenhua Heavy Industries Company Limited, Shanghai 200125, China;
2. School of Naval Architecture, Ocean & Civil Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;
3. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
To resolve multi-objective programming problem of the continuous trajectory for redundant robots, the principle of the multi-objective arbitration is analyzed. A product arbitration method is designed and its feasibility is shown. The quotient exterior point penalty function method is proposed to deal with the constraints in the product arbitration model. The product arbitration based optimization model has complex local extremum point structure, and requires the solver to possess very strong ability to search the global extremum. Therefore, a Gaussian rovering particle swarm optimization (GR-PSO) method is proposed. The GR-PSO and the standard PSO algorithm are used to search the global extremum of five constrained and unconstrained optimization testing functions for a hundred times respectively. The results show that the success ratio of the GR-PSO is superior to the standard PSO obviously. In resolving a 7-dimensional optimization testing function with complex local extremum point structure, the success ratio of GR-PSO is 80%, and that of the standard PSO is zero, which shows the GR-PSO has stronger ability to search the global extremum point in resolving high-dimensional optimization problem. The GR-PSO can resolve the path planning problem for robots with multiple degrees of freedom.
[1] Pareto V. Manual of political economy[M]. New York, USA: Kelley, 1971.[2] Salukvadze M E. Vector-valued optimization problems in control theory[M]. New York, USA: Academic Press, 1979.[3] Marler R T, Arora J S. Survey of multi-objective optimization methods for engineering[J]. Structural and Multidisciplinary Optimization, 2004, 26(6): 369-395. [4] van Veldhuizen D A, Lamont G B. Multiobjective evolutionary algorithms: Analyzing the state-of-the-art[J]. Evolutionary Computation, 2000, 8(2): 125-147. [5] Johan A. Multiobjective optimization in engineering design - Applications to fluid power systems[D]. Sweden: Linköping University, 2001.[6] Das I, Dennis J E. A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems[J]. Structural Optimization, 1997, 14(1): 63-69. [7] Bridgman P W. Dimensional analysis[M]. New Haven, USA: Yale University Press, 1922.[8] Gerasimov E N, Repko V N. Multicriterial optimization[J]. Soviet Applied Mechanics, 1978, 14(11): 1179-1184. [9] Rentmeesters M J, Tsai W K, Lin K J. A theory of lexicographic multi-criteria optimization[C]//Second IEEE International Conference on Engineering of Complex Computer Systems. Piscataway, NJ, USA: IEEE, 1996: 76-79.[10] Ogryczak W. A goal programming model of the reference point method[J]. Annals of Operations Research, 1994, 51: 33-44.[11] Miettinen K. Nonlinear multiobjective optimization[M]. Boston, USA: Kluwer Academic Publishers, 1998.[12] Konak A, Coit D W, Smith A E. Multi-objective optimization using genetic algorithms: A tutorial[J]. Reliability Engineering and System Safety, 2006, 91(9): 992-1007. [13] Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197. [14] Clerc M, Kennedy J. The particle swarm: Explosion, stability, and convergence in a multidimensional complex space[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58-73. [15] Banks A, Vincent J, Anyakoha C. A review of particle swarm optimization. Part I: Background and development[J]. Natural Computing, 2007, 6(4): 467-484. [16] Banks A, Vincent J, Anyakoha C. A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications[J]. Natural Computing, 2008, 7(1): 109-124. [17] 曾建潮,崔志华.一种保证全局收敛的PSO算法[J].计算机研究与发展,2004,41(8):1333-1338. Zeng J C, Cui Z H. A guaranteed global convergence particle swarm optimizer[J]. Journal of Computer Research and Development, 2004, 41(8): 1333-1338.[18] Chattopadhyay A, Seeley C E. Simulated annealing technique for multiobjective optimization of intelligent structures[J]. Smart Materials and Structures, 1994, 3(2): 98-106. [19] Li S Z. Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers[J]. IEEE Transactions on Neural Networks, 1996, 7(6): 1507-1516. [20] Schwartz E, Manseur R, Doty K. Noncommensurate systems in robotics[J]. International Journal of Robotics and Automation, 2002, 17(2): 86-92.[21] Davis M D. Game theory, a nontechnical introduction[M]. New York, USA: Dover Publications, 1983.[22] Nash J F. The bargaining problem[J]. Econometrica, 1950, 18: 155-162.[23] Straffin P D. Game theory and strategy[M]. Washington DC, USA: The Mathematical Association of America, 1993.[24] Rao S S, Hati S K. Optimum design of shock and vibration isolation systems using game theory[J]. Engineering Optimization, 1980, 4(4): 215-226. [25] Mazumdar R, Mason L G, Douligeris C. Fairness in network optimal flow control: Optimality of product forms[J]. IEEE Transactions on Communications,1991, 39(5): 775-782. [26] Cheng F Y, Li D. Multiobjective optimization of structures with and without control[J]. Journal of Guidance, Control, and Dynamics, 1996, 19(2): 392-397. [27] 薛毅.最优化原理与方法[M].北京:北京工业大学出版社,2001. Xue Y. Optimization theory and method[M]. Beijing: Beijing University of Technology Press, 2001.[28] Huang P F, Xu Y S. PSO-based time-optimal trajectory planning for space robot with dynamic constraints[C]//IEEE International Conference on Robotics and Biomimetics. Piscataway, NJ, USA: IEEE, 2006: 1402-1407.[29] 蔡晓慧,李艳君,吴铁军.基于PSO和滚动优化的不确定环境下移动机器人动态路径规划[J].科技通报,2008,24(2):260-265. Cai X H, Li Y J, Wu T J. Dynamic path planning of mobile robots in uncertain environments based on PSO and receding horizon optimization[J]. Bulletin of Science and Technology, 2008, 24(2): 260-265.[30] 曾建潮,介婧,崔志华.微粒群算法[M].北京:科学出版社,2004. Zeng J C, Jie J, Cui Z H. Particle swarm algorithm[M]. Beijing: Science Press, 2004.[31] Shi Y, Eberhart R. A modified particle swarm optimizer[C]// IEEE Conference on Evolutionary Computation. Piscataway, NJ, USA: IEEE, 1998: 69-73.
