A* algorithm is a typical heuristic search algorithm, which is widely used in Game Programming, Artificial Intelligence and robotics. However, AI programmers have found again and again that the standard A* algorithm can be woefully inadequate for achieving realistic movements. A modified A* algorithm is proposed in this paper to solve the pathfinding problem for an Agent-based pedestrian simulation system. First, several heuristic functions are introduced and compared. Second, a "Trimming Algorithm" has been developed to achieve smooth straight-line movements. Third, the problem of the output path "clinging to obstacle" of the standard A* algorithm has been solved by imposing a penalty on the nodes near obstacles in map preprocessing. With these modifications, we can get a more realistic path like a human trail, the feasibility and efficiency having been proved in the simulation tests.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Modified Heuristic Search Algorithm for Pedestrian Simulation


    Beteiligte:
    Gao, Peng (Autor:in) / Xu, Ruihua (Autor:in) / Zou, Xiaolei (Autor:in)

    Kongress:

    Seventh International Conference of Chinese Transportation Professionals Congress (ICCTP) ; 2007 ; Shanghai, China



    Erscheinungsdatum :

    21.03.2008




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    A heuristic model for pedestrian intention estimation

    Camara, Fanta / Merat, Natasha / Fox, Charles W. | IEEE | 2019


    An effective algorithm to simulate pedestrian flow using the heuristic force-based model

    Qu, Yunchao / Gao, Ziyou / Orenstein, Penina et al. | Taylor & Francis Verlag | 2015


    A heuristic search algorithm for on-line system identification

    Musto, J.C. / Lauderbaugh, L.K. | IEEE | 1991


    Improved Heuristic Search Algorithm for Multi-Cargo Loading Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013