JP5702655B2 - Locker room management system - Google Patents

Description

  The present invention relates to a locker room management system that assigns a locker installed in a locker room to a user.

  Generally, a company office or the like is provided with a locker room in which a plurality of lockers are installed. There are often no clear rules for how to assign lockers to users. For example, there are almost all methods of assigning vacant lockers to new employees or grouping them in the same department or section.

  Patent Document 1 listed below discloses a locker room system for the purpose of preventing the rented article from being stolen or lost. Patent Document 2 below discloses an exit / exit management system that notifies a contact person of the status of exit / exit of a person to be managed who attends a cram school, a school, or a company.

JP 2007-247391 A International Publication No. 2006/011557

  In most cases, the area occupied by the user when using the locker is wider than the installation interval of the locker. For this reason, there may be a situation in which adjacent locker users have to put together and care about each other. In particular, when the passage in the locker room is narrow, users may come into contact with each other, so adjacent locker users need to use the locker while avoiding each other. For example, even if you are changing clothes in front of your own locker, you need to change your clothes so that you do not come into contact with the locker while paying attention to the presence and movement of the adjacent locker users. If there is already a user using the locker between the locker room entrance and the locker, it is necessary to go to the locker while avoiding the user. At this time, the user who has already used the locker needs to use the locker while paying attention to the movements of other users passing in front of or behind the locker. Further, when a plurality of users use their own lockers at the same time, the locker room becomes crowded, so it is necessary to use the lockers, change clothes, or pass through a passage in a narrow space. Therefore, the work efficiency of each user may be reduced. As described above, randomly assigning lockers to users may inconvenience users.

  Note that the locker room system described in Patent Document 1 described above is intended to prevent theft and loss of articles, and does not consider the convenience of those who use the locker.

  The objective of this invention is providing the locker room management system which aimed at the improvement of the convenience of those using a locker.

The present invention seeks an entry / exit management means for managing a user's entry / exit to a locker room in which a plurality of lockers are arranged, an assignment pattern that can be taken when a locker is temporarily assigned to a user, Based on the history of each user's entry / exit, with respect to the possible allocation patterns, between each locker user placed at a position along the movement area of the locker user, in each locker room of each user It determined the length of the time period during which period the residence time overlap, have a, a calculating means for obtaining an allocation pattern the length of the time zone of the overlapping of the take obtain allocation pattern is minimized, said calculating means the weighting process in accordance with the positional relationship of the plurality of rocker performed to the length of the time zone in which the overlapping, obtaining the allocation pattern based on the length of the time period after the weighting process, the A locker room management system to butterflies.

  Further, in the locker room management system according to the present invention, the calculation means obtains a length of a time zone in which a stay time zone overlaps between users of lockers adjacent to each other for the possible allocation pattern, An allocation pattern that minimizes the length of the overlapping time zone is obtained from the possible allocation patterns.

  Further, in the locker room management system according to the present invention, the calculation means, as the weighting process, is a length of a time zone in which a stay time zone overlaps between users of the lockers arranged side by side in the left-right direction. Is multiplied by the first weighting coefficient, and the length of the time zone in which the staying time zones overlap among the users of the lockers arranged in the vertical direction is larger than the first weighting factor. A weighting coefficient is multiplied, and an allocation pattern is obtained based on the length of the time zone after the weighting process.

  This invention calculates | requires the length of the time slot | zone when the staying time slot | zone of each user's locker room overlaps between each user of the locker arrange | positioned along the movement area | region of the user of a locker, and the overlap An allocation pattern that minimizes the length of the time zone is obtained. This makes it possible to obtain an allocation pattern that can improve the convenience of the locker user.

