Competition arrangement method and device, terminal equipment and storage medium

Abstract

The invention is suitable for the technical field of data processing, and provides a match arrangement method and device, terminal equipment and a storage medium, and the method comprises the steps: firstly obtaining historical match data, training an initial match schedule arrangement model based on the historical match data, and obtaining a target match schedule arrangement model; inputting the current match data into the target match schedule arrangement model to obtain a match schedule table of the current match; in the competition process, the appearing competition problems are collected; inputting the match problem, the time when the match problem occurs and the match schedule into a target match schedule arrangement model for match schedule arrangement optimization to obtain an optimized match schedule; according to the method and the device, the schedule arrangement of the current match is realized through the target schedule arrangement model, the intelligence of schedule arrangement is realized, the method and the device are suitable for any match, the schedule arrangement speed is improved, and the schedule arrangement error rate is reduced.

Description

Technical Field

[0001] The present application belongs to the field of data processing technology, and in particular, relates to a competition scheduling method, device, terminal equipment and storage medium. Background Art

[0002] As the scale and number of competitions increase, a reasonable schedule arrangement is an important condition for a smooth competition. At present, the schedule of competitions is mostly arranged manually. For competitions with a small number of participating teams and a few types of competitions, manual arrangement is not difficult. However, for competitions with a large scale and a large number of competition categories, manual arrangement is not only slow but also prone to errors. Summary of the invention

[0003] The embodiments of the present application provide a method, apparatus, terminal device and storage medium for scheduling a game, which can solve the problem that manual scheduling is not only slow but also prone to errors.

[0004] In a first aspect, an embodiment of the present application provides a method for arranging a competition, comprising:

[0005] Acquire current game data, the current game data including current game category, current competition information corresponding to each current game category and game constraint conditions corresponding to each current game category, the current competition information including current participating teams, current competition venue and current game time;

[0006] Inputting the current game data into the target game schedule model to obtain the game schedule of the current game;

[0007] During the competition, collect the competition problems that occur, wherein the competition problems include the absence of participating teams and / or the failure of the current competition venue;

[0008] The game problem, the time when the game problem occurs and the game schedule are input into the target game schedule model to optimize the game schedule, so as to obtain an optimized game schedule.

[0009] In a possible implementation manner of the first aspect, the competition constraint condition includes at least one of a fairness constraint among participating teams, a competition venue constraint, and a competition interval duration constraint.

[0010] In a possible implementation manner of the first aspect, before obtaining the current game data, the method further includes:

[0011] Acquire historical game data, wherein the historical game data includes historical game categories, historical competition information corresponding to each of the historical game categories, and game constraints corresponding to each of the historical game categories, and the historical competition information includes historical participating teams, historical competition venues, and historical competition times;

[0012] The initial schedule scheduling model is trained based on the historical game data, and the parameters in the initial schedule scheduling model are optimized to obtain a target schedule scheduling model, where the target schedule scheduling model is the initial schedule scheduling model after the parameters are optimized.

[0013] In a possible implementation of the first aspect, the training of the initial schedule scheduling model based on the historical game data, optimizing the parameters in the initial schedule scheduling model, and obtaining the target schedule scheduling model includes:

[0014] Training the initial schedule scheduling model based on the historical game data, optimizing the parameters in the initial schedule scheduling model, and obtaining a candidate schedule scheduling model;

[0015] The candidate schedule scheduling model is optimized based on the optimization model to obtain the target schedule scheduling model, wherein the optimization model includes a genetic algorithm model and / or a simulated annealing algorithm model.

[0016] In a possible implementation of the first aspect, inputting the current game data into the target game schedule model to obtain a game schedule for the current game includes:

[0017] Performing data cleaning and standardization processing on the current game data to obtain standard data of the current game data;

[0018] Performing data processing on the standard data to obtain key information in the standard data, wherein the data processing includes at least one of keyword extraction, sentiment analysis, and topic modeling;

[0019] Extracting features of the key information to obtain numerical features and text features in the key information;

[0020] The numerical features and the text features are input into the target game schedule model to obtain the game schedule of the current game.

[0021] In a possible implementation manner of the first aspect, after inputting the current game data into the target game schedule model to obtain a game schedule for the current game, the method further includes:

[0022] Performing text recognition on the match schedule to obtain a match schedule corresponding to each current match venue and a match schedule corresponding to each current match category;

