Passenger pull-in optimization method, device and equipment and medium

By building a target scheduling model, the optimal entry path is determined based on real-time passenger flow and train departure time, which solves the problem that cannot be dynamically adjusted in traditional methods and improves the efficiency of passenger entry and operational efficiency.

CN119005431APending Publication Date: 2024-11-22GUANGZHOU BAOLUN ELECTRONICS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411122143.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-15
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

Traditional static path planning methods cannot provide passengers with the optimal entry path based on real-time passenger flow, resulting in inefficiency of passenger entry during peak hours.

Method used

By obtaining the path parameters that affect passengers entering the station, a target scheduling model is built, and the optimal entry, optimal ride and optimal path are determined with the goal of minimizing the time for passengers to arrive at the ride gate, and the optimal entry gate, optimal ride gate and optimal path are determined, combining real-time passenger flow and The train departure time is dynamically adjusted.

Benefits of technology

It improves the efficiency and operational efficiency of passengers entering the station, reduces waiting time and congestion, and ensures that passengers can arrive at their destination quickly and easily.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119005431A_ABST
    Figure CN119005431A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of intelligent transportation, and discloses a passenger pull-in optimization method, device and equipment and a medium, the optimization method is applied to a passenger pull-in system, and the passenger pull-in system comprises a plurality of pull-in ports and a plurality of riding ports; comprising the steps of obtaining path influence parameters influencing passenger arrival; according to the path influence parameters, a target scheduling model is constructed by taking the minimization of the time for the passengers to arrive at any bus-taking opening as a target; and determining an optimal entrance, an optimal riding entrance and an optimal path through the target scheduling model. According to the method, the optimal entrance, the optimal riding entrance and the optimal path of each passenger can be determined in a personalized manner according to the real-time data condition, so that the operation efficiency and the passenger experience are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent transportation technology, and in particular to an optimization method, device, equipment and medium for passengers entering a station. Background Art

[0002] With the rapid development of urban rail transit, passengers have an increasing demand for efficient, convenient and safe station entry experience. Traditional static path planning methods can no longer adapt to the real-time changing passenger flow, especially during peak hours, when a large number of passengers enter and exit the station, which poses a huge challenge to station operations.

[0003] At present, the relevant technologies mainly include station entry solutions based on AFC systems and navigation solutions based on static maps. Some high-speed railway stations have adopted intelligent station entry systems, such as face recognition and automatic ticket checking, but these systems mainly focus on the automation of identity authentication and ticket checking processes, and the real-time planning of station entrances and routes still adopts a fixed mode. However, these technologies lack real-time and dynamic features, and cannot provide passengers with the best station entry route based on real-time passenger flow conditions. Summary of the invention

[0004] The present application provides a method, device, equipment and medium for optimizing passengers entering the station, which solves the technical problem of being unable to provide passengers with an optimal entry path based on real-time passenger flow conditions, and achieves the technical effect of improving the rapid entry of passengers.

[0005] In order to achieve the above objectives, the main technical solutions adopted in this application include:

[0006] In a first aspect, an embodiment of the present application provides a method for optimizing passenger entry, the method being applied to a passenger entry system, the passenger entry system comprising a plurality of station entrances and a plurality of boarding entrances; the method comprising:

[0007] Obtain path influencing parameters that affect passengers entering the station;

[0008] According to the path influencing parameters, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate;

[0009] The optimal entrance, optimal boarding entrance and optimal route are determined through the target scheduling model.

[0010] This embodiment provides a method for optimizing passenger entry into a station. By obtaining path influencing parameters that affect passenger entry into the station, the time it takes for passengers to arrive at any boarding gate is minimized, a target scheduling model is established, and the optimal station entry gate, optimal boarding gate, and optimal path are determined in a personalized manner for each passenger, thereby improving operational efficiency and passenger experience.

[0011] Optionally, the path influencing parameters include the spatial coordinate positions divided in the passenger station, the passenger flow at each of the spatial coordinate positions, and the train departure time; and constructing a target scheduling model based on the path influencing parameters with the goal of minimizing the time for passengers to arrive at any boarding gate includes:

[0012] Determine the predicted passenger flow at each of the spatial coordinate positions within a corresponding time period according to the train departure time and the passenger flow;

[0013] Based on the predicted passenger flow, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate.

[0014] This embodiment determines the passenger flow of each spatial coordinate position in different time periods by train departure time and passenger flow, and can understand the congestion level and demand of different spatial coordinate positions of the passenger station in each time period, and then builds a target scheduling model based on the predicted passenger flow and with the goal of minimizing the time for passengers to arrive at the boarding gate. This model can calculate the optimal time for passengers to arrive at the boarding gate. Through effective scheduling and optimization, the time for passengers to enter the station can be shortened, and the overall service efficiency and passenger flow processing capacity can be improved.

[0015] Optionally, the target scheduling model is:

[0016]

[0017] Among them, T min is the minimum total time for a passenger to reach any boarding gate j from the current spatial coordinate position k; i is a spatial coordinate position on the passenger's path to boarding gate j; n is the total number of spatial coordinate positions; D ijk is the distance from the passenger's spatial coordinate position i to the boarding gate j; F ijk (t) is the average walking speed from spatial coordinate position i to boarding gate j at time t; V ijk (t) is the predicted passenger flow from spatial coordinate position i to boarding gate j at time t; C ijk (t) is the actual moving speed from spatial coordinate position i to boarding gate j at time t.

