[go: up one dir, main page]

CN120106495A - Control method, device and electronic equipment - Google Patents

Control method, device and electronic equipment Download PDF

Info

Publication number
CN120106495A
CN120106495A CN202510235276.6A CN202510235276A CN120106495A CN 120106495 A CN120106495 A CN 120106495A CN 202510235276 A CN202510235276 A CN 202510235276A CN 120106495 A CN120106495 A CN 120106495A
Authority
CN
China
Prior art keywords
sub
range
user
target
users
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202510235276.6A
Other languages
Chinese (zh)
Other versions
CN120106495B (en
Inventor
吕晓卓
肖烨
贺泽雨
苏童童
肖尧
郝鑫
黄晓霞
吴晓艳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Zhuozhuo Cultural And Creative Co ltd
Original Assignee
Beijing Zhuozhuo Cultural And Creative Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Zhuozhuo Cultural And Creative Co ltd filed Critical Beijing Zhuozhuo Cultural And Creative Co ltd
Priority to CN202510235276.6A priority Critical patent/CN120106495B/en
Priority claimed from CN202510235276.6A external-priority patent/CN120106495B/en
Publication of CN120106495A publication Critical patent/CN120106495A/en
Application granted granted Critical
Publication of CN120106495B publication Critical patent/CN120106495B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/14—Travel agencies

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Tourism & Hospitality (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Primary Health Care (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a control method, a device and electronic equipment, the control method comprises the steps of obtaining user information and task information corresponding to a target range, wherein the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range, determining a first load value based on the actual number and the rated number and a second load value based on the release number and the completion number, determining a load balance coefficient corresponding to the target range based on the first load value and the second load value, determining a weight value of the tasks corresponding to each sub-range based on the actual number and the rated number of the users corresponding to each sub-range and the attribute information of the tasks corresponding to the sub-range, and carrying out shunt control on the users based on the weight value.

Description

Control method and device and electronic equipment
Technical Field
The present application relates to the field of control technologies, and in particular, to a control method, a control device, and an electronic device.
Background
Currently, game items in amusement parks are becoming increasingly abundant, so that more users play. The situation that a large number of users want to experience the same play item at the same time, the queuing number of the play item is large, and the situation that other play items in an amusement park are idle is possibly caused, so that the problems of low play efficiency and play resource waste of the users are solved.
Disclosure of Invention
The embodiment of the application aims to provide a control method, a control device and electronic equipment.
In a first aspect, an embodiment of the present application provides a control method, including:
The method comprises the steps of obtaining user information and task information corresponding to a target range, wherein the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range;
determining a first load value based on the actual number and the rated number, and determining a second load value based on the release number and the completion number;
Determining a load balance coefficient corresponding to the target range based on the first load value and the second load value;
under the condition that the load balance coefficient meets the shunt condition, determining a weight value of a task corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range;
And carrying out shunt control on the user based on the weight value.
In one possible implementation, the shunt condition includes the load balancing coefficient being greater than or equal to a first threshold value and the load balancing coefficient being less than the first threshold value and greater than or equal to a second threshold value;
the step of performing shunt control on the user based on the weight value comprises the following steps:
When the load balance coefficient is greater than or equal to a first threshold value, carrying out shunt control on the user based on the weight value according to a first shunt strategy;
and when the load balance coefficient is smaller than the first threshold value and larger than or equal to a second threshold value, carrying out shunt control on the user based on the weight value according to a second shunt strategy.
In a possible implementation manner, the performing splitting control on the user based on the weight value according to the first splitting policy includes:
for each sub-range, determining a sub-load balance coefficient corresponding to the sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range;
determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range;
And screening out part of users from all the users corresponding to the target sub-range, and determining the users as target users so as to perform distribution control on the target users.
In a possible implementation manner, the screening a part of users from all the users corresponding to the target sub-range to determine the users as target users, so as to perform splitting control on the target users includes:
For each user corresponding to the target sub-range, determining whether a weight value, of which the difference value between the weight values corresponding to the target sub-range is smaller than a threshold value, exists in all weight values corresponding to the user;
If yes, determining the user as the target user;
For each target user, determining a weight value with the smallest difference value between the weight values corresponding to the target sub-ranges in all weight values corresponding to the target user;
And assigning the task corresponding to the weight value with the smallest difference value between the weight values corresponding to the target sub-range to the target user.
In a possible implementation manner, the splitting control is performed on the user based on the weight value according to the first splitting policy, and the method further includes:
for each sub-range, determining a sub-load balance coefficient corresponding to the sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range;
determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range;
updating the weight value corresponding to each user corresponding to the target sub-range according to a first updating mode;
And distributing the task corresponding to the maximum weight value in the updated weight values to the user.
In a possible implementation manner, the splitting control is performed on the user based on the weight value according to a second splitting policy, and includes:
updating the weight value corresponding to each user according to a second updating mode;
Determining the allocation probability of each task based on the updated weight value;
and allocating the task corresponding to the maximum allocation probability to the user.
In one possible embodiment, the control method further includes:
Acquiring reference information of each user under the condition that the load balance coefficient does not meet the distribution condition, wherein the reference information at least comprises age, task participation, queuing behavior and recommended behavior;
based on the age, the task participation degree, the queuing behavior and the recommendation behavior, sequencing the users corresponding to each sub-range to obtain a user queue;
The method comprises the steps of obtaining state information of a sub-range and/or a user request, wherein the state information at least comprises that a task corresponding to the sub-range is to be executed, is in progress or is completed, and the user request characterizes a user request to exit a user queue corresponding to the sub-range;
updating the user queue based on the status information and/or the user request.
In one possible embodiment, the control method further includes:
Determining the time length of waiting for a user to execute the task corresponding to the sub-range based on the user queue, the rated number and the execution time length corresponding to the task;
and transmitting the duration of the required waiting to a terminal corresponding to the user so that the terminal displays the duration of the required waiting.
In a second aspect, an embodiment of the present application further provides a control apparatus, including:
The system comprises an acquisition module, a task information acquisition module and a task information processing module, wherein the acquisition module is configured to acquire user information and task information corresponding to a target range, the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range;
a first determination module configured to determine a first load value based on the actual number and the rated number, and a second load value based on the release number and the completion number;
A second determining module configured to determine a load balancing coefficient corresponding to the target range based on the first load value and the second load value;
The third determining module is configured to determine, for each sub-range, a weight value of a task corresponding to the sub-range based on an actual number and a rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range, if the load balancing coefficient meets a splitting condition;
and the control module is configured to perform shunt control on the user based on the weight value.
In a third aspect, an embodiment of the present application further provides an electronic device, including a processor and a memory, where the memory stores machine-readable instructions executable by the processor, where the processor and the memory communicate via a bus when the electronic device is running, and where the machine-readable instructions, when executed by the processor, perform the steps of any one of the control methods described above.
In the embodiment of the application, after the user information and the task information corresponding to the target range are determined to be subjected to the split control on the user in the target range, the weight value of the task corresponding to the sub-range is further determined, so that the split control on the user is performed on the basis of the weight value, the problems that the actual number corresponding to one part of the sub-ranges is more and the actual number corresponding to the other part of the sub-ranges is less are effectively avoided, the queuing efficiency of the user and the utilization rate of resources (the sub-ranges) are ensured to a certain extent, and the user experience is greatly improved.
Drawings
In order to more clearly illustrate the application or the technical solutions of the prior art, the drawings that are used in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments described in the present application, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flow chart of a control method provided by the present application;
Fig. 2 shows a flowchart of a control method for performing split control on a user based on a weight value according to a first split strategy according to the present application;
FIG. 3 is a flowchart illustrating another method for controlling user distribution based on a weight value according to a first distribution strategy;
Fig. 4 shows a flowchart of performing split control on a user based on a weight value according to a second split policy in a control method provided by the present application;
fig. 5 shows a schematic structural diagram of a control device according to the present application;
fig. 6 shows a schematic structural diagram of an electronic device provided by the present application.
Detailed Description
Various aspects and features of the present application are described herein with reference to the accompanying drawings.
It should be understood that various modifications may be made to the embodiments of the application herein. Therefore, the above description should not be taken as limiting, but merely as exemplification of the embodiments. Other modifications within the scope and spirit of the application will occur to persons of ordinary skill in the art.
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the application and, together with a general description of the application given above, and the detailed description of the embodiments given below, serve to explain the principles of the application.
These and other characteristics of the application will become apparent from the following description of a preferred form of embodiment, given as a non-limiting example, with reference to the accompanying drawings.
It is also to be understood that, although the application has been described with reference to some specific examples, a person skilled in the art will certainly be able to achieve many other equivalent forms of the application, having the characteristics as set forth in the claims and hence all coming within the field of protection defined thereby.
The above and other aspects, features and advantages of the present application will become more apparent in light of the following detailed description when taken in conjunction with the accompanying drawings.
Specific embodiments of the application will be described hereinafter with reference to the accompanying drawings, in which, however, it is to be understood that the embodiments so applied are merely examples of the application, which may be practiced in various ways. Well-known and/or repeated functions and constructions are not described in detail to avoid obscuring the application in unnecessary or unnecessary detail. Therefore, specific structural and functional details disclosed herein are not intended to be limiting, but merely as a basis for the claims and as a representative basis for teaching one skilled in the art to variously employ the present application in virtually any appropriately detailed structure.
The specification may use the word "in one embodiment," "in another embodiment," "in yet another embodiment," or "in other embodiments," which may each refer to one or more of the same or different embodiments in accordance with the application.
In one aspect, the present application provides a control method. It should be noted that, the application scenario of the embodiment of the present application is a scenario in which a user experiences various items in an amusement park, where a target range in the following is an amusement park, and a sub-range is a certain play item, and a task is that the user determines a play item that wants to experience (queuing behavior is generated for the play item).
Fig. 1 shows a flowchart of a control method provided by an embodiment of the present application, where specific steps include S101-S105.
And S101, acquiring user information and task information corresponding to a target range, wherein the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range.
In implementations, the target range includes multiple sub-ranges, i.e., multiple play items within the amusement park. And obtaining the actual number corresponding to each sub-range in the target range, wherein the actual number is the user in the current queue corresponding to the sub-range. The rated number of users corresponding to the sub-range is the number of the largest users that the sub-range can carry. The number of tasks corresponding to the sub-scope is the number of users generating queuing behaviors for the sub-scope, and the number of tasks corresponding to the sub-scope is the number of users executing preset behaviors for the sub-scope.
And acquiring user information and task information corresponding to the target range, namely acquiring the actual number and the rated number of users corresponding to each sub-range in the target range and the release number and the completion number of tasks corresponding to each sub-range.
It is to be noted that the actual number, the distribution number, and the completion number are varied.
S102, determining a first load value based on the actual number and the rated number, and determining a second load value based on the release number and the completion number.
After the actual number and the rated number of the users corresponding to each sub-range and the release number and the completion number of the tasks corresponding to each sub-range are obtained, a first load value is determined based on the actual number and the rated number. As one example, a ratio between the actual number and the rated number is determined as a first load value.
Likewise, in determining the second load value based on the issue number and the completion number, a ratio between the completion number and the issue number may be determined to be the second load value.
S103, determining a load balance coefficient corresponding to the target range based on the first load value and the second load value.
After the first load value and the second load value corresponding to each sub-range are obtained, the load balance coefficient corresponding to the target range is further determined based on the first load value and the second load value. Optionally, a first sum of the first load values corresponding to all the sub-ranges and a second sum of the second load values corresponding to all the sub-ranges may be calculated, and the first sum and the second sum are calculated by using the balance weight corresponding to the user information and the balance weight corresponding to the task information, so as to obtain the load balance coefficient corresponding to the target range. In another example, a first average value of the first load values corresponding to all the sub-ranges and a second average value of the second load values corresponding to all the sub-ranges may be calculated, and the first average value and the second average value are calculated by using the balance weight corresponding to the user information and the balance weight corresponding to the task information, so as to obtain the load balance coefficient corresponding to the target range.
In the embodiment of the application, when the load balance coefficient corresponding to the target range is determined based on the first load value and the second load value, the following formula (1) is adopted.
Bload＝α×Lqueue+β×Ltask (1)
Wherein B load represents a load balance coefficient corresponding to the target range, L queue represents a first load value, L task represents a second load value, α represents a balance weight corresponding to the user information, β represents a balance weight corresponding to the task information, and the sum of α and β is 1.
Wherein the load balancing factor characterizes queue conditions within a target range, which may include heavy congestion, medium congestion, and no congestion.
S104, when the load balance coefficient meets the split-flow condition, determining a weight value of the task corresponding to each sub-range based on the actual number and the rated number of the users corresponding to the sub-range and the attribute information of the task corresponding to the sub-range.
After the load balance coefficient corresponding to the target range is determined, whether the load balance coefficient meets the shunt condition is further determined. The shunt condition comprises that the load balance coefficient is larger than or equal to a first threshold value and the load balance coefficient is smaller than the first threshold value and larger than or equal to a second threshold value, and the first threshold value is larger than the second threshold value. Optionally, when determining whether the load balancing coefficient meets the splitting condition, comparing the load balancing coefficient with the first threshold and the second threshold respectively, or directly comparing the load balancing coefficient with the second threshold, and if the load balancing coefficient is greater than or equal to the second threshold, characterizing that the load balancing coefficient meets the splitting condition.
Under the condition that the load balance coefficient meets the split-flow condition, for each sub-range, determining a weight value of a task corresponding to the sub-range based on the actual number and the rated number of the users corresponding to the sub-range and attribute information of the task corresponding to the sub-range, wherein the weight value represents the degree of executing the task by the users. For example, the weight value corresponding to the task a received by the user 1 is 167, and the weight value corresponding to the task b received by the user 1 is 180, and at this time, the task b is preferentially allocated to the user 1.
One example of this is to determine the weight value of the task corresponding to the sub-range according to the following formula (2).
Woriginal ＝Wload +Wdifficulty (2)
Wherein, W original represents the weight value of the task corresponding to the sub-range, W load represents the user weight value corresponding to the sub-range, and W difficulty represents the task weight value corresponding to the sub-range.
In one example, the actual number of users and the rated number of users corresponding to the sub-range are used to determine the user weight value corresponding to the sub-range, specifically, the first standard value/(actual number/rated number) is determined as the user weight value. For example, the first standard value is 50%, the actual number of users corresponding to the sub-range a is 100, and the rated number is 30, that is, there are 100 users that want to execute the task corresponding to the sub-range a, when the sub-range a is the roller coaster, the corresponding task is to sit the roller coaster, at this time, there are 100 users that queue to want to sit the roller coaster, and the roller coaster can bear 30 users each time, based on this, the user weight value corresponding to the sub-range a is 50/(100/30) =15.
In another example, the task weight value corresponding to the sub-scope is determined by using the attribute information and the rated number of the tasks corresponding to the sub-scope, where the attribute information of the tasks at least includes an execution time period required for executing the tasks once. Optionally, the second standard value/(execution duration/rated number) is determined as the user weight value. As in the example above, the execution time required for the sub-range a to execute a task, that is, to start a roller coaster, is 10 minutes, and at this time, the task weight value corresponding to the sub-range a is 50/(10/30) =150.
To sum up, the weight value of the task corresponding to the sub-range a is 15+150=165.
S105, based on the weight value, the user is subjected to shunt control.
And after determining the weight value of the task corresponding to each sub-range, carrying out shunt control on the user based on the weight value.
Optionally, when the user is subjected to the shunt control based on the weight value, the user is subjected to the shunt control based on the weight value according to a first shunt strategy aiming at a scene, namely a sub-range, of which the load balance coefficient is greater than or equal to a first threshold value, and the user is subjected to the shunt control based on the weight value according to a second shunt strategy aiming at a scene, namely a sub-range, of which the load balance coefficient is less than the first threshold value and greater than or equal to a second threshold value.
For one example, fig. 2 shows a flow chart of splitting control of a user based on weight values according to a first splitting strategy, wherein the specific steps include S201-S203.
S201, determining a sub-load balance coefficient corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range.
S202, determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range.
S203, screening out partial users from all users corresponding to the target sub-range, and determining the partial users as target users so as to perform distribution control on the target users.
And under the condition that the load balance coefficient is larger than or equal to a first threshold, determining the sub-load balance coefficient corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range. Here, the manner of calculating the sub-load balance coefficient corresponding to the sub-range is the same as the load balance coefficient corresponding to the calculation target range, and will not be described in detail herein.
After obtaining the sub-load balance coefficient corresponding to each sub-range, determining the largest sub-load balance coefficient from all the sub-load balance coefficients, and then determining the sub-range corresponding to the largest sub-load balance coefficient as the target sub-range. The users corresponding to the target sub-range are more, and the users corresponding to the target sub-range need to be subjected to shunt control.
In one example, from all users corresponding to the target sub-range, screening out part of users to determine the users as target users so as to perform split control on the target users. Optionally, for each user corresponding to the target sub-range, determining whether a weight value, of all weight values corresponding to the user, exists, wherein the difference value between the weight values corresponding to the target sub-range is smaller than a threshold value.
In a specific implementation, each user may get a task for a plurality of sub-ranges, that is, queue behavior is generated for a plurality of play items, and a weight value is respectively corresponding to each task, so that in the case that the user gets a task for a plurality of sub-ranges, the user corresponds to a plurality of weight values. Further, a plurality of weight values corresponding to the user are traversed to determine whether there are weight values for which a difference between the weight values corresponding to the target sub-range is less than a threshold.
If the difference value between the weight values corresponding to the target sub-ranges is smaller than the weight value of the threshold value, the user is determined to be the target user, that is, other tasks can be allocated to the target user. The target user may be all or part of the users corresponding to the target sub-range.
Further, for each target user, determining a weight value with the smallest difference between the weight values corresponding to the target sub-ranges in all the weight values corresponding to the target user, so as to allocate the task corresponding to the weight value with the smallest difference between the weight values corresponding to the target sub-ranges to the target user.
By the method, other tasks except the tasks corresponding to the target sub-range are distributed to the target users, so that a large number of users can be effectively prevented from waiting for executing the tasks corresponding to the target sub-range at the same time, the queuing efficiency of the users is improved to a certain extent, and further the user experience is improved, meanwhile, the load corresponding to the target sub-range can be relieved, namely the sub-load balance coefficient corresponding to the target sub-range is reduced, and accordingly, the resource utilization rate of the sub-range corresponding to other tasks is improved.
As yet another example, fig. 3 shows another flow chart for performing a offloading control on a user based on a weight value according to a first offloading policy, wherein the specific steps include S301-S304.
S301, determining a sub-load balance coefficient corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range.
S302, determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range.
S303, updating the weight value corresponding to each user according to a first updating mode aiming at each user corresponding to the target sub-range.
S304, assigning the task corresponding to the largest weight value in the updated weight values to the user.
Still another example, another first splitting strategy is further provided by the embodiment of the present application, so as to adapt to different splitting scenarios through different first splitting strategies. When the user is subjected to shunt control based on the weight value according to another first shunt strategy, determining a sub-load balance coefficient corresponding to each sub-range based on the actual number and the rated number of the users corresponding to the sub-range and the release number and the completion number of the tasks corresponding to the sub-range.
Similarly, after obtaining the sub-load balance coefficient corresponding to each sub-range, determining the largest sub-load balance coefficient from all the sub-load balance coefficients, and then determining the sub-range corresponding to the largest sub-load balance coefficient as the target sub-range. The users corresponding to the target sub-range are more, and the users corresponding to the target sub-range need to be subjected to shunt control.
Further, for each user corresponding to the target sub-range, updating the weight value corresponding to the user according to a first updating mode, and updating the weight value corresponding to the task corresponding to each sub-range when the user corresponds to a plurality of weight values. Alternatively, the first updating manner may refer to the following formula (3).
Wi,new＝Wi,original+k×(Lqueue,i/Lmax) (3)
Wherein, W i,new represents the weight value corresponding to the task corresponding to the sub-range i after updating, W i,original represents the weight value corresponding to the task corresponding to the sub-range i before updating, k represents the adjustment coefficient, L queue,i represents the first load value of the sub-range i, and L max represents the maximum load value of the sub-range i (which may be determined by the attribute of the sub-range or may be set manually).
After the updating of the weight value corresponding to each user is completed, the task corresponding to the largest weight value in the updated weight values corresponding to each user is allocated to the user. Here, the task corresponding to the largest weight value in the updated weight values corresponding to the user may not be the task corresponding to the target sub-range, so that the purpose of splitting control on the user corresponding to the target sub-range is achieved, further, the queuing efficiency of the user and the utilization rate of resources (sub-ranges) are ensured, and the user experience is greatly improved.
Fig. 4 shows a flow chart of splitting control of a user based on weight values according to a second splitting strategy, wherein the specific steps comprise S401-S403.
S401, for each user, updating the weight value corresponding to the user according to a second updating mode.
S402, determining the allocation probability of each task based on the updated weight value.
S403, the task corresponding to the maximum allocation probability is allocated to the user.
And under the condition that the load balance coefficient is smaller than the first threshold value and larger than or equal to the second threshold value, updating the weight value corresponding to each user according to a second updating mode. Alternatively, the first updating manner may refer to the following formula (4).
Wi,new＝Wi,original×(1-Lqueue,i/Lmax) (4)
Wherein, W i,new represents the updated weight value corresponding to the task corresponding to the sub-range i, W i,original represents the weight value corresponding to the task corresponding to the sub-range i before updating, L queue,i represents the first load value of the sub-range i, and L max represents the maximum load value of the sub-range i.
After the updating is completed for the weight value corresponding to each user, the allocation probability of each task is determined for each user based on the updated weight value corresponding to the user. Optionally, the allocation probability of each task is determined with reference to the following formula (5).
Pi＝Wi/∑j＝1 nWj (5)
Wherein, P i represents the allocation probability of the task corresponding to the sub-range i, W i represents the weight value corresponding to the task corresponding to the sub-range i, j represents the number of tasks corresponding to the user, n represents the number of sub-ranges in the target range, and W j represents the weight value corresponding to the task corresponding to the sub-range j.
After determining the allocation probability of each task, the task corresponding to the maximum allocation probability is allocated to the user. Similarly, the task corresponding to the maximum allocation probability may not be the task corresponding to the current sub-range (the sub-range with moderate congestion), so that the purpose of carrying out split control on the user corresponding to the current sub-range is achieved, further, the queuing efficiency of the user and the utilization rate of resources (sub-range) are ensured, and the user experience is greatly improved.
In the embodiment of the application, after the user information and the task information corresponding to the target range are determined to be subjected to the split control on the user in the target range, the weight value of the task corresponding to the sub-range is further determined, so that the split control on the user is performed on the basis of the weight value, the problems that the actual number corresponding to one part of the sub-ranges is more and the actual number corresponding to the other part of the sub-ranges is less are effectively avoided, the queuing efficiency of the user and the utilization rate of resources (the sub-ranges) are ensured to a certain extent, and the user experience is greatly improved.
It is worth to be noted that, when the load balance coefficient is smaller than the second threshold, that is, when the load balance coefficient does not meet the splitting condition, the splitting control is not required to be performed on the user. Optionally, under the condition that the load balance coefficient does not meet the distribution condition, acquiring reference information of each user, wherein the reference information at least comprises age, task participation, queuing behavior and recommended behavior.
And ordering the users corresponding to each sub-range based on the age, the task participation degree, the queuing behavior and the recommendation behavior to obtain a user queue. As an example, the queuing score of each user is calculated according to the following formula (6) to order the users corresponding to each sub-range in the order of the queuing scores from large to small, thereby obtaining a user queue.
Z=W0×A+W1×G+W2×Q+W3×R (6)
Wherein Z represents the queuing score of the user, W 0 represents the weight coefficient of the age, A represents the sub-score corresponding to the age of the user, W 1 represents the weight coefficient of the task engagement, G represents the sub-score corresponding to the task engagement, W 2 represents the weight coefficient of the queuing behavior, Q represents the sub-score corresponding to the queuing behavior, W 3 represents the weight coefficient of the recommended behavior, and R represents the sub-score corresponding to the recommended behavior.
For example, for the age-corresponding sub-score, a user of 1 to 12 years old may be set, whose age-corresponding sub-score is 1.5 points, a user of 13 to 17 years old whose age-corresponding sub-score is 1.2 points, a user of 18 to 59 years old whose age-corresponding sub-score is 1.0 points, and a user of 60 years old or older whose age-corresponding sub-score is 1.4 points. Aiming at the subtrees corresponding to the task participation, the user finishes the task 1 time, the subtrees corresponding to the task participation is 1 minute, the user finishes the task 3 times, and the subtrees corresponding to the task participation is 3 minutes. Aiming at the sub-scores corresponding to the queuing behaviors, setting the sub-scores corresponding to the queuing behaviors to arrive at a sub-range on time by a user, increasing the sub-scores corresponding to the queuing behaviors by 5 minutes, actively exiting the queue by the user, reducing the sub-scores corresponding to the queuing behaviors by 5 minutes, and delaying the user to be moved out of the formal queue, wherein the sub-scores corresponding to the queuing behaviors are reduced by 20 minutes. Aiming at the sub-scores corresponding to the recommended actions, each time the user recommends a new player to successfully pick up the task corresponding to the sub-range, the sub-score corresponding to the recommended actions is increased by 10 points. The subtrees corresponding to the task participation and the subtrees corresponding to the behavior points are respectively provided with a corresponding upper limit value and a corresponding lower limit value. Of course, this is only one example, and embodiments of the present application are not limited thereto.
In a specific implementation, a period of queue score resetting is set for an operation period of a target range, for example, the operation period of the target range is 12 hours (for example, the operation time is 9:00-21:00 a day), at this time, the period of queue score resetting may be set to 24 hours, and reset at any time point from 21:00 a day to 9:00 a next day is set, so that users with high queue scores are prevented from frequently and preferentially executing tasks of sub-ranges, thereby affecting experience degrees of other users.
And after the user queue is obtained, obtaining state information and/or user requests of the sub-range, wherein the state information at least comprises that the task corresponding to the sub-range is to be executed, is in progress or is completed, and the user requests characterize the user requests to exit the user queue corresponding to the sub-range. The user queue is then updated based on the status information and/or the user request.
For example, when the status information of the sub-range is to be executed, the rated number of users corresponding to the sub-range is selected from the user queue according to the order of the queuing values from large to small to execute the tasks corresponding to the sub-range, and meanwhile, the rated number of users are removed from the user queue. And updating the user queue according to the preset frequency when the state information of the sub-range is in progress or is finished, wherein the preset frequencies corresponding to different sub-ranges are different. And if a user request for exiting the user queue corresponding to the sub-range is received, removing the user from the user queue.
In another example, the time length of waiting required for the user to execute the task corresponding to the sub-range may be determined based on the user queue, the rated number and the execution time length of the task, and the time length of waiting required is transmitted to the terminal corresponding to the user, so that the terminal displays the time length of waiting required. The time length of the required waiting= (the number of users in the user queue/the rated number) = the execution time length corresponding to the task.
Accordingly, the user can reasonably arrange time according to the waiting time, and the user experience is effectively improved.
On the other hand, the application also provides a control device corresponding to the control method, and because the principle of solving the problem of the control device in the application is similar to that of the control method in the application, the implementation of the control device can refer to the implementation of the method, and the repetition is omitted.
Fig. 5 shows a schematic structural diagram of a control device according to an embodiment of the present application, which specifically includes:
The system comprises an acquisition module 501, a task processing module and a control module, wherein the acquisition module is configured to acquire user information and task information corresponding to a target range, the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range;
A first determination module 502 configured to determine a first load value based on the actual number and the rated number, and a second load value based on the published number and the completed number;
a second determining module 503 configured to determine a load balancing factor corresponding to the target range based on the first load value and the second load value;
A third determining module 504, configured to determine, for each sub-range, a weight value of a task corresponding to the sub-range based on an actual number of users corresponding to the sub-range, a rated number, and attribute information of the task corresponding to the sub-range, if the load balancing coefficient satisfies a splitting condition;
A control module 505 configured to perform split control on the user based on the weight value.
In yet another example, the shunt condition includes the load balancing coefficient being greater than or equal to a first threshold value and the load balancing coefficient being less than the first threshold value and greater than or equal to a second threshold value;
The control module 505 is specifically configured to:
When the load balance coefficient is greater than or equal to a first threshold value, carrying out shunt control on the user based on the weight value according to a first shunt strategy;
and when the load balance coefficient is smaller than the first threshold value and larger than or equal to a second threshold value, carrying out shunt control on the user based on the weight value according to a second shunt strategy.
In yet another example, the control module 505 is further configured to:
for each sub-range, determining a sub-load balance coefficient corresponding to the sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range;
determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range;
And screening out part of users from all the users corresponding to the target sub-range, and determining the users as target users so as to perform distribution control on the target users.
In yet another example, the control module 505 is further configured to:
For each user corresponding to the target sub-range, determining whether a weight value, of which the difference value between the weight values corresponding to the target sub-range is smaller than a threshold value, exists in all weight values corresponding to the user;
If yes, determining the user as the target user;
For each target user, determining a weight value with the smallest difference value between the weight values corresponding to the target sub-ranges in all weight values corresponding to the target user;
And assigning the task corresponding to the weight value with the smallest difference value between the weight values corresponding to the target sub-range to the target user.
In yet another example, the control module 505 is further configured to:
for each sub-range, determining a sub-load balance coefficient corresponding to the sub-range based on the actual number and the rated number of users corresponding to the sub-range and the release number and the completion number of tasks corresponding to the sub-range;
determining a sub-range corresponding to the maximum sub-load balancing coefficient as a target sub-range;
updating the weight value corresponding to each user corresponding to the target sub-range according to a first updating mode;
And distributing the task corresponding to the maximum weight value in the updated weight values to the user.
In yet another example, the control module 505 is further configured to:
updating the weight value corresponding to each user according to a second updating mode;
Determining the allocation probability of each task based on the updated weight value;
and allocating the task corresponding to the maximum allocation probability to the user.
In yet another example, the control device further includes a queue module 506 configured to:
Acquiring reference information of each user under the condition that the load balance coefficient does not meet the distribution condition, wherein the reference information at least comprises age, task participation, queuing behavior and recommended behavior;
based on the age, the task participation degree, the queuing behavior and the recommendation behavior, sequencing the users corresponding to each sub-range to obtain a user queue;
The method comprises the steps of obtaining state information of a sub-range and/or a user request, wherein the state information at least comprises that a task corresponding to the sub-range is to be executed, is in progress or is completed, and the user request characterizes a user request to exit a user queue corresponding to the sub-range;
updating the user queue based on the status information and/or the user request.
In yet another example, the queue module 506 is further configured to:
Determining the time length of waiting for a user to execute the task corresponding to the sub-range based on the user queue, the rated number and the execution time length corresponding to the task;
and transmitting the duration of the required waiting to a terminal corresponding to the user so that the terminal displays the duration of the required waiting.
In the embodiment of the application, after the user information and the task information corresponding to the target range are determined to be subjected to the split control on the user in the target range, the weight value of the task corresponding to the sub-range is further determined, so that the split control on the user is performed on the basis of the weight value, the problems that the actual number corresponding to one part of the sub-ranges is more and the actual number corresponding to the other part of the sub-ranges is less are effectively avoided, the queuing efficiency of the user and the utilization rate of resources (the sub-ranges) are ensured to a certain extent, and the user experience is greatly improved.
An embodiment of the present application provides a storage medium, which is a computer readable medium storing a computer program, where the computer program when executed by a processor implements a method provided by any embodiment of the present application, including steps S11 to S15 as follows:
S11, acquiring user information and task information corresponding to a target range, wherein the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range;
s12, determining a first load value based on the actual quantity and the rated quantity, and determining a second load value based on the release quantity and the completion quantity;
S13, determining a load balance coefficient corresponding to the target range based on the first load value and the second load value;
S14, determining a weight value of a task corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range for each sub-range when the load balance coefficient meets the split-flow condition;
and S15, carrying out shunt control on the user based on the weight value.
An embodiment of the present application provides an electronic device, where a schematic structural diagram of the electronic device may be shown in fig. 6, and the electronic device at least includes a memory 601 and a processor 602, where the memory 601 stores a computer program, and the processor 602 implements a method provided by any embodiment of the present application when executing the computer program on the memory 601. Exemplary, the electronic device computer program steps are as follows S21 to S25:
s21, acquiring user information and task information corresponding to a target range, wherein the target range comprises a plurality of sub-ranges, the user information at least comprises the actual number and the rated number of users corresponding to each sub-range, and the task information at least comprises the release number and the completion number of tasks corresponding to each sub-range;
s22, determining a first load value based on the actual quantity and the rated quantity, and determining a second load value based on the release quantity and the completion quantity;
s23, determining a load balance coefficient corresponding to the target range based on the first load value and the second load value;
S24, determining a weight value of a task corresponding to each sub-range based on the actual number and the rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range under the condition that the load balance coefficient meets a shunt condition;
And S25, carrying out shunt control on the user based on the weight value.
In the embodiment of the application, after the user information and the task information corresponding to the target range are determined to be subjected to the split control on the user in the target range, the weight value of the task corresponding to the sub-range is further determined, so that the split control on the user is performed on the basis of the weight value, the problems that the actual number corresponding to one part of the sub-ranges is more and the actual number corresponding to the other part of the sub-ranges is less are effectively avoided, the queuing efficiency of the user and the utilization rate of resources (the sub-ranges) are ensured to a certain extent, and the user experience is greatly improved.
Alternatively, in the present embodiment, the storage medium may include, but is not limited to, a U disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, etc. various media that can store program codes. Optionally, in this embodiment, the processor performs the method steps described in the above embodiment according to the program code stored in the storage medium. Alternatively, specific examples in this embodiment may refer to examples described in the foregoing embodiments and optional implementations, and this embodiment is not described herein. It will be appreciated by those skilled in the art that the modules or steps of the application described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a memory device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps within them may be fabricated into a single integrated circuit module for implementation. Thus, the present application is not limited to any specific combination of hardware and software.
Furthermore, although exemplary embodiments have been described herein, the scope thereof includes any and all embodiments having equivalent elements, modifications, omissions, combinations (e.g., of the various embodiments across), adaptations or alterations as pertains to the present application. The elements in the claims are to be construed broadly based on the language employed in the claims and are not limited to examples described in the present specification or during the practice of the application, which examples are to be construed as non-exclusive. It is intended, therefore, that the specification and examples be considered as exemplary only, with a true scope and spirit being indicated by the following claims and their full scope of equivalents.
The above description is intended to be illustrative and not restrictive. For example, the above-described examples (or one or more aspects thereof) may be used in combination with each other. For example, other embodiments may be used by those of ordinary skill in the art upon reading the above description. In addition, in the above detailed description, various features may be grouped together to streamline the application. This is not to be interpreted as an intention that the disclosed features not being claimed are essential to any claim. Rather, inventive subject matter may lie in less than all features of a particular disclosed embodiment. Thus, the following claims are hereby incorporated into the detailed description as examples or embodiments, with each claim standing on its own as a separate embodiment, and it is contemplated that these embodiments may be combined with one another in various combinations or permutations. The scope of the application should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
While various embodiments of the present application have been described in detail, the present application is not limited to these specific embodiments, and various modifications and embodiments can be made by those skilled in the art on the basis of the inventive concept, and these modifications and modifications should be included in the scope of the claimed application.

Claims (10)

1.一种控制方法，其特征在于，包括：1. A control method, characterized by comprising: 获取目标范围对应的用户信息以及任务信息；其中，所述目标范围包括多个子范围，所述用户信息至少包括每个子范围对应的用户的实际数量以及额定数量，所述任务信息至少包括每个子范围对应的任务的发布数量以及完成数量；Acquire user information and task information corresponding to the target range; wherein the target range includes multiple sub-ranges, the user information includes at least the actual number and the rated number of users corresponding to each sub-range, and the task information includes at least the number of tasks published and the number of tasks completed corresponding to each sub-range; 基于所述实际数量和所述额定数量确定第一负载值，以及基于所述发布数量和所述完成数量确定第二负载值；determining a first load value based on the actual quantity and the rated quantity, and determining a second load value based on the published quantity and the completed quantity; 基于所述第一负载值和第二负载值，确定所述目标范围对应的负载平衡系数；Determining a load balancing coefficient corresponding to the target range based on the first load value and the second load value; 在所述负载平衡系数满足分流条件的情况下，针对每个子范围，基于该子范围对应的用户的实际数量、额定数量以及该子范围对应的任务的属性信息，确定该子范围对应的任务的权重值；In the case where the load balancing coefficient satisfies the diversion condition, for each sub-range, based on the actual number and rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range, determine the weight value of the task corresponding to the sub-range; 基于所述权重值，对用户进行分流控制。Based on the weight value, the user is diverted and controlled. 2.根据权利要求1所述的控制方法，其特征在于，所述分流条件包括所述负载平衡系数大于或等于第一阈值以及所述负载平衡系数小于所述第一阈值且大于或等于第二阈值；2. The control method according to claim 1, characterized in that the diversion condition includes that the load balancing coefficient is greater than or equal to a first threshold value and that the load balancing coefficient is less than the first threshold value and greater than or equal to a second threshold value; 所述基于所述权重值，对用户进行分流控制，包括：The controlling the flow of users based on the weight value includes: 在所述负载平衡系数大于或等于第一阈值时，按照第一分流策略，基于所述权重值对用户进行分流控制；When the load balancing coefficient is greater than or equal to a first threshold, performing diversion control on the user based on the weight value according to a first diversion strategy; 在所述负载平衡系数小于所述第一阈值且大于或等于第二阈值时，按照第二分流策略，基于所述权重值对用户进行分流控制。When the load balancing coefficient is less than the first threshold and greater than or equal to the second threshold, the user is diverted and controlled based on the weight value according to the second diversion strategy. 3.根据权利要求2所述的控制方法，其特征在于，所述按照第一分流策略，基于所述权重值对用户进行分流控制，包括：3. The control method according to claim 2, characterized in that the step of performing traffic diversion control on users based on the weight value according to the first diversion strategy comprises: 针对每个子范围，基于该子范围对应的用户的实际数量和额定数量以及该子范围对应的任务的发布数量和完成数量，确定该子范围对应的子负载平衡系数；For each sub-range, based on the actual number and rated number of users corresponding to the sub-range and the number of published and completed tasks corresponding to the sub-range, determine the sub-load balancing coefficient corresponding to the sub-range; 确定最大的子负载平衡系数对应的子范围为目标子范围；Determine the sub-range corresponding to the maximum sub-load balancing coefficient as the target sub-range; 从所述目标子范围对应的所有用户中，筛选出部分用户确定为目标用户，以对所述目标用户进行分流控制。From all users corresponding to the target sub-range, some users are screened out and determined as target users, so as to perform diversion control on the target users. 4.根据权利要求3所述的控制方法，其特征在于，所述从所述目标子范围对应的所有用户中，筛选出部分用户确定为目标用户，以对所述目标用户进行分流控制，包括：4. The control method according to claim 3, characterized in that the step of selecting some users from all users corresponding to the target sub-range and determining them as target users to perform flow control on the target users comprises: 针对所述目标子范围对应的每个用户，确定该用户对应的所有权重值中，是否存在与所述目标子范围对应的权重值之间的差值小于阈值的权重值；For each user corresponding to the target sub-range, determining whether, among all weight values corresponding to the user, there is a weight value whose difference with the weight value corresponding to the target sub-range is less than a threshold; 若存在，确定该用户为所述目标用户；If so, determining that the user is the target user; 针对每个目标用户，确定该目标用户对应的所有权重值中，与所述目标子范围对应的权重值之间的差值最小的权重值；For each target user, determine a weight value having the smallest difference between all weight values corresponding to the target user and the weight value corresponding to the target sub-range; 将与所述目标子范围对应的权重值之间的差值最小的权重值对应的任务，分配给该目标用户。The task corresponding to the weight value having the smallest difference between the weight values corresponding to the target sub-range is allocated to the target user. 5.根据权利要求2所述的控制方法，其特征在于，所述按照第一分流策略，基于所述权重值对用户进行分流控制，还包括：5. The control method according to claim 2, characterized in that the step of performing traffic diversion control on users based on the weight value according to the first diversion strategy further comprises: 针对每个子范围，基于该子范围对应的用户的实际数量和额定数量以及该子范围对应的任务的发布数量和完成数量，确定该子范围对应的子负载平衡系数；For each sub-range, based on the actual number and rated number of users corresponding to the sub-range and the number of published and completed tasks corresponding to the sub-range, determine the sub-load balancing coefficient corresponding to the sub-range; 确定最大的子负载平衡系数对应的子范围为目标子范围；Determine the sub-range corresponding to the maximum sub-load balancing coefficient as the target sub-range; 针对所述目标子范围对应的每个用户，按照第一更新方式，更新该用户对应的权重值；For each user corresponding to the target sub-range, updating the weight value corresponding to the user according to the first updating method; 将更新后的权重值中最大的权重值对应的任务，分配给该用户。The task corresponding to the largest weight value among the updated weight values is assigned to the user. 6.根据权利要求2所述的控制方法，其特征在于，所述按照第二分流策略，基于所述权重值对用户进行分流控制，包括：6. The control method according to claim 2, characterized in that the step of performing traffic diversion control on users based on the weight value according to the second diversion strategy comprises: 针对每个用户，按照第二更新方式，更新该用户对应的权重值；For each user, update the weight value corresponding to the user according to the second updating method; 基于更新后的权重值，确定每个所述任务的分配概率；Determining the assignment probability of each of the tasks based on the updated weight value; 将最大的分配概率对应的任务分配给该用户。Assign the task corresponding to the maximum assignment probability to the user. 7.根据权利要求1所述的控制方法，其特征在于，还包括：7. The control method according to claim 1, further comprising: 在所述负载平衡系数不满足分流条件的情况下，获取每个用户的参照信息；其中，所述参照信息至少包括年龄、任务参与度、排队行为以及推荐行为；When the load balancing coefficient does not satisfy the diversion condition, obtaining reference information of each user; wherein the reference information at least includes age, task participation, queuing behavior and recommended behavior; 基于所述年龄、所述任务参与度、所述排队行为以及所述推荐行为，对每个子范围对应的用户进行排序，得到用户队列；Based on the age, the task participation, the queuing behavior, and the recommendation behavior, users corresponding to each sub-range are sorted to obtain a user queue; 获得该子范围的状态信息和/或用户请求；其中，所述状态信息至少包括该子范围对应的任务处于待执行、进行中或已完成，所述用户请求表征用户请求退出该子范围对应的用户队列；Obtaining status information and/or user requests of the sub-range; wherein the status information at least includes whether the task corresponding to the sub-range is to be executed, in progress, or completed, and the user request represents a user request to exit the user queue corresponding to the sub-range; 基于所述状态信息和/或所述用户请求更新所述用户队列。The user queue is updated based on the status information and/or the user request. 8.根据权利要求7所述的控制方法，其特征在于，还包括：8. The control method according to claim 7, further comprising: 基于所述用户队列、所述额定数量以及任务对应的执行时长，确定用户执行子范围对应的任务所需等待的时长；Determine the waiting time for the user to execute the task corresponding to the sub-range based on the user queue, the rated number and the execution time corresponding to the task; 将所需等待的时长传输给用户对应的终端，以使终端显示所需等待的时长。The required waiting time is transmitted to the terminal corresponding to the user, so that the terminal displays the required waiting time. 9.一种控制装置，其特征在于，包括：9. A control device, comprising: 获取模块，其配置为获取目标范围对应的用户信息以及任务信息；其中，所述目标范围包括多个子范围，所述用户信息至少包括每个子范围对应的用户的实际数量以及额定数量，所述任务信息至少包括每个子范围对应的任务的发布数量以及完成数量；An acquisition module configured to acquire user information and task information corresponding to a target range; wherein the target range includes a plurality of sub-ranges, the user information includes at least an actual number and a rated number of users corresponding to each sub-range, and the task information includes at least a published number and a completed number of tasks corresponding to each sub-range; 第一确定模块，其配置为基于所述实际数量和所述额定数量确定第一负载值，以及基于所述发布数量和所述完成数量确定第二负载值；a first determination module configured to determine a first load value based on the actual quantity and the rated quantity, and to determine a second load value based on the published quantity and the completed quantity; 第二确定模块，其配置为基于所述第一负载值和第二负载值，确定所述目标范围对应的负载平衡系数；a second determination module configured to determine a load balancing coefficient corresponding to the target range based on the first load value and the second load value; 第三确定模块，其配置为在所述负载平衡系数满足分流条件的情况下，针对每个子范围，基于该子范围对应的用户的实际数量、额定数量以及该子范围对应的任务的属性信息，确定该子范围对应的任务的权重值；A third determination module is configured to determine, for each sub-range, a weight value of the task corresponding to the sub-range based on the actual number and rated number of users corresponding to the sub-range and attribute information of the task corresponding to the sub-range when the load balancing coefficient satisfies the diversion condition; 控制模块，其配置为基于所述权重值，对用户进行分流控制。The control module is configured to perform diversion control on users based on the weight value. 10.一种电子设备，其特征在于，包括：处理器和存储器，所述存储器存储有所述处理器可执行的机器可读指令，当电子设备运行时，所述处理器与所述存储器之间通过总线通信，所述机器可读指令被所述处理器执行时执行如权利要求1至8中任意一项所述的控制方法的步骤。10. An electronic device, characterized in that it comprises: a processor and a memory, wherein the memory stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor and the memory communicate via a bus, and when the machine-readable instructions are executed by the processor, the steps of the control method as described in any one of claims 1 to 8 are performed.
CN202510235276.6A 2025-02-28 Control method, device and electronic equipment Active CN120106495B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202510235276.6A CN120106495B (en) 2025-02-28 Control method, device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202510235276.6A CN120106495B (en) 2025-02-28 Control method, device and electronic equipment

Publications (2)

Publication Number Publication Date
CN120106495A true CN120106495A (en) 2025-06-06
CN120106495B CN120106495B (en) 2025-10-03

Family

ID=

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007034752A (en) * 2005-07-27 2007-02-08 Pioneer Electronic Corp Theme park management device, theme park management method, theme park management program and recording medium
US20090063205A1 (en) * 2005-07-12 2009-03-05 Pioneer Corporation Theme park management apparatus, theme park management method, theme park management program, and recording medium
CN105447952A (en) * 2016-01-18 2016-03-30 苏州越坤信息科技有限公司 Queuing method, system and equipment
CN107368947A (en) * 2017-06-16 2017-11-21 深圳市盛路物联通讯技术有限公司 A kind of play field management and device
CN108769924A (en) * 2018-04-28 2018-11-06 哈尔滨工业大学 A kind of scenic spot tourist chain type trip service system and method
CN110838077A (en) * 2019-11-12 2020-02-25 赵蓉蓉 Scenic spot-based touring management method
CN116777685A (en) * 2023-06-02 2023-09-19 北京中科声智科技有限公司 Scenic spot guiding system, method and device and management server

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090063205A1 (en) * 2005-07-12 2009-03-05 Pioneer Corporation Theme park management apparatus, theme park management method, theme park management program, and recording medium
JP2007034752A (en) * 2005-07-27 2007-02-08 Pioneer Electronic Corp Theme park management device, theme park management method, theme park management program and recording medium
CN105447952A (en) * 2016-01-18 2016-03-30 苏州越坤信息科技有限公司 Queuing method, system and equipment
CN107368947A (en) * 2017-06-16 2017-11-21 深圳市盛路物联通讯技术有限公司 A kind of play field management and device
CN108769924A (en) * 2018-04-28 2018-11-06 哈尔滨工业大学 A kind of scenic spot tourist chain type trip service system and method
CN110838077A (en) * 2019-11-12 2020-02-25 赵蓉蓉 Scenic spot-based touring management method
CN116777685A (en) * 2023-06-02 2023-09-19 北京中科声智科技有限公司 Scenic spot guiding system, method and device and management server

Similar Documents

Publication Publication Date Title
CN110474966B (en) Method for processing cloud platform resource fragments and related equipment
CN111084983A (en) Cloud game service method, device, equipment and storage medium
CN114756347B (en) Cluster-based server resource scheduling method and device, cloud platform and medium
CN112860383A (en) Cluster resource scheduling method, device, equipment and storage medium
CN110336885B (en) Edge node distribution method, device, scheduling server and storage medium
CN110493317B (en) Method for processing cloud platform resource fragments and related equipment
CN111135586B (en) Game matching method, game matching device, storage medium and electronic equipment
CN103297446A (en) Game resource allocation method and server
CN115562877B (en) Arranging method, device and equipment of distributed computing power resources and storage medium
CN114189522B (en) Priority-based blockchain consensus method and system in Internet of vehicles
Duong et al. QoS-aware revenue-cost optimization for latency-sensitive services in IaaS clouds
CN110460650B (en) Decision-making method and device for computation unloading in multi-edge server scene
CN116939044A (en) A computing power routing planning method and device based on blockchain technology
CN113176936A (en) QoE-aware distributed edge task scheduling and resource management method and system
CN120106495B (en) Control method, device and electronic equipment
CN119440847A (en) A load balancing scheduling method, device and electronic device for model reasoning
CN111124672A (en) Method and related equipment for data distribution based on Redis cluster
CN120106495A (en) Control method, device and electronic equipment
CN108933675B (en) Conference resource allocation method, device and storage medium
CN105578503B (en) A kind of method and device of service access
CN113728602A (en) Competitor selection
CN117138354A (en) Multi-player game cross-server team forming method and system
CN111111216A (en) Matching method, device, server and storage medium
CN112379978B (en) Back-end service calling method, device, equipment and storage medium
CN115390988A (en) Resource allocation method and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant