IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8973153.html
   My bibliography  Save this article

Picking Path Optimization of Agaricus bisporus Picking Robot

Author

Listed:
  • Xiaomei Hu
  • Zhaoren Pan
  • Shunke Lv

Abstract

The design and application of the mushroom picking robot will greatly reduce the labor cost, and it has become one of the research hotspots in the world. Therefore, we independently developed an A. bisporus (a kind of mushroom) picking robot and introduced its functional principle in this paper. At the same time, in order to improve the picking efficiency of the picking robot, a picking path optimization algorithm based on TSP model is proposed. Firstly, based on the TSP model, a picking route model for A. bisporus was established to determine the storage location of each A. bisporus . Then, an improved simulated annealing (I-SA) search algorithm is proposed to find the optimal path sequence. By improving the path initialization module, path generation module, and temperature drop module, the I-SA search algorithm can optimize the picking path in a short time. Finally, in order to improve the stability and reduce the running time of the I-SA search algorithm, a parallel optimization method for global search (“rough exploration”) and local search (“precision exploration”) is proposed. Through simulation experiments, the I-SA search algorithm can search stable and excellent path solution in a relatively short time. Through field experiments on mushroom base, the efficiency of picking A. bisporus can be improved by 14% to 18%, which verifies the effectiveness of the I-SA search algorithm.

Suggested Citation

  • Xiaomei Hu & Zhaoren Pan & Shunke Lv, 2019. "Picking Path Optimization of Agaricus bisporus Picking Robot," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-16, September.
  • Handle: RePEc:hin:jnlmpe:8973153
    DOI: 10.1155/2019/8973153
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/8973153.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/8973153.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/8973153?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:8973153. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.