[0018] The model of this embodiment optimizes the passenger's path selection by considering the minimum total time for the passenger to reach any boarding gate from the current spatial coordinate position. This includes considering factors such as distance, average walking speed, predicted passenger flow and actual moving speed. Through this comprehensive consideration, the model can provide passengers with the best path planning and reduce the total travel time of passengers.

[0019] Optionally, determining the optimal entrance, the optimal boarding entrance and the optimal route through the target scheduling model includes:

[0020] By using the target scheduling model, the minimum time required for passengers to arrive at any boarding gate is calculated;

[0021] Determine the path corresponding to the minimized time as the optimal path;

[0022] Determine the optimal entrance and the optimal boarding entrance corresponding to the optimal path.

[0023] This embodiment uses the target scheduling model to calculate the minimum time for passengers to arrive at each boarding gate, so as to ensure that each boarding gate has been calculated, and selects the path corresponding to the shortest time as the optimal path, and determines the station entrance and boarding gate in the optimal path as the optimal station entrance and optimal boarding gate. It ensures that passengers can choose the optimal path to reach their destination as quickly as possible, thereby reducing waiting time and congestion.

[0024] Optionally, the method further comprises:

[0025] Obtaining real-time passenger flow corresponding to each spatial coordinate position on the optimal path;

[0026] When the real-time passenger flow exceeds a preset threshold, the target scheduling model is used to determine a suboptimal station entrance, a suboptimal boarding entrance and a suboptimal route.

[0027] This embodiment obtains the passenger flow of each spatial coordinate position on the optimal path in real time. These data reflect the real-time passenger flow in different areas of the passenger station. When the real-time passenger flow exceeds the preset threshold, the target scheduling model will be activated to re-evaluate the suitability of each boarding gate based on the current real-time data and predicted passenger flow, and calculate the suboptimal entrance gate, suboptimal boarding gate and suboptimal path. This enables rapid response to changes in passenger flow, effectively avoids congestion and optimizes the efficiency of entry points or boarding points.

[0028] Optionally, the method further comprises:

[0029] Obtaining the fault status of the optimal entrance to the station and / or the optimal boarding entrance;

[0030] When the fault state is a fault, a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route are determined through the target scheduling model.

[0031] This embodiment can detect various operating states of the optimal entrance and / or the optimal boarding entrance in real time, so as to promptly discover the fault conditions of the optimal entrance and / or the optimal boarding entrance, achieve rapid response, and help reduce the time affecting passengers' travel. When the optimal entrance and / or the optimal boarding entrance is confirmed to have a fault, the target scheduling model will be called immediately. The model will re-evaluate the suitability of other entrances and / or other boarding entrances based on real-time data and predicted passenger flow, and select the most appropriate suboptimal entrance, suboptimal boarding entrance, and suboptimal path. Minimize passenger inconvenience and delays, and maintain the efficiency and continuity of station operations.

[0032] Optionally, the method further comprises:

[0033] The optimal station entrance, optimal boarding entrance and optimal path are recommended to the passenger, so that the passenger can take the optimal path from the optimal station entrance to the optimal boarding entrance to board the vehicle.

[0034] This embodiment timely pushes the optimal entrance, optimal boarding entrance and the optimal route to passengers, ensuring that passengers know the best route before departure, reducing waiting and getting lost time.

[0035] In a second aspect, an embodiment of the present application provides a passenger entry optimization device, the optimization device is applied to a passenger entry system, the passenger entry system includes multiple entry gates and multiple boarding gates; the device includes:

[0036] A parameter acquisition module, used to acquire path influencing parameters affecting passengers entering the station;

[0037] A model building module, for building a target scheduling model based on the path influencing parameters and aiming at minimizing the time it takes for passengers to arrive at any boarding gate;

[0038] The scheduling result module is used to determine the optimal entrance, optimal boarding entrance and optimal route through the target scheduling model.

[0039] The present embodiment provides a device for optimizing passenger entry into a station. The device obtains path influencing parameters that affect passenger entry into the station, thereby minimizing the time it takes for passengers to arrive at any boarding gate, establishes a target scheduling model, and individually determines the optimal station entry gate, optimal boarding gate, and optimal path for each passenger, thereby improving operational efficiency and passenger experience.

[0040] Optionally, the path influencing parameters include the spatial coordinate positions divided in the passenger station, the passenger flow at each of the spatial coordinate positions, and the train departure time; the model building module includes:

[0041] Determine the predicted passenger flow at each of the spatial coordinate positions within a corresponding time period according to the train departure time and the passenger flow;

[0042] Based on the predicted passenger flow, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate.

[0043] This embodiment determines the passenger flow of each spatial coordinate position in different time periods by train departure time and passenger flow, and can understand the congestion level and demand of different spatial coordinate positions of the passenger station in each time period, and then builds a target scheduling model based on the predicted passenger flow and with the goal of minimizing the time for passengers to arrive at the boarding gate. This model can calculate the optimal time for passengers to arrive at the boarding gate. Through effective scheduling and optimization, the time for passengers to enter the station can be shortened, and the overall service efficiency and passenger flow processing capacity can be improved.

