A configuration method, device and storage medium for shared workstations

Abstract

The present application provides a configuration method, device and storage medium for a shared workstation, in the field of shared workstation management technology. The method comprises the following steps: S1, providing a shared office area, wherein a plurality of shared workstations are arranged in the shared office area, and recording the reservation status of all shared workstations with a first matrix; S2, configuring a confidence level for each user; S3, initiating a team reservation request, including a reservation period, reservation members and a workstation combination method, wherein the workstation combination method is recorded with a second matrix; S4, after receiving the reservation request, merging a plurality of first matrices corresponding to the reservation period to obtain a third matrix; S5, sequentially intercepting a fourth matrix under the third matrix, and comparing the second matrix with the fourth matrix each time a fourth matrix is ​​intercepted. If the reservation conditions are met, the shared workstation corresponding to the fourth matrix is ​​recommended to the reservation user; otherwise, the next fourth matrix is ​​intercepted. The present invention can take into account the needs of both single-person reservations and group reservations in a shared office area.

Description

Technical Field

[0001] The present application relates to the technical field of shared workstation management, and in particular to a configuration method, device, and storage medium for a shared workstation. Background Art

[0002] Shared office space, also known as flexible office space, short-term office space, or joint office space, allows multiple people to share the same workstations within a single space. This reduces office rental costs and provides greater flexibility. Effectively utilizing shared workstations can significantly improve operating costs for businesses, especially small and medium-sized enterprises.

[0003] For example, Chinese patent application publication number CN114462655A discloses a shared workstation management method and apparatus, electronic device, and readable storage medium. This invention controls the operating status of office equipment at a target workstation through sign-in and identity verification. If a user leaves the workstation, the operating status of the office equipment at the target workstation is terminated, releasing the shared workstation resources. This allows for dynamic changes in shared workstation resources and improves resource utilization efficiency.

[0004] However, the aforementioned shared workstation management method has the following shortcomings: It is based on individual needs, reserving a single user's workstation at a time. However, in practice, a large portion of work requires teamwork, which often requires team members to work in close proximity. Existing shared workstation management methods often fail to meet this requirement. Summary of the Invention

[0005] The present application provides a configuration method, device and storage medium for a shared workstation to at least solve the above technical problems existing in the prior art.

[0006] According to a first aspect of the present application, a method for configuring a shared workstation is provided, comprising the following steps:

[0007] S1. A shared office area is provided, wherein a plurality of shared workstations are arranged in the shared office area. In each unit time period, the reservation status of all shared workstations is recorded using a first matrix.

[0008] S2: Assign a confidence level to each user. During each single-person reservation, if the user accepts the recommended shared workstation, they will receive a first confidence level reward. If the user chooses another shared workstation, they will receive a first confidence level penalty. When the confidence level falls below the set threshold, the user can only accept the recommended shared workstation.

[0009] S3, initiating a team reservation request, the team reservation request including the reservation time period, reservation members, and workstation combination, the workstation combination being recorded in a second matrix;

[0010] S4, after receiving the reservation request, merging the first matrices corresponding to the reservation period to obtain a third matrix;

[0011] S5, using a moving window method to sequentially intercept the fourth matrix under the third matrix. Each time a fourth matrix is ​​intercepted, the second matrix is ​​compared with the fourth matrix. If the reservation conditions are met, the shared workstation corresponding to the fourth matrix is ​​recommended to the reservation user; otherwise, the next fourth matrix is ​​intercepted.

[0012] In certain embodiments of the first aspect of the present application, when a single person makes a reservation, a method for recommending a shared workstation is as follows: counting the adjacent idle value of each unreserved shared workstation, where the adjacent idle value is the number of shared workstations adjacent to the shared workstation and not reserved; recommending the shared workstation with the smallest adjacent idle value to the user; if there are multiple shared workstations with the smallest adjacent idle value at the same time, any one of them is selected.

[0013] In certain embodiments of the first aspect of the present application, in S4, the method of merging the plurality of first matrices corresponding to the reservation period to obtain the third matrix is ​​as follows:

[0014] The first matrix is ​​denoted as ,in, The serial number representing the unit time period, Represents the elements of the first matrix, elements When it is 0, it means that the corresponding shared workstation has been reserved. When it is 1, it means that the corresponding shared workstation has not been reserved; represents the number of rows, Represents the number of columns;

