Abstract：This paper presents a method to solve the problem of manipulator placement in which the simulated annealing genetic algorithm(SA-GA) is adopted.The principle of SA-GA is introduced.Multiple kinematics criteria is presented and the objective function is constructed which are used in the optimal process.Finally, the algorithm is tested and its results are satisfactory.
[1] Seraji H.Reachability analysis for base placement in mobile manipulators[J].Journal of Robotic Systems,1995,12 (1):29-43. [2] Zeghloul S,Pamanes-Garcia J A.Multi-criteria optimal placement of robots in constrained environment[J].Robotica,1993,11 (2):105-110. [3] Zeghloul S,Blanchard B,Ayrault M.SMAR:a robot modeling and simulation system[J].Robotica,1997,15 (1):63-73. [4] Yu W.Optimal Placement of Serial Manipulators[D].USA:The University of Iowa,2001. [5] 崔鲲,吴林,陈善本.遗传算法在冗余度弧焊机器人路径规划中的应用[J].机器人,1998,20(5):362-367. [6] Cheng H,Flann N S,Watson D W.Parallel genetic simulated annealing:a massively parallel SIMD algorithm[J].IEEE Transactions on Parallel and Distributed Systems,1998,9(2):126-136. [7] Quagliarella D,Vicini A.A genetic algorithm with adaptive parameters[A].Proceedings of the 1999 IEEE International Conference on Systems,Man,and Cybernetics[C].Piscataway,USA:IEEE,1999.598-603. [8] Sugisaka M,Fan X J.Adaptive genetic algorithm with a cooperative mode[A].Proceedings of the 2001 IEEE International Symposium on Industrial Electronics[C].Piscataway,USA:IEEE,2001.1941 -1945.