[0044] Optionally, the target scheduling model is:

[0045]

[0046] Among them, T min is the minimum total time for a passenger to reach any boarding gate j from the current spatial coordinate position k; i is a spatial coordinate position on the passenger's path to boarding gate j; n is the total number of spatial coordinate positions; D ijk is the distance from the passenger's spatial coordinate position i to the boarding gate j; F ijk (t) is the average walking speed from spatial coordinate position i to boarding gate j at time t; V ijk (t) is the predicted passenger flow from spatial coordinate position i to boarding gate j at time t; C ijk (t) is the actual moving speed from spatial coordinate position i to boarding gate j at time t.

[0047] The model of this embodiment optimizes the passenger's path selection by considering the minimum total time for the passenger to reach any boarding gate from the current spatial coordinate position. This includes considering factors such as distance, average walking speed, predicted passenger flow and actual moving speed. Through this comprehensive consideration, the model can provide passengers with the best path planning and reduce the total travel time of passengers.

[0048] Optionally, the scheduling result module includes:

[0049] By using the target scheduling model, the minimum time required for passengers to arrive at any boarding gate is calculated;

[0050] Determine the path corresponding to the minimized time as the optimal path;

[0051] Determine the optimal entrance and the optimal boarding entrance corresponding to the optimal path.

[0052] This embodiment uses the target scheduling model to calculate the minimum time for passengers to arrive at each boarding gate, so as to ensure that each boarding gate has been calculated, and selects the path corresponding to the shortest time as the optimal path, and determines the station entrance and boarding gate in the optimal path as the optimal station entrance and optimal boarding gate. It ensures that passengers can choose the optimal path to reach their destination as quickly as possible, thereby reducing waiting time and congestion.

[0053] Optionally, the device further comprises:

[0054] Obtaining real-time passenger flow corresponding to each spatial coordinate position on the optimal path;

[0055] When the real-time passenger flow exceeds a preset threshold, the target scheduling model is used to determine a suboptimal station entrance, a suboptimal boarding entrance and a suboptimal route.

[0056] This embodiment obtains the passenger flow of each spatial coordinate position on the optimal path in real time. These data reflect the real-time passenger flow in different areas of the passenger station. When the real-time passenger flow exceeds the preset threshold, the target scheduling model will be activated to re-evaluate the suitability of each boarding gate based on the current real-time data and predicted passenger flow, and calculate the suboptimal entrance gate, suboptimal boarding gate and suboptimal path. This enables rapid response to changes in passenger flow, effectively avoids congestion and optimizes the efficiency of entry points or boarding points.

[0057] Optionally, the device further comprises:

[0058] Obtaining the fault status of the optimal entrance to the station and / or the optimal boarding entrance;

[0059] When the fault state is a fault, a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route are determined through the target scheduling model.

[0060] This embodiment can detect various operating states of the optimal entrance and / or the optimal boarding entrance in real time, so as to promptly discover the fault conditions of the optimal entrance and / or the optimal boarding entrance, achieve rapid response, and help reduce the time affecting passengers' travel. When the optimal entrance and / or the optimal boarding entrance is confirmed to have a fault, the target scheduling model will be called immediately. The model will re-evaluate the suitability of other entrances and / or other boarding entrances based on real-time data and predicted passenger flow, and select the most appropriate suboptimal entrance, suboptimal boarding entrance, and suboptimal path. Minimize passenger inconvenience and delays, and maintain the efficiency and continuity of station operations.

[0061] Optionally, the device further comprises:

[0062] The optimal station entrance, optimal boarding entrance and optimal path are recommended to the passenger, so that the passenger can take the optimal path from the optimal station entrance to the optimal boarding entrance to board the vehicle.

[0063] This embodiment timely pushes the optimal entrance, optimal boarding entrance and the optimal route to passengers, ensuring that passengers know the best route before departure, reducing waiting and getting lost time.

[0064] In a third aspect, an embodiment of the present application provides a computer device, including:

[0065] A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the above-mentioned method for optimizing passenger entry by executing the computer instructions.

[0066] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which computer instructions are stored, and the computer instructions are used to enable a computer to execute the above-mentioned passenger entry optimization method. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0068] Figure 1 A flow chart of a method for optimizing passenger entry into a station provided in an embodiment of the present application;

[0069] Figure 2 A flowchart of step S3 provided in an embodiment of the present application;

[0070] Figure 3 A flowchart of step S5 provided in an embodiment of the present application;

[0071] Figure 4 A flowchart for determining a suboptimal entrance, a suboptimal boarding entrance, and a suboptimal route provided in an embodiment of the present application;

[0072] Figure 5 Another flow chart for determining a suboptimal entrance, a suboptimal boarding entrance, and a suboptimal route provided in an embodiment of the present application;

[0073] Figure 6 A flowchart for recommending the optimal entrance, boarding entrance and route to passengers provided in an embodiment of the present application;

[0074] Figure 7 A block diagram of a passenger entry optimization device provided in an embodiment of the present application;

[0075] Figure 8 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0076] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present application.