[0015] The third matrix is ​​recorded as ,in, represents the elements of the third matrix;

[0016]

[0017] in, A set of serial numbers representing the unit time periods included in the reservation time period.

[0018] In certain embodiments of the first aspect of the present application, in S5, the method of comparing the second matrix with the fourth matrix is ​​as follows:

[0019] The second matrix is ​​recorded as ,in, Represents the elements of the second matrix, elements When it is 0, it means that the corresponding shared workstation does not need to be reserved. When it is 1, it means that the corresponding shared workstation needs to be reserved; represents the number of rows, Represents the number of columns;

[0020] The fourth matrix is ​​recorded as ,in, represents the elements of the fourth matrix;

[0021] Count all elements whose value is 1 , and record its corresponding position ( i, j ), and construct the corresponding set P, and then compare the positions contained in the corresponding set P in the fourth matrix one by one ( i, j ) element values, if the fourth matrix is ​​at these positions ( i, j ) are all 1, the reservation condition is met, otherwise the reservation condition is not met.

[0022] In certain embodiments of the first aspect of the present application, in S5, if all fourth matrices fail to meet the reservation condition, the following steps are performed:

[0023] S6, counting the comparison results of the second matrix and all the fourth matrices, and sorting the priorities of all the fourth matrices according to the statistical results, and sending requests to users of the reserved shared workstations in descending order of priority until the users agree to the change.

[0024] In certain embodiments of the first aspect of the present application, the specific method of step S6 is as follows:

[0025] S61, record the positions included in the corresponding set P in each fourth matrix ( i, j ) has a value of 0;

[0026] S62, sorting the fourth matrix by priority in ascending order of the number of elements K, wherein the smaller the number of elements K, the higher the priority;

[0027] S63, taking the fourth matrix with the highest priority;

[0028] S64, extracting the elements with a value of 0 at position (i, j) contained in the set P corresponding to the fourth matrix, and obtaining the users who have reserved the shared workstations corresponding to these elements in each unit time period;

[0029] S65, sending a request to the users to change shared workstations. If all users agree to the change, then updating the values ​​of the corresponding elements in the fourth matrix and recommending the shared workstations corresponding to the updated fourth matrix to the reserved users. Otherwise, proceeding to S66;

[0030] S66, take the fourth matrix of the next priority and return to S64.

[0031] In certain embodiments of the first aspect of the present application, in S62, if there are at least two fourth matrices with the same number of elements K, the users of the shared workstations corresponding to these elements are extracted according to the method of S64, and the average confidence values ​​of these users are calculated, and the at least two fourth matrices are prioritized from high to low according to the average confidence values.

[0032] In certain embodiments of the first aspect of the present application, in S65, a second confidence reward is given to the user who agrees to the change, and the value of the second confidence reward is greater than the value of the first confidence reward.

[0033] According to a second aspect of the present application, an electronic device is provided, including:

[0034] at least one processor; and

[0035] a memory communicatively connected to the at least one processor; wherein,

[0036] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method described in the first aspect of the present application.

[0037] According to a fourth aspect of the present application, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the method described in the first aspect of the present application.

[0038] Compared with the prior art, this application has the following beneficial effects:

[0039] This application adopts a method of configuring confidence levels for users and restricting them to only accepting recommended shared workstations when the confidence levels are lower than the set threshold. This makes shared workstations reserved by a single person more compact, and on the other hand, makes shared workstations that have not been reserved more compact, reserving sufficient space for the workstation combinations required for team reservations, thereby taking into account the needs of both single-person reservations and group reservations in the shared office area.

[0040] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The above and other objects, features and advantages of the exemplary embodiments of the present application will become readily understood by reading the detailed description below with reference to the accompanying drawings. In the accompanying drawings, several embodiments of the present application are shown in an illustrative and non-limiting manner, in which:

[0042] In the drawings, the same or corresponding reference numerals denote the same or corresponding parts.

[0043] Figure 1 A schematic diagram of the implementation process of Example 1 of the present application is shown.

[0044] Figure 2 A schematic diagram of the distribution of shared workstations in Example 1 of the present application is shown.

[0045] Figure 3 A schematic diagram of the shared workstation reservation status for the third unit time period of the first embodiment of the present application is shown.