[0023] Based on the match arrangement corresponding to each current match venue and the match arrangement corresponding to each current match category, the eligibility of the match schedule is determined.

[0024] In a possible implementation manner of the first aspect, determining the eligibility of the game schedule based on the game arrangement corresponding to each current game venue and the game arrangement corresponding to each current game category includes:

[0025] Based on the match schedule corresponding to each current match venue, determine the number of matches that exist in the current match venue in the same time period;

[0026] Based on the match arrangement corresponding to each current match category, determine the time of each match stage corresponding to the current match category;

[0027] If the number of matches existing in a current competition venue in the same time period is greater than a preset number, and / or there are at least two competition stages of the same competition category in one day, the schedule is determined to be unqualified;

[0028] If the number of matches existing in a current competition venue in the same time period is less than or equal to a preset number, and there is a competition stage of the same competition category in one day, it is determined that the schedule is qualified.

[0029] In a second aspect, an embodiment of the present application provides a competition arrangement device, including:

[0030] A current data acquisition module, used to acquire current game data, wherein the current game data includes the current game category, current competition information corresponding to each current game category, and game constraints corresponding to each current game category, wherein the current competition information includes the current participating team, the current competition venue, and the current game time;

[0031] A data output module, used for inputting the current game data into the target game schedule model to obtain a game schedule for the current game;

[0032] A problem collection module is used to collect the problems that occur during the competition, wherein the competition problems include the absence of participating teams and / or the failure of the current competition venue;

[0033] The result output module is used to input the game problem, the time when the game problem occurs and the game schedule into the target game schedule model to optimize the game schedule and obtain an optimized game schedule.

[0034] In a third aspect, an embodiment of the present application provides a terminal device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method for arranging a game described in any one of the first aspects above is implemented.

[0035] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method for arranging a game described in any one of the first aspects above is implemented.

[0036] In a fifth aspect, an embodiment of the present application provides a computer program product. When the computer program product is run on a terminal device, the terminal device executes the method for arranging a game as described in any one of the first aspects above.

[0037] Compared with the prior art, the beneficial effects of the first aspect of the embodiment of the present application are as follows: the present application first obtains the current game data, inputs the current game data into the target schedule model, and obtains the schedule of the current game; during the game, collects the game problems that occur, and the game problems include the absence of participating teams and / or the current game venue malfunctions; the game problems, the time when the game problems occur, and the schedule are input into the target schedule model for schedule optimization to obtain an optimized schedule; the present application implements the schedule of the current game through the target schedule model, and automatically optimizes the schedule after the game problems occur, thereby realizing the intelligent schedule. The present application is applicable to any game, improves the speed of schedule scheduling, and reduces the error rate of schedule scheduling.

[0038] It can be understood that the beneficial effects of the second to fifth aspects mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0040] Figure 1 It is a flowchart of a model training method provided in one embodiment of the present application;

[0041] Figure 2 is a flowchart of a model training method provided by another embodiment of the present application;

[0042] Figure 3 It is a flowchart of a method for arranging a competition provided in an embodiment of the present application;

[0043] Figure 4 It is a flowchart of a method for determining a game schedule provided in an embodiment of the present application;

[0044] Figure 5 It is a flowchart of a method for testing the eligibility of a game schedule provided in an embodiment of the present application;

[0045] Figure 6 It is a structural schematic diagram of a game arrangement device provided in one embodiment of the present application;

[0046] Figure 7 It is a structural diagram of a terminal device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0047] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0048] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0049] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.

[0050] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.

[0051] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the phrases "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. appearing in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways.

[0052] Competition refers to activities that compare skills and techniques in sports, production and other activities. Competition can not only test the strength of the participants and promote their growth, but also inspire their sense of honor and enhance their teamwork ability.

[0053] For all kinds of competitions, reasonable planning of competition time is the prerequisite for a smooth competition. At present, most competitions need to arrange the competition time manually. For large-scale competitions, manual arrangement of competition time not only wastes manpower, but also is prone to errors.

[0054] Based on the above problems, this application proposes a method for scheduling a game. The trained game scheduling model can directly output the game schedule, which saves the time of manual scheduling and improves the qualification rate of the game scheduling.

[0055] Before introducing the competition scheduling method of the present application, the method for determining the target schedule scheduling model used in the present application is explained.

[0056] Specifically, Figure 1 As shown in the figure, the process of determining the target schedule model includes:

[0057] S101, obtaining historical game data.

[0058] The historical game data includes historical game categories, historical competition information corresponding to each of the historical game categories, and game constraints corresponding to each of the historical game categories. The historical competition information includes historical participating teams, historical competition venues, and historical competition times.

[0059] In this embodiment, the historical game categories may include table tennis singles games, table tennis doubles games, badminton singles games, youth robot games, etc.

[0060] Historical participating teams may include the names of participating teams, the number of players in each participating team, the country or school of each participating team, etc. Historical venues may include the venue name, venue capacity, and venue location, etc.

[0061] The historical match time may include the match time period and unused time period for each match category, etc.

[0062] The competition constraints represent some competition restrictions for a smooth competition. The competition constraints may include at least one of the fairness constraints between participating teams, the competition venue constraints, and the competition interval time constraints. Of course, the competition constraints may also include other constraints, which are specifically determined according to the competition category and are not limited here.

[0063] The fairness constraints between participating teams may include the number of matches for each participating team, the number of participants, and the interval between matches. The interval between matches for each participating team may be determined according to the type of competition. In order to ease the tension of the participants, the same participating team may be arranged to avoid consecutive matches. For example, if the fairness constraints between participating teams include that the interval between matches for each participating team is 1 day, participating team A can continue to compete on the third day after competing on the first day.

[0064] The constraints of the competition venue include the frequency of use of the competition venue and the maintenance time of the competition venue.

[0065] The time interval constraints between games include the time interval between different games, the time interval between different stages of the same game, etc.

[0066] In this embodiment, the competition constraint condition may also include a priority constraint. The existence of the priority constraint can reasonably arrange the order of the competition. For example, the priority of a table tennis singles competition is higher than the priority of a table tennis team competition. Therefore, when scheduling the competition, the table tennis singles competition needs to be arranged before the table tennis team competition.

[0067] In this embodiment, after obtaining the historical game data, it is necessary to verify the historical game data to supplement the missing data and correct the erroneous data to obtain the target historical game data, and use the target historical game data for model training.

[0068] In this embodiment, after obtaining the target historical game data, natural language processing technology can be used to analyze and extract the target historical game data to obtain target data, and the target data can be used for model training.

[0069] S102, training an initial schedule scheduling model based on the historical game data, optimizing parameters in the initial schedule scheduling model, and obtaining a target schedule scheduling model.

[0070] In this embodiment, based on historical game data, the initial schedule scheduling model is trained using a deep learning algorithm and / or a reinforcement learning algorithm to obtain a target schedule scheduling model.

[0071] Specifically, the historical match data is input into the initial schedule scheduling model to output a first result; based on the first result, the parameters in the initial schedule scheduling model are modified to obtain a first candidate model; the historical match data is input into the first candidate model to output a second result; based on the second result, the parameters in the first candidate model are modified to obtain a second candidate model; the cycle is repeated until the preset number of training times is reached, the training is terminated, and the target schedule scheduling model is obtained.

[0072] Using historical match data to train the initial schedule scheduling model not only provides data support for model training, but also makes the trained initial schedule scheduling model more accurate.

[0073] like Figure 2 As shown, in a possible implementation manner, the implementation process of step S102 may include:

[0074] S1021, training the initial schedule scheduling model based on the historical game data, optimizing the parameters in the initial schedule scheduling model, and obtaining a candidate schedule scheduling model.

[0075] S1022, optimizing the candidate schedule scheduling model based on the optimization model to obtain the target schedule scheduling model, wherein the optimization model includes a genetic algorithm model and / or a simulated annealing algorithm model.

[0076] In this embodiment, after obtaining the candidate schedule scheduling model, the candidate schedule scheduling model can be optimized using a genetic algorithm model to obtain a target schedule scheduling model.

[0077] Alternatively, after obtaining the candidate schedule scheduling model, the candidate schedule scheduling model can be optimized using a simulated annealing algorithm model to obtain a target schedule scheduling model.

[0078] Alternatively, after obtaining the candidate schedule scheduling model, the candidate schedule scheduling model is first optimized using a genetic algorithm model to obtain a first scheduling model; then the first scheduling model is optimized using a simulated annealing algorithm model to obtain a target schedule scheduling model.

[0079] This application optimizes the candidate schedule scheduling model obtained through training by optimizing the model, which can improve the efficiency and accuracy of the target schedule scheduling model.

[0080] In a possible implementation, the implementation process of step S102 may further include:

[0081] Perform data cleaning and standardization on the historical match data to obtain standard data of the historical match data. Perform data processing on the standard data of the historical match data to obtain key information in the historical match data, wherein the data processing includes at least one of keyword extraction, sentiment analysis, and topic modeling. Perform information extraction on the key information to obtain numerical features and text features in the key information. Input the numerical features and text features into the initial schedule arrangement model to train the initial schedule arrangement model and obtain the target schedule arrangement model.

[0082] In this embodiment, before the historical game data is cleaned and standardized, the historical game data may be checked to supplement the missing data and correct the erroneous data.

[0083] Next, the game scheduling method of the embodiment of the present application is described in detail in combination with the target schedule scheduling model.

[0084] Figure 3 A schematic flow chart showing the arrangement of the competition provided by the present application is shown, with reference to Figure 3 , the method is described in detail as follows:

[0085] S201, obtaining current game data.

[0086] The current game data includes the current game category, current competition information corresponding to each of the current game categories, and game constraints corresponding to each of the current game categories. The current competition information includes the current participating team, the current competition venue, and the current game time.

[0087] In this embodiment, the description of step S201 refers to the above step S101 and will not be repeated here.

[0088] S202, input the current game data into the target game schedule model to obtain a game schedule for the current game.

[0089] In this embodiment, the game schedule may include the game time, corresponding participating teams, referees, etc. of each game stage corresponding to each current game category.

[0090] S203, collecting competition problems that occur during the competition, wherein the competition problems include the absence of participating teams and / or the failure of the current competition venue.

[0091] In this embodiment, the method for collecting information on absent teams includes: manually inputting the name of the absent team, the corresponding competition category and competition stage, etc.; or requiring the participating team to register for the competition on an electronic device before the competition. If the registration information of the participating team is not received before the competition, it is determined that the participating team is absent.

[0092] The information collection method of the current competition venue failure includes: manually inputting the failure information, failure time, etc. Alternatively, determining that the current competition venue failure occurs through images collected by a camera.

[0093] Specifically, the method of determining that the current competition venue has a fault through images collected by the camera includes:

[0094] Acquire the venue images of each current competition venue; perform image recognition on the venue images to determine whether the various competition facilities in each current competition venue meet the facility requirements; if it is determined that the competition facilities of the current competition venue do not meet the facility requirements, determine that the current competition venue has a fault. Pre-set the facility requirements corresponding to different current competition venues, and the competition facilities may include competition supplies (ping-pong tables, badminton nets, etc.), lighting, etc.

[0095] For example, the net in a badminton competition venue should be set in the middle area of ​​the venue. Image recognition can be used to determine whether the net deviates from the middle area. For the lights in the current competition venue, it can be determined based on the venue image whether any of the lights are not lit. If a preset number of lights are not lit, it is determined that there is a fault in the current competition venue.

[0096] S204, inputting the game problem, the time when the game problem occurs and the game schedule into the target game schedule arrangement model to obtain an optimized game schedule.

[0097] In this embodiment, the game problem, the time when the game problem occurs and the schedule are input into the target schedule arrangement model, the game arrangement is replanned, and an optimized schedule is obtained, thereby ensuring the dynamic optimization of the schedule, allowing subsequent games to proceed smoothly, and improving the overall event organization efficiency and user satisfaction.

[0098] The present application first obtains current game data, inputs the current game data into a target schedule model, and obtains a schedule for the current game; during the game, collects game problems that occur, and the game problems include absence of participating teams and / or malfunctions of the current game venue; inputs the game problems, the time when the game problems occur, and the schedule into the target schedule model for schedule optimization to obtain an optimized schedule; the present application implements the schedule of the current game through the target schedule model, and automatically optimizes the schedule after the game problems occur, thereby realizing intelligent schedule scheduling. The present application is applicable to any game, improves the speed of schedule scheduling, and reduces the error rate of schedule scheduling.

[0099] This application adds competition constraints during model training and use, ensuring the accuracy and fairness of the schedule arranged using the target schedule scheduling model, and avoiding errors and unfairness caused by human scheduling.

[0100] like Figure 4 As shown, in a possible implementation manner, the implementation process of step S202 may also include:

[0101] S2021, performing data cleaning and standardization processing on the current game data to obtain standard data of the current game data.

[0102] In this embodiment, data cleaning refers to discovering and correcting identifiable errors in data files, including checking data consistency, processing invalid values, missing values, deleting duplicate data, correcting erroneous data, etc.

[0103] Standardization can make the data conform to the expected requirements.

[0104] Specifically, the current game data is first cleaned, and then the cleaned current game data is standardized to obtain standard data of the current game data. The current game data after data cleaning and standardization has the characteristics of completeness and consistency.

[0105] S2022, performing data processing on the standard data to obtain key information in the standard data, wherein the data processing includes at least one of keyword extraction, sentiment analysis and topic modeling.

[0106] In this embodiment, the standard data is processed using natural language processing technology to obtain key information of the standard data. The natural language processing technology includes at least one of keyword extraction, sentiment analysis and topic modeling.

[0107] Keyword extraction is mainly used to extract the most representative and meaningful words or phrases from the text. The keyword extraction method can be term frequency-inverse document frequency (TF-IDF) or linear discriminant analysis (LDA algorithm).

[0108] Sentiment analysis refers to the use of big data technology and natural language processing technology to analyze and mine massive amounts of text data to extract the emotional information contained in the text. Its main purpose is to help people better understand and analyze large amounts of text data and extract useful information from it through computer technology and linguistic knowledge.

[0109] Topic modeling can automatically extract information about different topics from large-scale texts, and help understand the intrinsic structure and topic distribution of text data in big data analysis.

[0110] In the embodiment of the present application, valuable information in the standard data can be obtained by performing data processing on the standard data.

[0111] S2023: extract features from the key information to obtain numerical features and text features in the key information.

[0112] In this embodiment, the numerical features may include the utilization rate of the competition venue, the winning probability of the participating teams, etc. The textual characteristics may include sentiment tendency and theme features, etc.

[0113] S2024, input the numerical features and the text features into the target game schedule model to obtain a game schedule for the current game.

[0114] This application performs data processing and feature extraction on the current game data when scheduling the game, ensuring the integrity and accuracy of the data input into the target schedule scheduling model, making the final schedule table more accurate and complete.

[0115] In a possible implementation, after obtaining the game schedule, the game schedule may be verified to ensure the rationality of the game schedule.

[0116] like Figure 5 Specifically, after step S202, the method may further include:

[0117] S301, performing text recognition on the game schedule to obtain the game schedule corresponding to each current game venue and the game schedule corresponding to each current game category.

[0118] In this embodiment, all the matches arranged for each current match venue are counted. For example, match venue A has match A from 9:00 to 11:00 on the 13th, match B from 15:00 to 17:00 on the 13th, and match C from 9:00 to 11:00 on the 14th; match venue B has match D from 9:00 to 11:00 on the 13th, and match E from 15:00 to 17:00 on the 13th.

[0119] Statistics are kept of the competition schedule corresponding to each current competition category. For example, the competition schedule for the individual competition of the youth robot competition includes: preliminary round from 8:00 to 11:00 on May 11, semi-final from 8:00 to 11:00 on May 12, and final from 8:00 to 10:00 on May 13.

[0120] S302, determining the eligibility of the game schedule based on the game schedule corresponding to each current game venue and the game schedule corresponding to each current game category.

[0121] In this embodiment, based on the competition constraints, the competition arrangement corresponding to each current competition venue and the competition arrangement corresponding to each current competition category are checked to determine the eligibility of the competition schedule.

[0122] If the match arrangement corresponding to each current competition venue and / or the match arrangement corresponding to each current competition category does not meet the competition constraint conditions, the competition schedule is determined to be unqualified. If the match arrangement corresponding to each current competition venue and the match arrangement corresponding to each current competition category meet the competition constraint conditions, the competition schedule is determined to be qualified.

[0123] This application determines the eligibility of the schedule by inspecting the schedule, which is conducive to timely discovering unreasonable schedules and avoiding discovering unreasonable schedules in the middle of the game and thus delaying the progress of the game.

[0124] In a possible implementation, the implementation process of step S302 may include:

[0125] S3021, based on the game arrangement corresponding to each current game venue, determine the number of games existing in the current game venue in the same time period.