[0077] The current Automatic Fare Collection (AFC) system mainly records the entry and exit information of passengers, but does not involve the optimization of passengers' walking paths inside the passenger station. After entering the station, passengers may need to find the entrance in an unfamiliar passenger station environment, especially in large or complex passenger stations, which may cause passengers to waste time. The navigation solution based on static maps cannot reflect the passenger flow dynamics in the passenger station in real time. Therefore, during peak hours, some areas may be very crowded, but the static map cannot tell passengers this information, causing passengers to choose to enter these crowded areas, reducing the efficiency of entering the station. In addition, passengers can usually only enter the station through designated fixed entrances, which lacks flexibility. The gates of the station lack intelligence and cannot dynamically adjust the opening status according to real-time passenger flow data.

[0078] Therefore, there is a lack of effective methods to integrate information such as passenger quantity, location, and target entrance, and to coordinate scheduling in a unified manner in relation to the physical space within the passenger station.

[0079] It should be noted that the method, device, equipment and medium for optimizing passenger entry into the station provided in this specification is based on a platform with a boarding gate as the center, and there are multiple boarding gates on the platform for passengers to board the train. Starting from the overall interior of the passenger station, multiple digitally controlled entrance gates are set up. According to the embodiments provided in this specification, the optimal entrance gate, optimal boarding gate and optimal path can be generated for each passenger, so that passengers can take the optimal path to enter the station from the optimal entrance according to their train information and then enter the optimal boarding gate to board the train.

[0080] According to an embodiment of the present application, an embodiment of an optimization method for passengers entering a station is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0081] In this embodiment, a method for optimizing passenger entry is provided. Figure 1 A flowchart of a passenger entry optimization method provided in an embodiment of the present application, wherein the optimization method is applied to a passenger entry system, wherein the passenger entry system includes multiple entry gates and multiple boarding gates, such as Figure 1 As shown, the process includes the following steps:

[0082] Step S1, obtaining path influencing parameters affecting passengers entering the station.

[0083] Specifically, path influencing parameters refer to various factors and variables that need to be considered when planning and optimizing the path for passengers to travel to the boarding gate. Path influencing parameters can be obtained through sensors, cameras, mobile terminals, etc. The optimal path for passengers is usually affected by factors such as the spatial layout of the passenger station, the current location of the passenger, the target train that the passenger needs to take, and the departure time of the train. In view of this, in practical applications, path influencing parameters can be parameters related to the spatial layout of the passenger station and the train schedule. For example, path influencing parameters can be the spatial layout of the passenger station, including a series of divided spatial coordinate positions; or they can be related parameters such as real-time passenger flow, train departure schedule, and passenger spatial coordinate positions. Among them, real-time passenger flow can collect data through sensors and cameras installed in the passenger station. These devices can detect and record the location and movement trajectory of passengers, and realize real-time monitoring and statistics of passenger flow. The spatial coordinates obtained by dividing the spatial layout of the passenger station can be divided into internal grids of the passenger station through professional GIS software, and the center point of each grid can be extracted to obtain the coordinates of the center point. When dividing, it is necessary to consider the waiting area, ticket area, exit, entrance, luggage storage area, toilet, dining area and commercial area and other functional areas on the corresponding grid. The train departure timetable can be obtained through the station screen or the background database of the automatic ticket vending and checking system AFC. The spatial coordinates of the passenger can be obtained through real-time positioning by GPS software.

[0084] Step S3, constructing a target scheduling model based on the path influencing parameters and taking minimizing the time it takes for passengers to arrive at any boarding gate as the goal.

[0085] Specifically, based on the path influencing parameters, by calculating the time it takes for passengers to arrive at a series of different boarding gates, the aim is to find the optimal path for passengers from their current location to the nearest boarding gate to minimize the total time. The model is continuously optimized according to the actual path conditions until the target scheduling model is obtained to ensure that passengers arrive at the entrance as quickly as possible, and enter the passenger station from the entrance to the corresponding boarding gate to take the bus, thereby improving the station's operational efficiency and passenger satisfaction.

[0086] It should be noted here that the multiple boarding gates here all lead to the same platform, and the train departure times of the platform will not overlap, and only one train departs at any time. Therefore, only the path influencing parameters, such as the spatial coordinate position of the passenger station, passenger flow, and train departure time, can be considered to plan the optimal path for passengers to reach the boarding gate, so as to quickly guide passengers to board the train. In addition, there will be a preset interval between the opening time of the boarding gate and the train departure time to ensure that the time when passengers enter the boarding gate matches the train they are taking, avoiding the risk of taking other trains by mistake. In other words, even if the optimal path is planned, passengers arrive at the boarding gate in advance, and they also need to enter the vehicle through the boarding gate at the specified time to board the train.

[0087] When building and training the scheduling model, historical path influencing parameters can be used, such as the spatial coordinate positions divided within the passenger station, the passenger flow at each spatial coordinate position, and the current train departure time within the passenger station. The scheduling model can use the D Lite algorithm or the LPA* algorithm to plan the path. According to the trained target scheduling model, the optimal path for each passenger to reach the boarding gate and the corresponding entrance and boarding gate can be calculated, thereby optimizing the passenger's entry path and improving the passenger experience.

[0088] Step S5, determining the optimal entrance, optimal boarding entrance and optimal route through the target scheduling model.

