IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0347043.html

Path planning for volumetric flask grasping based on visual guidance and multi-constraint optimization

Author

Listed:
  • Zhaopeng Yuan
  • Meng Li
  • Chengyun Wang

Abstract

In the automated operation of the chemical laboratory, using a robotic arm to pick up volumetric flasks is a core step of the operation process. By implementing reasonable path planning, the grasping operation of the robotic arm can be made efficient and precise. In this scenario, the traditional Rapidly-exploring Random Tree Star (RRT*) algorithm suffers from low sampling efficiency and numerous sharp path turns. To address these problems, this paper proposes the Vision-guided Multi-constraint RRT* (VM-RRT*) algorithm, which integrates visual guidance sampling and multi-constraint paths. Firstly, the algorithm determines the spatial coordinates of the volumetric flask through target detection, reducing ineffective exploration and accelerating path convergence. Subsequently, it uses cubic B-splines to fit the path and improves the density of data points through spline interpolation methods. Combined with low-pass filtering, it further reduces noise and eliminates sudden changes in the end-effector speed and acceleration of the robotic arm, realizing multi-constraint trajectory optimization. Experimental simulation results show that the average planning time of the VM-RRT* algorithm is 3.27 seconds, which is approximately 20% shorter than that of the traditional RRT* algorithm (4.07 seconds), effectively improving the experimental efficiency. At the same time, the end motion parameters of the robotic arm are effectively controlled, providing support for laboratory automation.

Suggested Citation

  • Zhaopeng Yuan & Meng Li & Chengyun Wang, 2026. "Path planning for volumetric flask grasping based on visual guidance and multi-constraint optimization," PLOS ONE, Public Library of Science, vol. 21(4), pages 1-30, April.
  • Handle: RePEc:plo:pone00:0347043
    DOI: 10.1371/journal.pone.0347043
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0347043
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0347043&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0347043?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:plo:pone00:0347043. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.