[0126] In this embodiment, if competition venue A has only game A from 9:00 to 11:00 on the 13th, the number of games at competition venue A from 9:00 to 11:00 on the 13th is 1. If competition venue B has game A and game B from 9:00 to 11:00 on the 13th, the number of games at competition venue A from 9:00 to 11:00 on the 13th is 2.

[0127] S3022: Based on the game arrangement corresponding to each current game category, determine the time of each game stage corresponding to the current game category.

[0128] For example, the preliminaries for the table tennis singles competition will be held from 8:00 to 11:00 on May 10, the semi-finals will be held from 14:00 to 16:00 on May 12, and the finals will be held from 16:00 to 18:00 on May 14.

[0129] S3023: If the number of games in the same time period at a current competition venue is greater than a preset number, and / or there are at least two competition stages of the same competition category in one day, it is determined that the schedule arrangement is unqualified.

[0130] In this embodiment, the number of games allowed to be played simultaneously corresponding to each current game venue is pre-stored. For example, a table tennis venue has three competition tables, and three games are allowed to be played simultaneously.

[0131] If the number of matches in a current competition venue in the same time period is greater than the preset number, it means that the number of matches in this time period exceeds the range that the current competition venue can accommodate, and the arrangement of matches in this time period is unreasonable.

[0132] The competition stages in the same competition category within one day may be preliminary rounds, semi-finals or finals. For example, the badminton semi-finals will be held on May 10. If both the badminton semi-finals and the badminton finals are held on May 10, it is definitely an unreasonable arrangement.

[0133] S3024: If the number of games in a current competition venue in the same time period is less than or equal to a preset number, and there is a competition stage of the same competition category in one day, it is determined that the schedule is qualified.

[0134] In a possible implementation, during the game, each game can be monitored to determine whether there are any problems with each game. If there are any problems, the game schedule can be adjusted to ensure that subsequent games proceed smoothly.

[0135] In a possible implementation, the current game data contains contact information of each participating team. After the schedule of the current game is generated in step S202, the schedule can be sent to relevant personnel of each participating team according to the contact information of the participating team.

[0136] In a possible implementation, the method may further include: if a query instruction is received, displaying a game schedule to facilitate the user to query the game schedule.

[0137] In a possible implementation, the method may further include: if a schedule change instruction is received, displaying an identity authentication interface, after receiving the identity authentication information, verifying the user's identity according to the identity authentication information, and if it is determined that the user's identity is legitimate, displaying a schedule change page to facilitate the user to modify the schedule. The identity authentication information may be a fingerprint, a face image, or a user name.

[0138] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0139] Corresponding to the method for arranging the competition described in the above embodiment, Figure 6 A structural block diagram of a game arrangement device provided in an embodiment of the present application is shown. For ease of explanation, only the parts related to the embodiment of the present application are shown.

[0140] Reference Figure 6The device 400 may include: a current data acquisition module 410, a data output module 420, a question collection module 430 and a result output module 440.

[0141] The current data acquisition module 410 is used to acquire current game data, wherein the current game data includes the current game category, the current competition information corresponding to each current game category, and the game constraint conditions corresponding to each current game category, and the current competition information includes the current participating team, the current competition venue, and the current game time;

[0142] The data output module 420 is used to input the current game data into the target game schedule model to obtain the game schedule of the current game;

[0143] The problem collection module 430 is used to collect the game problems that occur during the game, wherein the game problems include the absence of participating teams and / or the failure of the current game venue;

[0144] The result output module 440 is used to input the game problem, the time when the game problem occurs and the game schedule into the target game schedule model to optimize the game schedule and obtain an optimized game schedule.

[0145] In a possible implementation, the competition constraint condition includes at least one of a fairness constraint among participating teams, a competition venue constraint, and a competition interval duration constraint.

[0146] In a possible implementation, the current data acquisition module 410 may also be connected to:

[0147] A historical data acquisition module, used to acquire historical game data, wherein the historical game data includes historical game categories, historical competition information corresponding to each of the historical game categories, and game constraints corresponding to each of the historical game categories, and the historical competition information includes historical participating teams, historical competition venues, and historical competition times;

[0148] The model training module is used to train the initial schedule scheduling model based on the historical game data, optimize the parameters in the initial schedule scheduling model, and obtain the target schedule scheduling model, which is the initial schedule scheduling model after the parameters are optimized.

[0149] In a possible implementation, the model training module can be specifically used for:

[0150] Training the initial schedule scheduling model based on the historical game data, optimizing the parameters in the initial schedule scheduling model, and obtaining a candidate schedule scheduling model;

[0151] The candidate schedule scheduling model is optimized based on the optimization model to obtain the target schedule scheduling model, wherein the optimization model includes a genetic algorithm model and / or a simulated annealing algorithm model.

[0152] In a possible implementation, the data output module 420 may be specifically used for:

[0153] Performing data cleaning and standardization processing on the current game data to obtain standard data of the current game data;

[0154] Performing data processing on the standard data to obtain key information in the standard data, wherein the data processing includes at least one of keyword extraction, sentiment analysis, and topic modeling;

[0155] Extracting features of the key information to obtain numerical features and text features in the key information;

[0156] The numerical features and the text features are input into the target game schedule model to obtain the game schedule of the current game.

[0157] In a possible implementation, the data output module 420 may also be connected to:

[0158] A data recognition module is used to perform text recognition on the game schedule to obtain the game schedule corresponding to each current game venue and the game schedule corresponding to each current game category;

[0159] The eligibility determination module is used to determine the eligibility of the schedule based on the match arrangement corresponding to each current match venue and the match arrangement corresponding to each current match category.

[0160] In a possible implementation, the eligibility determination module may be specifically used to:

[0161] Based on the match arrangement corresponding to each current match venue, determine the number of matches existing in the current match venue in the same time period;

[0162] Based on the match arrangement corresponding to each current match category, determine the time of each match stage corresponding to the current match category;

[0163] If the number of matches existing in a current competition venue in the same time period is greater than a preset number, and / or there are at least two competition stages of the same competition category in one day, the schedule is determined to be unqualified;

[0164] If the number of matches existing in a current competition venue in the same time period is less than or equal to a preset number, and there is a competition stage of the same competition category in one day, it is determined that the schedule is qualified.

[0165] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0166] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0167] The present application also provides a terminal device, see Figure 7 The terminal device 500 may include: at least one processor 510, a memory 520, and a computer program stored in the memory 520 and executable on the at least one processor 510. When the processor 510 executes the computer program, the steps in any of the above-mentioned method embodiments are implemented, for example Figure 3 Steps S201 to S205 in the illustrated embodiment. Alternatively, when the processor 510 executes the computer program, the functions of each module / unit in the above-mentioned device embodiments are implemented, for example Figure 6 The functions of the current data acquisition module 510 to the result output module 550 are shown.

[0168] Exemplarily, the computer program may be divided into one or more modules / units, one or more modules / units are stored in the memory 520, and executed by the processor 510 to complete the present application. The one or more modules / units may be a series of computer program segments capable of completing specific functions, and the program segments are used to describe the execution process of the computer program in the terminal device 500.

[0169] Those skilled in the art will understand that Figure 6It is only an example of a terminal device and does not constitute a limitation on the terminal device. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components, such as input and output devices, network access devices, buses, etc.

[0170] The processor 510 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.

[0171] The memory 520 may be an internal storage unit of the terminal device, or an external storage device of the terminal device, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. The memory 520 is used to store the computer program and other programs and data required by the terminal device. The memory 520 may also be used to temporarily store data that has been output or is to be output.

[0172] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the bus in the drawings of the present application is not limited to only one bus or one type of bus.

[0173] The competition arrangement method provided in the embodiment of the present application can be applied to terminal devices such as computers, tablet computers, laptop computers, netbooks, personal digital assistants (PDAs), etc. The embodiment of the present application does not impose any restrictions on the specific type of terminal devices.

[0174] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0175] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0176] In the embodiments provided in the present application, it should be understood that the disclosed terminal equipment, devices and methods can be implemented in other ways. For example, the terminal equipment embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0177] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0178] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0179] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and when the computer program is executed by one or more processors, the steps of each of the above-mentioned method embodiments can be implemented.

[0180] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and when the computer program is executed by one or more processors, the steps of each of the above-mentioned method embodiments can be implemented.

[0181] Similarly, as a computer program product, when the computer program product runs on a terminal device, the terminal device can implement the steps in the above-mentioned method embodiments when executing the computer program product.

[0182] The computer program includes computer program code, which may be in source code form, object code form, executable file or some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer readable medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer readable media do not include electric carrier signals and telecommunication signals.

