IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i4d10.1007_s10845-020-01602-0.html
   My bibliography  Save this article

Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic

Author

Listed:
  • Juan Lu

    (Guangxi University
    Beibu Gulf University)

  • Chengyi Ou

    (Guangxi Automobile Group Co., Ltd.)

  • Chen Liao

    (Pengcheng Laboratory of Shenzhen Cyberspace Laboratory)

  • Zhenkun Zhang

    (Guangxi University)

  • Kai Chen

    (Guangxi University)

  • Xiaoping Liao

    (Guangxi University)

Abstract

This study introduces a developed method to a smart computer-aided design/manufacturing (CAD/CAM) system, where layout design, process planning, and comprehensive computerized numerical control (CNC) code generation can be implemented to satisfy laser cutting holes, tapping, irregular and complicated profile processing, engraving, and burr back-scraping. The smart CAD/CAM(SCAM) system is developed as a commercial software product or application and firstly applied to flexible sheet metal machining center (BGL 130R). In this study, a formal modeling method involving Petri nets and first-order predicate logic is proposed to develop the smart manufacturing system. High-level Petri nets are employed to achieve the formal application architecture design of data flow for various functions, and the first-order logic used to represent the process plan is defined and deduced according to the machining methods. The developed system possesses the following characteristics: (1) a sound and complete deductive system to implement various types of trajectory planning, automatic generation, and validation of the CNC code; (2) a convenient design input environment and readiness for re-design and modification by adding specific design functions and using standard design procedures on a widely used CAD/CAM package; (3) helpful for designers in sheet metal layout designing, layout interference detection, process planning validation, preprocess manufacturing operation of CNC code generation, and autodefinition of storable file names; and (4) formal and simple in human–computer interaction, automatic and intelligent in process operations, and satisfactory in terms of the requirements of the flexible sheet metal machining center (BGL 130R).

Suggested Citation

  • Juan Lu & Chengyi Ou & Chen Liao & Zhenkun Zhang & Kai Chen & Xiaoping Liao, 2021. "Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1043-1063, April.
    • Handle: RePEc:spr:joinma:v:32:y:2021:i:4:d:10.1007_s10845-020-01602-0
    DOI: 10.1007/s10845-020-01602-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01602-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-020-01602-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Victor R. L. Shen & Cheng-Ying Yang & Rong-Kuan Shen & Yu-Chia Chen, 2018. "Application of Petri nets to deadlock avoidance in iPad-like manufacturing systems," Journal of Intelligent Manufacturing, Springer, vol. 29(6), pages 1363-1378, August.
    2. Yingcong Wang & Renbin Xiao & Huimin Wang, 2017. "A flexible labour division approach to the polygon packing problem based on space allocation," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3025-3045, June.
    3. Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    4. Yuriy Stoyan & Alexander Pankratov & Tatiana Romanova, 2016. "Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(5), pages 786-800, May.
    5. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    6. Edmund Burke & Robert Hellier & Graham Kendall & Glenn Whitwell, 2006. "A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem," Operations Research, INFORMS, vol. 54(3), pages 587-601, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    2. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    3. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    4. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    5. Sato, André Kubagawa & Martins, Thiago Castro & Gomes, Antonio Miguel & Tsuzuki, Marcos Sales Guerra, 2019. "Raster penetration map applied to the irregular packing problem," European Journal of Operational Research, Elsevier, vol. 279(2), pages 657-671.
    6. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    7. E. K. Burke & R. S. R. Hellier & G. Kendall & G. Whitwell, 2010. "Irregular Packing Using the Line and Arc No-Fit Polygon," Operations Research, INFORMS, vol. 58(4-part-1), pages 948-970, August.
    8. Miguel Santoro & Felipe Lemos, 2015. "Irregular packing: MILP model based on a polygonal enclosure," Annals of Operations Research, Springer, vol. 235(1), pages 693-707, December.
    9. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    10. Qiang Luo & Yunqing Rao, 2022. "Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    11. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.
    12. Luiz H. Cherri & Adriana C. Cherri & Edilaine M. Soler, 2018. "Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations," Journal of Global Optimization, Springer, vol. 72(1), pages 89-107, September.
    13. Donald Jones, 2014. "A fully general, exact algorithm for nesting irregular shapes," Journal of Global Optimization, Springer, vol. 59(2), pages 367-404, July.
    14. Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.
    15. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    16. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    17. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    18. Qin, Yichen & Ng, Kam K.H., 2023. "Analysing the impact of collaborations between airlines and maintenance service company under MRO outsourcing mode: Perspective from airline's operations," Journal of Air Transport Management, Elsevier, vol. 109(C).
    19. Huang, Zhendong & Xiao, Renbin, 2013. "An emergent computation approach to the problem of polygon layout with performance constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5074-5088.
    20. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:32:y:2021:i:4:d:10.1007_s10845-020-01602-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.