Pedestrian/traffic interactions. Part I: an algorithm to assign pedestrian groups dispersing at public gatherings.

Author(s)
Ceder, A.
Year
Abstract

The minimization of weighted pedestrian and vehicle times for pedestrians dispersing at public gatherings is the problem under consideration. An algorithm to solve this problem and to assign each pedestrian group to a unique selected path is developed and described.

Request publication

11 + 0 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
B 12329 (In: B 11265) /71/72/ IRRD 229768
Source

In: Proceedings of the International Conference on Pedestrian Safety, Haifa, December 20-23, 1976, p. 5E1-5E8,2 fig., 2 graph., 4 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.