Airport barrier-free service resource planning method, device, equipment and medium

By obtaining passenger intention and demand information and coordinate values, determining resource types and deployment locations, the problems of waste and insufficient coverage in airport accessibility service resource planning are solved, and the rationalization of resource deployment and improvement of passenger service levels are achieved.

CN114048915BActive Publication Date: 2024-12-03THE SECOND RES INST OF CIVIL AVIATION ADMINISTRATION OF CHINA
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202111391594.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-23
Publication Date
2024-12-03
Estimated Expiration
2041-11-23

AI Technical Summary

Technical Problem

In the existing airport accessibility service resource planning method, it is difficult to adjust resource deployment in real time according to the actual needs of passengers, resulting in oversupply, insufficient or mismatch in types, resulting in waste of resources and poor service coverage.

Method used

By obtaining passenger's intention demand information and coordinate values, determining the resource type, generating a demand location distribution map, and determining the number and location of resource deployment based on the coverage area radius, the clustering algorithm and iterative optimization method are used to optimize resource deployment.

Benefits of technology

It has achieved rationalization of resource deployment, optimized resource types and quantity, saved costs, and improved passenger travel service level and satisfaction.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114048915B_ABST
    Figure CN114048915B_ABST
Patent Text Reader

Abstract

The present application discloses a method, device, equipment and medium for planning airport barrier-free service resources, the method comprising: obtaining the intention demand information and the corresponding coordinate value of the passenger, the coordinate value being the coordinate position of the passenger when sending the intention demand information; determining the resource type corresponding to each intention demand information; determining the demand location distribution map of each resource based on the resource type and coordinate value corresponding to each intention demand information; determining the deployment quantity and resource deployment point of each resource based on the demand location distribution map and coverage area radius of each resource. The scheme can quickly determine the quantity and location of each type of resource deployment based on the intention demand information of the passenger, so as to provide the airport with reasonable suggestions for the deployment of passenger service resources, optimize the types and quantities of resource deployment, save the airport investment cost and maintenance expenses, improve the service level of passenger travel, and also increase passenger satisfaction.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention generally relates to the field of civil aviation technology, and in particular to a method, device, equipment and medium for planning airport barrier-free service resources. Background Art

[0002] With the continuous development of civil aviation technology, airports are constantly promoting the construction of barrier-free service environment by deploying different numbers and types of service resources in the terminal area. In order to allow more special passengers with functional disabilities to enjoy the convenience of resources during air travel, it is particularly important to plan barrier-free service resources.

[0003] At present, the related technologies have been put into use by planning the barrier-free resources of the terminal based on manual design experience. However, with the long-term operation of the terminal, it is necessary to continuously make local adjustments according to the actual needs of passengers, which often leads to problems such as excess resources, insufficient resources, and mismatch of resource types in different areas of the terminal, resulting in resource waste. Therefore, how to plan the barrier-free service resources of the airport is an urgent problem to be solved today. Summary of the invention

[0004] In view of the above-mentioned defects or deficiencies in the prior art, it is desirable to provide an airport barrier-free service resource planning method, device, equipment and medium.

[0005] In a first aspect, the present invention provides a method for planning airport barrier-free service resources, the method comprising:

[0006] Acquire the passenger's intended demand information and the coordinate value corresponding to the intended demand information, wherein the coordinate value is the coordinate position of the passenger when sending the intended demand information;

[0007] Determine the resource type corresponding to each intent requirement information;

[0008] Based on the resource type and coordinate value corresponding to each intention demand information, determine the demand location distribution map of each resource;

[0009] Based on the demand location distribution map and coverage area radius of each resource, determine the deployment quantity and resource deployment points of each resource.

[0010] In a second aspect, an embodiment of the present application provides an airport barrier-free service resource planning device, the device comprising:

[0011] An acquisition module, used to acquire the passenger's intention demand information and a coordinate value corresponding to the intention demand information, wherein the coordinate value is the coordinate position of the passenger when sending the intention demand information;

[0012] A type determination module is used to determine the resource type corresponding to each intention requirement information;

[0013] A distribution determination module is used to determine the resource type and coordinate value corresponding to each intention demand information, and determine the demand location distribution map of each resource;

[0014] The location determination module is used to determine the deployment quantity and resource deployment points of each type of resource deployment based on the required location distribution map and coverage area radius of each resource.

[0015] In a third aspect, an embodiment of the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the above-mentioned airport accessibility service resource planning method when executing the computer program.

[0016] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program is used to implement the airport accessibility service resource planning method as described in the first aspect.

[0017] In summary, the airport barrier-free service resource planning method, device, equipment and medium provided in the embodiments of the present application obtain the intention demand information and the corresponding coordinate value of the passenger, which is the coordinate position of the passenger when sending the intention demand information, and determine the resource type corresponding to each intention demand information, and determine the demand location distribution map of each resource based on the resource type and coordinate value corresponding to each intention demand information, and determine the deployment quantity and resource deployment points of each resource based on the demand location distribution map and coverage area radius of each resource. This technical solution can quickly determine the quantity and location of each type of resource deployment based on the intention demand information of the passenger, so as to provide the airport with reasonable suggestions for the deployment of passenger service resources, optimize the types and quantities of resource deployment, save the airport's investment costs and maintenance expenses, improve the service level of passenger travel, and also increase passenger satisfaction. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0019] Figure 1 A schematic diagram of the architecture of the implementation environment of airport accessibility service resource planning provided in the embodiment of the present application;

[0020] Figure 2 A flowchart of a method for planning airport accessibility service resources provided in an embodiment of the present application;

[0021] Figure 3A schematic diagram of the correspondence between the intended requirement information and the resource type provided in the embodiment of the present application;

[0022] Figure 4 A partial schematic diagram of the intention requirement information and the corresponding coordinate values ​​provided in an embodiment of the present application;

[0023] Figure 5 A demand location distribution map corresponding to a certain service resource provided in an embodiment of the present application;

[0024] Figure 6 A flowchart of a method for determining the number of deployments and resource deployment points of each resource provided in an embodiment of the present application;

[0025] Figure 7 A schematic diagram of clustering results of a certain service resource provided in an embodiment of the present application;

[0026] Figure 8 A schematic diagram of the structure of the cluster provided in the embodiment of the present application;

[0027] Fig. 9 A schematic diagram of a set of geometric center coordinate points of a cluster provided in an embodiment of the present application;

[0028] Fig.10 A schematic diagram of a coordinate point set corresponding to a "water dispenser" resource provided in an embodiment of the present application;

[0029] Fig.11 A schematic diagram of a coordinate point set corresponding to a "service device" resource provided in an embodiment of the present application;

[0030] Fig.12 A schematic diagram of the service resource parameter configuration structure provided in the embodiment of the present application;

[0031] Fig.13 The demand location distribution map corresponding to the "water dispenser" and "service equipment" resources provided in the embodiment of the present application;

[0032] Fig.14 A schematic diagram of the number of algorithm optimization iterations corresponding to the "water dispenser" and "service equipment" resources provided in the embodiment of the present application;

[0033] Fig.15 A schematic diagram of resource deployment planning corresponding to the "water dispenser" and "service equipment" resources provided in the embodiment of the present application;

[0034] Fig.16 A schematic diagram of resource deployment suggestions corresponding to the "water dispenser" and "service equipment" resources provided in the embodiment of the present application;

[0035] Fig.17A schematic diagram of the structure of an airport barrier-free service resource planning device provided by an embodiment of the present invention;

[0036] Fig.18 A schematic diagram of the structure of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0037] The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0038] It should be noted that the following embodiments and features in the embodiments may be combined with each other in the absence of conflict; and, based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without making any creative work are within the scope of protection of the present disclosure.

[0039] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein may be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present disclosure, it should be understood by those skilled in the art that an aspect described herein may be implemented independently of any other aspect, and two or more of these aspects may be combined in various ways. For example, any number of aspects described herein may be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein may be used to implement this device and / or practice this method.

[0040] It is understandable that with the continuous improvement of the travel service guarantee capabilities of civil aviation airports, more and more special passengers with functional disabilities have chosen to travel by air. In order to meet the service needs of special passengers, civil aviation airports have continuously optimized and improved the barrier-free service resources in the terminal. At present, the relevant technology plans the barrier-free resources of the terminal based on manual design experience and puts them into use. Since the airport cannot conduct service feedback statistics on the deployed barrier-free service resources, when optimizing the barrier-free service resource deployment plan, there will be problems such as excess resources, insufficient resources, and mismatch of resource types, which are not targeted and have poor coverage. Therefore, how to plan the barrier-free service resources of the airport is a problem that needs to be solved today.

[0041] Based on the above-mentioned defects, an embodiment of the present invention provides an airport barrier-free service resource planning method. Compared with the existing technology, this technical solution can quickly determine the quantity and location of each type of resource deployment according to the passenger's intention demand information, so as to provide the airport with reasonable suggestions for passenger service resource deployment, optimize the types and quantities of resource deployment, save the airport's investment costs and maintenance expenses, improve the service level of passengers' travel, and also increase passenger satisfaction.

[0042] Figure 1 : is an implementation environment architecture diagram of an airport barrier-free service resource planning method provided by an embodiment of the present application. Figure 1 As shown, the implementation environment architecture includes: a terminal 100 and a server 200.

[0043] The terminal 100 may be a smart home device such as a smart TV or a smart TV set-top box, or the terminal 100 may be a mobile portable terminal such as a smart phone, a tablet computer, or an e-book reader, or the terminal 100 may be a smart wearable device such as smart glasses or a smart watch, which is not specifically limited in this embodiment.

[0044] The server 200 may be a single server, or a server cluster consisting of a plurality of servers, or the server 200 may include one or more virtualization platforms, or the server 200 may be a cloud computing service center.

[0045] The server 200 may be a server device that provides background services for the AI ​​application installed in the terminal 100 .

[0046] The terminal 100 and the server 200 establish a communication connection via a wired or wireless network. Optionally, the wireless network or wired network uses standard communication technology and / or protocols. The network is usually the Internet, but can also be any network, including but not limited to a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a private network or any combination of a virtual private network.

[0047] For ease of understanding and explanation, the following Figures 2 to 18 The airport barrier-free service resource planning method, device, equipment and medium provided in the embodiments of the present application are described in detail.

[0048] It should be noted that the execution subject of the following method embodiment may be an airport barrier-free service resource planning device, which may be implemented as part or all of the terminal device through software, hardware, or a combination of software and hardware. The execution subject of the following method embodiment is described by taking a server as an example.

[0049] Figure 2 A flow chart of a method for planning airport barrier-free service resources provided by an embodiment of the present invention is shown in FIG. Figure 2 As shown, the method includes:

[0050] S101. Obtain the passenger's intended demand information and the corresponding coordinate value, where the coordinate value is the coordinate position of the passenger when sending the intended demand information.

[0051] Specifically, all the intention demand information of passengers in the terminal and the geographic information system (GIS) trajectory data corresponding to the intention demand information can be obtained by calling the database, or by calling the interface, or by importing it through external devices. After obtaining the GIS trajectory data, the coordinate values ​​corresponding to all the intention demand information can be obtained. The coordinate value is the coordinate position of the passenger when sending the intention demand information. The intention demand information refers to the intention information of the passenger in the terminal, such as "drinking", "asking information", "pay query", "call server", etc.

