首页|约束空间工业机器人姿态搜索及避障研究

约束空间工业机器人姿态搜索及避障研究

扫码查看
为解决约束空间下机器人无碰撞目标姿态求解问题,提出一种机器人姿态快速搜索算法,并结合4 种不同的路径规划算法实现工业机器人的多目标路径规划.首先,对机器人运动框架初步配置完成后,通过计算位姿矩阵得到了场景内物体坐标的动态相对关系,并在ROS中搭建规划场景;其次,提出一种基于模型和机器人逆解的机器人姿态快速搜索算法RFP,并在RoboDK中对其进行验证,验证结果表明该算法有效;最后,根据任务需求设计了路径规划流程并引入二次规划减少算法随机性的影响,提高规划成功率,应用了RRT等算法进行对比分析,仿真结果表明RRT-con-nect算法的规划速度与成功率高于其它算法,为样机的实现奠定了基础.
Research on Attitude Search and Obstacle Avoidance of Industrial Robots in Constrained Space
In order to solve the problem of collision-free robot attitude in constrained space,a fast robot atti-tude search algorithm is proposed,and four different path planning algorithms are combined to realize multi-objective path planning of industrial robots.First,after completing the preliminary configuration of the robot motion frame,the dynamic relative relationship of object coordinates in the scene was obtained by calculating the pose matrix,and the planning scene was built in ROS.A fast robot pose search algorithm RFP based on model and robot inverse solution is proposed and verified in RoboDK.The verification results show that the algorithm is effective.According to the task requirements,the path planning process is designed and quadratic planning is introduced to reduce the influence of algorithm randomness and improve the planning success rate.The simulation results show that the planning speed and success rate of RT-connect algorithm are higher than other algorithms.The simulation study lays a foundation for the realization of the prototype.

industrial robotspath planningobstacle avoidanceconstrained spaceattitude searchROS

赵海文、罗元铭、张雅丽、赵悦焜、杨冬、胡宁

展开 >

河北工业大学机械工程学院,天津 300401

河北工业大学电工装备可靠性与智能化国家重点实验室,天津 300401

工业机器人 路径规划 避障 约束空间 姿态搜索 ROS

国家自然科学基金国家科技重大专项河北省自然科学基金创新研究群体项目河北省重点研发计划天津市自然科学基金重点项目天津市科技计划重庆市自然科学基金重庆市自然科学基金新疆兵团区域创新引导计划河北省军民融合科技创新项目

122278012017-VII-0011-0106A2020202002202030507040009S20ZDF07720ZYJDJC00030cstc2021jcyjmsxmX0241cstc2021jcyjmsxm05252022BB004SJMYF2022X15

2024

组合机床与自动化加工技术
大连组合机床研究所 中国机械工程学会生产工程分会

组合机床与自动化加工技术

CSTPCD北大核心
影响因子:0.671
ISSN:1001-2265
年,卷(期):2024.(5)
  • 7