It is a block diagram which shows the locker room management system which concerns on embodiment of this invention. It is a table | surface which shows the log | history of the entrance / exit to a locker room. It is a figure which shows the allocation pattern of a locker. It is a figure which shows the log | history of the entrance / exit to a locker room, and is a figure for demonstrating the length of the overlapping stay time. It is a table | surface which shows the duplication degree for every allocation pattern of a locker. It is a figure which shows a two-stage pile rocker typically. It is a figure which shows the example of arrangement | positioning of the locker in a locker room. It is a figure which shows the example of arrangement | positioning of the locker in a locker room, and is a figure for demonstrating a user's flow line.

  With reference to FIG. 1, the locker room management system which concerns on this embodiment is demonstrated. FIG. 1 is a block diagram showing a locker room management system according to an embodiment of the present invention. The locker room management system 1 which concerns on embodiment of this invention calculates | requires the allocation pattern for allocating the locker installed in the locker room 20 to a user.

  The locker room 20 is a room in which lockers are arranged, and is provided, for example, in a company office. The wall of the locker room 20 is provided with a door 21 serving as a user entrance. In the example shown in FIG. 1, three lockers (lockers 31, 32, 33) are arranged in a row in the locker chamber 20. Specifically, the locker 31 is installed on one side of the locker 32 with the locker 32 in between, and the locker 33 is installed on the other side of the locker 32. For example, lockers 31, 32, and 33 are arranged in a line at positions facing the door 21.

  The locker room management system 1 according to the present embodiment includes an entrance / exit management unit 2, an entrance / exit history storage unit 3, a calculation unit 4, a location information storage unit 8, and an output unit 9. In addition, the calculation unit 4 includes a redundancy degree calculation unit 5, a statistical processing unit 6, and an allocation pattern determination unit 7.

  The entrance / exit management unit 2 manages the entrance / exit of the user with respect to the locker room 20. The entry / exit history storage unit 3 stores user entry / exit history information obtained by the entry / exit management unit 2. The entrance / exit management unit 2 is connected to the storage medium information reading units 22 and 23 and an electric lock (not shown) of the door 21.

  The storage medium information reading units 22 and 23 read storage medium information stored in a storage medium possessed by the user. The storage medium information reading unit 22 is installed near the door 21 and outside the locker chamber 20. The storage medium information reading unit 23 is installed in the vicinity of the door 21 and inside the locker chamber 20. The storage medium possessed by the user is, for example, a card or a portable terminal. The storage medium information stored in the storage medium is information (ID) that proves the identity of the user who owns the storage medium, and is information including, for example, an ID number or a figure including a plurality of characters. The storage medium information reading units 22 and 23 read the storage medium information with or without contact with the storage medium, and output the storage medium information to the entrance / exit management unit 2. In the present embodiment, the case where the storage medium information reading units 22 and 23 read the storage medium information has been described. However, the present embodiment is not limited to this configuration. For example, if it is information that proves the identity of the user, the storage medium information reading units 22 and 23 read biometric information such as fingerprints or veins and output the biometric information to the entrance / exit management unit 2. Also good.

  The entrance / exit management unit 2 stores personal information of the user of the locker room 20. The personal information of the user is information including, for example, an ID number and an entry / exit permission room number corresponding to the ID number. The entry / exit room number is a number assigned to a room where entry / exit is permitted.

  The entrance / exit management unit 2 manages the user's entrance / exit by comparing the storage medium information read by the storage medium information reading units 22 and 23 with the personal information stored in the entrance / exit management unit 2. Specifically, when the user enters the room, the entrance / exit management unit 2 receives, for example, an ID number that is storage medium information from the storage medium information reading unit 22 outside the locker room 20. Then, the entrance / exit management unit 2 compares the ID number output from the storage medium information reading unit 22 with the ID number stored in the entrance / exit management unit 2, and enters / exits permission corresponding to the matched ID number. Confirm entry based on room number. When there is an entry / exit room number for the locker room 20, the entrance / exit management unit 2 confirms the user's entry and outputs an unlock command to the electric lock of the door 21. At this time, the storage medium information reading unit 22 may notify that the user has been permitted to enter the room by displaying a voice or a lamp. On the other hand, when there is no entry / exit permission room number of the locker room 20, the entrance / exit management unit 2 does not permit the user to enter the room, and the electric lock of the door 21 remains locked. At this time, the storage medium information reading unit 22 may notify that the user is not permitted to enter the room by displaying a voice or a lamp.

  When the user leaves the room, the entrance / exit management unit 2 receives an ID number that is storage medium information from the storage medium information reading unit 23 inside the locker room 20. Then, the entrance / exit management unit 2 collates the ID number output from the storage medium information reading unit 23 with the ID number stored in the entrance / exit management unit 2, and confirms the exit when the ID numbers match. I do. When the ID numbers match, the entrance / exit management unit 2 confirms the user's exit and outputs an unlock command to the electric lock of the door 21. At this time, the storage medium information reading unit 23 may notify the user that the user is permitted to leave the room by displaying a voice or a lamp.

  The entrance / exit management unit 2 obtains the staying time zone (usage time zone) during which the user stayed in the locker room 20 based on the time point when the user entered the room and the time point when the user left the room, and entered the room. Information indicating the time point, the leaving time point, and the staying time zone is managed as user entry / exit history information. The entry / exit history storage unit 3 stores entry / exit history information of each user. For example, the entrance / exit management unit 2 stays in the locker room 20 based on the time at which the user has entered the room (room entry time) and the time at which the user has confirmed the room exit (the room exit time). Ask for a belt. In this case, the time zone between the entry time and the exit time corresponds to the staying time zone. The entrance / exit history storage unit 3 stores entrance / exit history information indicating an entrance time, an exit time, and a staying time zone. Note that the storage medium information reading unit 23 may not be provided inside the locker chamber 20, but only the storage medium information reading unit 22 may be provided outside, and verification may be performed only when entering the room. In this case, the entrance / exit management unit 2 estimates the time obtained by adding a predetermined time to the entrance time as the exit time, and the user stays in the locker room 20 based on the entrance time and the estimated exit time. Find the time of stay. The predetermined time to be added to the room entry time may be set in advance in the entrance / exit management unit 2, or the operator may input a value indicating the predetermined time using an input unit (not shown). For example, the length of the user's past staying time may be set as the predetermined time.

  With reference to FIG. 2, an example of the entry / exit history of each user will be described. FIG. 2 is a table showing a history of entering and leaving the locker room. As an example, the users of the locker room 20 are three users A, B, and C. The table of FIG. 2 shows the history of entering and leaving the locker room 20 for one day for users A, B, and C. For example, the user A enters the locker room 20 at 08:30 (entry time T1) and leaves the locker room 20 at 08:35 (exit time T2). Thereafter, the user A enters the locker room 20 at 20:45 (entry time T3) and leaves the locker room 20 at 20:50 (exit time T4). User B enters the locker room 20 at 08:34 (entry time T1) and leaves the locker room 20 at 08:39 (exit time T2). Thereafter, the user B enters the locker room 20 at 20:49 (entry time T3), and leaves the locker room 20 at 20:54 (exit time T4). User C enters the locker room 20 at 08:32 (entry time T1), and leaves the locker room 20 at 08:37 (exit time T2). Thereafter, the user C enters the locker room 20 at 20:43 (entry time T3), and leaves the locker room 20 at 20:48 (exit time T4). For example, it is assumed that an employee (an example of a user) working at a company uses the locker room 20 when leaving the office and then uses the locker room 20 again when leaving the office, as in the example of the entry / exit history shown in FIG. Is done. The entry / exit history storage unit 3 includes user A's entry / exit history information (entry time T1, exit time T2, entry time T3, exit time T4) and user B's entry / exit history information (entry time T1, exit time). (T2, entry time T3, exit time T4) and user C entry / exit history information (entry time T1, exit time T2, entry time T3, exit time T4) are stored.

  The calculation unit 4 obtains an allocation pattern for allocating a locker to each user based on the entry / exit history of each user in the locker room 20. The calculating part 4 calculates | requires the length of the time slot | zone when each user's stay time zone in the locker room 20 overlaps between each user, and calculates | requires an allocation pattern based on the length of the overlapped time slot | zone. In other words, the calculation unit 4 obtains the length of time that each user stays in the locker room 20 overlapping each other, and determines an allocation pattern based on the length of time. For example, the calculation unit 4 targets locker users arranged at positions along the movement area of the locker user, and the staying time zone (usage time zone) of each user in the locker room 20 is used for each usage. The length of a time zone that overlaps between users (hereinafter sometimes referred to as “overlap time”) is obtained, and an allocation pattern that shortens the length of the overlap time between users is obtained. Here, the movement area of the user is an area where there is a high possibility that the user exists, and corresponds to a flow line of the user in the locker room 20, for example. As an example of the locker arranged at a position along the movement area (flow line) of the user, there are lockers adjacent to each other. That is, the lockers adjacent to each other are included in the concept of the lockers arranged along the movement area (flow line) of the user. As an example, for users of adjacent lockers, the length of the time period in which the stay time period (use time period) of each user in the locker room 20 overlaps between each user is obtained, A case will be described in which an allocation pattern in which the length of the overlap time is reduced is calculated. Hereinafter, the duplication degree calculation unit 5, the statistical processing unit 6, and the allocation pattern determination unit 7 included in the calculation unit 4 will be described.

  Based on the entry / exit history of each user in the locker room 20, the overlapping degree calculation unit 5 is a time period in which the staying time period (usage time period) of each user in the locker room 20 overlaps between the users ( Find the length of overlap time. In other words, the duplication degree calculation unit 5 obtains the length of time that each user stays in the locker room 20 overlapping each other. The duplication degree calculation unit 5 obtains the length of the duplication time for each user. Here, the length of the overlap time is defined as the overlap degree. The redundancy calculation unit 5 obtains all allocation patterns that can be taken when a locker is temporarily allocated to a user, and each locker user arranged at a position along the movement area of the locker user for each allocation pattern. In the meantime, the length (duplication degree) of the time zone in which each user's stay time zone overlaps is obtained for each user. As an example, the duplication degree calculation unit 5 obtains, for each user, the length (duplication degree) of a time zone in which the stay time zones overlap between users of adjacent lockers for each allocation pattern.

  First, the degree-of-redundancy calculation unit 5 provides a locker to a user based on position information (coordinate information) indicating the position of each locker installed in the locker room 20 and personal information (for example, an ID number) of each user. All the allocation patterns that can be taken when are assigned are determined. Since the personal information of the user is managed by the entrance / exit management unit 2, the duplication degree calculation unit 5 acquires the personal information of each user from the entrance / exit management unit 2. Further, position information (coordinate information) indicating the position of each locker installed in the locker chamber 20 is stored in advance in the position information storage unit 8. For example, the position information storage unit 8 stores identification information (for example, a number) for identifying the locker and position information indicating the position of the locker in association with each other. The position (coordinate) of each locker may be obtained with the position of the door 21 that is the entrance / exit of the locker chamber 20 as the origin of the coordinate system and the origin as a reference. Further, the position information storage unit 8 may store position information indicating the position of the door 21 and position information indicating the position of the wall of the locker chamber 20.

  As an example, the case where the three lockers 31, 32, and 33 shown in FIG. 1 are assigned to three users A, B, and C will be described. FIG. 3 shows an allocation pattern when the lockers 31, 32, and 33 are temporarily allocated to the users A, B, and C. FIG. 3 is a diagram showing a locker allocation pattern. Since the lockers 31, 32, and 33 are arranged symmetrically around the locker 32, there are three allocation patterns 1, 2, and 3 in the allocation pattern. Specifically, in the allocation pattern 1, the locker 31 is allocated to the user A, the locker 32 is allocated to the user B, and the locker 33 is allocated to the user C. In the allocation pattern 2, the locker 31 is allocated to the user B, the locker 32 is allocated to the user A, and the locker 33 is allocated to the user C. Moreover, in the allocation pattern 3, the locker 31 is allocated to the user B, the locker 32 is allocated to the user C, and the locker 33 is allocated to the user A.

  Based on the entry / exit histories of users A, B, and C, the overlap degree calculation unit 5 overlaps the stay time zones (use time zones) between the users of the adjacent lockers for the allocation patterns 1, 2, and 3. Find the length of the time zone (redundancy). As an example, with reference to FIG. 4, a method for obtaining the degree of duplication of users A, B, and C in allocation pattern 1 will be described. FIG. 4 is a diagram showing the history of entering and leaving the locker room, and is a diagram for explaining the length of the overlap time in which the stay time zones overlap.

(About User A)
In the allocation pattern 1, the locker 31 is allocated to the user A. The locker adjacent to the locker 31 is a locker 32, and the locker 32 is assigned to the user B. Therefore, for user A, user B is the target for calculating the degree of overlap. For the user A, the duplication degree calculation unit 5 obtains the length of the time period in which the stay time period overlaps with the user B (duplication degree α _A ).

The degree of overlap α A for user _A is as follows:
1 minute (the length of time that user A's entry time T1 to exit time T2 overlaps with user B's entry time T1 to exit time T2) + 1 minute (user A's The length of time in which the time zone from the entry time T3 to the exit time T4 overlaps the time zone from the entrance time T3 to the exit time T4 of the user B) = 2 minutes.

More specifically, as shown in FIGS. 2 and 4, the first staying time zone of the user A is a time zone from the entry time T1 (08:30) to the exit time T2 (08:35). The first staying time zone of user B is the time zone from the entry time T1 (08:34) to the exit time T2 (08:39). Therefore, the staying time zone overlaps between User A and User B for 1 minute between 08:34 and 08:35. In addition, the second staying time zone of the user A is a time zone from the entry time T3 (20:45) to the leaving time T4 (20:50), and the second staying time zone of the user B is This is the time period from the entry time T3 (20:49) to the exit time T4 (20:54). Therefore, the staying time zone overlaps between user A and user B for one minute between 20:49 and 20:50. Therefore, the overlap degree α A for the user _A is 2 minutes (1 minute + 1 minute).

(About User B)
In the allocation pattern 1, the central locker 32 is allocated to the user B. Lockers adjacent to the locker 32 are lockers 31 and 33, the locker 31 is assigned to the user A, and the locker 33 is assigned to the user C. Therefore, for user B, users A and C are the targets for calculating the degree of overlap. For user B, overlap degree calculation unit 5 determines the length of the time period in which the stay time period overlaps with user A (overlap degree α _B1 ) and the stay time period with user C. the length of overlapping time zone and (multiplicity alpha _B2) determined by adding the overlap degree alpha _B1 and multiplicity alpha _B2, determine the multiplicity alpha _B for user B.

The degree of overlap for user B is as follows:
1 minute (the length of time that user B's entry time T1 to exit time T2 overlap with user A's entry time T1 to exit time T2) + 1 minute (user B's Length of time that overlaps the time period from the entry time T3 to the exit time T4 and the time period from the entry time T3 to the exit time T4 of the user A + 3 minutes (the entry time T1 to the exit time T2 of the user B) And the time zone from user C's entry time T1 to exit time T2 overlap + 0 minutes (user B's entrance time T3 to exit time T4) The length of the time that overlaps the time zone from the entrance time T3 to the exit time T4 of the person C) = 5 minutes.

As explained in the calculation for the user A, the staying time zone overlaps with the user A and the user B for 2 minutes, so the overlap degree α _B1 between the user A and the user B is 2 minutes (1 minute + 1 minute). On the other hand, the first staying time zone of the user B is the time zone from the entry time T1 (08:34) to the leaving time T2 (08:39), and the first staying time zone of the user C is This is the time period from the entry time T1 (08:32) to the exit time T2 (08:37). Accordingly, the staying time zones of User B and User C overlap for 3 minutes between 08:34 and 08:37. In addition, the second staying time zone of the user B is a time zone from the entry time T3 (20:49) to the leaving time T4 (20:54), and the second staying time zone of the user C is This is the time period from the entry time T3 (20:43) to the exit time T4 (20:48). Therefore, the stay time zones do not overlap between the user B and the user C in the second stay time zone. Therefore, the degree of overlap α _B2 between the user B and the user C is 3 minutes. Therefore, the overlapping degree α B for the user _B is 5 minutes (1 minute + 1 minute + 3 minutes + 0 minutes).

(About User C)
In the allocation pattern 1, the locker 33 is allocated to the user C. The locker adjacent to the locker 33 is the locker 32, and the locker 32 is assigned to the user B. Therefore, for user C, user B is the target for calculating the degree of overlap. For the user C, the duplication degree calculation unit 5 obtains the length of the time period in which the stay time period overlaps with the user B (duplication degree α _C ).

The degree of overlap α C for user _C is as shown in the following equation:
3 minutes (the length of time that user C's entry time T1 to exit time T2 overlaps with user B's entry time T1 to exit time T2) + 0 minutes (user C's The length of time in which the time zone from entry time T3 to exit time T4 and the time zone from user B entry time T3 to exit time T4 overlap) is 3 minutes.

As described in the calculation for the user B, the stay time zone overlaps with the user B and the user C for 3 minutes, so the overlap degree α _C for the user _C is 3 minutes (3 minutes + 0 Min).

  The duplication degree calculation unit 5 obtains the duplication degrees of the users A, B, and C in the assignment patterns 2 and 3 in the same manner as the duplication degrees of the users A, B, and C in the assignment pattern 1. Then, the duplication degree calculation unit 5 outputs duplication degree information indicating the duplication degree of each user in each allocation pattern to the statistical processing unit 6. In the example described above, the duplication degree calculation unit 5 includes duplication degree information indicating the duplication degree of each of the users A, B, and C in the allocation pattern 1 and each duplication of the users A, B, and C in the assignment pattern 2. The degree-of-duplication information and the degree-of-duplication information indicating the degree of duplication of each of the users A, B, and C in the allocation pattern 3 are output to the statistical processing unit 6.

The degree of duplication of users A, B, and C in the allocation patterns 1, 2, and 3 is shown in FIG. FIG. 5 is a table showing the degree of overlap for each locker allocation pattern. As shown in the table of FIG. 5, in the allocation pattern 1, the overlap degree α _A of the user _A is 2 minutes, the overlap degree α _B of the user _B is 5 minutes, and the overlap degree α _{C of the} user _C. Is 3 minutes. In the allocation pattern 2, the overlap degree α _A of the user _A is 8 minutes, the overlap degree α _B of the user _B is 2 minutes, and the overlap degree α _C of the user _C is 6 minutes. In the allocation pattern 3, the overlap degree α _A of the user _A is 6 minutes, the overlap degree α _B of the user _B is 3 minutes, and the overlap degree α _C of the user _C is 9 minutes.

The statistical processing unit 6 receives the redundancy information obtained by the redundancy calculation unit 5 and obtains the average value and variance of the redundancy. For example, the statistical processing unit 6 obtains the average value and variance of the respective degrees of overlap α _A , α _B , α _C of the users A, B, C in the same allocation pattern. Specifically, the statistical processing unit 6 obtains the average value and variance of the respective degrees of overlap α _A , α _B , and α _C of the users A, B, and C in the allocation pattern 1. Further, the statistical processing unit 6 obtains an average value and a variance of the respective degrees of overlap α _A , α _B , and α _C of the users A, B, and C in the allocation pattern 2. Further, the statistical processing unit 6 obtains an average value and a variance of the respective degrees of overlap α _A , α _B , and α _C of the users A, B, and C in the allocation pattern 3. FIG. 5 shows the average value and variance of the degree of overlap in the allocation patterns 1, 2, and 3. For example, for allocation pattern 1, the average value of the degree of duplication is 3.33 minutes and the variance of the degree of duplication is 1.56 / ² . The statistical processing unit 6 outputs statistical information indicating the average value and the variance value of the degree of overlap in each allocation pattern to the allocation pattern determination unit 7. Note that the statistical processing unit 6 may obtain only the average value of the degree of overlap in each allocation pattern, and output statistical information indicating the average value to the allocation pattern determination unit 7.

  The allocation pattern determination unit 7 determines an allocation pattern for allocating lockers to users based on the statistical information obtained by the statistical processing unit 6. For example, the assignment pattern determination unit 7 compares the average value and variance of the degree of overlap in each assignment pattern, and outputs assignment pattern information indicating the assignment pattern that minimizes the average value and variance of the degree of overlap to the output unit 9. The allocation pattern determination unit 7 may output allocation pattern information indicating an allocation pattern in which both the average value and the variance of the duplication degree are minimum to the output unit 9, or an allocation pattern in which the average value of the duplication degree is the smallest May be output to the output unit 9. A small degree of overlap means that the length of overlapping staying hours is short between locker users (for example, between adjacent locker users) arranged along the user's movement area. doing. The allocation pattern information is information indicating association between locker identification information (for example, a number) and user personal information (for example, an ID number), for example.

  In the example shown in FIG. 5, the average value and variance of the degree of overlap in allocation pattern 1 are smaller than the average value and variance of the degree of overlap in allocation patterns 2 and 3. Therefore, the allocation pattern determination unit 7 determines the allocation pattern 1 as an allocation pattern for allocating a locker to the user, and outputs allocation pattern information indicating the allocation pattern 1 to the output unit 9. In the example shown in FIG. 3, the allocation pattern information indicating the allocation pattern 1 includes the association between the identification information (for example, the number) of the locker 31 and the personal information (for example, the ID number) of the user A, the identification number and the usage of the locker 32. The association with the personal information of the person B and the association between the identification information of the locker 33 and the personal information of the user C are shown.

  The output unit 9 displays the allocation pattern obtained by the calculation unit 4, stores the allocation pattern information, and outputs the allocation pattern information to the outside of the locker room management system 1. For example, the output unit 9 may be configured by a display device and display the allocation pattern obtained by the calculation unit 4. Or the output part 9 is comprised with the memory | storage device, and may store allocation pattern information. Alternatively, the output unit 9 may be a printer that prints on paper or the like, and the allocation pattern may be printed on paper or the like. Or the output part 9 is comprised with communication apparatuses, such as a network interface, and may transmit allocation pattern information to the exterior of the locker room management system 1. FIG. In the above-described example, the output unit 9 receives the allocation pattern information indicating the allocation pattern 1 from the allocation pattern determination unit 7 and displays a table or a diagram indicating the correspondence between the locker and the user in the allocation pattern 1. Or print. For example, the output unit 9 corresponds to the correspondence between the identification information of the locker 31 and the personal information of the user A, the correspondence between the identification information of the locker 32 and the personal information of the user B, and the identification information of the locker 33 and the user C's personal information. Display or print correspondence tables and diagrams showing correspondence with personal information.

  According to the locker room management system 1 having the above-described configuration, by calculating the degree of duplication among locker users arranged at positions along the user's movement area and obtaining an allocation pattern that minimizes the degree of duplication. Thus, it is possible to obtain an allocation pattern that makes it difficult for use time zones (stay time zones) to overlap between locker users arranged at positions along the user's movement area. As an example, by calculating the degree of overlap between users of adjacent lockers and obtaining an allocation pattern that minimizes the degree of overlap, the use time zones (stay time zones) are difficult to overlap between users of adjacent lockers. An allocation pattern can be obtained. Accordingly, an administrator or the like who manages the locker room assigns each locker to each user according to the assignment pattern obtained by the locker room management system 1, so that the locker rooms arranged at positions along the user's movement area Each locker can be assigned to each user so that the use time zones do not easily overlap between users (for example, between users of adjacent lockers). For example, the administrator or the like uses the locker arranged at a position along the user's movement area by assigning each locker to each user while referring to the assignment pattern printed or displayed by the output unit 9. Each locker can be assigned to each user so that the use time zones are not easily overlapped between users (for example, between users of adjacent lockers). As a result, it becomes difficult for a situation in which the users have to take care of each other to occur, and the mental load on the user can be reduced. In particular, even when the passage in the locker room 20 is narrow, it is difficult for the use time zones to overlap between adjacent locker users, so that the users are less likely to contact each other. Thus, according to the locker room management system 1 according to the present embodiment, an allocation pattern that can improve the convenience of the locker user can be obtained.

  Some locker users like loneliness and others like crowds. For example, the tendency of preference for loneliness and crowd is represented by numerical values, and the allocation pattern determination unit 7 reduces the degree of overlap between users who prefer loneliness and other users, and the degree of overlap between those who prefer crowds. You may make it output the allocation pattern which becomes high. Thereby, it becomes possible to assign a locker to a user while satisfying a preference tendency of each user.

(Multi-stage locker)
In the example described above, the case where a single-stage locker is targeted has been described. However, even when the lockers are stacked in two or more stages, the allocation pattern of the lockers can be obtained as in the above-described embodiment. With reference to FIG. 6, the case where the allocation pattern of a locker is determined for a double-tiered locker will be described. FIG. 6 is a diagram schematically showing a two-stage rocker.

  As an example, a case where six lockers 31, 32, 33, 34, 35, and 36 are allocated to six users A, B, C, D, E, and F will be described. FIG. 6 shows one of the allocation patterns when the lockers 31, 32, 33, 34, 35, and 36 are temporarily allocated to the users A, B, C, D, E, and F. For example, the lockers 34, 35, and 36 are arranged in a row in the first row, and the lockers 31, 32, and 33 are arranged in a row on the first locker. More specifically, a second-stage locker 31 is disposed on the first-stage locker 34, a second-stage locker 32 is disposed on the first-stage locker 35, and A second-stage locker 33 is disposed above.

  As described above, the position information storage unit 8 stores position information indicating the position of each locker. In the case of a multi-stage locker, the position information of each locker includes position information indicating a position on a plane in the locker chamber 20 and position information indicating a position in the height direction (vertical direction). The first-stage rocker and the second-stage rocker can be distinguished by the position in the height direction. For example, in the position information of the locker 31 and the position information of the locker 34, the information indicating the position on the plane in the locker chamber 20 is the same, but the information indicating the position in the height direction is different. The locker 31 and the locker 34 can be distinguished.

  Similar to the example shown in FIG. 1, the redundancy calculation unit 5 obtains all possible allocation patterns when a locker is temporarily allocated to a user. And the duplication degree calculation part 5 calculates | requires the length (duplication degree) of the time slot | zone when a stay time slot | zone overlaps between the users of an adjacent locker based on the entrance / exit history of each user. The duplication degree calculation unit 5 obtains the duplication degree of the users A, B, C, D, E, and F for each allocation pattern. For example, since the lockers 32 assigned to the user B are adjacent to the lockers 31, 33, 34, 35, and 36, for the user B, the users A, C, D, E, and F are duplicated. It becomes the object of calculation. Therefore, for the user B, the duplication degree calculation unit 5 obtains the length (duplication degree) of the time zone in which the stay time zones overlap with the users A, C, D, E, and F. The duplication degree calculation unit 5 similarly obtains the duplication degree for other locker users. And the duplication degree calculation part 5 calculates | requires the duplication degree of each user about each allocation pattern. Similar to the example described above, the statistical processing unit 6 obtains the average and variance of the degree of duplication, and the assignment pattern determination unit 7 decides the assignment pattern based on the average value of the degree of duplication. For example, the allocation pattern determination unit 7 outputs allocation pattern information indicating an allocation pattern that minimizes the average value of the degree of duplication to the output unit 9.

  Moreover, the duplication degree calculation part 5 may obtain | require duplication degree by performing the weighting process according to the positional relationship of each locker. Specifically, the duplication degree calculation unit 5 multiplies the length of the time zone in which the stay time zones overlap between the users by a weighting coefficient corresponding to the positional relationship of each locker, thereby Find the degree of overlap. For example, each user of a locker arranged in a vertical direction uses each locker at the same position. Therefore, inconvenience for the user is further increased. Therefore, the second weighting for the rocker arranged in the vertical direction (height direction) is more than the first weighting coefficient (for example, “1”) for the rocker arranged adjacent to the left-right direction (plane direction). It is preferable to increase the coefficient. For example, the duplication degree calculation unit 5 multiplies the length of the time zone in which the stay time zones overlap between locker users arranged adjacent in the left-right direction by a first weighting coefficient (for example, “1”). Then, the degree of overlap is obtained by multiplying the length of the time zone in which the stay time zones overlap between the locker users arranged in the vertical direction by a second weighting factor larger than 1. As a result, it is possible to obtain the degree of duplication taking into account the inconvenience of the user of the locker arranged in the vertical direction.

As an example, a case where the overlap degree α _A for the user _A is obtained will be described. For example, since the lockers 32, 34, and 35 are adjacent to the locker 31 assigned to the user A, for the user A, the users B, D, and E are subject to overlap calculation. Therefore, for the user A, the duplication degree calculation unit 5 obtains the length of the time zone in which the stay time zones overlap with the users B, D, and E. Since the locker 31 and the lockers 32 and 35 are adjacent in the left-right direction (plane direction) between the user A and the users B and E, the overlap degree calculation unit 5 sets the first weighting coefficient. As “1”, the length (duplication degree) of the time zone in which the stay time zones overlap between the user A and the users B and E is obtained. On the other hand, between the user A and the user D, the locker 31 and the locker 34 are arranged so as to overlap in the vertical direction. Therefore, the duplication degree calculation unit 5 obtains the length of the time zone in which the staying time zones overlap between the user A and the user D, and the second weighting greater than 1 for the length of the overlapping time zone. The degree of overlap is obtained by multiplying by a coefficient. Since the locker 31 and the locker 34 are not only adjacent to each other but are arranged so as to be stacked one above the other, the users A and D use the respective lockers at the same position. Therefore, the inconvenience of the users A and D is taken into consideration by multiplying the length of the time zone in which the stay time zones overlap between the users A and D by the second weighting coefficient larger than 1. The degree of overlap can be determined.

  Moreover, the duplication degree calculation part 5 may obtain | require duplication degree by performing the weighting process according to the number of adjacent lockers. As the number of adjacent lockers increases, there is a possibility that the available space becomes narrower and the opportunity to contact other users increases. Therefore, inconvenience for the user is further increased. Therefore, it is preferable that the duplication degree calculation unit 5 multiplies a user with a larger number of adjacent lockers by a larger weighting coefficient.

  For example, the lockers 32 and 35 have more adjacent lockers than the lockers 31, 33, 34, and 36. In this case, the duplication degree calculation unit 5 is larger in the duplication degree of the users B and E of the lockers 32 and 35 than the duplication degree of the users A, C, D and F of the lockers 31, 33, 34 and 36. Multiply by weighting factor. For example, the duplication degree calculation unit 5 obtains the duplication degree by multiplying the length of the duplication time obtained for the users B and E by a weighting coefficient larger than 1. As a result, it is possible to obtain the degree of duplication taking into account the user's inconvenience due to the number of adjacent lockers.

  In some cases, a single locker may be shared by multiple persons. For example, when there are more users than lockers, one locker may be assigned to a plurality of users. In this case, it is preferable to perform the weighting process similarly to the degree of duplication of each user of the lockers arranged in the vertical direction. A user who shares one locker with another user uses the locker at the same position, which increases the inconvenience of the user. For example, the duplication degree calculation unit 5 obtains the duplication degree by multiplying the length of the time zone in which the stay time zones overlap between users to which the same locker is assigned by a weighting coefficient larger than 1. As a result, it is possible to obtain a degree of duplication taking into account the inconvenience of a plurality of users sharing one locker.

  Next, another arrangement example of the lockers will be described with reference to FIG. FIG. 7 is a diagram illustrating another example of the locker room. In the above-described example, the case where the three lockers 31, 32, and 33 are installed in the locker chamber 20 as shown in FIG. 1 has been described. However, even if the number of lockers is large, the embodiment relates to this embodiment. The locker room management system 1 can determine locker allocation patterns.

  For example, as shown in FIG. 7, lockers A, B, C, D, E, and F are arranged in a row, lockers G, H, I, J, K, and L are arranged in a row, and lockers M, N, and O , P, Q, R will be described in a row. A row composed of the lockers A to F is a rocker row 50A, a row composed of the lockers G to L is a rocker row 50B, and a row composed of the lockers M to R is a rocker row 50C. The rocker row 50A and the rocker row 50B are arranged to face each other with a predetermined distance. That is, the rocker row 50A and the rocker row 50B are arranged to face each other with a passage therebetween. Further, the locker row 50C is arranged at a position away from the locker rows 50A and 50B with the other locker rows in between. The locker row 50 </ b> C is disposed to face the wall at a predetermined distance from the wall of the locker chamber 20.

  Similar to the example shown in FIG. 1, the redundancy calculation unit 5 obtains all allocation patterns that can be taken when a locker is temporarily allocated to a user, and arranges each allocation pattern at a position along the movement area of the user. The length (duplication degree) of the time zone in which the stay time zones overlap between the users of the locked lockers (for example, between the users of the adjacent lockers) is obtained. For example, since lockers A, C, G, H, and I are adjacent to locker B, for locker B users, users of lockers A, C, G, H, and I are subject to calculation of redundancy. It becomes. Therefore, the duplication degree calculation unit 5 calculates the length (duplication degree) of the time zone in which the stay time zones overlap between the user of the locker B and the users of the lockers A, C, G, H, and I. Ask. The duplication degree calculation unit 5 similarly obtains the duplication degree for other locker users. And the duplication degree calculation part 5 calculates | requires the duplication degree of each user about each allocation pattern. Similar to the example described above, the statistical processing unit 6 calculates the average value and variance of the degree of overlap, and the allocation pattern determination unit 7 determines the allocation pattern based on the average value of the degree of overlap. For example, the allocation pattern determination unit 7 outputs allocation pattern information indicating an allocation pattern that minimizes the average value of the degree of duplication to the output unit 9.

  As described above, even if the number of lockers increases, according to the locker room management system 1 according to the present embodiment, between locker users arranged along the user's movement area (for example, between adjacent lockers) It is possible to obtain an allocation pattern that makes it difficult for usage time zones to overlap with each other.

  In the embodiment described above, the length of the time period in which the stay time period overlaps between the users of the adjacent lockers is obtained, but the target area may be expanded. As an example, a case will be described in which the length of the time zone in which the stay time zones overlap is obtained between the users of the lockers arranged along the moving area (flow line) of the user wider than adjacent. With reference to FIG.7 and FIG.8, the method of calculating | requiring duplication degree on the basis of a user's flow line is demonstrated. FIG. 8 is a diagram illustrating an example of arrangement of lockers in the locker room, and is a diagram for explaining a flow line of a user.

  It is assumed that the user who entered the locker room 20 goes from the door 21 toward his locker. At this time, if there is already a user who uses the locker between the door 21 and his / her locker, it is necessary to go to his / her locker while avoiding the user. In addition, a user who has already used the locker needs to use the locker while paying attention to the movements of other users passing before or after the user. That is, if the staying time zones overlap between the users of the lockers arranged along the movement area (flow line) of the user, the user may be inconvenienced.

  For example, the user of the locker M cannot reach the locker M from the door 21 unless it passes through the vicinity of the lockers N, O, P, Q, and R. Therefore, the users of the lockers M to R may be inconvenienced when the staying time zones overlap. Further, the user of the locker A cannot reach the locker A from the door 21 unless it passes through the vicinity of the lockers B to L. Therefore, the users of the lockers A to L may be inconvenienced when the staying time zones overlap. Therefore, the locker room management system 1 according to the present embodiment has a length of time period (duplication degree) in which the stay time period overlaps between locker users arranged along the movement area (flow line) of the user. The locker allocation pattern is determined based on the degree of overlap.

  First, as in the example described above, the degree-of-duplication calculation unit 5 performs all the operations that can be taken when a locker is temporarily allocated to a user based on the position information indicating the position of each locker and the personal information of each user. Find the allocation pattern. Further, the degree-of-duplication calculation unit 5 acquires position information indicating the position of the door 21 and position information indicating the position of the wall of the locker room 20 from the position information storage unit 8. The overlapping degree calculation unit 5 obtains the shortest line connecting the target locker and the door 21 while avoiding lockers other than the target locker and the wall of the locker chamber 20. And the duplication degree calculation part 5 assumes the area | region along the shortest line as a movement area | region (flow line) of the user of the target locker. The movement area (flow line) of the user may have a certain width. For example, for the locker A, the line 40A connecting the locker A and the door 21 is the shortest line while avoiding other lockers and walls, so the overlap degree calculation unit 5 is an area along the shortest line 40A. Is assumed to be the movement area (flow line) of the user of the locker A. That is, the user of the locker A is expected to go from the door 21 to the locker A substantially along the line 40A. In addition, for the locker F, the line 40F connecting the locker F and the door 21 is the shortest line while avoiding other lockers and walls, so the overlap calculation unit 5 follows the shortest line 40F. The area is assumed to be a movement area (flow line) of the user of the locker F. Further, for the locker M, the line 40M along the locker row 50C is the shortest line while avoiding other lockers and the wall of the locker chamber 20, so the overlap calculation unit 5 sets the line 40M to the shortest line 40M. The area along the line is assumed as the movement area (flow line) of the user of the locker M. The overlapping degree calculation unit 5 similarly assumes a moving area (flow line) for other locker users.

  And the duplication degree calculation part 5 is based on each user's entrance / exit history of the time zone when a stay time zone overlaps between the users of the locker arrange | positioned along a user's movement area | region (flow line). Find the length (multiplicity). The duplication degree calculation unit 5 includes the users of the lockers arranged along the movement area (flow line) of any user in one group, and the users included in the same group are overlapped with each other. The degree of duplication of each user is obtained as an object of the calculation. For example, since the lockers A to L are arranged along the flow line (line 40A) of the user of the locker A, the users of the lockers A to L are included in the same group 61. Moreover, since the users of the lockers M to R are arranged along the flow line (line 40M) of the users of the lockers M, the users of the lockers M to R are included in the same group 62. That is, it can be considered that the users of the lockers included in the locker rows facing each other or the users of the lockers included in the locker rows facing the walls are included in one group. For example, the users of the lockers A to L included in the locker rows 50 </ b> A and 50 </ b> B facing each other can be considered to be included in one group 61. Further, the users of the lockers M to R included in the locker row 50 </ b> C facing the wall of the locker chamber 20 can be considered to be included in one group 62.

  Since the users of the lockers A to L are included in the group 61, the duplication degree calculation unit 5 has a staying time zone between the users of the lockers A to L except the user for the lockers A to L. Find the length of overlapping time zones (redundancy). For example, for the user of the locker A, the users of the lockers B to L included in the same group 61 are subject to calculation of the degree of overlap. Therefore, the duplication degree calculation part 5 calculates | requires the length (duplication degree) of the time slot | zone when the stay time slot | zone overlaps with the user of the lockers B-L about the user of the locker A. Moreover, about the user of the locker F, the user of the lockers AE and GL included in the same group 61 becomes the object of calculation of the degree of duplication. Therefore, the duplication degree calculation part 5 calculates | requires the length (duplication degree) of the time slot | zone when the stay time slot | zone overlaps with the user of the lockers AE and GL about the user of the locker F. FIG.

  In addition, since the users of the lockers M to R are included in the group 62, the duplication degree calculation unit 5 for the users of the lockers M to R stays with the users of the lockers M to R other than themselves. Find the length (duplication degree) of the time zone where the bands overlap. For example, for the user of the locker M, the users of the lockers N to R included in the same group 62 are subject to calculation of the degree of duplication. Therefore, the duplication degree calculation part 5 calculates | requires the length (duplication degree) of the time slot | zone when the stay time slot | zone overlaps with the user of the locker NR about the user of the locker M. Moreover, about the user of the locker R, the user of the lockers M-Q becomes the object of calculation of duplication degree. Therefore, the duplication degree calculation part 5 calculates | requires the length (duplication degree) of the time slot | zone for which the stay time slot | zone overlaps with the user of the locker M-Q about the user of the locker R.

  And the duplication degree calculation part 5 calculates | requires the duplication degree of each user about each allocation pattern. Similar to the example described above, the statistical processing unit 6 obtains the average value and variance of the degree of overlap, and the assignment pattern determination unit 7 obtains the assignment pattern based on the average value of the degree of overlap. For example, the allocation pattern determination unit 7 outputs allocation pattern information indicating an allocation pattern that minimizes the average value of the degree of duplication to the output unit 9.

  As described above, the user's movement area is obtained by calculating the degree of duplication among the users of the lockers arranged along the movement area (flow line) of the user and obtaining the allocation pattern that minimizes the degree of duplication. It is possible to obtain an allocation pattern that makes it difficult for usage time zones to overlap between locker users arranged along the line. By allocating a locker to a user using the allocation pattern obtained in the present embodiment, it becomes possible to improve the convenience of the user of the locker arranged along the movement area of the user.

  In addition, the duplication degree calculation unit 5 includes locker users included within a predetermined distance from the movement area (flow line) of the users in the same group, and the users included in the same group It is good also as an object of calculation.

  In addition, in the process of obtaining an allocation pattern based on the user's flow line, when lockers are stacked in two or more stages as shown in FIG. 6, or when one locker is allocated to a plurality of users As described above, the duplication degree calculation unit 5 may obtain the duplication degree by performing weighting processing.

  In addition, the entrance / exit management part 2, the duplication degree calculation part 5, the statistical processing part 6, and the allocation pattern determination part 7 may be implement | achieved by cooperation with a hardware resource and software, for example. Specifically, each function of the entrance / exit management unit 2, the duplication degree calculation unit 5, the statistical processing unit 6, and the allocation pattern determination unit 7 includes an entrance / exit management program, a duplication degree calculation program stored in a storage medium, The statistical processing program and the allocation pattern determination program are read into the main memory and executed by a CPU (Central Processing Unit). The entrance / exit management program, the redundancy calculation program, the statistical processing program, and the allocation pattern determination program can be provided by being stored in a computer-readable storage medium or provided by communication as data communication. Is also possible. However, the entrance / exit management unit 2, the duplication degree calculation unit 5, the statistical processing unit 6, and the allocation pattern determination unit 7 may be realized by hardware. Further, the entrance / exit management unit 2, the duplication degree calculation unit 5, the statistical processing unit 6, and the allocation pattern determination unit 7 may be physically realized by one device or may be realized by a plurality of devices. .

  DESCRIPTION OF SYMBOLS 1 Locker room management system, 2 Entrance / exit management part, 3 Entrance / exit log | history storage part, 4 Calculation part, 5 Duplication degree calculation part, 6 Statistical processing part, 7 Allocation pattern determination part, 8 Location information storage part, 9 Output part, 20 Locker room, 21 Door, 22, 23 Storage medium information reading unit, 31, 32, 33 Locker.

Claims (3)

Entry / exit management means for managing entry / exit of a user into a locker room where a plurality of lockers are arranged;
An allocation pattern that can be taken when a locker is temporarily allocated to a user is obtained, and the allocation pattern that can be taken is based on the movement history of each user entering and leaving the locker room along the movement area of the locker user. The length of the time zone in which the staying time zone of each user in the locker room overlaps among each user of the locker arranged at the position is obtained, and the length of the overlapping time zone among the possible allocation patterns Computing means for obtaining an allocation pattern that minimizes
I have a,
The computing means performs weighting processing according to the positional relationship of the plurality of rockers for the length of the overlapping time zone, and determines an allocation pattern based on the length of the time zone after the weighting processing,
A locker room management system. The locker room management system according to claim 1,
The calculation means obtains a length of a time zone in which a stay time zone overlaps between users of lockers adjacent to each other for the possible allocation pattern, and among the possible allocation patterns, the length of the overlapping time zone Find the allocation pattern that minimizes
A locker room management system. The locker room management system according to claim 1 or 2 ,
The computing means, as the weighting process, multiplies the length of the time zone in which the stay time zones overlap between the users of the lockers arranged side by side in the left-right direction by the first weighting factor, and superimposes them in the vertical direction. Multiplying the length of the time zone in which the stay time zones overlap between the users of the lockers arranged in a manner by a second weighting factor that is larger than the first weighting factor, Find allocation pattern based on length,
A locker room management system.

Images