[0046] Figure 4 A schematic diagram of the shared workstation reservation status for the 4th unit time period of the first embodiment of the present application is shown.

[0047] Figure 5 A partial implementation flow diagram of Example 2 of the present application is shown.

[0048] Figure 6 A schematic diagram of the structure of an electronic device according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0049] In order to make the purpose, features, and advantages of this application more obvious and easy to understand, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without making creative efforts shall fall within the scope of protection of this application.

[0050] Example 1:

[0051] Please refer to Figure 1 , this embodiment 1 provides a method for configuring a shared workstation, comprising the following steps:

[0052] S1. A shared office area is provided, wherein a plurality of shared workstations are arranged in the shared office area. In each unit time period, the reservation status of all shared workstations is recorded in a first matrix.

[0053] It is worth mentioning that the unit time period can be 0.5 hours, 1 hour or 4 hours.

[0054] The first matrix is ​​denoted as ,in, The serial number representing the unit time period, Represents the elements of the first matrix, elements When it is 0, it means that the corresponding shared workstation has been reserved. When it is 1, it means that the corresponding shared workstation has not been reserved; represents the number of rows, Represents the number of columns;

[0055] For details, please refer to Figure 2 As shown, a shared office area contains 40 shared workstations, which are distributed in an 8×5 array. Each shared workstation is marked with the coordinates of the corresponding rows and columns, and the corresponding first matrix is ​​an 8×5 matrix.

[0056] exist Figure 3 and Figure 4 As shown, the shadow represents that the corresponding shared workstation has been reserved, and the corresponding element value of the first matrix is ​​0; the blank represents that the corresponding shared workstation has not been reserved, and the corresponding element value of the first matrix is ​​1.

[0057] therefore, Figure 3 In the third unit period shown, the first matrix is:

[0058]

[0059] Similarly, Figure 4 In the fourth unit period shown, the first matrix is:

[0060]

[0061] At this point, the reservation status record for the shared workstations in the shared office area is completed.

[0062] S2 assigns a confidence level to each user. For each individual reservation, if the user accepts the recommended shared workstation, they receive a first confidence level reward. If they choose another shared workstation, they receive a first confidence level penalty. When the confidence level falls below the set threshold, the user can only accept the recommended shared workstation. By setting the confidence level, users can be restricted from freely choosing shared workstations, forcing some users to only accept the system-recommended shared workstations. This allows for a closer fit between reserved shared workstations, leaving enough space for the desired workstation combinations required for group reservations.

[0063] Specifically, in order to make the shared workstations recommended by the system more compact, the method for recommending shared workstations when making a single reservation in this embodiment is as follows:

[0064] Count the adjacent free space value of each unreserved shared workstation, where the adjacent free space value is the number of shared workstations adjacent to the shared workstation that are not reserved; recommend the shared workstation with the smallest adjacent free space value to the user. If there are multiple shared workstations with the smallest adjacent free space value, select any one of them.

[0065] like Figure 2As shown, in the initial state, the shared workstations in the four corners have the smallest adjacent availability values. For example, the shared workstation at coordinate 11 has no reservations, and its adjacent shared workstations at coordinates 12, 21, and 22 are all unreserved, so its adjacent availability value is 3. Therefore, any of the shared workstations in these four corners can be recommended to the user.

[0066] For example Figure 3 As shown in the figure, in the third unit time slot, the shared workstation at coordinate 21 has a calculated adjacent availability value of 2, which is the smallest value. Therefore, in this case, if a single person reserves a shared workstation for the third unit time slot, the system recommends the shared workstation at coordinate 21 to the user. Clearly, the system prioritizes shared workstations on the edge, making unreserved contributed workstations more concentrated and compact, thus reserving them for group reservations.

[0067] In addition, it is worth mentioning that the first confidence reward method is to increase the first step length based on the user's current confidence value; similarly, the first confidence penalty method is to reduce the first step length based on the user's current confidence value.

[0068] S3: Initiate a team reservation request, which includes a reservation time period, reservation members, and a workstation combination method, and the workstation combination method is recorded in a second matrix.

[0069] Specifically, the second matrix is ​​recorded as ,in, Represents the elements of the second matrix, elements When it is 0, it means that the corresponding shared workstation does not need to be reserved. When it is 1, it means that the corresponding shared workstation needs to be reserved; represents the number of rows, Represents the number of columns.

