中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Research of path planning for polishing robot based on improved genetic algorithm

文献类型:会议论文

作者Guo TY(郭彤颖); Qu DK(曲道奎); Dong ZL(董再励)
出版日期2004
会议名称IEEE International Conference on Robotics and Biomimetics (ROBIO 2004)
会议日期August 22-26, 2004
会议地点Shenyang, China
关键词polishing robot path planning genetic algorithm heuristic search
页码334-338
中文摘要The path planning for traditional polishing robot is teach-play-back method. That is, after adjusting offset errors, the polishing robot repeats the same fixed program in a pre-determined path. Obviously, fixed program makes transferring the robot to new operations difficult. In this paper, the path planning schemes based on improved genetic algorithm (IGA) are proposed. The encoding ways, crossover operator and mutation operator of genetic algorithm (GA) are researched. Simulation shows that this method of path planning for polishing robot is effective.
收录类别EI ; CPCI(ISTP)
产权排序1
会议主办者IEEE Robot & Automat Soc, IEEE HK RA CS Joint Chapter, Chinese Acad Sci, Shenyang Inst Automat, Chinese High tech Dev Program, Robot Soc Japan, Japan Soc Mech Engineers, Int Rescue Syst Inst, Shenyang Hunnan New Urban Area, Shenyang New & High tech Ind Dev Zone
会议录IEEE ROBIO 2004: PROCEEDINGS OF THE IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS
会议录出版者IEEE
会议录出版地NEW YORK
语种英语
ISBN号0-7803-8641-8
WOS记录号WOS:000234343000059
源URL[http://ir.sia.cn/handle/173321/7668]  
专题沈阳自动化研究所_其他
推荐引用方式
GB/T 7714
Guo TY,Qu DK,Dong ZL. Research of path planning for polishing robot based on improved genetic algorithm[C]. 见:IEEE International Conference on Robotics and Biomimetics (ROBIO 2004). Shenyang, China. August 22-26, 2004.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。