[0089] Specifically, through the target scheduling model, the most suitable optimal entrance, boarding entrance and route can be determined for each passenger according to the passenger's needs. That is, the needs of each passenger can be met in a personalized manner and the best service plan can be provided.

[0090] Obtain the path influencing parameters that currently affect entry into the station, including the passenger's current spatial position, the spatial coordinate position of the passenger station, real-time passenger flow, and train departure time. Then, predict the passenger flow at each spatial coordinate based on the real-time passenger flow and train departure time. This can be done using big data analysis or a trained machine learning model. Based on the predicted passenger flow and the passenger's current spatial position, calculate the optimal path using the target scheduling model. Determine the optimal entrance and optimal boarding gate based on the optimal path so that passengers can take the optimal path to enter the station from the optimal entrance and enter the optimal boarding gate to meet their personalized needs.

[0091] This embodiment provides a method for optimizing passenger entry into a station. By obtaining path influencing parameters that affect passenger entry into the station, the time it takes for passengers to arrive at any boarding gate is minimized, a target scheduling model is established, and the optimal station entry gate, optimal boarding gate, and optimal path are determined in a personalized manner for each passenger, thereby improving operational efficiency and passenger experience.

[0092] Figure 2 The flowchart of step S3 provided in the embodiment of the present application, the path influencing parameters include the spatial coordinate positions divided in the passenger station, the passenger flow at each of the spatial coordinate positions, and the train departure time. Among them, the spatial coordinate position can represent the spatial coordinate point in the passenger station, and the passenger flow at each spatial coordinate position can be counted by means of sensors, counters, cameras and other devices. The process may include the following steps:

[0093] Step S31, determining the predicted passenger flow at each of the spatial coordinate positions in the corresponding time period according to the train departure time and the passenger flow.

[0094] Specifically, the train departure time can be obtained from the departure data in the passenger station or the corresponding train information purchased by the passenger. The passenger flow can be collected through sensors, counters or cameras to collect data on passengers entering and leaving the station to obtain real-time changes in passenger flow. The spatial layout inside the passenger station is regarded as a network diagram, in which the nodes represent the spatial coordinate positions in the passenger station, and the edges represent the walkable passage paths between these positions. According to the train departure time, a day is divided into multiple time periods, such as morning peak, evening peak, and off-peak hours. Using the train departure time and passenger flow, the predicted passenger flow of each spatial coordinate position in the next time period is predicted in real time, so as to provide personalized services to passengers in a targeted manner to recommend the optimal entrance, optimal boarding entrance and optimal path.

[0095] It should be noted that the historical train departure time and historical passenger flow can be used to analyze the passenger flow at each spatial coordinate position in different time periods. Time series analysis, regression analysis or machine learning models, such as ARIMA, regression model or neural network, can be used to establish a prediction model. Use historical data to train and optimize the established prediction model to ensure that the model can accurately predict the passenger flow at each spatial coordinate position in different time periods. Cross-validation, parameter adjustment and other techniques can be used to improve the accuracy and generalization ability of the prediction model. Finally, after the prediction model is trained, the real-time train departure time and current passenger flow are combined with the prediction model to predict the passenger flow at each spatial coordinate position in the next time period in real time.

[0096] Step S33, based on the predicted passenger flow, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate.

[0097] Specifically, in order to optimize the arrival time of passengers and ensure that passengers can enter the station and board the train as quickly as possible, the target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate, and the goal is to calculate the time it takes for passengers to arrive at the boarding gate and find the shortest time for passengers to arrive at the boarding gate. Through such optimization, the utilization efficiency of the entrance gate and the overall service efficiency of the passenger station can be improved.

[0098] and Figure 1 Compared with the embodiment shown in the figure, this embodiment determines the passenger flow of each spatial coordinate position in different time periods by the train departure time and passenger flow corresponding to the passenger, and can understand the congestion degree and demand of different spatial coordinate positions of the passenger station in each time period, and then build a target scheduling model based on the predicted passenger flow and the goal of minimizing the time for passengers to arrive at the boarding gate. This model can calculate the optimal time for passengers to arrive at the boarding gate. Through effective scheduling and optimization, the time for passengers to enter the station can be shortened, and the overall service efficiency and passenger flow processing capacity can be improved.

[0099] In some embodiments, the target scheduling model is:

[0100]

[0101] Among them, T min is the minimum total time for a passenger to reach any boarding gate j from the current spatial coordinate position k; i is a spatial coordinate position on the passenger's path to boarding gate j; n is the total number of spatial coordinate positions; D ijk is the distance from the passenger's spatial coordinate position i to the boarding gate j; F ijk (t) is the average walking speed from spatial coordinate position i to boarding gate j at time t; V ijk (t) is the predicted passenger flow from spatial coordinate position i to boarding gate j at time t; C ijk (t) is the actual moving speed from spatial coordinate position i to boarding gate j at time t.

[0102] The average walking speed here is calculated based on the historical passenger walking speed. If the passenger is riding at the bus station for the first time, the preset walking speed will be used as the average walking speed of the passenger. The model takes into account the behavior and experience of passengers at the bus station, because passengers usually form an average walking speed after becoming familiar with the bus station. The preset walking speed reflects the passenger's first experience of riding at the bus station. This method makes the model closer to actual operation and can provide a reasonable starting speed in the calculation.