[0070] In one embodiment, the second matrix is:

[0071]

[0072] This means that you need to reserve a workstation combination with one contribution workstation on the right side of the first row, and three shared workstations side by side in the second and third rows.

[0073] S4: After receiving the reservation request, several first matrices corresponding to the reservation period are merged to obtain a third matrix.

[0074] The merging method is as follows:

[0075] The third matrix is ​​recorded as ,in, represents the elements of the third matrix;

[0076]

[0077] in, A set of serial numbers representing the unit time periods included in the reservation time period.

[0078] In the above formula, it can be simply understood that if a shared workstation has been reserved in any unit time period included in the reservation period, it will be marked as reserved in the third matrix, so as to avoid the shared workstation being repeatedly reserved in the subsequent shared workstation recommendation process for team reservations.

[0079] Specifically, taking the reservation period including the third unit period and the fourth unit period as an example, according to the first matrix records of the third unit period and the fourth unit period, after merging them using the above formula, the third matrix result is:

[0080]

[0081] At this point, the calculation of the third matrix is ​​completed.

[0082] S5, using a moving window method to sequentially intercept the fourth matrix under the third matrix. Each time a fourth matrix is ​​intercepted, the second matrix is ​​compared with the fourth matrix. If the reservation conditions are met, the shared workstation corresponding to the fourth matrix is ​​recommended to the reservation user; otherwise, the next fourth matrix is ​​intercepted.

[0083] The recommended shared workstations must meet the following conditions: corresponding to the combination of multiple shared workstations that need to be reserved in the second matrix, the shared workstations in the corresponding arrangement must not be reserved within the reservation period.

[0084] In order to meet the above conditions, this embodiment proposes a method for comparing the second matrix with the fourth matrix as follows:

[0085] The fourth matrix is ​​recorded as ,in, Represents the elements of the fourth matrix.

[0086] It is worth mentioning that the number of rows and columns of the fourth matrix is ​​equal to that of the second matrix. and the third matrix For example, the 3×3 part of the upper left corner of the first fourth matrix and the third matrix is ​​intercepted by moving the window, specifically: , if it is not satisfied, then move one unit to the right and intercept the second and fourth matrices as follows: , and so on until it is intercepted to the upper right corner, then move down one unit and intercept the next fourth matrix: , and so on, until the 3×3 part at the lower right corner of the third matrix is ​​intercepted.

[0087] Count all elements in the second matrix that have a value of 1 , and record its corresponding position ( i, j ), and construct the corresponding set P, and then compare the positions contained in the corresponding set P in the fourth matrix one by one ( i, j ) element values, if the fourth matrix is ​​at these positions ( i, j ) are all 1, the reservation condition is met, otherwise the reservation condition is not met.

[0088] If the user accepts the recommended shared workstation, the reservation is completed. If not, they need to return to S3 to change the workstation combination and make a team reservation again.

[0089] Example 2:

[0090] In the solution of the first embodiment, when there are many individual reservations or too many group reservations, there may be a situation where all the fourth matrices in S5 fail to meet the reservation conditions.

[0091] Therefore, the second embodiment is further improved on the basis of the first embodiment. In S5, if all fourth matrices fail to meet the reservation condition, the following steps are performed:

[0092] S6, counting the comparison results of the second matrix and all the fourth matrices, and sorting the priorities of all the fourth matrices according to the statistical results, and sending requests to users of the reserved shared workstations in descending order of priority until the users agree to the change.

[0093] Please refer to Figure 5 , the specific method is as follows:

[0094] S61, record the positions included in the corresponding set P in each fourth matrix ( i, j ) has a value of 0;

[0095] S62: Prioritize the fourth matrices in ascending order of the number of elements K. The smaller the number of elements K, the higher the priority. If at least two fourth matrices have the same number of elements K, extract the users who share the workstations corresponding to those elements. For a specific extraction method, refer to the method in S64. Then, calculate the average confidence level of those users, and prioritize the at least two fourth matrices in descending order of the average confidence level.

[0096] S63, taking the fourth matrix with the highest priority;

[0097] S64, extracting the elements with a value of 0 at position (i, j) contained in the set P corresponding to the fourth matrix, and obtaining the users who have reserved the shared workstations corresponding to these elements in each unit time period;

