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

Optimal Acceleration-Velocity-Bounded Trajectory Planning in Dynamic Crowd Simulation

Author

Listed:
  • Fu Yue-wen
  • Li Meng
  • Liang Jia-hong
  • Hu Xiao-qian

Abstract

Creating complex and realistic crowd behaviors, such as pedestrian navigation behavior with dynamic obstacles, is a difficult and time consuming task. In this paper, we study one special type of crowd which is composed of urgent individuals, normal individuals, and normal groups. We use three steps to construct the crowd simulation in dynamic environment. The first one is that the urgent individuals move forward along a given path around dynamic obstacles and other crowd members. An optimal acceleration-velocity-bounded trajectory planning method is utilized to model their behaviors, which ensures that the durations of the generated trajectories are minimal and the urgent individuals are collision-free with dynamic obstacles (e.g., dynamic vehicles). In the second step, a pushing model is adopted to simulate the interactions between urgent members and normal ones, which ensures that the computational cost of the optimal trajectory planning is acceptable. The third step is obligated to imitate the interactions among normal members using collision avoidance behavior and flocking behavior. Various simulation results demonstrate that these three steps give realistic crowd phenomenon just like the real world.

Suggested Citation

  • Fu Yue-wen & Li Meng & Liang Jia-hong & Hu Xiao-qian, 2014. "Optimal Acceleration-Velocity-Bounded Trajectory Planning in Dynamic Crowd Simulation," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-12, August.
  • Handle: RePEc:hin:jnljam:501689
    DOI: 10.1155/2014/501689
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2014/501689.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/JAM/2014/501689.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/501689?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:jnljam:501689. 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.