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

AGV navigation in complex environments: A cooperative trajectory optimization strategy based on SMF-MPC

Author

Listed:
  • Zonghe Ding
  • Ling Chen
  • Jintao Wang
  • Qi Qu
  • Liming Chang
  • Yajing Cheng

Abstract

This paper addresses the navigation problem of automated guided vehicles (AGVs) in complex environments by proposing a collaborative trajectory optimization strategy based on the Set Membership Filter (SMF) and Model Predictive Control (MPC). In contrast, the traditional probability distribution-based navigation method, UKF-MPC, often fails to provide a strict safety margin when dealing with UBB noise, thereby increasing the risk of navigation failure. Therefore, this paper proposes a set-membership filter algorithm that constructs a minimum enclosing ellipsoid to enclose the system’s true state in real time and incorporates the geometric characteristics of this ellipsoid as a time-varying penalty term into the MPC optimization objective, thereby achieving dynamic risk avoidance. Finally, comparative experiments under three different types of environmental noise were conducted using MATLAB. The MATLAB simulation results indicate that, under complex environmental disturbances, the SMF-MPC control strategy exhibits a higher navigation success rate and greater robustness than both the traditional UKF-MPC control strategy and the Robust MPC control strategy.

Suggested Citation

  • Zonghe Ding & Ling Chen & Jintao Wang & Qi Qu & Liming Chang & Yajing Cheng, 2026. "AGV navigation in complex environments: A cooperative trajectory optimization strategy based on SMF-MPC," PLOS ONE, Public Library of Science, vol. 21(8), pages 1-29, August.
  • Handle: RePEc:plo:pone00:0355960
    DOI: 10.1371/journal.pone.0355960
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0355960?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:0355960. 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.