[0098] S65, sending a request to the users to change shared workstations. If all users agree to the change, then updating the values ​​of the corresponding elements in the fourth matrix and recommending the shared workstations corresponding to the updated fourth matrix to the reserved users. Otherwise, proceeding to S66;

[0099] If the user agrees to change the location, the user will be given a second confidence reward. The method of the second confidence reward is also to add a second step length based on the user's current confidence value, and the value of the second confidence reward is greater than the value of the first confidence reward, that is, the second step length is greater than the first step length.

[0100] It's also worth mentioning that in addition to the second confidence reward for users, team members are also penalized. The third step is reduced based on each member's confidence value. First, calculate the sum of the second steps of all second confidence rewards during the team booking process, then divide this sum by the number of members to obtain the third step of the team confidence penalty for each member.

[0101] S66, take the fourth matrix of the next priority and return to S64.

[0102] Ultimately, the use of confidence rewards makes it possible to take into account the needs of both individual and group reservations, and to meet the needs of the public as much as possible.

[0103] Example 3:

[0104] This third embodiment also provides an electronic device and a readable storage medium.

[0105] Figure 6 A schematic block diagram of an example electronic device that can be used to implement an embodiment of the present application is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present application described and / or required herein.

[0106] like Figure 6As shown, the device includes a computing unit that can perform various appropriate actions and processes based on a computer program stored in a read-only memory (ROM) or loaded from a storage unit into a random access memory (RAM). The RAM can also store various programs and data required for device operation. The computing unit, ROM, and RAM are interconnected via a bus. An input / output (I / O) interface is also connected to the bus.

[0107] Many components in a device are connected to the I / O interface, including: input units, such as a keyboard and mouse; output units, such as various types of displays and speakers; storage units, such as magnetic disks and optical disks; and communication units, such as network cards, modems, and wireless communication transceivers. The communication unit allows the device to exchange information / data with other devices via computer networks such as the Internet and / or various telecommunication networks.

[0108] The computing unit can be any general-purpose and / or specialized processing component with processing and computing capabilities. Some examples of computing units include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit performs the various methods and processes described above, such as the shared workstation configuration method described in Example 1. For example, in some embodiments, the shared workstation configuration method can be implemented as a computer software program tangibly embodied in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program can be loaded and / or installed onto the device via ROM and / or a communication unit. When the computer program is loaded into RAM and executed by the computing unit, one or more steps of the shared workstation configuration method described above can be performed. Alternatively, in other embodiments, the computing unit can be configured to perform the shared workstation configuration method via any other suitable means (e.g., via firmware).

[0109] Various embodiments of the systems and techniques described above can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-chip systems (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that are executable and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0110] The program code for implementing the methods of the present application can be written in any combination of one or more programming languages. Such program code can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the program code is executed by the processor or controller, the functions / operations specified in the flow charts and / or block diagrams are implemented. The program code can be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0111] In the context of this application, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or apparatus. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of machine-readable storage media may include an electrical connection based on one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fibers, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0112] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0113] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.

[0114] A computer system may include a client and a server. The client and server are generally remote from each other and typically interact through a communication network. The client-server relationship arises through computer programs running on the respective computers and having a client-server relationship with each other. The server may be a cloud server, a server in a distributed system, or a server integrated with a blockchain.

[0115] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in this application can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of this application can be achieved. This is not limited herein.

[0116] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features being referred to. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. Throughout the description of this application, "plurality" means two or more, unless otherwise specifically defined.

