Switching Control of Pedestrian Flows Using Discrete Hughes Models

Control of pedestrian flows has various applications such as fire evacuation. Mobile robots play an important role in control of pedestrian flows. In this paper, a switching control method of pedestrian flows is proposed toward using of mobile robots in future. As a mathematical model for pedestrian flows, we adopt the discrete Hughes model, which is a kind of meso-scale models. In the discrete Hughes model, the space is represented as an undirected graph, and pedestrian flows are characterized by changes in density at each vertex. In the proposed method, pedestrian flows are controlled by dynamically switching the graph structure. For each graph structure, a safety penalty is assigned. The optimal switching times that minimize the penalty are determined under a constraint on the exit rate defined in this paper. Through a numerical example, we demonstrate the effectiveness of the proposed method in evacuation guidance.

Institutions

Publication Details

Journal
Journal of Robotics and Mechatronics
Published
2025-12-19
DOI
https://doi.org/10.20965/jrm.2025.p1470
Primary Topic
Evacuation and Crowd Dynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Switching Control of Pedestrian Flows Using Discrete Hughes Models

Journal of Robotics and Mechatronics
Evacuation and Crowd Dynamics
article

Switching Control of Pedestrian Flows Using Discrete Hughes Models

article en

Abstract

Control of pedestrian flows has various applications such as fire evacuation. Mobile robots play an important role in control of pedestrian flows. In this paper, a switching control method of pedestrian flows is proposed toward using of mobile robots in future. As a mathematical model for pedestrian flows, we adopt the discrete Hughes model, which is a kind of meso-scale models. In the discrete Hughes model, the space is represented as an undirected graph, and pedestrian flows are characterized by changes in density at each vertex. In the proposed method, pedestrian flows are controlled by dynamically switching the graph structure. For each graph structure, a safety penalty is assigned. The optimal switching times that minimize the penalty are determined under a constraint on the exit rate defined in this paper. Through a numerical example, we demonstrate the effectiveness of the proposed method in evacuation guidance.

Journal of Robotics and MechatronicsVol. 37(6)
Hokkaido University (JP)
Sustainable cities and communities
Openalex Percentile: Top 37%
Evacuation and Crowd Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.