[0052] S102: Determine the resource type corresponding to each intention requirement information.

[0053] S103. Determine a demand location distribution map for each resource based on the resource type and coordinate value corresponding to each intended demand information.

[0054] It should be noted that after obtaining the intention demand information and the coordinate values ​​corresponding to the intention demand information during the passenger's travel, it can be processed to determine the resource type corresponding to each intention demand information, and generate a demand location distribution map for each resource. Optionally, the intention demand information can be virtualized into intention points in the coordinate system, and based on the resource type and coordinate values ​​corresponding to each intention demand information, the intention points of the same resource type can be screened to generate a demand location distribution map for each resource.

[0055] Specifically, since each service resource can provide different types of service resources to passengers, after obtaining the passenger's intention demand information, the passenger's intention demand information can be analyzed based on the correspondence between the resource type and the intention demand information to determine the resource type corresponding to the intention demand information. Among them, there is a one-to-many relationship between the resource type and the intention demand information, that is, one resource can correspond to multiple intention demand information. The correspondence between the above resource type and the intention demand information can be found in Figure 3 As shown, the resource types corresponding to the intent requirement information "drinking" and "payment" are both "water resources", and the resource types corresponding to the intent requirement information "asking information", "pay query" and "call server" are all "service resources".

[0056] The intention of passengers is simulated at different map coordinate points to filter out the intention demand information of the same type of service resources, and the coordinate values ​​x and y generated by the intention demand information corresponding to the same resource type are used as the input parameters of the clustering model to generate a demand location distribution map, where Figure 4 The following is a schematic diagram of the intention requirement information and the corresponding coordinate values. Figure 5 It is a demand location distribution map corresponding to a certain service resource, wherein the coordinate system is a plane rectangular coordinate system, the horizontal axis is the horizontal coordinate value x, and the vertical axis is the vertical coordinate value y. The distribution of the intention information points can be clearly and intuitively seen through the above demand location distribution map.

[0057] S104: Determine the deployment quantity and resource deployment points of each resource deployment based on the demand location distribution map and coverage area radius of each resource.

[0058] Optionally, based on the above embodiment, Figure 6 A flow chart of a method for determining the number of deployments and resource deployment points of each resource provided in an embodiment of the present application, such as Figure 6 As shown, the method includes:

[0059] S201. Based on the demand location distribution map of each resource, a clustering algorithm is used to determine the initial quantity and initial location of each resource.

[0060] Specifically, a density-based clustering algorithm can be used to cluster resource demand points in the demand location distribution map to generate a clustering result, which includes at least one cluster. The core points and edge points can be determined based on the domain radius and the minimum number of cluster points of the clustering model, and the domain radius, the minimum number of cluster points, and the coordinate values ​​corresponding to the intention points. The core points are connected to the edge points to obtain density-connected points, and in the demand location distribution map, the clustered points of the density-connected points within the domain radius are determined as clusters. Among them, Figure 7 This is a schematic diagram of the clustering results. Different grayscale colors in the figure represent different clusters, and the dark dots around these clusters represent noise. To determine a cluster, we need to use the two parameter values ​​of the DBSCAN clustering model: epsilon and the minimum number of cluster points min_samples. See Figure 8 As shown in the figure, when the number of points within the range of the domain radius epsilon of point p is greater than or equal to the minimum number of clustering points min_samples, point p is determined to be a core point, and its surrounding points can be called edge points. If the number of points within the range of the domain radius epsilon of an edge point is also greater than or equal to the minimum number of clustering points min_samples, the edge point is a point other than point p and can be regarded as point q. Point q and point p are connected together and are called density-connected, thus forming density-connected points. The clustered points of density-connected points within the domain radius are clustered.

[0061] Optionally, the above clustering algorithm can be a DBSCAN clustering algorithm. It is understandable that since the DBSCAN cluster center is not related to the resource service radius, the clustering result of DBSCAN cannot be directly used to plan the final resource deployment point, and DBSCAN only has location attributes and cannot optimize the number of resource deployments and service coverage. Therefore, the calculation results of the DBSCAN algorithm are mainly used to estimate the number of deployments of each type of resource. It should be noted that the DBSCAN algorithm is a density-based clustering algorithm. The clustering result of the maximum density connected sample set derived from the density-reachable relationship is a category of the final clustering, or a cluster.

[0062] After completing the clustering process, the resource demand points in the demand location distribution map that do not belong to any cluster are noise points. The noise points in the demand location distribution map can be removed, and then the number of resource demand points in the demand location distribution map after removing the noise points is counted. Then, based on the number of resource demand points in the demand location distribution map after removing the noise points and the service capacity value corresponding to the resource, the initial number of resource deployments is calculated.

[0063] In specific implementation, the total number of resource demand points N in the demand location distribution map after removing noise points is counted. total , total number N total Divide by the service capacity value S corresponding to the resource to get the estimated value N of the resource quantity PRE =N total / S; if the estimated value of the number of resources is not less than the number of clusters obtained by clustering, the estimated value of the number of resources is used as the initial number of resource deployment; if the estimated value of the number of resources is greater than the number of clusters obtained by clustering, the number of clusters is used as the initial number of resource deployment.

[0064] by Figure 7 Taking the clustering result of a certain service resource shown as an example, the DBSCAN clustering model clusters the intention points into 5 clusters. After removing the noise points, the number of resource demand points in the demand location distribution map is 714.