[0117] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A method for configuring a shared workstation, characterized in that: The following steps are involved: S1. A shared office area is provided, wherein a plurality of shared workstations are arranged in the shared office area. In each unit time period, the reservation status of all shared workstations is recorded using a first matrix. S2: Assign a confidence level to each user. During each single-person reservation, if the user accepts the recommended shared workstation, they will receive a first confidence level reward. If the user chooses another shared workstation, they will receive a first confidence level penalty. When the confidence level falls below the set threshold, the user can only accept the recommended shared workstation. S3, initiating a team reservation request, the team reservation request including the reservation time period, reservation members, and workstation combination, the workstation combination being recorded in a second matrix; S4, after receiving the reservation request, merging the first matrices corresponding to the reservation period to obtain a third matrix; S5, sequentially intercepting fourth matrices under the third matrix using a moving window method. Each time a fourth matrix is ​​intercepted, the second matrix is ​​compared with the fourth matrix. If the reservation conditions are met, a shared workstation corresponding to the fourth matrix is ​​recommended to the reservation user; otherwise, the next fourth matrix is ​​intercepted. In S5, if all fourth matrices fail to meet the reservation condition, the following steps are performed: S6, counting the comparison results of the second matrix and all the fourth matrices, and prioritizing all the fourth matrices according to the statistical results, and sending requests to users of the reserved shared workstations in descending order of priority until the users agree to the change; The specific method of step S6 is as follows: S61, record the positions included in the corresponding set P in each fourth matrix ( i, j ) has a value of 0; S62, sorting the fourth matrix by priority in ascending order of the number of elements K, wherein the smaller the number of elements K, the higher the priority; S63, taking the fourth matrix with the highest priority; S64, extracting the elements with a value of 0 at position (i, j) contained in the set P corresponding to the fourth matrix, and obtaining the users who have reserved the shared workstations corresponding to these elements in each unit time period; S65, sending a request to the users to change shared workstations. If all users agree to the change, then updating the values ​​of the corresponding elements in the fourth matrix and recommending the shared workstations corresponding to the updated fourth matrix to the reserved users. Otherwise, proceeding to S66; S66, take the fourth matrix of the next priority and return to S64; In S62, if there are at least two fourth matrices with the same number of elements K, the users of the shared workstations corresponding to these elements are extracted according to the method of S64, and the average confidence values ​​of these users are calculated. The at least two fourth matrices are prioritized from high to low according to the average confidence values. In S65, a second confidence reward is given to the user who agrees to the change, and the value of the second confidence reward is greater than the value of the first confidence reward; The first confidence reward method is to increase the first step length based on the user's current confidence value; The first confidence penalty method is to reduce the first step length based on the user's current confidence value; The second confidence reward method is to increase the second step length based on the user's current confidence value, and the second step length is greater than the first step length; On the basis of the second confidence reward for the user, the team reservation members are also punished with team confidence, and the third step is reduced based on the confidence value of each reservation member; first calculate the sum of the second steps of all second confidence rewards in the team reservation process, and then divide the sum by the number of reservation members, and the result is the third step of the team confidence penalty for each reservation member.

2. The method for configuring a shared workstation according to claim 1, wherein: When a single person makes a reservation, the method for recommending a shared workstation is as follows: count the adjacent idle value of each unreserved shared workstation, where the adjacent idle value is the number of shared workstations adjacent to the shared workstation and not reserved; recommend the shared workstation with the smallest adjacent idle value to the user; if there are multiple shared workstations with the smallest adjacent idle value at the same time, select any one of them.

3. The method for configuring a shared workstation according to claim 1, wherein: In S4, the method of combining the first matrices corresponding to the reservation period to obtain the third matrix is ​​as follows: The first matrix is ​​denoted as ,in, The serial number representing the unit time period, Represents the elements of the first matrix, elements When it is 0, it means that the corresponding shared workstation has been reserved. When it is 1, it means that the corresponding shared workstation has not been reserved; represents the number of rows, Represents the number of columns; The third matrix is ​​recorded as ,in, represents the elements of the third matrix; in, A set of serial numbers representing the unit time periods included in the reservation time period.

4. The method for configuring a shared workstation according to claim 3, wherein: In S5, the method of comparing the second matrix with the fourth matrix is ​​as follows: The second matrix is ​​recorded as ,in, Represents the elements of the second matrix, elements When it is 0, it means that the corresponding shared workstation does not need to be reserved. When it is 1, it means that the corresponding shared workstation needs to be reserved; represents the number of rows, Represents the number of columns; The fourth matrix is ​​recorded as ,in, represents the elements of the fourth matrix; Count all elements whose value is 1 , and record its corresponding position ( i, j ), and construct the corresponding set P, and then compare the positions contained in the corresponding set P in the fourth matrix one by one ( i, j ) element values, if the fourth matrix is ​​at these positions ( i， j ) are all 1, the reservation condition is met, otherwise the reservation condition is not met.

5. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 4.

6. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 4.

Images