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.
A Modified Heuristic Search Algorithm for Pedestrian Simulation
Seventh International Conference of Chinese Transportation Professionals Congress (ICCTP) ; 2007 ; Shanghai, China
2008-03-21
Conference paper
Electronic Resource
English
Heuristic estimation of pedestrian traffic volumes
Elsevier | 1987
|A heuristic model for pedestrian intention estimation
IEEE | 2019
|An effective algorithm to simulate pedestrian flow using the heuristic force-based model
Taylor & Francis Verlag | 2015
|Improved Heuristic Search Algorithm for Multi-Cargo Loading Problem
British Library Conference Proceedings | 2013
|