[0065] Furthermore, the maximum number of passengers that the barrier-free service resource can serve at one time can be regarded as the service capacity of the service resource, that is, the service capacity value, which is regarded as S, and the number of clustered users calculated by the DBSCAN clustering model is set to n, then the number of resource deployments M can be calculated by the following formula:

[0066] M = round(n / S);

[0067] Where n is the number of clustered users, that is, the number of resource demand points in the demand location distribution map after removing noise points, and S is the service capacity value corresponding to the resource. The result of the number M of resource deployment can be rounded to an integer value.

[0068] For example, see Figure 5 As shown in Figure 2, volume is the service capacity of the service resource, that is, S = volume = 220, and n is the number of resource demand points in the demand location distribution map after removing noise points. Figure 7 For example, n=714, so M=round(n / S)=round(714 / 220)≈3 (stations). Therefore, the initial number of resources to be deployed is 3.

[0069] Optionally, the coordinate value of the geometric center of each cluster can be calculated based on the coordinate value corresponding to the intention point and the total number of intention points after denoising, and then the initial position of each resource can be determined based on the geometric center of each cluster. Since each cluster is a finite point set, it is applicable to the geometric center algorithm of a finite point set. In the process of calculating the geometric center of a cluster, the horizontal and vertical coordinate values ​​corresponding to each intention point are determined based on the coordinate value corresponding to the intention point; the horizontal coordinate values ​​corresponding to each intention point of the cluster are added and summed, and the sum is divided by the total number of intention points after denoising to obtain the horizontal coordinate value of the geometric center; the vertical coordinate values ​​of each intention point of the cluster are added, and the sum is divided by the total number of intention points after denoising to obtain the vertical coordinate value of the geometric center; thus, the coordinate value of the geometric center is determined based on the horizontal and vertical coordinate values ​​of the geometric center, and then the geometric center coordinate point set of all clusters is obtained. See also Fig. 9 Schematic diagram of the geometric center coordinate point sets of the five clusters shown, where the dark dot at the center of each cluster is the geometric center of the cluster.

[0070] When determining the initial position of resources based on the geometric center of each cluster, when the initial number of resources is less than the number of clusters, N clusters are deleted in order from the smallest to the largest number of resource demand points contained in the clusters, and the geometric center of each remaining cluster is used as the initial position of the resource, where N is equal to the difference between the number of clusters and the initial number; if the initial number of resources is equal to the number of clusters, the geometric center of each cluster is used as the initial position of the resource.

[0071] In this embodiment, the trajectory data of the passenger's intention demand points are analyzed through a clustering model, the noise interference data of the passenger's intention is removed, and the number of resource configurations can be accurately determined according to the amount of clustering, so as to match the type of resource delivery with the type of user demand, and realize on-demand deployment of service resources, reducing redundancy.

[0072] S202. For each resource, the deployment quantity and resource deployment points of the resource are iteratively optimized based on the initial position and initial quantity of the resource, until the resource coverage rate of the resource meets the preset conditions, and the final deployment quantity and resource deployment points of the resource are obtained, wherein the resource coverage rate is determined based on the coverage area radius, deployment quantity and resource deployment points corresponding to the resource.

[0073] Specifically, the resource deployment points of the resource can be iteratively optimized based on the initial position of the resource so that the resource coverage reaches the maximum value. If the maximum value of the resource coverage does not meet the preset conditions, the number of resource deployments is increased by 1 and a new resource deployment point is added. Based on the resource deployment points obtained in the previous round of optimization and the newly added resource deployment points, the resource deployment points of the resource are iteratively optimized to achieve the maximum resource coverage, wherein the initial value of the number of resource deployments is the initial number of resources.

[0074] It is understandable that the main goal of service resource site selection is to meet a certain functional service coverage rate in the area with dense intention points. When optimizing the target, the final target point should be optimized according to the coordinate value of the geometric center of each cluster provided by the clustering model. Any barrier-free service resource has its own service scope, and the service scope is mainly based on the choice willingness of passengers. Service coverage rate refers to the ability of deployed service resources to cover the barrier-free service needs of users to the greatest extent, where the coverage area of ​​the service resource is assumed to be circular, and the passengers in the circular area are considered to be covered, and the proportion of the number of covered passengers is the service coverage rate. Due to the difference in the types of service resources, the area of ​​the service coverage area is also different, which can be determined by the coverage area radius, where the coverage area radius can be determined by parameter settings. In the process of resource site selection, the threshold of passenger service coverage rate to be achieved can also be set by parameters, so that the agreed algorithm can be repeatedly iterated when the coverage rate does not meet the standard until the passenger service target coverage rate meets the standard. For example, the service target coverage rate of barrier-free service resources for users can be set to 95%, the coverage area radius can be set to 90 meters, and then the preset algorithm can be used to calculate the service resource deployment point.

[0075] Optionally, the preset algorithm may be one or more of a hill climbing algorithm, a genetic algorithm, a steepest descent method, a simulated annealing method, a particle swarm algorithm and a taboo search algorithm.

[0076] Specifically, in each iteration of the resource deployment points, the resource coverage range of each resource deployment point is determined based on the resource coverage area radius and the resource deployment points obtained through this iterative optimization, and then the resource demand points falling within each resource coverage range are allocated to the corresponding resource deployment points based on the coordinate values ​​of each resource demand point in each cluster obtained by clustering and the resource coverage range of each resource deployment point. Among them, a resource demand point can only be allocated to a unique resource deployment point. Then the total number M1 of resource demand points allocated to each resource deployment point is determined, and based on the total number M1 and the total number M2 of resource demand points contained in all clusters obtained by clustering (i.e., the total number of resource demand points in the demand location distribution map after removing noise points), the resource coverage rate after this iterative optimization is determined. Specifically, resource coverage rate = (M1 / M2) × 100%.

