{{javascript}}TimeCostPedestrianDensityIteration
TimeCostPedestrianDensityIteration return cost for the pedestrian density by using the gaussian formula from Seitz paper. We currently use the getSpatialMapPeds for getting the neighbours (3 * size x size * 3), with size = 3. The function is for the purpose of navigation around groups. This implementation is not efficient, but was used to compare the values and the performance of the different implementations. Use the TimeCostPedestrianDensity instead.
the floor for the time cost function in general the whole scenario. the for the pedestrian density function. the varianz of the pedestrian density function. the next decorator (time cost function) of the decorator pattern. the loading of the pedestrian density (= c_p). a flag which decide that we use a dynamic (true) or a constant (false) pedestrian loading. only for logging information.