[0103] In addition, factors such as the age, physical condition, and real-time situation of the passengers need to be considered. The actual moving speed needs to be obtained to improve the calculation accuracy of the model. Among them, age factor: Age can affect the walking speed of passengers. Generally speaking, young people may walk faster, while the elderly may walk slower. Physical condition: For example, whether the passenger is in a wheelchair or has other physical limitations. For passengers using wheelchairs, the walking speed will obviously be more restricted. Real-time situation: In addition to the average walking speed predicted based on historical data, the model also needs to consider the real-time situation. For example, during peak hours or special events, the walking speed of passengers may be affected by congestion or other factors, which can be adjusted by the real-time actual moving speed.

[0104] Specifically, the target scheduling model comprehensively considers the predicted passenger flow, which affects the speed of passengers moving on the path and possible congestion; the model can calculate the minimum total time for passengers from the current spatial coordinate position to any boarding gate to improve the efficiency and speed of passengers arriving at the boarding gate. By considering factors such as distance, average walking speed, predicted passenger flow and actual moving speed, the allocation of entrances / boarding gates and the path selection of passengers can be optimized, thereby reducing passengers' waiting time and congestion, and improving the operating efficiency and service quality of passenger stations.

[0105] and Figure 1 Compared with the embodiment shown in FIG. 1 , the model of this embodiment optimizes the passenger's path selection by considering the minimum total time for the passenger to reach any boarding gate from the current spatial coordinate position. This includes considering factors such as distance, average walking speed, predicted passenger flow and actual moving speed. Through this comprehensive consideration, the model can provide passengers with optimal path planning and reduce the total travel time of passengers.

[0106] Figure 3 The flowchart of step S5 provided in the embodiment of the present application may include the following steps:

[0107] Step S51, calculating the minimum time for passengers to arrive at any boarding gate through the target scheduling model.

[0108] Step S53: determine the path corresponding to the minimized time as the optimal path.

[0109] Step S55, determining the optimal entrance and boarding gate corresponding to the optimal path.

[0110] Specifically, based on the constructed target scheduling model, the total time for passengers to arrive from the current spatial coordinate position is calculated for each boarding gate. The minimum value of these times is determined, that is, the minimum time for passengers to reach any boarding gate from the current position. Then the corresponding path that minimizes the total time is selected as the optimal path. Since the optimal path is a continuous path starting from the passenger's current spatial coordinate position, passing through the entrance, and finally reaching the boarding gate, the first key point on this path (i.e., the entrance) is the optimal entrance, and the last key point (boarding gate) is the optimal boarding gate. Therefore, it can ensure that passengers choose the boarding gate that they can reach in the shortest time, thereby improving overall efficiency and service quality.

[0111] For example, the train departure time of the passenger station and the passenger flow of the current passenger station are obtained, and the predicted passenger flow at each spatial coordinate position in the future time period is determined using step S31. Combined with the average walking speed and actual moving speed of the passengers, the target scheduling model is used to calculate the minimum time for passengers to arrive at any boarding gate, and the corresponding path with the minimum time is selected as the optimal path, and the entrance and boarding gate in the optimal path are determined as the optimal entrance and optimal boarding gate. In the process of calculating the minimum time, the path information is recorded so that the optimal entrance and optimal boarding gate for passengers to board the train can be directly found after the optimal path is determined.

[0112] and Figure 1 Compared with the embodiment shown in FIG. 1 , this embodiment uses the target scheduling model to calculate the minimum time for passengers to arrive at each boarding gate, so as to ensure that each boarding gate has been calculated, and selects the path corresponding to the shortest time as the optimal path, and determines the station entrance and boarding gate in the optimal path as the optimal station entrance and optimal boarding gate. It is ensured that passengers can reach their destination as quickly as possible by choosing the optimal path, thereby reducing waiting time and congestion.

[0113] Figure 4 A flowchart for determining a suboptimal entrance, a suboptimal boarding entrance, and a suboptimal route is provided in an embodiment of the present application. The flowchart may include the following steps:

[0114] Step S21, obtaining the real-time passenger flow corresponding to each spatial coordinate position on the optimal path.

[0115] Step S23, when the real-time passenger flow exceeds a preset threshold, a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route are determined through the target scheduling model.

[0116] Specifically, sensors, cameras and other equipment in the passenger station can be used to monitor passenger flow in real time, collect passenger flow at each spatial coordinate position on the optimal path, set a threshold for passenger flow, which is determined based on historical data and passenger station operation experience, monitor passenger flow in real time, and once a situation exceeding the threshold is detected, immediately use the target scheduling model to recalculate the suboptimal entrance, suboptimal boarding entrance and suboptimal path based on the current real-time data and predicted passenger flow. That is, the target scheduling model is used to calculate the time when passengers arrive at each boarding entrance, and the time is sorted from short to long, and the path corresponding to the second shortest time is selected as the suboptimal path, and the entrance and boarding entrance in the suboptimal path are determined as the suboptimal entrance and suboptimal boarding entrance. This method can quickly respond to real-time passenger flow changes, avoid congestion and inconvenience, and optimize the passenger's travel experience and the efficiency of the station to the greatest extent.

