A hierarchical pedestrians motion planning model for heterogeneous crowds simulation

  • Guo D
  • Wang C
  • Wang X
  • 9


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


The paper has proposed a hierarchical method for heterogeneous pedestrian motion planning in complex dynamic environments. It extends the minimum link paths (MLPs) in a constraint-based algorithm to perform pedestrians' global path computations for avoiding diverse obstacles in complex dynamic scenes. Simultaneously, it uses a modified social force model to capture pedestrians' local dynamics with distinct individual characteristics and intermediate goals. The model has augmented the pedestrian's cognitive capability on environment. At global level, it minimizes the shortest global path graph for avoiding obstacles. At local level, it intelligently selects the immediate target in global path graph which instructs the pedestrian local motion, instead of using a pre-defined or a single goal attraction path potential. We simulate the model in a complex indoor scenario consisting of multiple pedestrians and diverse obstacles to generate realistic animation.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Dan Guo

  • Cheng Wang

  • Xulei Wang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free