IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i4p395-d500905.html
   My bibliography  Save this article

Hybrid Assembly Path Planning for Complex Products by Reusing a Priori Data

Author

Listed:
  • Guodong Yi

    (State Key Laboratory of Fluid Power & Mechatronic Systems, Zhejiang University, Hangzhou 310027, China)

  • Chuanyuan Zhou

    (State Key Laboratory of Fluid Power & Mechatronic Systems, Zhejiang University, Hangzhou 310027, China)

  • Yanpeng Cao

    (State Key Laboratory of Fluid Power & Mechatronic Systems, Zhejiang University, Hangzhou 310027, China)

  • Hangjian Hu

    (State Key Laboratory of Fluid Power & Mechatronic Systems, Zhejiang University, Hangzhou 310027, China)

Abstract

Assembly path planning (APP) for complex products is challenging due to the large number of parts and intricate coupling requirements. A hybrid assembly path planning method is proposed herein that reuses a priori paths to improve the efficiency and success ratio. The assembly path is initially segmented to improve its reusability. Subsequently, the planned assembly paths are employed as a priori paths to establish an a priori tree, which is expanded according to the bounding sphere of the part to create the a priori space for path searching. Three rapidly exploring random tree (RRT)-based algorithms are studied for path planning based on a priori path reuse. The RRT* algorithm establishes the new path exploration tree in the early planning stage when there is no a priori path to reuse. The static RRT* (S-RRT*) and dynamic RRT* (D-RRT*) algorithms form the connection between the exploration tree and the a priori tree with a pair of connection points after the extension of the exploration tree to a priori space. The difference between the two algorithms is that the S-RRT* algorithm directly reuses an a priori path and obtains a new path through static backtracking from the endpoint to the starting point. However, the D-RRT* algorithm further extends the exploration tree via the dynamic window approach to avoid collision between an a priori path and obstacles. The algorithm subsequently obtains a new path through dynamic and non-continuous backtracking from the endpoint to the starting point. A hybrid process combining the RRT*, S-RRT*, and D-RRT* algorithms is designed to plan the assembly path for complex products in several cases. The performances of these algorithms are compared, and simulations indicate that the S-RRT* and D-RRT* algorithms are significantly superior to the RRT* algorithm in terms of the efficiency and success ratio of APP. Therefore, hybrid path planning combining the three algorithms is helpful to improving the assembly path planning of complex products.

Suggested Citation

  • Guodong Yi & Chuanyuan Zhou & Yanpeng Cao & Hangjian Hu, 2021. "Hybrid Assembly Path Planning for Complex Products by Reusing a Priori Data," Mathematics, MDPI, vol. 9(4), pages 1-14, February.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:4:p:395-:d:500905
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/4/395/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/4/395/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chen, Ruey-Shun & Lu, Kun-Yung & Tai, Pei-Hao, 2004. "Optimizing assembly planning through a three-stage integrated approach," International Journal of Production Economics, Elsevier, vol. 88(3), pages 243-256, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carlos Sáenz-Royo & Francisco Chiclana & Enrique Herrera-Viedma, 2022. "Functional Representation of the Intentional Bounded Rationality of Decision-Makers: A Laboratory to Study the Decisions a Priori," Mathematics, MDPI, vol. 10(5), pages 1-17, February.

    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. Lai, Tsung-Chyan & Sotskov, Yuri N. & Dolgui, Alexandre & Zatsiupa, Aksana, 2016. "Stability radii of optimal assembly line balances with a fixed workstation set," International Journal of Production Economics, Elsevier, vol. 182(C), pages 356-371.
    2. Lai, Tsung-Chyan & Sotskov, Yuri N. & Dolgui, Alexandre, 2019. "The stability radius of an optimal line balance with maximum efficiency for a simple assembly line," European Journal of Operational Research, Elsevier, vol. 274(2), pages 466-481.

    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:gam:jmathe:v:9:y:2021:i:4:p:395-:d:500905. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.