[0077] Among them, in the process of allocating resource demand points falling within the resource coverage range to corresponding resource deployment points based on the coordinate values ​​of each resource demand point in the demand location distribution map after removing noise points and the resource coverage range of each resource deployment point, if the resource demand point only falls within the resource coverage range of a single resource deployment point, the resource demand point is allocated to the resource deployment point; if the resource demand point falls within the resource coverage range of at least two resource deployment points at the same time, the distances from the resource demand point to the above-mentioned at least two resource deployment points are calculated respectively, and the resource demand point is allocated to a resource deployment point closest to the resource demand point.

[0078] As an implementable manner, for resource demand points that only fall within the coverage of a single resource, if the number of resource demand points allocated to the resource deployment point exceeds the service capacity value S, then multiple resource demand points that are farther away are removed according to the distances from each resource demand point to the resource deployment point, to ensure that the number of resource demand points allocated to each resource deployment point does not exceed S. For example, assuming that the number of resource demand points allocated to the resource deployment point is 178 and the service capacity value S is 177, then the resource deployment point that is farthest from the resource deployment point can be removed.

[0079] As another achievable method, for resource demand points that fall into multiple resource coverage ranges at the same time, if the number of resource demand points allocated to the closest resource deployment point has reached S, then the resource demand point is allocated to the second closest resource deployment point. If the quota of the second closest resource deployment point also reaches the service capacity value S, then it is allocated to the third closest resource deployment point, and so on. For example, in the process of allocating resource demand points that fall into the resource coverage range to the corresponding resource deployment points, assuming that resource demand point h falls into the resource coverage range of three resource deployment points a, b, and c at the same time, it can be determined first according to the distance between resource demand point h and the three resource deployment points a, b, and c, that the distance between resource demand point h and resource deployment point a is the shortest, followed by the distance between resource deployment point b, and then the distance between resource demand point h and resource deployment point c is the farthest. And if the number of resource demand points allocated to the resource deployment point a has reached the service capacity value S, then determine whether the number of resource demand points allocated to the resource deployment point b has reached the corresponding service capacity value S; if the number of resource demand points allocated to the resource deployment point b has reached the corresponding service capacity value S, and the number of resource demand points allocated to the resource deployment point c has not reached the corresponding service capacity value S, then allocate the resource demand point h to the resource deployment point c.

[0080] It should be noted that the resource coverage rate refers to the ratio of the total number of resource demand points allocated to each resource deployment point to the number of resource demand points in the demand location distribution map after removing noise points. The set of covered demand points corresponding to the total number of demand points M1 allocated to each resource deployment point can be expressed by the following formula:

[0081]

[0082] in, It refers to the set of covered demand points corresponding to the total number of demand points M1 allocated to each resource deployment point, that is, the set of points covered by each resource T, which are combined to obtain the total set of covered demand points. TS refers to the resource set. The constraint condition is that the number of resource sets TS is the minimum.

[0083] Optionally, the resource coverage objective function can be expressed as f CT To express, given the known number of resources deployed for each type, we can obtain the resource coverage. If the resource coverage f CT The value of can reach 1, that is, when the resource coverage rate reaches 100%, the service resource location model can achieve the optimal coverage level. At this time, the resource deployment point is the optimal solution we seek, that is, the optimal objective function f_CT can be expressed by the following formula:

[0084]

[0085] in, It refers to the set of covered demand points corresponding to the total number of demand points M1 allocated to each resource deployment point, and |US| refers to the point set corresponding to the total number of resource demand points M2 contained in all clusters obtained by clustering.

[0086] It should be noted that a genetic algorithm can be used to iteratively optimize the deployment points of resources so that when the resource coverage rate reaches the maximum value, the optimal solution can be calculated through the processes of encoding, initializing the population, selection, crossover, mutation, etc.

[0087] For example, assume that the resource types extracted from the acquired passenger's intention demand information are water dispensers and service equipment, where the water dispenser resource corresponds to the "pay" intention demand information, and the service equipment resource corresponds to the "ask_for_directions" intention demand information. The trajectory point coordinates of the above two resource intentions are as follows: Fig.10 and Fig.11 As shown in the figure, the intent field represents the content of the intent requirement information, and x and y represent the horizontal and vertical coordinates of the intent point.

[0088] Then, we build a clustering analysis environment through tool libraries such as sklearn, geatpy, and matplotlib. We can first set the pre-operation parameters of the DBSCAN clustering model, that is, obtain the domain radius of the clustering model epsilon = 50 and the minimum number of cluster points min_samples = 50 to form a cluster, so that the service resource parameter configuration is as follows: Fig.12 The demand location distribution diagrams of “water dispenser” and “service equipment” resource deployment are generated by using the DBSCAN clustering model and the geometric center method. The demand location distribution diagrams can be found in Fig.13 As shown, Fig.13 a is the demand location distribution map corresponding to the water dispenser, Fig.13 b is the demand location distribution map corresponding to the service equipment.

[0089] After obtaining the demand location distribution map, the service coverage area radius of "water dispenser" and "service equipment" can be set to 90 meters and 50 meters respectively; the initial population size is 100; and the resource coverage rate is 95%. Among them, the number of genetic algorithm iterations does not need to be set manually, and the calculation automatically stops after reaching or exceeding the target coverage rate. When the resource coverage rate cannot converge to meet the resource coverage rate requirements, and the limit value of N consecutive convergences remains unchanged, the program will automatically increase the number of resources in the genetic algorithm and perform genetic calculations again until the resource coverage rate requirements are met. For the judgment of the N value, through testing and experience, N=30 can be set in this program. After the genetic algorithm parameters are set, the algorithm operation begins to optimize the service resource deployment coordinates and quantity, and proposes planning and deployment suggestions for service resources.