[0117] and Figure 1 Compared with the embodiment shown in the figure, this embodiment obtains the passenger flow of each spatial coordinate position on the optimal path in real time. These data reflect the real-time passenger flow in different areas of the passenger station. When the real-time passenger flow exceeds the preset threshold, the target scheduling model will be started. According to the current real-time data and the predicted passenger flow, the suitability of each boarding gate will be re-evaluated, and the suboptimal entrance gate, suboptimal boarding gate and suboptimal path will be calculated. This enables rapid response to changes in passenger flow, effectively avoiding congestion and optimizing the efficiency of the entrance or boarding point.

[0118] Figure 5 Another flow chart for determining a suboptimal entrance, a suboptimal boarding entrance, and a suboptimal route is provided in an embodiment of the present application. The flow chart may include the following steps:

[0119] Step S41, obtaining the fault status of the optimal entrance and / or the optimal boarding entrance.

[0120] Step S43, when the fault state is a fault, determine a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route through the target scheduling model.

[0121] Specifically, passenger stations are usually equipped with monitoring and alarm systems that can detect various operating conditions of entrances or boarding gates in real time, including equipment failures, power supply problems, or other operational anomalies. Once it is confirmed that the optimal entrance and / or optimal boarding gate has failed, the target scheduling model will be immediately called to re-evaluate the suitability of other entrances and / or boarding gates. The model will recalculate and determine the suboptimal entrance, suboptimal boarding gate, and suboptimal path based on the current real-time data and predicted passenger flow. That is, the target scheduling model is used to calculate the time it takes for passengers to arrive at each boarding gate, and the time is sorted from short to long, and the path corresponding to the second shortest time is selected as the suboptimal path, and the entrance and boarding gate in the suboptimal path are determined as the suboptimal entrance and suboptimal boarding gate.

[0122] and Figure 1 Compared with the embodiment shown in the figure, this embodiment can detect the various operating states of the optimal entrance and / or the optimal boarding entrance in real time, so as to timely discover the failure of the optimal entrance and / or the optimal boarding entrance, realize rapid response, and help reduce the time affecting passengers' travel. When the optimal entrance and / or the optimal boarding entrance is confirmed to have a failure, the target scheduling model will be called immediately. The model will re-evaluate the suitability of other entrances and / or other boarding entrances based on real-time data and predicted passenger flow, and select the most appropriate suboptimal entrance, suboptimal boarding entrance and suboptimal path. Minimize passenger inconvenience and delays and maintain the efficiency and continuity of station operations.

[0123] Figure 6 A flowchart for recommending the optimal entrance, boarding entrance, and route to passengers provided in an embodiment of the present application may include the following steps:

[0124] Step S7, recommending the optimal station entrance, optimal boarding entrance and the optimal route to the passenger, so that the passenger can take the optimal route from the optimal station entrance to the optimal boarding entrance to board the vehicle.

[0125] Specifically, passenger stations can push information about the best entrance, boarding gate, and route to passengers through mobile phone applications, in-station displays, or text message notifications. This ensures that passengers can reach the entrance and boarding gate smoothly and quickly, improving the overall passenger travel experience and entrance operation efficiency. Once passengers arrive at the entrance and boarding gate, they can enter the station by swiping their ID card or face, and the gates at the entrance and boarding gate can also open quickly according to the passenger information so that passengers can enter the station and board the bus quickly.

[0126] and Figure 1 Compared with the embodiment shown, this embodiment timely pushes the optimal entrance, optimal boarding entrance and the optimal route to passengers, ensuring that passengers know the best route before departure, reducing waiting and lost time.

[0127] Accordingly, please refer to Figure 7 , an optimization device for passenger entry provided in an embodiment of the present application, the optimization device is applied to a passenger entry system, the passenger entry system includes multiple entry gates and multiple boarding gates; the device includes:

[0128] A parameter acquisition module 101 is used to acquire path influencing parameters affecting passengers entering the station;

[0129] A model building module 103 is used to build a target scheduling model based on the path influencing parameters and with the goal of minimizing the time it takes for passengers to arrive at any boarding gate;

[0130] The scheduling result module 105 is used to determine the optimal entrance, the optimal boarding entrance and the optimal route through the target scheduling model.

[0131] In some embodiments, the path influencing parameters include the spatial coordinate positions divided within the passenger station, the passenger flow at each of the spatial coordinate positions, and the train departure time; the model building module 103 includes:

[0132] Determine the predicted passenger flow at each of the spatial coordinate positions within a corresponding time period according to the train departure time and the passenger flow;

[0133] Based on the predicted passenger flow, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate.

[0134] In some embodiments, the target scheduling model is:

[0135]

[0136] Among them, T min is the minimum total time for a passenger to reach any boarding gate j from the current spatial coordinate position k; i is a spatial coordinate position on the passenger's path to boarding gate j; n is the total number of spatial coordinate positions; D ijk is the distance from the passenger's spatial coordinate position i to the boarding gate j; F ijk (t) is the average walking speed from spatial coordinate position i to boarding gate j at time t; V ijk (t) is the predicted passenger flow from spatial coordinate position i to boarding gate j at time t; C ijk (t) is the actual moving speed from spatial coordinate position i to boarding gate j at time t.

[0137] In some embodiments, the scheduling result module 105 includes:

