CN111125886A - Crowd evacuation simulation system and simulation method based on three different behaviors - Google Patents

Crowd evacuation simulation system and simulation method based on three different behaviors Download PDF

Info

Publication number
CN111125886A
CN111125886A CN201911225104.1A CN201911225104A CN111125886A CN 111125886 A CN111125886 A CN 111125886A CN 201911225104 A CN201911225104 A CN 201911225104A CN 111125886 A CN111125886 A CN 111125886A
Authority
CN
China
Prior art keywords
congestion
crowd
evacuation
nodes
pedestrian
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201911225104.1A
Other languages
Chinese (zh)
Inventor
周晓晶
蔡艳潇
陈国华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201911225104.1A priority Critical patent/CN111125886A/en
Publication of CN111125886A publication Critical patent/CN111125886A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/24Classification techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services
    • G06Q50/265Personal security, identity or safety
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/05Geographic models

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Geometry (AREA)
  • Tourism & Hospitality (AREA)
  • Evolutionary Biology (AREA)
  • General Health & Medical Sciences (AREA)
  • Evolutionary Computation (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Computer Security & Cryptography (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Artificial Intelligence (AREA)
  • Remote Sensing (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Computer Graphics (AREA)
  • Alarm Systems (AREA)

Abstract

The invention discloses a crowd evacuation simulation system and a simulation method based on three different behaviors, wherein the system comprises: the system comprises a scene modeling module, a pedestrian information loading module, a crowd behavior modeling module and a result output and analysis module; the method comprises the following steps: (1) establishing an abstract environment and carrying out layout of related facilities; (2) generating safe evacuation crowd, initializing pedestrians, determining pedestrian targets and position information, and setting behavior correlation attributes of the pedestrians; (3) establishing a crowd evacuation behavior model, and driving the pedestrian to move through the behavior decision of the pedestrian; (4) and (3) realizing the simulation result and carrying out correlation analysis on the result. The invention can provide required data support for evacuation research, reveal the evacuation rule of people and find the evacuation bottleneck, thereby having important theoretical significance and practical significance for improving the safety design level of buildings and the evacuation capacity.

Description

Crowd evacuation simulation system and simulation method based on three different behaviors
Technical Field
The invention relates to the technical field of crowd evacuation simulation, in particular to a crowd evacuation simulation system and a crowd evacuation simulation method based on three different behaviors.
Background
In recent years, with the rapid development of society, when there are many pedestrians in the environment, severe clogging often occurs. And some pedestrians do not like congestion, and can select a detour to avoid congestion when congestion ahead is found. The pedestrian's route of choice may change because of congestion ahead. Therefore, more and more people simulation researches take the road congestion condition as an important factor to influence the path selection of the pedestrians.
Currently, most congestion prediction research mainly focuses on predicting local motion of other pedestrians, and such prediction can effectively achieve collision avoidance. Steffen has proposed a concept of forecasting, i.e., inferring future population movements based on the current situation. The researches mainly consider the influence of the current and local environment congestion on the pedestrians, the researches on the remote congestion prediction model and the influence on the path selection are few, and the pedestrian classification is only one type, so that the behavior characteristics of different people are not reflected.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a crowd evacuation simulation system and a simulation method based on three different behaviors, which can provide required data support for evacuation research, reveal the evacuation rule of people and find evacuation bottlenecks, thereby having important theoretical significance and practical significance for improving the safety design level of buildings and the evacuation capacity.
In order to solve the above technical problems, the present invention provides a crowd evacuation simulation system based on three different behaviors, comprising: the system comprises a scene modeling module, a pedestrian information loading module, a crowd behavior modeling module and a result output and analysis module;
the scene modeling module specifies the size of an evacuation scene, the position of an obstacle and the position of an exit;
the pedestrian information loading module finds that the behavior of the crowd to be evacuated has three characteristics according to the situation of the crowd collected by the camera in real life during evacuation: the method comprises the following steps of selecting a nearest exit for evacuation without worrying about congestion, selecting to avoid congestion and bypass barriers all the time for evacuation, comprehensively considering congestion and the nearest exit for evacuation, and dividing pedestrian behaviors into three types: waiting for crowds with congestion, bypassing the crowds with congestion and comprehensively judging the crowds, and defining the number of the crowds and the positions of people;
the crowd behavior modeling module comprehensively judges reasonable analysis of crowds during path selection, compares time consumed by bypassing congestion positions and waiting for the two behaviors, and finally selects a path with the least consumed time;
and the result output and analysis module simulates the personnel flow in the scene and analyzes the simulation result.
Preferably, the crowd waiting for congestion does not mind congestion, the crowd waiting for congestion can select to wait when the congestion occurs, the crowd waiting for congestion arrives at the destination by following the shortest path all the time, the crowd waiting for congestion does not mind congestion, the crowd waiting for congestion can bypass the congestion as long as the congestion occurs on the road, the positions of the congestion which do not come are predicted and identified and used as obstacles, and then the positions of the congestion are avoided.
Correspondingly, the crowd evacuation simulation method based on three different behaviors comprises the following steps:
(1) establishing an abstract environment and carrying out layout of related facilities;
(2) generating safe evacuation crowd, initializing pedestrians, determining pedestrian targets and position information, and setting behavior correlation attributes of the pedestrians;
(3) establishing a crowd evacuation behavior model, and driving the pedestrian to move through the behavior decision of the pedestrian;
(4) and (3) realizing the simulation result and carrying out correlation analysis on the result.
Preferably, in the step (3), a crowd evacuation behavior model is established, in the motion of the pedestrian driven by the behavior decision of the pedestrian, the congested crowd is received without thinking of congestion, the pedestrian can select to wait when encountering congestion and reach the destination by always following the shortest path, a single-terminal dynamic shortest path algorithm-DOT algorithm is selected, and the DOT algorithm is executed once for the pedestrian with the same destination, and the method comprises the following steps:
(1) initializing a network, and presetting N1 as a set of nodes occupied by pedestrians;
(2) executing DOT algorithm to calculate the shortest path from all nodes to the destination K1;
(3) for all pedestrians p1 closest to the destination currently, finding the shortest path j1 of the destination K1 through unoccupied nodes;
(4) add all nodes on path j1 to set N1;
(5) disabling routes containing any node on path j 1;
(6) the shortest path from the affected node to destination K1 is updated.
Preferably, in the step (3), a crowd evacuation behavior model is established, the pedestrian moves by means of behavior decision of the pedestrian, congestion crowd is intentionally jammed and bypassed as long as the road is jammed, an upcoming congestion position is predicted and identified and is used as an obstacle, and the congestion position is avoided, so that a congestion identification algorithm is added to the pedestrian when the pedestrian arrives at the destination along the shortest path, the crowd evacuation time consumption is the shortest path time consumption after the congestion point is regarded as the obstacle, and the method specifically comprises the following steps of:
(1) initializing a network, presetting N2 as a set of nodes occupied by pedestrians, presetting M2 as a set of congestion nodes, and presetting R2 as a total set of nodes in the set N2 and nodes around the nodes by 3 x 3;
(2) for each node in R2, calculating the total number P2 of nodes occupied by obstacles and the total Q2 of nodes occupied by pedestrians;
(3) judgment of
Figure BDA0002301974110000031
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 2, if the obtained value is less than epsilon 2, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 2, the node is added into the set M2;
(4) the shortest path from the affected node to destination K2 is updated.
Preferably, in the step (3), a crowd evacuation behavior model is established, the pedestrian moves by means of a behavior decision of the pedestrian, the congested crowd is intentionally congested, the congested crowd is bypassed as long as the road is congested, the position of the future congestion is predicted and identified and is used as an obstacle, and then the position of the congestion is avoided, so that a congestion identification algorithm is added when the pedestrian arrives at the destination along the shortest path, the time consumed for evacuating the crowd is the time consumed by the shortest path after the congestion point is regarded as the obstacle, and the method specifically comprises the following steps of:
(1) initializing a network, presetting N3 as a set of nodes occupied by pedestrians, presetting M3 as a set of congestion nodes, and presetting R3 as a total set of nodes in the row where the nodes in the set N3 are located and the nodes in the previous row;
(2) for each node in R3, calculating the total number P3 of nodes occupied by obstacles and the total Q3 of nodes occupied by pedestrians;
(3) judgment of
Figure BDA0002301974110000032
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 3, if the obtained value is less than epsilon 3, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 3, the node is added into the set M3;
(4) the shortest path from the affected node to destination K3 is updated.
Preferably, comprehensively judging reasonable analysis of the crowd during path selection, comparing time consumed by the two behaviors of bypassing the congestion position and waiting for the congestion position, and finally selecting the path with the least consumed time, wherein the method comprises the following steps:
(1) calculating the time t1 for receiving the evacuation of the congested crowd for the current grid;
(2) calculating the evacuation time t2 for the current grid to bypass the congested crowd;
(3) comparing time t1 and t2, a path that takes less time is selected.
(4) The shortest path from the affected node to destination K4 is updated.
The invention has the beneficial effects that: (1) the method comprises the steps of firstly, considering the influence of different behaviors on crowds in the process of crowd evacuation, and classifying the behaviors of people in the evacuation process; for each individual, the individual constantly senses the surrounding conditions and makes a behavior decision through own judgment, so that each individual has own behavior, all people forming the crowd constantly conduct the individual behaviors, and the individual behaviors interact with each other and influence the scene where the individual behaviors are located. The invention is based on a grid scene model, fully considers the human behaviors, and divides the human behaviors into three types: waiting for congestion, bypassing congestion and comprehensively judging, which is consistent with the actual situation, so that the evacuation situation has more variability; (2) the video camera is used for collecting video data during crowd evacuation in real life, and people evacuation behaviors are classified by selecting 5 frames of image data before and after a congestion point in a video, so that the method is more reasonable and practical; (3) in the aspect of congestion identification, the congestion identification based on an image, the congestion identification based on a hidden Markov model, the congestion identification based on a convolutional neural network and the like are mainly adopted in the prior art, and the method is based on a gridding scene, defines a congestion coefficient on the basis of the gridding scene, and can achieve the purpose of congestion identification only by judging the size of the congestion coefficient, so that the method is more efficient and simple and makes up the defects of complexity and low efficiency in the prior art; (4) the invention is suitable for evacuation processes in various complex scenes, utilizes an anti-collision principle and adds a competition algorithm, so that more than two persons cannot exist in the same position, and the simulation is more reasonable and real.
Drawings
Fig. 1 is a schematic flow chart of the functional structure of the present invention.
Fig. 2 is a schematic view of the camera acquisition situation of the present invention.
FIG. 3 is a schematic diagram of a path prediction process according to the present invention.
Fig. 4 is a schematic diagram illustrating an intra-floor congestion identification process according to the present invention.
Fig. 5 is a schematic diagram illustrating a flow of identifying congestion in stairs according to the present invention.
Fig. 6 is a schematic diagram of an evacuation simulation within a floor according to the present invention.
Fig. 7 is a schematic diagram of the simulation of evacuation inside stairs according to the present invention.
FIG. 8 is a schematic diagram of the overall process of model simulation according to the present invention.
Detailed Description
As shown in fig. 1, a crowd evacuation simulation system based on three different behaviors includes: the system comprises a scene modeling module, a pedestrian information loading module, a crowd behavior modeling module and a result output and analysis module.
The scene modeling module gridds the scene based on the rectangular grid, mainly specifies the size of an evacuation scene, the size of stairs, the position of specified obstacles, the position of the stairs and the position of an exit.
The pedestrian information loading module is used for collecting video data of people during crowd evacuation in real life by using a camera, people evacuation behaviors are classified by selecting 5 frames of image data before and after a congestion point in a video, and the behaviors of people to be evacuated are found to have three characteristics: and selecting a nearest exit for evacuation, not worrying about congestion, selecting to avoid congestion, bypassing obstacles all the time for evacuation, comprehensively considering congestion and the nearest exit for evacuation, so that the behaviors of pedestrians are divided into three types, waiting for congestion crowds, bypassing congestion crowds and comprehensively judging crowds, and then counting the total number of observed crowds and the proportion of each behavior crowd. The module also specifies the number of people and their locations, the camera acquisition being as shown in figure 2.
The crowd behavior modeling module comprises four parts for modeling: pedestrian division, behavior decision, path planning and position updating.
In the pedestrian division modeling, the pedestrian behaviors are divided into three types based on the gridding model, and different algorithms are provided for the behaviors of three different crowds.
In the behavior decision modeling, congestion crowds are received, congestion is not cared for, waiting is selected when congestion occurs, and the shortest path is always followed to reach a destination, so that a single-terminal dynamic shortest path algorithm-DOT algorithm is selected, the time consumed for evacuating the crowds is the congestion waiting time plus the path traveling time, and the congestion waiting time is integral multiple of t because position updating and congestion recognition are carried out once every unit time t. The DOT algorithm is an algorithm for updating the consumption of all nodes to destinations in a network in a decreasing order over time, thereby efficiently calculating the lowest consumption of all nodes to destinations, and thus selecting the lowest consumption path.
However, if the shortest path algorithm is performed once for each pedestrian, time and operation efficiency are wasted, and especially when the number of pedestrians is particularly large, the operation efficiency is particularly low. When a pedestrian selects a shortest path to reach a destination, only a very small part of nodes in the network will change, i.e. the nodes change from unoccupied to occupied, so a DOT algorithm is performed once for the pedestrian with the same destination, as shown in the path prediction flowchart of fig. 3, and the steps are as follows:
step 1: initializing a network, and presetting N1 as a set of nodes occupied by pedestrians;
step 2: executing DOT algorithm to calculate the shortest path from all nodes to the destination K1;
and step 3: for all pedestrians p1 closest to the destination currently, finding the shortest path j1 of the destination K1 through unoccupied nodes;
and 4, step 4: add all nodes on path j1 to set N1;
and 5: disabling routes containing any node on path j 1;
step 6: the shortest path from the affected node to destination K1 is updated.
Congestion crowds are intentionally congested by bypassing, congestion is bypassed as long as a road is congested, the congestion positions in the future are predicted and identified and used as obstacles, and then the congestion positions are avoided, so that a congestion identification algorithm is added when pedestrians reach a destination along the shortest path, and the time consumed for evacuating the crowds is the time consumed by the shortest path after a congestion point is considered as an obstacle. As shown in the flow chart of fig. 4, the congestion identification in the floor includes the following steps:
step 1: initializing a network, presetting N2 as a set of nodes occupied by pedestrians, presetting M2 as a set of congestion nodes, and presetting R2 as a total set of nodes in the set N2 and nodes around the nodes by 3 x 3;
step 2: for each node in R2, calculating the total number P2 of nodes occupied by obstacles and the total Q2 of nodes occupied by pedestrians;
and step 3: judgment of
Figure BDA0002301974110000051
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 2, if the obtained value is less than epsilon 2, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 2, the node is added into the set M2;
and 4, step 4: the shortest path from the affected node to destination K2 is updated.
The evacuation rules in the stairs are different from the floors as follows:
(1) evacuation in stairs does not allow retreat, but can wait;
(2) the evacuation speed in the stairs is 3/4 of the evacuation speed in the floors;
(3) evacuation scene size inside stairs: length of stairs
Figure BDA0002301974110000061
H is the height of the stairs, r is the width of the stairs, the scene area s is the length m of the stairs and the evacuation width n, and finally the evacuation scene of the stairs is formed according to the size proportion of the evacuation scene unit grids in the floors.
For the identification of congestion in stairs, as shown in the flow chart of fig. 5, the steps are as follows:
step 1: initializing a network, presetting N3 as a set of nodes occupied by pedestrians, presetting M3 as a set of congestion nodes, and presetting R3 as a total set of nodes in the row where the nodes in the set N3 are located and the nodes in the previous row;
step 2: for each node in R3, calculating the total number P3 of nodes occupied by obstacles and the total Q3 of nodes occupied by pedestrians;
and step 3: judgment of
Figure BDA0002301974110000062
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 3, if the obtained value is less than epsilon 3, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 3, the node is added into the set M3;
and 4, step 4: the shortest path from the affected node to destination K3 is updated.
Comprehensively judging reasonable analysis of crowds during path selection, comparing time consumed by bypassing congestion positions and waiting for the two behaviors, and finally selecting a path with the least consumed time, wherein the steps are as follows:
step 1: calculating the time t1 for receiving the evacuation of the congested crowd for the current grid;
step 2: calculating the evacuation time t2 for the current grid to bypass the congested crowd;
and step 3: comparing time t1 and t2, a path that takes less time is selected.
And 4, step 4: the shortest path from the affected node to destination K4 is updated.
In the path planning modeling, a situation that a plurality of persons compete for the same grid position exists, so a competition algorithm is needed, and when only one pedestrian takes the grid as a target, the pedestrian moves to the grid; when a plurality of people target the grid, if the people are crowds with different behaviors, the probability of bypassing the crowd crowds for competition win is larger than the probability of comprehensively judging the crowd competition win, the probability of comprehensively judging the crowd competition win is larger than the probability of receiving the crowd competition win, if the crowd with the same behavior, the people with small distance move to the grid, and if the distance is the same, the pedestrians are randomly selected to move to the grid.
In the updated position modeling, the position of the pedestrian after moving each time is updated, and each grid is only allowed to be occupied by one pedestrian or obstacle.
Several simulation examples are provided below:
the crowd evacuation simulation method comprises the steps that 3 psychological crowds are evacuated in rooms with 10 × 10 in each floor, for example, a simulation graph for in-floor evacuation is shown in fig. 6, for example, a simulation graph for in-stair evacuation is shown in fig. 7, under the condition, crowd evacuation simulation is conducted according to behavior characteristics of different crowds, the crowd with congestion is received, shortest paths are selected for evacuation, the crowd with congestion is bypassed, the crowd with congestion is selected for bypassing congestion all the time, evacuation time of the crowd with two methods is comprehensively judged, and finally the crowd with congestion waiting for ending is selected for evacuation.
The evacuation method of three populations is shown in the general flow chart of the model simulation of fig. 8.
And finally, feeding back the simulation result of the personnel flow in the scene to the user through a result output and analysis module.
The invention provides a crowd evacuation simulation system and a crowd evacuation simulation method based on three different behaviors, which are used for dividing the crowd behaviors into three types under the condition that a part of pedestrians can continuously predict long-distance congestion and can effectively avoid possible future congestion places during path selection: waiting for congested people, bypassing congested people and comprehensively judging people, which is consistent with actual human behavior and potentially reduces prediction errors in the method. The evacuation simulation method provided by the invention can provide required data support for evacuation research, reveal the evacuation rule of people and find the evacuation bottleneck, thereby having important theoretical significance and practical significance for improving the safety design level of buildings and the evacuation capability.

Claims (7)

1. A crowd evacuation simulation system based on three different behaviors, comprising: the system comprises a scene modeling module, a pedestrian information loading module, a crowd behavior modeling module and a result output and analysis module;
the scene modeling module specifies the size of an evacuation scene, the position of an obstacle and the position of an exit;
the pedestrian information loading module finds that the behavior of the crowd to be evacuated has three characteristics according to the situation of the crowd collected by the camera in real life during evacuation: the method comprises the following steps of selecting a nearest exit for evacuation without worrying about congestion, selecting to avoid congestion and bypass barriers all the time for evacuation, comprehensively considering congestion and the nearest exit for evacuation, and dividing pedestrian behaviors into three types: waiting for crowds with congestion, bypassing the crowds with congestion and comprehensively judging the crowds, and defining the number of the crowds and the positions of people;
the crowd behavior modeling module comprehensively judges reasonable analysis of crowds during path selection, compares time consumed by bypassing congestion positions and waiting for the two behaviors, and finally selects a path with the least consumed time;
and the result output and analysis module simulates the personnel flow in the scene and analyzes the simulation result.
2. The crowd evacuation simulation system based on three different behaviors as claimed in claim 1, wherein waiting for congested crowds does not mind congestion, waiting is selected when congestion is encountered, a destination is reached always following a shortest path, congestion crowd mind congestion is bypassed, a congestion position is bypassed as long as congestion occurs on a road, a future congestion position is predicted, identified and used as an obstacle, and then the congestion position is avoided.
3. A crowd evacuation simulation method based on three different behaviors is characterized by comprising the following steps:
(1) establishing an abstract environment and carrying out layout of related facilities;
(2) generating safe evacuation crowd, initializing pedestrians, determining pedestrian targets and position information, and setting behavior correlation attributes of the pedestrians;
(3) establishing a crowd evacuation behavior model, and driving the pedestrian to move through the behavior decision of the pedestrian;
(4) and (3) realizing the simulation result and carrying out correlation analysis on the result.
4. The crowd evacuation simulation method based on three different behaviors as claimed in claim 3, wherein in the step (3), a crowd evacuation behavior model is established, and in the motion of the pedestrians, the congested crowd is received through behavior decision-making of the pedestrians, the pedestrians are selected to wait when meeting the congestion and arrive at the destination always following the shortest path, and a single-end dynamic shortest path algorithm-DOT algorithm is selected, and the DOT algorithm is executed once for the pedestrians with the same destination, comprising the following steps:
(1) initializing a network, and presetting N1 as a set of nodes occupied by pedestrians;
(2) executing DOT algorithm to calculate the shortest path from all nodes to the destination K1;
(3) for all pedestrians p1 closest to the destination currently, finding the shortest path j1 of the destination K1 through unoccupied nodes;
(4) add all nodes on path j1 to set N1;
(5) disabling routes containing any node on path j 1;
(6) the shortest path from the affected node to destination K1 is updated.
5. The crowd evacuation simulation method based on three different behaviors as claimed in claim 3, wherein in the step (3), a crowd evacuation behavior model is established, the behavior decision of the pedestrian is used to drive the pedestrian to move, congestion crowd mind congestion is bypassed, the congested crowd is bypassed as long as the road is congested, the congestion position is predicted and identified and is used as an obstacle, and then the congestion position is avoided, so that a congestion identification algorithm is added to the destination of the pedestrian along the shortest path, the time consumed for the crowd evacuation is the time consumed by the shortest path after the congestion point is used as the obstacle, and the congestion identification in the building specifically comprises the following steps:
(1) initializing a network, presetting N2 as a set of nodes occupied by pedestrians, presetting M2 as a set of congestion nodes, and presetting R2 as a total set of nodes in the set N2 and nodes around the nodes by 3 x 3;
(2) for each node in R2, calculating the total number P2 of nodes occupied by obstacles and the total Q2 of nodes occupied by pedestrians;
(3) judgment of
Figure FDA0002301974100000021
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 2, if the obtained value is less than epsilon 2, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 2, the node is added into the set M2;
(4) the shortest path from the affected node to destination K2 is updated.
6. The crowd evacuation simulation method according to claim 3, wherein in the step (3), a crowd evacuation behavior model is established, the behavior decision of the pedestrian is used to drive the pedestrian to move, congestion crowd mind congestion is bypassed, the congested crowd is bypassed as long as the road is congested, the congestion position is predicted and identified as an obstacle, and then the congestion position is avoided, so that a congestion identification algorithm is added to the destination of the pedestrian along the shortest path, the time consumed for the crowd evacuation is the time consumed by the shortest path after the congestion point is regarded as the obstacle, and the congestion identification in the stairs specifically comprises the following steps:
(1) initializing a network, presetting N3 as a set of nodes occupied by pedestrians, presetting M3 as a set of congestion nodes, and presetting R3 as a total set of nodes in the row where the nodes in the set N3 are located and the nodes in the previous row;
(2) for each node in R3, calculating the total number P3 of nodes occupied by obstacles and the total Q3 of nodes occupied by pedestrians;
(3) judgment of
Figure FDA0002301974100000022
Whether the value of (a) is greater than or equal to the congestion coefficient epsilon 3, if the obtained value is less than epsilon 3, the node is indicated to be not congested, and if the obtained value is greater than or equal to epsilon 3, the node is added into the set M3;
(4) the shortest path from the affected node to destination K3 is updated.
7. The method according to claim 3, wherein the method for crowd evacuation simulation based on three different behaviors comprises the following steps of comprehensively judging reasonable analysis of crowd probability during path selection, comparing time consumed by the behaviors of bypassing a congestion position and waiting for the congestion position, and finally selecting a path with the least time consumption, wherein the method comprises the following steps:
(1) calculating the time t1 for receiving the evacuation of the congested crowd for the current grid;
(2) calculating the evacuation time t2 for the current grid to bypass the congested crowd;
(3) comparing time t1 and t2, a path that takes less time is selected.
(4) The shortest path from the affected node to destination K4 is updated.
CN201911225104.1A 2019-12-04 2019-12-04 Crowd evacuation simulation system and simulation method based on three different behaviors Pending CN111125886A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911225104.1A CN111125886A (en) 2019-12-04 2019-12-04 Crowd evacuation simulation system and simulation method based on three different behaviors

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911225104.1A CN111125886A (en) 2019-12-04 2019-12-04 Crowd evacuation simulation system and simulation method based on three different behaviors

Publications (1)

Publication Number Publication Date
CN111125886A true CN111125886A (en) 2020-05-08

Family

ID=70497419

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911225104.1A Pending CN111125886A (en) 2019-12-04 2019-12-04 Crowd evacuation simulation system and simulation method based on three different behaviors

Country Status (1)

Country Link
CN (1) CN111125886A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114353804A (en) * 2022-01-04 2022-04-15 哈尔滨工业大学(深圳) Fire emergency evacuation path planning method and device, intelligent terminal and storage medium
CN114418170A (en) * 2021-12-09 2022-04-29 淮阴工学院 Optimal path selection method for people evacuation in building

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014219851A (en) * 2013-05-09 2014-11-20 清水建設株式会社 Evacuation behavior prediction system and evacuation behavior prediction program
CN107220447A (en) * 2017-06-05 2017-09-29 山东师范大学 Crowd evacuation emulation method and system based on evacuation set of paths
CN107480320A (en) * 2017-06-20 2017-12-15 山东师范大学 A kind of crowd evacuation emulation method and system based on topological map and visual impact

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014219851A (en) * 2013-05-09 2014-11-20 清水建設株式会社 Evacuation behavior prediction system and evacuation behavior prediction program
CN107220447A (en) * 2017-06-05 2017-09-29 山东师范大学 Crowd evacuation emulation method and system based on evacuation set of paths
CN107480320A (en) * 2017-06-20 2017-12-15 山东师范大学 A kind of crowd evacuation emulation method and system based on topological map and visual impact

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
潘琳: "地铁车站人群应急疏散行为仿真研究", 《中国优秀硕士学位论文全文数据库 工程科技辑》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114418170A (en) * 2021-12-09 2022-04-29 淮阴工学院 Optimal path selection method for people evacuation in building
CN114353804A (en) * 2022-01-04 2022-04-15 哈尔滨工业大学(深圳) Fire emergency evacuation path planning method and device, intelligent terminal and storage medium
CN114353804B (en) * 2022-01-04 2024-04-30 哈尔滨工业大学(深圳) Fire emergency evacuation path planning method and device, intelligent terminal and storage medium

Similar Documents

Publication Publication Date Title
CN108229719B (en) Multi-objective optimization method and device for unmanned aerial vehicle formation task allocation and flight path planning
Ma et al. Trajectory planning for connected and automated vehicles at isolated signalized intersections under mixed traffic environment
CN111609864B (en) Multi-policeman cooperative trapping task allocation and path planning method under road network constraint
CN107807665B (en) Unmanned aerial vehicle formation detection task cooperative allocation method and device
Hartanti et al. Optimization of smart traffic lights to prevent traffic congestion using fuzzy logic
CN110782086A (en) Rescue vehicle distribution path optimization method and system with unmanned aerial vehicle
Odeh et al. A hybrid fuzzy genetic algorithm for an adaptive traffic signal system
CN112732905A (en) Traffic accident analysis, prevention and control method and system based on knowledge graph
CN111125886A (en) Crowd evacuation simulation system and simulation method based on three different behaviors
CN114580751B (en) Method, system, storage medium and terminal for predicting evacuation time of passengers arriving at airport
CN116592903B (en) Ecological driving path real-time planning method for group preference under vehicle-road cooperative environment
Odeh Hybrid algorithm: fuzzy logic-genetic algorithm on traffic light intelligent system
CN115527369A (en) Large passenger flow early warning and evacuation method under large-area delay condition of airport hub
Shi et al. Task allocation and path planning of many robots with motion uncertainty in a warehouse environment
CN114253975A (en) Load-aware road network shortest path distance calculation method and device
CN117912254A (en) Highway open space detection collaborative layout method, equipment and medium
CN116229720A (en) Traffic accident judging method of intelligent vehicle road system
Ji et al. A research based on k-means clustering and artificial fish-swarm algorithm for the vehicle routing optimization
CN114187577A (en) System and method for predicting pedestrian crossing track
Barzilai et al. Using machine learning techniques to incorporate social priorities in traffic monitoring in a junction with a fast lane
Zannou et al. Predicting the Traffic Congestion and Optimal Route in a Smart City Exploiting IoT Devices
Zhong et al. Automatic crowd navigation path planning in public scenes through multiobjective differential evolution
Shimi et al. A multi-objective decision-based solution (MODM) for facility location-allocation problem using cuckoo search and genetic algorithms
Tang et al. Crowd Intelligent Grouping Collaboration Evacuation via Multi-agent Reinforcement Learning
CN113015085B (en) Open type unmanned vehicle group dynamic evolution detection method in expressway scene

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200508