Skip to main content

A Learning Algorithm for the Simulation of Pedestrian Flow by Cellular Automata

  • Conference paper
Cellular Automata (ACRI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6350))

Included in the following conference series:

Abstract

Cellular Automata was applied to model the pedestrian flow, where the local neighbor and transition rules implemented to each person in the crowd were determined automatically by the experience of pedestrians. The experience was based on two parameters; the number of continuous vacant cells in front of the cell to proceed, and the number of pedestrian in the cell to proceed. The experience was evaluated numerically, and a pedestrian selected the cell to proceed by the evaluated index. The flow formations by pedestrians in the opposite direction on a straight pathway and on a corner were simulated, and the number of rows was discussed in relation to the density of pedestrian on the simulation space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Wolfram, S.: Cellular Automata. Los Alamos Science, 2–21 (Fall 1983)

    Google Scholar 

  2. Gutowitz, H.: Cellular Automata - Theory and Experiment, pp. 254–270. MIT Press, Cambridge (1990)

    Google Scholar 

  3. Mehta, A.: Granular Matter - An Interdisciplinary Approach, pp. 85–120. Springer, Heidelberg (1994)

    Google Scholar 

  4. Helbing, D., Farkas, I., Vicsek, T.: Simulating Dynamical Features of Escape Panic. Nature 407, 487–490 (2000)

    Article  Google Scholar 

  5. Shiraishi, T., Morishita, S., Gavin, H.P.: Estimation of Equivalent Permeability in MR Fuid Considering Cluster Formation of Particles. Transactions of ASME, Journal of Applied Mechanics 71(2), 201–207 (2004)

    Article  MATH  Google Scholar 

  6. Morishita, S., Nakatsuka, N.: Simulation of Emergency Evacuation by Cellular Automata. In: Proceedings of 6th International Conference on Complex Systems, pp. 92–97 (2002)

    Google Scholar 

  7. Narimatsu, K., Shiraishi, T., Morishita, S.: Acquisition of Local Neighbor Rules in the Simulation of Pedestrian Flow by Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 211–219. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishii, H., Morishita, S. (2010). A Learning Algorithm for the Simulation of Pedestrian Flow by Cellular Automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15979-4_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15978-7

  • Online ISBN: 978-3-642-15979-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics