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

Hexagon-Based Generalized Voronoi Diagrams Generation for Path Planning of Intelligent Agents

Author

Listed:
  • Fen Tang
  • Xiong You
  • Xin Zhang
  • Kunwei Li

Abstract

Grid-based Generalized Voronoi Diagrams (GVDs) are widely used to represent the surrounding environment of intelligent agents in the fields of robotics, computer games, and military simulations, which improve the efficiency of path planning of intelligent agents. Current studies mainly focus on square-grid-based GVD construction approaches, and little attention has been paid to constructing GVDs from hexagonal grids. In this paper, an algorithm named hexagon-based crystal growth (HCG) is presented to extract GVDs from hexagonal grids. In addition, two thinning patterns for obtaining one-cell-wide GVDs from rough hexagon-based GVDs are proposed. On the basis of the principles of a leading square-grid-based algorithm named Brushfire, a hexagon-based Brushfire algorithm is realized. A comparison of the HCG and the hexagon-based Brushfire algorithm shows that HCG is much more efficient. Further, the usefulness of hexagon-based GVDs for the path planning tasks of intelligent agents is demonstrated using several representative simulation experiments.

Suggested Citation

  • Fen Tang & Xiong You & Xin Zhang & Kunwei Li, 2020. "Hexagon-Based Generalized Voronoi Diagrams Generation for Path Planning of Intelligent Agents," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-13, April.
  • Handle: RePEc:hin:jnlmpe:5750739
    DOI: 10.1155/2020/5750739
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5750739.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5750739.xml
    Download Restriction: no

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