[0090] Among them, for the optimization process of service resources such as "water dispenser" and "service equipment", Fig.14 The figure shows the number of algorithm optimization iterations corresponding to the process of achieving resource coverage. Fig.14 a is a schematic diagram of the algorithm optimization iteration times corresponding to the water dispenser. Fig.14 b is a schematic diagram of the algorithm optimization iteration times corresponding to the service device.

[0091] After the above iterative optimization, the deployment plan of the service resource "water dispenser" is obtained as follows Fig.15 As shown in a, the deployment plan of the service resource "service equipment" is as follows Fig.15 As shown in Figure b, the red dot is the deployment coordinate point of the resource, and the circle around it represents the service coverage of the resource. The service coverage includes 95% of all intention points except noise points, which means that the coverage target requirement is met. The planning and deployment suggestions for the service resource "water dispenser" are as follows: Fig.16 As shown in a, the planning and deployment suggestions for the service resource "service equipment" are as follows Fig.16 As shown in b, the planning deployment suggestion includes the number of resources of this type to be deployed and the deployment points of each type of resources.

[0092] The airport barrier-free service resource planning method provided in the embodiment of the present application obtains the intention demand information of the passenger and the coordinate value corresponding to the intention demand information, the coordinate value is the coordinate position of the passenger when sending the intention demand information, and determines the resource type corresponding to each intention demand information, and determines the demand location distribution map of each resource based on the resource type and coordinate value corresponding to each intention demand information, and determines the deployment quantity and resource deployment points of each resource based on the demand location distribution map and coverage area radius of each resource. This technical solution can quickly determine the quantity and location of each type of resource deployment based on the intention demand information of the passenger, so as to provide the airport with reasonable suggestions for the deployment of passenger service resources, optimize the types and quantities of resource deployment, save the airport investment cost and maintenance expenses, improve the service level of passenger travel, and also increase passenger satisfaction.

[0093] It should be noted that although the operations of the method of the present invention are described in a particular order in the accompanying drawings, this does not require or imply that the operations must be performed in this particular order, or that all the operations shown must be performed to achieve the desired results. On the contrary, the steps depicted in the flow chart can be performed in a different order. Additionally or alternatively, some steps can be omitted, multiple steps can be combined into one step, and / or one step can be decomposed into multiple steps.

[0094] on the other hand, Fig.17 The schematic diagram of the structure of the airport barrier-free service resource planning device provided by the embodiment of the present invention. Fig.17As shown, the device can be implemented as Figure 2-3 The method shown, the apparatus may include:

[0095] An acquisition module 10 is used to acquire the passenger's intention demand information and the coordinate value corresponding to the intention demand information, where the coordinate value is the coordinate position of the passenger when sending the intention demand information;

[0096] A type determination module 20, used to determine the resource type corresponding to each intention requirement information;

[0097] A distribution confirmation module 30 is used to determine the resource type and coordinate value corresponding to each intended demand information, and determine the demand location distribution map of each resource;

[0098] The location determination module 40 is used to determine the deployment quantity and resource deployment points of each type of resource deployment based on the required location distribution map and coverage area radius of each resource.

[0099] Optionally, the location determination module 40 is specifically used for:

[0100] Based on the demand location distribution map of each resource, a clustering algorithm is used to determine the initial quantity and initial location of each resource;

[0101] For each resource, the deployment quantity and resource deployment points of the resource are iteratively optimized based on the initial position and initial quantity of the resource until the resource coverage rate of the resource meets the preset conditions, and the final deployment quantity and resource deployment points of the resource are obtained, where the resource coverage rate is determined based on the coverage area radius, deployment quantity and resource deployment points corresponding to the resource.

[0102] Optionally, the location determination module 40 is specifically used for:

[0103] Using a density-based clustering algorithm to cluster the resource demand points in the demand location distribution map to obtain at least one cluster;

[0104] Removing noise points in the demand location distribution map, where the noise points are resource demand points that do not belong to any cluster;

[0105] Determine the initial quantity of resources according to the number of resource demand points in the demand location distribution map after removing noise points and the service capacity value corresponding to the resources;

[0106] The initial location of the resource is determined based on the geometric center of each cluster.

[0107] Optionally, the location determination module 40 is further configured to:

[0108] If the initial number is less than the number of clusters, N clusters are deleted in order of the number of resource demand points contained in the clusters from small to large, and the geometric center of each remaining cluster is used as the initial position of the resource, where N is equal to the difference between the number of clusters and the initial number;

[0109] If the initial number is equal to the number of clusters, the geometric center of each cluster is used as the initial position of the resource.

[0110] Optionally, the location determination module 40 is further configured to:

[0111] Based on the initial location of the resources, the resource deployment points of the resources are iteratively optimized to maximize the resource coverage;

[0112] If the maximum value of the resource coverage rate does not meet the preset conditions, the number of resource deployments increases by 1 and a new resource deployment point is added. Based on the resource deployment points obtained in the previous round of optimization and the newly added resource deployment points, the resource deployment points of the resources are iteratively optimized to make the resource coverage rate reach the maximum value, wherein the initial value of the number of resource deployments is the initial number.

[0113] Optionally, the location determination module 40 is further configured to:

[0114] Based on the resource coverage area radius and the resource deployment points obtained through this iterative optimization, determine the resource coverage range of each resource deployment point;

[0115] Based on the coordinate values ​​of each resource demand point in the at least one cluster and the resource coverage range of each resource deployment point, allocating the resource demand points falling within the resource coverage range to the corresponding resource deployment points;

[0116] Determine the total number M1 of resource demand points allocated to each resource deployment point;

[0117] Based on the total number M1 and the total number M2 of resource demand points included in the at least one cluster, the resource coverage rate after this iterative optimization is determined.

[0118] Optionally, the location determination module 40 is further configured to:

[0119] If the resource demand point only falls within the resource coverage of a single resource deployment point, the resource demand point is allocated to the single resource deployment point;

[0120] If a resource demand point falls within the resource coverage of at least two resource deployment points at the same time, the resource demand point is allocated to a resource deployment point that is closest to the resource demand point among the at least two resource deployment points.

[0121] The airport barrier-free service resource planning device provided in this embodiment can execute the embodiment of the above method. Its implementation principle and technical effects are similar and will not be repeated here.

[0122] Fig.18 A schematic diagram of the structure of a computer device provided by an embodiment of the present invention. Fig.18 As shown, it shows a schematic diagram of the structure of a computer system 700 of a terminal device or server suitable for implementing an embodiment of the present application.

[0123] like Fig.18 As shown, computer system 700 includes a central processing unit (CPU) 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage part 708 into a random access memory (RAM) 703. Various programs and data required for the operation of system 700 are also stored in RAM 703. CPU 701, ROM 702 and RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 706 is also connected to bus 704.

[0124] The following components are connected to the I / O interface 705: an input section 706 including a keyboard, a mouse, etc.; an output section 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, a modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 706 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage section 708 as needed.

[0125] In particular, according to the embodiments of the present disclosure, the above reference Figure 2 The described processes may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising a computer program for executing Figure 2 In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 709 and / or installed from the removable medium 711.

[0126] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of the code, and the aforementioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0127] The units or modules involved in the embodiments described in the present application may be implemented by software or hardware. The units or modules described may also be set in a processor. For example, they may be described as: a processor includes an acquisition module, a quantity determination module, a construction module, and a location determination module. The names of these units or modules do not, in some cases, constitute limitations on the units or modules themselves. For example, the acquisition module may also be described as "used to obtain the passenger's intention demand information and corresponding coordinate values."

[0128] As another aspect, the present application further provides a computer-readable storage medium, which may be the computer-readable storage medium included in the aforementioned device in the above embodiment; or may be a computer-readable storage medium that exists independently and is not assembled into the device. The computer-readable storage medium stores one or more programs, and the aforementioned programs are used by one or more processors to execute the airport barrier-free service resource planning method described in the present application.

[0129] In summary, the airport barrier-free service resource planning method, device, equipment and medium provided in the embodiments of the present application obtain the passenger's intention demand information and the coordinate value corresponding to the intention demand information, which is the coordinate position of the passenger when sending the intention demand information, and determine the resource type corresponding to each intention demand information, and determine the demand location distribution map of each resource based on the resource type and coordinate value corresponding to each intention demand information, and determine the deployment quantity and resource deployment points of each resource based on the demand location distribution map and coverage area radius of each resource. This technical solution can quickly determine the quantity and location of each type of resource deployment based on the passenger's intention demand information, so as to provide the airport with reasonable suggestions for the deployment of passenger service resources, optimize the types and quantities of resource deployment, save the airport's investment costs and maintenance expenses, improve the service level of passenger travel, and also increase passenger satisfaction.

[0130] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the inventive concept. For example, the above features are replaced with (but not limited to) technical features with similar functions disclosed in the present application.

Claims

1. A method for planning airport barrier-free service resources, characterized in that: The method comprises: Acquire the passenger's intention demand information and the corresponding coordinate value, where the coordinate value is the coordinate position of the passenger when sending the intention demand information; Determine the resource type corresponding to each intent requirement information; Based on the resource type and coordinate value corresponding to each intention demand information, determine the demand location distribution map of each resource; Determine the deployment quantity and resource deployment points of each resource based on the required location distribution map and coverage area radius of each resource; Based on the required location distribution map and coverage area radius of each resource, determine the deployment quantity and resource deployment points of each resource, including: Based on the demand location distribution map of each resource, a clustering algorithm is used to determine the initial quantity and initial location of each resource; For each resource, the number of resource deployments and resource deployment points are iteratively optimized based on the initial position and initial number of resources until the resource coverage rate of the resource meets the preset conditions, and the final number of resource deployments and resource deployment points are obtained, where the resource coverage rate is determined based on the coverage area radius, deployment number and resource deployment points corresponding to the resource; Based on the demand location distribution map of each resource, a clustering algorithm is used to determine the initial quantity and initial location of each resource, including: Using a density-based clustering algorithm to cluster the resource demand points in the demand location distribution map to obtain at least one cluster; Removing noise points in the demand location distribution map, where the noise points are resource demand points that do not belong to any cluster; Determine the initial quantity of resources according to the number of resource demand points in the demand location distribution map after removing noise points and the service capacity value corresponding to the resources; The initial quantity of each resource is determined by the following steps: For any type of resource, obtain the total number N of resource demand points in the demand location distribution map after removing noise points total The service capacity value S corresponding to the resource; According to N total and S, determine the estimated value of resource quantity N PRE =N total / S; If N PRE is not less than the number of clusters obtained by clustering, the estimated value of the number of resources is used as the initial number of resource deployment; if N PRE If it is greater than the number of clusters obtained by clustering, the number of clusters is used as the initial number of resource deployment; Determine the initial location of the resource based on the geometric center of each cluster; The determining of the initial position of the resource based on the geometric center of each cluster includes: According to the coordinate values ​​corresponding to the resource demand points in each cluster, determine the horizontal coordinate value and the vertical coordinate value corresponding to each resource demand point; The horizontal coordinate values ​​corresponding to each resource demand point of the cluster are added and summed, and the sum is divided by the total number of resource demand points after denoising to obtain the horizontal coordinate value of the geometric center; Add the ordinate values ​​of each resource demand point in the cluster, and divide the sum by the total number of resource demand points after denoising to obtain the ordinate value of the geometric center; Based on the horizontal coordinate value and the vertical coordinate value of the geometric center, the coordinate value of the geometric center is determined, and then the coordinate point set of the geometric center in all clusters is obtained; If the initial number is less than the number of clusters, N clusters are deleted in order of the number of resource demand points contained in the clusters from small to large, and the geometric center of each remaining cluster is used as the initial position of the resource, where N is equal to the difference between the number of clusters and the initial number.

