Using Queueing Networks to Approximate Pedestrian Simulations

被引:0
|
作者
Sagredo-Olivenza, Ismael [1 ]
Cardenas-Bonett, Marlon [1 ]
Gomez-Sanz, Jorge J. [1 ]
机构
[1] Univ Complutense Madrid, Dept Software Engn & Artificial Intelligence, Res Grp Agent Based Social & Interdisciplinary Ap, Madrid, Spain
关键词
Crowd simulation; Queueing theory; Simulation as a service;
D O I
10.1007/978-3-319-99608-0_15
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Pedestrian or crowds simulation is a complex and expensive task that involves a plethora of technologies. In certain exigent environments, for example, whether we want to use a complex simulation in a machine learning system, in real-time decision making or when the user does not need the details of the simulation, this computational cost may not be desirable. Having simpler models is useful if you want to use these simulations in those exigent environments or we just want to obtain approximate calculations of these simulations quickly. In this paper, we propose a simplified model of simulation based on a network of configurable queues that helps us to approximate the results of a complex simulation in a very short time, while maintaining a high representativeness of the real simulation.
引用
收藏
页码:132 / 139
页数:8
相关论文
共 50 条
  • [1] Improving accuracy of time-parallel approximate simulations of queueing networks
    Solcany, V
    Safarik, J
    [J]. ESS'98 - SIMULATION TECHNOLOGY: SCIENCE AND ART, 1998, : 57 - 59
  • [2] Approximate analysis of coupled queueing in ATM networks
    Gelenbe, E
    Ghanwani, A
    [J]. IEEE COMMUNICATIONS LETTERS, 1999, 3 (02) : 31 - 33
  • [3] Approximate solution of a class of queueing networks with breakdowns
    Thomas, N
    Thornley, D
    Zatschler, H
    [J]. ESM 2003: 17TH EUROPEAN SIMULATION MULTICONFERENCE: FOUNDATIONS FOR SUCCESSFUL MODELLING & SIMULATION, 2003, : 251 - 256
  • [4] Approximate analysis of finite fork/join queueing networks
    Kim, JH
    Tcha, DW
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (04) : 799 - 810
  • [5] Approximate Analysis of Blocking Queueing Networks with Temporal Dependence
    Persone, Vittoria de Nitto
    Casale, Giuliano
    Smirni, Evgenia
    [J]. 2011 IEEE/IFIP 41ST INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2011, : 574 - 585
  • [6] Approximate Solution of Multiclass Queueing Networks with Region Constraints
    Anselmi, Jonatha
    Casale, Giuliano
    Cremonesi, Paolo
    [J]. PROCEEDINGS OF MASCOTS '07: 15TH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, 2007, : 225 - 230
  • [7] ON THE TRANSIENT RESPONSE OF OPEN QUEUEING NETWORKS USING AD HOC DISTRIBUTED SIMULATIONS
    Huang, Ya-Lin
    Fujimoto, Richard
    Alexopoulos, Christos
    Hunter, Michael
    [J]. 2013 WINTER SIMULATION CONFERENCE (WSC), 2013, : 2947 - 2958
  • [8] AN ANALYSIS OF PEDESTRIAN QUEUEING
    WEISS, GH
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1963, 67 (04): : 229 - 243
  • [9] Closed queueing networks with finite capacity queues: Approximate analysis
    Balsamo, S
    [J]. SIMULATION AND MODELLING: ENABLERS FOR A BETTER QUALITY OF LIFE, 2000, : 593 - 600
  • [10] USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS
    Walraevens, Joris
    Fiems, Dieter
    Moeneclaey, Marc
    [J]. PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2009, 23 (02) : 333 - 355