基于自適應(yīng)遺傳算法的六軸工業(yè)機(jī)器人時間最優(yōu)軌跡規(guī)劃
[Abstract]:As an important branch of robot field, the development and application of industrial robot has been paid much attention by the society. With the development of society and the increasing demand for material, the working quality and efficiency of industrial robots have become a more and more concerned factor. Therefore, robot trajectory planning aiming at optimal time is becoming more and more popular. Based on the kinematics model of PUMA560 robot, the fifth order polynomial function is used to plan the trajectory of each joint, and an adaptive genetic algorithm is used to optimize the motion time of each joint. Enables the robot to complete the specified action in a relatively short period of time. This paper first introduces the research background and significance of the subject, the development status and application prospect of robot technology, briefly expounds the general problems of robot trajectory planning, and discusses the experts at home and abroad in recent years. The research results of robot trajectory optimization are summarized and analyzed. According to the kinematics knowledge of the robot, the description method of the space point and the theory of coordinate transformation are briefly expounded. The kinematics equation is established for the PUMA560 robot, and the position and pose of the end of the robot arm are represented by the joint variables. The inverse kinematics of the robot is analyzed and solved. Based on the research of robot trajectory planning theory, the methods of straight line interpolation and arc interpolation in Cartesian space are analyzed, as well as the fifth degree polynomial function and the transitional interpolation method with parabola in joint space. The simulation of robot trajectory planning in Cartesian space and joint space is realized by MATLAB programming. On the basis of analyzing the mechanism of genetic algorithm and the influence of genetic operator on the evolution process, an adaptive genetic algorithm is used to optimize the trajectory of robot joint arm, and the trajectory of each joint of PUMA560 is simulated by MATLAB. According to the analysis of each curve, the method in this paper can achieve the optimal planning goal of time, and ensure the smooth angular displacement, velocity and acceleration curve of each joint, and ensure the robot to finish the task smoothly and efficiently.
【學(xué)位授予單位】:安徽工業(yè)大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:TP242.2
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 柳倩;桂建軍;楊小薇;曲艷麗;;工業(yè)機(jī)器人傳感控制技術(shù)研究現(xiàn)狀及發(fā)展態(tài)勢——基于專利文獻(xiàn)計量分析視角[J];機(jī)器人;2016年05期
2 陶建華;陳云霽;;類腦計算芯片與類腦智能機(jī)器人發(fā)展現(xiàn)狀與思考[J];中國科學(xué)院院刊;2016年07期
3 高峰;郭為忠;;中國機(jī)器人的發(fā)展戰(zhàn)略思考[J];機(jī)械工程學(xué)報;2016年07期
4 陳鶴;方勇純;孫寧;錢_g哲;;基于偽譜法的雙擺吊車時間最優(yōu)消擺軌跡規(guī)劃策略[J];自動化學(xué)報;2016年01期
5 王琨;駱敏舟;曹毅;李可;張秋菊;;基于執(zhí)行時間約束的機(jī)器人關(guān)節(jié)空間軌跡優(yōu)化[J];計算機(jī)工程與設(shè)計;2015年06期
6 倪自強(qiáng);王田苗;劉達(dá);;醫(yī)療機(jī)器人技術(shù)發(fā)展綜述[J];機(jī)械工程學(xué)報;2015年13期
7 楊錦濤;姜文剛;林永才;;工業(yè)機(jī)器人沖擊最優(yōu)的軌跡規(guī)劃算法[J];科學(xué)技術(shù)與工程;2014年28期
8 王田苗;陶永;;我國工業(yè)機(jī)器人技術(shù)現(xiàn)狀與產(chǎn)業(yè)化發(fā)展戰(zhàn)略[J];機(jī)械工程學(xué)報;2014年09期
9 馬睿;胡曉兵;殷國富;萬曉東;;六關(guān)節(jié)工業(yè)機(jī)器人最短時間軌跡優(yōu)化[J];機(jī)械設(shè)計與制造;2014年04期
10 王晟;閔華松;陳友東;;使用QT構(gòu)建的碼垛機(jī)器人離線編程仿真系統(tǒng)[J];計算機(jī)工程與設(shè)計;2013年07期
相關(guān)碩士學(xué)位論文 前6條
1 王佳;一種六自由度工業(yè)機(jī)器人的軌跡規(guī)劃及仿真研究[D];長安大學(xué);2011年
2 陳偉華;工業(yè)機(jī)器人笛卡爾空間軌跡規(guī)劃的研究[D];華南理工大學(xué);2010年
3 閆妍;一種新的自適應(yīng)遺傳算法[D];哈爾濱工程大學(xué);2007年
4 李明;遺傳算法的改進(jìn)及其在優(yōu)化問題中的應(yīng)用研究[D];吉林大學(xué);2004年
5 張紅強(qiáng);工業(yè)機(jī)器人時間最優(yōu)軌跡規(guī)劃[D];湖南大學(xué);2004年
6 陶其銘;機(jī)器人軌跡規(guī)劃的研究[D];合肥工業(yè)大學(xué);2003年
,本文編號:2178617
本文鏈接:http://sikaile.net/kejilunwen/zidonghuakongzhilunwen/2178617.html