[0183] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A method for arranging a competition, characterized in that: include: Acquire current game data, the current game data including current game category, current competition information corresponding to each current game category and game constraint conditions corresponding to each current game category, the current competition information including current participating teams, current competition venue and current game time; Inputting the current game data into the target game schedule model to obtain the game schedule of the current game; During the competition, collect the competition problems that occur, wherein the competition problems include the absence of participating teams and / or the failure of the current competition venue; The game problem, the time when the game problem occurs and the game schedule are input into the target game schedule model to optimize the game schedule, so as to obtain an optimized game schedule.

2. The method for arranging a competition as claimed in claim 1, characterized in that: The competition constraint conditions include at least one of fairness constraint among participating teams, competition venue constraint and competition interval duration constraint.

3. The method for arranging a competition as claimed in claim 1, characterized in that: Before obtaining the current game data, the method further includes: Acquire historical game data, wherein the historical game data includes historical game categories, historical competition information corresponding to each of the historical game categories, and game constraints corresponding to each of the historical game categories, and the historical competition information includes historical participating teams, historical competition venues, and historical competition times; The initial schedule scheduling model is trained based on the historical game data, and the parameters in the initial schedule scheduling model are optimized to obtain a target schedule scheduling model, where the target schedule scheduling model is the initial schedule scheduling model after the parameters are optimized.

4. The method for arranging a competition as claimed in claim 3, characterized in that: The training of the initial schedule arrangement model based on the historical game data, optimizing the parameters in the initial schedule arrangement model, and obtaining the target schedule arrangement model includes: Training the initial schedule scheduling model based on the historical game data, optimizing the parameters in the initial schedule scheduling model, and obtaining a candidate schedule scheduling model; The candidate schedule scheduling model is optimized based on the optimization model to obtain the target schedule scheduling model, wherein the optimization model includes a genetic algorithm model and / or a simulated annealing algorithm model.

5. The method for arranging a competition according to any one of claims 1 to 4, characterized in that: The step of inputting the current game data into the target game schedule model to obtain the current game schedule includes: Performing data cleaning and standardization processing on the current game data to obtain standard data of the current game data; Performing data processing on the standard data to obtain key information in the standard data, wherein the data processing includes at least one of keyword extraction, sentiment analysis, and topic modeling; Extracting features of the key information to obtain numerical features and text features in the key information; The numerical features and the text features are input into the target game schedule model to obtain the game schedule of the current game.

6. The method for arranging a competition according to any one of claims 1 to 4, characterized in that: After inputting the current game data into the target game schedule model to obtain the game schedule of the current game, the method further includes: Performing text recognition on the game schedule to obtain the game schedule corresponding to each current game venue and the game schedule corresponding to each current game category; Based on the match arrangement corresponding to each current match venue and the match arrangement corresponding to each current match category, the eligibility of the match schedule is determined.

7. The method for arranging a competition as claimed in claim 6, characterized in that: The determining the eligibility of the game schedule based on the game arrangement corresponding to each current game venue and the game arrangement corresponding to each current game category includes: Based on the match arrangement corresponding to each current match venue, determine the number of matches existing in the current match venue in the same time period; Based on the match arrangement corresponding to each current match category, determine the time of each match stage corresponding to the current match category; If the number of matches existing in a current competition venue in the same time period is greater than a preset number, and / or there are at least two competition stages of the same competition category in one day, the schedule is determined to be unqualified; If the number of matches existing in a current competition venue in the same time period is less than or equal to a preset number, and there is a competition stage of the same competition category in one day, it is determined that the schedule is qualified.

8. A device for arranging a competition, characterized in that: include: A current data acquisition module, used to acquire current game data, wherein the current game data includes the current game category, current competition information corresponding to each current game category, and game constraints corresponding to each current game category, wherein the current competition information includes the current participating team, the current competition venue, and the current game time; A data output module, used to input the current game data into the target game schedule model to obtain the game schedule of the current game; A problem collection module is used to collect the problems that occur during the competition, wherein the competition problems include the absence of participating teams and / or the failure of the current competition venue; The result output module is used to input the game problem, the time when the game problem occurs and the game schedule into the target game schedule model to optimize the game schedule and obtain an optimized game schedule.

9. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for arranging a game according to any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method for arranging a game as claimed in any one of claims 1 to 7 is implemented.

Images