[0138] By using the target scheduling model, the minimum time required for passengers to arrive at any boarding gate is calculated;

[0139] Determine the path corresponding to the minimized time as the optimal path;

[0140] Determine the optimal entrance and the optimal boarding entrance corresponding to the optimal path.

[0141] In some embodiments, the apparatus further comprises:

[0142] Obtaining real-time passenger flow corresponding to each spatial coordinate position on the optimal path;

[0143] When the real-time passenger flow exceeds a preset threshold, the target scheduling model is used to determine a suboptimal station entrance, a suboptimal boarding entrance and a suboptimal route.

[0144] In some embodiments, the apparatus further comprises:

[0145] Obtaining the fault status of the optimal entrance to the station and / or the optimal boarding entrance;

[0146] When the fault state is a fault, a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route are determined through the target scheduling model.

[0147] In some embodiments, the apparatus further comprises:

[0148] The optimal station entrance, optimal boarding entrance and optimal path are recommended to the passenger, so that the passenger can take the optimal path from the optimal station entrance to the optimal boarding entrance to board the vehicle.

[0149] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0150] In this embodiment, a passenger entry optimization device is presented in the form of a functional module, where the module refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0151] See also Figure 8 , Figure 8 A schematic diagram of the structure of a computer device provided in an embodiment of the present application is shown in FIG. Figure 8As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 8 A processor 10 is taken as an example.

[0152] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0153] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0154] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0155] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0156] The computer device further comprises a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0157] The embodiment of the present application also provides a computer-readable storage medium. The above method according to the embodiment of the present application can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0158] The devices and modules described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0159] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing the present application, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0160] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, devices, and equipment. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0161] The present application is described with reference to the flowcharts and / or block diagrams of the methods, apparatuses, and devices according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0162] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0163] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0164] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0165] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0166] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

[0167] Although the embodiments of the present application have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present application, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for optimizing passenger entry into a station, It is characterized in that The optimization method is applied to a passenger station entry system, wherein the passenger station entry system includes multiple station entrances and multiple boarding entrances; the method includes: Obtain path influencing parameters that affect passengers entering the station; According to the path influencing parameters, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate; The optimal entrance, optimal boarding entrance and optimal route are determined through the target scheduling model.

2. The method according to claim 1, It is characterized in that The path influencing parameters include the spatial coordinate positions divided within the passenger station, the passenger flow at each of the spatial coordinate positions, and the train departure time; According to the path influencing parameters, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate, including: Determine the predicted passenger flow at each of the spatial coordinate positions within a corresponding time period according to the train departure time and the passenger flow; Based on the predicted passenger flow, a target scheduling model is constructed with the goal of minimizing the time it takes for passengers to arrive at any boarding gate.

3. The method according to claim 1 or 2, It is characterized in that The target scheduling model is: Among them, T min is the minimum total time for a passenger to reach any boarding gate j from the current spatial coordinate position k; i is a spatial coordinate position on the passenger's path to boarding gate j; n is the total number of spatial coordinate positions; D ijk is the distance from the passenger's spatial coordinate position i to the boarding gate j; F ijk (t) is the average walking speed from spatial coordinate position i to boarding gate j at time t; V ijk (t) is the predicted passenger flow from spatial coordinate position i to boarding gate j at time t; C ijk (t) is the actual moving speed from spatial coordinate position i to boarding gate j at time t.

4. The method according to claim 1, It is characterized in that Determining the optimal entrance, the optimal boarding entrance and the optimal route through the target scheduling model includes: By using the target scheduling model, the minimum time required for passengers to arrive at any boarding gate is calculated; Determine the path corresponding to the minimized time as the optimal path; Determine the optimal entrance and the optimal boarding entrance corresponding to the optimal path.

5. The method according to claim 1, It is characterized in that The method further comprises: Obtaining real-time passenger flow corresponding to each spatial coordinate position on the optimal path; When the real-time passenger flow exceeds a preset threshold, the target scheduling model is used to determine a suboptimal station entrance, a suboptimal boarding entrance and a suboptimal route.

6. The method according to claim 1, It is characterized in that The method further comprises: Obtaining the fault status of the optimal entrance to the station and / or the optimal boarding entrance; When the fault state is a fault, a suboptimal entrance, a suboptimal boarding entrance and a suboptimal route are determined through the target scheduling model.

7. The method according to claim 1, It is characterized in that The method further comprises: The optimal station entrance, optimal boarding entrance and optimal path are recommended to the passenger, so that the passenger can take the optimal path from the optimal station entrance to the optimal boarding entrance to board the vehicle.

8. An optimization device for passengers entering the station, It is characterized in that The optimization device is applied to a passenger station entry system, which includes multiple station entrances and multiple boarding entrances; the device includes: A parameter acquisition module, used to acquire path influencing parameters affecting passengers entering the station; A model building module, for building a target scheduling model based on the path influencing parameters and aiming at minimizing the time it takes for passengers to arrive at any boarding gate; The scheduling result module is used to determine the optimal entrance, optimal boarding entrance and optimal route through the target scheduling model.

9. A computer device, It is characterized in that include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the passenger entry optimization method according to any one of claims 1 to 7 by executing the computer instructions.

10. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the passenger entry optimization method according to any one of claims 1 to 7.