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

A Path Planning Algorithm for a Dynamic Environment Based on Proper Generalized Decomposition

Author

Listed:
  • Antonio Falcó

    (ESI International Chair@CEU-UCH, Departamento de Matemáticas, Física y Ciencias Tecnológicas, Universidad Cardenal Herrera-CEU, CEU Universities, San Bartolomé 55, 46115 Alfara del Patriarca, Spain)

  • Lucía Hilario

    (ESI International Chair@CEU-UCH, Departamento de Matemáticas, Física y Ciencias Tecnológicas, Universidad Cardenal Herrera-CEU, CEU Universities, San Bartolomé 55, 46115 Alfara del Patriarca, Spain)

  • Nicolás Montés

    (ESI International Chair@CEU-UCH, Departamento de Matemáticas, Física y Ciencias Tecnológicas, Universidad Cardenal Herrera-CEU, CEU Universities, San Bartolomé 55, 46115 Alfara del Patriarca, Spain)

  • Marta C. Mora

    (Departamento de Ingeniería Mecánica y Construcción, Universitat Jaume I, Avd. Vicent Sos Baynat s/n, 12071 Castellón, Spain)

  • Enrique Nadal

    (Departamento de Ingeniería Mecánica y de Materiales, Universitat Politècnica de València Camino de Vera, s/n, 46022 Valencia, Spain)

Abstract

A necessity in the design of a path planning algorithm is to account for the environment. If the movement of the mobile robot is through a dynamic environment, the algorithm needs to include the main constraint: real-time collision avoidance. This kind of problem has been studied by different researchers suggesting different techniques to solve the problem of how to design a trajectory of a mobile robot avoiding collisions with dynamic obstacles. One of these algorithms is the artificial potential field (APF), proposed by O. Khatib in 1986, where a set of an artificial potential field is generated to attract the mobile robot to the goal and to repel the obstacles. This is one of the best options to obtain the trajectory of a mobile robot in real-time (RT). However, the main disadvantage is the presence of deadlocks. The mobile robot can be trapped in one of the local minima. In 1988, J.F. Canny suggested an alternative solution using harmonic functions satisfying the Laplace partial differential equation. When this article appeared, it was nearly impossible to apply this algorithm to RT applications. Years later a novel technique called proper generalized decomposition (PGD) appeared to solve partial differential equations, including parameters, the main appeal being that the solution is obtained once in life, including all the possible parameters. Our previous work, published in 2018, was the first approach to study the possibility of applying the PGD to designing a path planning alternative to the algorithms that nowadays exist. The target of this work is to improve our first approach while including dynamic obstacles as extra parameters.

Suggested Citation

  • Antonio Falcó & Lucía Hilario & Nicolás Montés & Marta C. Mora & Enrique Nadal, 2020. "A Path Planning Algorithm for a Dynamic Environment Based on Proper Generalized Decomposition," Mathematics, MDPI, vol. 8(12), pages 1-11, December.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:12:p:2245-:d:464993
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/12/2245/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/12/2245/
    Download Restriction: no
    ---><---

    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:8:y:2020:i:12:p:2245-:d:464993. 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: 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.