Abstract
The objective of this paper is to recommend the algorithms for planning the best paths for the simultaneously moving agents operated in the large crowded environment. The proposed approach consists of two parts. Firstly, a navigation mesh for passable regions in rectangular 2D environment is created using Quad-trees algorithm. A graph is created by connecting centers of regions, where weights in the graph are Euclidean distances between centers. In the second part, a path is found for each agent currently present in environment using Dijkstra or A* algorithm. To plan good path in each passable region actual density value is stored. Density information is further mapped on graph edges along with distance value. Agents reevaluate their paths accordingly to re-planning strategy. Three strategies are considered: periodical re-planning, periodical with initial re-planning and event-driven re-planning proposed by the authors. The six combinations of algorithms have been implemented and tested. Simulation experiments made using the created experimentation system showed that the approach with the own event-driven re-planning seems to be promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Van Toll, W.G., Cook, A.F., Geraerts, R.: Real-time density-based crowd simulation. Computer Animation and Virtual Worlds Archive 23(1), 59–69 (2012)
Daamen, W.: Modelling passenger flows in public transport facilities. PhD thesis T2004/6, Delft University of Technology (2004)
Hale, D.H.: A growth-based approach to the automatic generation of navigation meshes. Technical report, The University of North Carolina at Charlotte (2011)
Kavraki, L.E., et al.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn., pp. 97–104. Prentice Hall (2003). ISBN 978-0137903955
Botea, A., Muller, M., Schaeffer, J.: Near optimal hierarchical path-finding. Report, Department of Computer Science, University Alberta (2004)
Geraerts, R.: Planning short paths with clearance using explicit corridors. In: Proc. to IEEE ICRA International Conference on Robotics and Automation (2010)
Geraerts, R.: Sampling-based motion planning: analysis and path quality. PhD thesis, The Utrecht University, The Netherlands (2006)
Kaminski, R.T., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: Evaluation and comparison of task allocation algorithms for mesh networks. In: Proc. 9th International Conference on Networks, pp. 104–108. IEEE Computer Society Press (2010)
Kmiecik, W., Wojcikowski, M., Koszalka, L., Kasprzak, A.: Task allocation in mesh connected processors with local search meta-heuristic algorithms. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds.) Intelligent Information and Database Systems. LNCS, vol. 5991, pp. 215–224. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hudziak, M., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A. (2015). Comparison of Algorithms for Multi-agent Pathfinding in Crowded Environment. In: Nguyen, N., Trawiński, B., Kosala, R. (eds) Intelligent Information and Database Systems. ACIIDS 2015. Lecture Notes in Computer Science(), vol 9011. Springer, Cham. https://doi.org/10.1007/978-3-319-15702-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-15702-3_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15701-6
Online ISBN: 978-3-319-15702-3
eBook Packages: Computer ScienceComputer Science (R0)