用户名: 密码: 验证码:
基于赋时Petri网的机器人小臂装配线建模
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Robot Arm Assembly Line Modeling Based on Timed Petri Net
  • 作者:姜明壮 ; 李东波 ; 童一飞
  • 英文作者:JIANG Mingzhuang;LI Dongbo;TONG Yifei;School of Mechanical Engineering, Nanjing University of Science & Technology;
  • 关键词:装配线平衡 ; 建模 ; 赋时Petri网 ; 自上而下/自下而上思想 ; 机器人小臂装配
  • 英文关键词:Assembly line balancing;;Modeling;;Timed Petri net;;Idea of top-down/down-top;;Robotic arm assembly
  • 中文刊名:机床与液压
  • 英文刊名:Machine Tool & Hydraulics
  • 机构:南京理工大学机械工程学院;
  • 出版日期:2019-07-28
  • 出版单位:机床与液压
  • 年:2019
  • 期:14
  • 基金:教育部人文社会科学研究青年基金资助项目(17YJC630139);; 国防科技项目基金资助项目(0106142)
  • 语种:中文;
  • 页:8-13
  • 页数:6
  • CN:44-1259/TH
  • ISSN:1001-3881
  • 分类号:TP242
摘要
针对机器人小臂装配过程复杂、装配线平衡分析困难的问题,提出一种以自上而下/自下而上为指导思想的赋时Petri网建模方法。根据机器人小臂实际装配的特点,研究了该装配线模型的定义规则和构建方法。在引入模型假设之后,先用自上而下的思想建立基于流程的赋时Petri网模型;再用自下而上的思想建立基于任一工序的赋时Petri网模型;然后将前两步所建模型相结合并细化,从而建立整个装配线的赋时Petri网模型。最后,通过建立和分析对应模型的可达树验证了该建模方法的可行性。研究对指导机器人小臂装配线的构建具有较大的应用价值。
        Aiming at the problems of complicate process for robotic arm assembly and difficult analysis for line balancing, a timed Petri network modeling method based on top-down/down-top was proposed. According to the actual assembly characteristics of the robotic arm, the definition rules and construction methods of the assembly line model were studied. After introducing the model hypothesis, a timed Petri net model based on the process was built with the idea of top-down. Then a timed Petri net model based on any procedure was built with the idea of down-up. Then the models above were combined to establish the timed Petri net model of the entire assembly line. Finally, the feasibility of the modeling method was verified by establishing and analyzing the reachable tree of the corresponding model.And this study has great application value in guiding the construction of robot arm assembly line.
引文
[1] 刘丰,单忠德,李柳,等.机器人手臂数字化制造技术研究[J].铸造技术,2014(5):1092-1094.LIU F,SHAN Z D,LI L,et al.Research on Digitized Manufacturing Technology for Robot Arm[J].Foundry Technology,2014(5):1092-1094.
    [2] 赵剑冬,黄战.基于Agent的经济社会系统建模与仿真研究[J].复杂系统与复杂性科学,2011,8(4):59-67.ZHAO J D,HUANG Z.A Study on Agent Based Social-Economic System Modeling and Simulation[J].Complex Systems & Complexity Science,2011,8(4):59-67.
    [3] HE Q,LUO W.Low-carbon Closed-loop Logistics Network Design Based on Interval Number Multi-attribute Decision and Queuing Theory[J].International Journal of Hybrid Information Technology,2014(7):235-248.
    [4] 伍晓榕,张树有,裘乐淼,等.基于IDEF的分层递阶工艺成熟度建模技术及应用[J].计算机集成制造系统,2013,19(8):2007-2017.WU X R,ZHANG S Y,QIU L M,et al.Technology and Application of Hierarchical Process Maturity Modeling Based on IDEF[J].Computer Integrated Manufacturing Systems,2013,19(8):2007-2017.
    [5] 曹化工,杨曼红.基于对象Petri网的工作流过程定义[J].计算机辅助设计与图形学学报,2001,13(1):13-18.CAO H G,YANG M H.Workflow Process Definition Based on Object Petri-net[J].Journal of Computer Aided Design & Computer Graphics,2001,13(1):13-18.
    [6] 王祺,王安荣,蒲绪强.制造系统Petri网特殊标识求解算法[J].西安电子科技大学学报(自然科学版),2013,40(6):85-91.WANG Q,WANG A R,PU X Q.Computation of Special Markings of Petri Nets of Manufacturing Systems[J].Journal of Xidian University(Natural Science),2013,40(6):85-91.
    [7] CHEN Y F,LI Z W,BARKAOUI K,et al.New Petri Net Structure and Its Application to Optimal Supervisory Control:Interval Inhibitor Arcs[J].IEEE Transactions on Systems Man & Cybernetics Systems,2014,44(10):1384-1400.
    [8] 魏佳兴,杨超民.基于Petri网的物流配送研究综述[J].中国市场,2014(22):30-31.
    [9] KABASHKIN I.Modelling of Regional Transit Multimodal Transport Accessibility with Petri Net Simulation[J].Procedia Computer Science,2015,77:151-157.
    [10] BEST E,DEVILLERS R.Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets[M]//Language and Automata Theory and Applications.Springer International Publishing,2014:161-172.
    [11] WANG J,DU Y Y,YU S X.Coloured Logic Petri Nets and Analysis of Their Reachable Trees[J].Enterprise Information Systems,2015,9(8):900-919.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700