2. The method according to claim 1, characterized in that Based on the initial position and initial quantity of resources, the deployment quantity and resource deployment points of resources are iteratively optimized, including: Based on the initial location of the resources, the resource deployment points of the resources are iteratively optimized to maximize the resource coverage; If the maximum value of the resource coverage rate does not meet the preset conditions, the number of resource deployments increases by 1 and a new resource deployment point is added. Based on the resource deployment points obtained in the previous round of optimization and the newly added resource deployment points, the resource deployment points of the resources are iteratively optimized to make the resource coverage rate reach the maximum value, wherein the initial value of the number of resource deployments is the initial number.

3. The method according to claim 1, characterized in that: In each iterative optimization process, the method further comprises: Based on the resource coverage area radius and the resource deployment points obtained through this iterative optimization, determine the resource coverage range of each resource deployment point; Based on the coordinate values ​​of each resource demand point in the at least one cluster and the resource coverage range of each resource deployment point, allocating the resource demand points falling within the resource coverage range to the corresponding resource deployment points; Determine the total number M1 of resource demand points allocated to each resource deployment point; Based on the total number M1 and the total number M2 of resource demand points included in the at least one cluster, the resource coverage rate after this iterative optimization is determined.

4. The method according to claim 3, characterized in that Based on the coordinate values ​​of each resource demand point in the at least one cluster and the resource coverage range of each resource deployment point, allocating the resource demand points falling within the resource coverage range to the corresponding resource deployment point includes: If the resource demand point only falls within the resource coverage of a single resource deployment point, the resource demand point is allocated to the single resource deployment point; If a resource demand point falls within the resource coverage of at least two resource deployment points at the same time, the resource demand point is allocated to a resource deployment point that is closest to the resource demand point among the at least two resource deployment points.

5. An airport barrier-free service resource planning device, characterized in that: The device comprises: An acquisition module, used to acquire the passenger's intention demand information and a coordinate value corresponding to the intention demand information, wherein the coordinate value is the coordinate position of the passenger when sending the intention demand information; A type determination module is used to determine the resource type corresponding to each intention requirement information; A distribution determination module is used to determine the resource type and coordinate value corresponding to each intention demand information, and determine the demand location distribution map of each resource; A location determination module, used to determine the deployment quantity and resource deployment points of each type of resource deployment based on the required location distribution map and coverage area radius of each resource; Based on the demand location distribution map of each resource, a clustering algorithm is used to determine the initial quantity and initial location of each resource; For each resource, the number of resource deployments and resource deployment points are iteratively optimized based on the initial position and initial number of resources until the resource coverage rate of the resource meets the preset conditions, and the final number of resource deployments and resource deployment points are obtained, where the resource coverage rate is determined based on the coverage area radius, deployment number and resource deployment points corresponding to the resource; Using a density-based clustering algorithm to cluster the resource demand points in the demand location distribution map to obtain at least one cluster; Removing noise points in the demand location distribution map, where the noise points are resource demand points that do not belong to any cluster; Determine the initial quantity of resources according to the number of resource demand points in the demand location distribution map after removing noise points and the service capacity value corresponding to the resources; For any type of resource, obtain the total number N of resource demand points in the demand location distribution map after removing noise points total The service capacity value S corresponding to the resource; According to N total and S, determine the estimated value of resource quantity N PRE =N total / S; If N PRE is not less than the number of clusters obtained by clustering, the estimated value of the number of resources is used as the initial number of resource deployment; if N PRE If it is greater than the number of clusters obtained by clustering, the number of clusters is used as the initial number of resource deployment; Determine the initial location of the resource based on the geometric center of each cluster; According to the coordinate values ​​corresponding to the resource demand points in each cluster, determine the horizontal coordinate value and the vertical coordinate value corresponding to each resource demand point; The horizontal coordinate values ​​corresponding to each resource demand point of the cluster are added and summed, and the sum is divided by the total number of resource demand points after denoising to obtain the horizontal coordinate value of the geometric center; Add the ordinate values ​​of each resource demand point in the cluster, and divide the sum by the total number of resource demand points after denoising to obtain the ordinate value of the geometric center; Based on the horizontal coordinate value and the vertical coordinate value of the geometric center, the coordinate value of the geometric center is determined, and then the coordinate point set of the geometric center in all clusters is obtained; If the initial number is less than the number of clusters, N clusters are deleted in order of the number of resource demand points contained in the clusters from small to large, and the geometric center of each remaining cluster is used as the initial position of the resource, where N is equal to the difference between the number of clusters and the initial number.

6. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 4 is implemented.

7. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is configured to implement the method according to any one of claims 1 to 4 when executed by a processor.

Citation Information

Patent Citations

  • Resource allocation method and device

    CN109492848A

  • Vehicle resource deployment method and device

    CN110298558A