PedNStream: Scalable Network Flow Simulation for Pedestrian Traffic Management

• URL: http://arxiv.org/abs/2607.01021v2
• Date: Sun, 05 Jul 2026 15:16:30 GMT
• Title: PedNStream: Scalable Network Flow Simulation for Pedestrian Traffic Management
• Abstract summary: PedNStream is an open-source simulator for macroscopic pedestrian network loading based on the Link Transmission Model (LTM)<n>It is implemented as a modular framework with built-in controller interfaces for interventions such as gating, flow separation, and route guidance.<n>Real-network experiments assess large-scale behavior and consistency with observed pedestrian counts.
• Score: 1.7205106391379026
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Large-scale crowd management requires pedestrian simulations that are both computationally efficient and compatible with feedback-based control. However, most open-source tools are either microscopic or not designed for network-scale closed-loop evaluation. This paper presents PedNStream (Pedestrian Network Flow Simulation), an open-source, Python-native simulator for macroscopic pedestrian network loading based on the Link Transmission Model (LTM). The framework extends LTM-based pedestrian models by incorporating stochastic link dynamics that capture diffusion and activity-induced variability, and replaces dynamic user equilibrium route choice with a utility-based formulation suited to uncertain, intervention-driven settings. PedNStream is implemented as a modular framework with built-in controller interfaces for interventions such as gating, flow separation, and route guidance. We evaluate the framework in a staged manner. Synthetic scenarios verify key mechanisms, including queue formation, spillback, congestion dissipation, and adaptive rerouting. Real-network experiments assess large-scale behavior and consistency with observed pedestrian counts. A closed-loop case study demonstrates controller integration, and a runtime analysis quantifies scalability. These results establish PedNStream as an efficient and practical testbed for large-scale pedestrian network simulation and control.

Related papers

• ASPaeroFlow: Decomposition Heuristics for Joint Air Traffic Flow & Capacity Management [60.85136195443409]
  We propose ASPaeroFlow: a for the joint Air Traffic Flow and Capacity Management (ATFCM)<n>It combines instance-space decompositions with a local exact approach using Answer Set Programming.<n>We benchmark ASPaeroFlow from small to industry-sized instances and compare it with exact and alternative approaches.
  arXiv  Detail & Related papers  (2026-08-10T08:57:18Z)
• Heuristic Learning for Active Flow Control Using Coding Agents [2.867517731896504]
  We use modern coding agents to search directly for explicit executable feedback laws.<n>We introduce a constrained-learning protocol in which an agent iteratively proposes, evaluates, and revises controller implementations while interacting exclusively through the public benchmark interface.<n>The discovered controllers match or outperform the best DRL policy in 10 of the 13 environments while remaining compact, interpretable, and directly inspectable.
  arXiv  Detail & Related papers  (2026-07-13T13:47:17Z)
• ECoSim: Data Efficient Fine-Tuning for Controllable Traffic Simulation [48.30643653308979]
  Controllable traffic simulation is critical for testing autonomous driving systems.<n>Existing approaches often require retraining large generative models with extensive annotated data.<n>We introduce a lightweight control adaptation framework that enables multi-modal controllability.
  arXiv  Detail & Related papers  (2026-07-01T07:35:29Z)
• Plug-and-Play Benchmarking of Reinforcement Learning Algorithms for Large-Scale Flow Control [61.155940786140455]
  Reinforcement learning (RL) has shown promising results in active flow control (AFC)<n>Current AFC benchmarks rely on external computational fluid dynamics (CFD) solvers, are not fully differentiable, and provide limited 3D and multi-agent support.<n>We introduce FluidGym, the first standalone, fully differentiable benchmark suite for RL in AFC.
  arXiv  Detail & Related papers  (2026-01-21T14:13:44Z)
• SMART: A Surrogate Model for Predicting Application Runtime in Dragonfly Systems [13.688119091055244]
  We present ourmodel, a surrogate model that combines graph neural networks (GNNs) and large language models (LLMs) to capture both spatial and temporal patterns from port level router data.<n>ourmodel outperforms existing statistical and machine learning baselines, enabling accurate runtime prediction and supporting efficient hybrid simulation of Dragonfly networks.
  arXiv  Detail & Related papers  (2025-11-14T09:39:43Z)
• Drift No More? Context Equilibria in Multi-Turn LLM Interactions [58.69551510148673]
  contexts drift is the gradual divergence of a model's outputs from goal-consistent behavior across turns.<n>Unlike single-turn errors, drift unfolds temporally and is poorly captured by static evaluation metrics.<n>We show that multi-turn drift can be understood as a controllable equilibrium phenomenon rather than as inevitable decay.
  arXiv  Detail & Related papers  (2025-10-09T04:48:49Z)
• m4: A Learned Flow-level Network Simulator [14.802940782072122]
  Flow-level simulators abstract traffic as continuous flows with dynamically assigned transmission rates.<n>We present m4, an accurate and scalable flow-level simulator that uses machine learning to learn the dynamics of the network of interest.
  arXiv  Detail & Related papers  (2025-03-03T17:51:08Z)
• Model-based deep reinforcement learning for accelerated learning from flow simulations [0.0]
  We demonstrate the benefits of model-based reinforcement learning for flow control applications. Specifically, we optimize the policy by alternating between trajectories sampled from flow simulations and trajectories sampled from an ensemble of environment models. The model-based learning reduces the overall training time by up to $85%$ for the fluidic pinball test case.
  arXiv  Detail & Related papers  (2024-02-26T13:01:45Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Improving and generalizing flow-based generative models with minibatch optimal transport [90.01613198337833]
  We introduce the generalized conditional flow matching (CFM) technique for continuous normalizing flows (CNFs) CFM features a stable regression objective like that used to train the flow in diffusion models but enjoys the efficient inference of deterministic flow models. A variant of our objective is optimal transport CFM (OT-CFM), which creates simpler flows that are more stable to train and lead to faster inference.
  arXiv  Detail & Related papers  (2023-02-01T14:47:17Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.