Elevator and elevator control method

Abstract

Provided is an elevator capable of eliminating the imbalance in the number of waiting people and the waiting time of users in lobbies, and capable of shortening the waiting time in the lobbies as a whole. The present invention comprises: a storage unit that stores, for each departure floor, information indicating the number of users who are users allocated to each car; a calculation unit that calculates, for each departure floor, the number of users who can ride on each car on the basis of information indicating the number of users stored by the storage unit; and an allocation processing unit that allocates, to one of the cars, the destination floor registered by a destination floor registration device on the basis of the number of users who can ride calculated by the calculation unit.

Description

Elevator and elevator control method

[0001] The present invention generally relates to an elevator in which a destination floor is registered by a destination floor registration device.

[0002] The elevator group control system provides more efficient operation services to users by treating multiple cars as a single group. More specifically, it manages multiple cars as a single group, and when a hall call occurs at a certain floor, it selects one of the most suitable cars from the group and assigns the hall call to the selected car.

[0003] Group control using a destination floor reservation system (hereinafter referred to as destination floor reservation group control) is a type of group control in which a destination floor is registered on a destination floor registration device installed at the elevator hall before boarding the car. In general elevator group control, an upward or downward call is registered at the elevator hall, and the destination floor is registered after boarding the car that has arrived. However, with destination floor reservation group control, the destination floor of the user is known in advance, so a more optimal car can be assigned according to the destination floor.

[0004] Patent Document 1 discloses an elevator group management system equipped with a destination floor registration device, in which when a user operates an HDC (landing destination floor registration device) at the landing of any floor to specify a destination floor, a destination call pairing the destination floor with the departure floor is issued from the HDC, and an allocation control unit provided in the group management control device uses this destination call to assign the destination call to the most suitable elevator car based on an evaluation formula E which is based on waiting time, boarding time, etc.

[0005] Patent Document 2 discloses an elevator group management system equipped with a destination floor registration device, in which a passenger group car allocation unit allocates cars to passenger groups, so that passengers on the same boarding floor and the same destination floor can be set to different passenger groups, thereby enabling appropriate car allocation processing to be performed without leaving any passengers behind even when a large number of passengers on the same boarding floor and the same destination floor appear.

[0006] JP 2020-125189 A International Publication No. 10 / 032625

[0007] In the method described in Patent Document 1, when determining and changing allocations, priority is given to assigning destination calls to cars that are assigned the same departure floor and the same destination floor, which creates a problem of imbalances in the number of people waiting between floors and worsening waiting times throughout the building.

[0008] The method described in Patent Document 2 does not take into consideration the imbalance in the number of people waiting at each departure floor when creating passenger groups, or the fact that if a crowded floor is full, passengers whose departure floor is an intermediate floor between the crowded floor and the destination floor will not be able to board the train.

[0009] The present invention has been made in consideration of the above points, and aims to propose an elevator or the like that can eliminate imbalances in the number of people waiting at a landing and in the waiting time of users, thereby shortening the waiting time at the entire landing.

[0010] In order to solve this problem, the present invention provides an elevator equipped with a destination floor registration device that can register the destination floor of a car specified by a user from among multiple cars, and is provided with: a memory unit that stores, for each departure floor, information indicating the number of users assigned to each car; a calculation unit that calculates, for each departure floor, the number of passengers that can board each car, based on the information indicating the number of users stored in the memory unit; and an allocation processing unit that allocates the destination floor registered by the destination floor registration device to one of the cars based on the number of passengers that can board calculated by the calculation unit.

[0011] In the above configuration, the number of passengers allowed on each departure floor is set to transport passengers evenly, preventing an excessive increase in the number of people waiting. Leveling out passenger waiting times leads to a reduction in waiting times at the entire platform. It also makes it easier for passengers waiting on floors between the departure floor and the destination floor, where there are many passengers, to board, leading to a reduction in waiting times at the entire platform.

[0012] According to the present invention, it is possible to realize a highly convenient elevator. Problems, configurations, and effects other than those described above will become apparent from the following description of the embodiment.

[0013] FIG. 1 is a diagram showing an example of a configuration related to an elevator according to a first embodiment. FIG. 2 is a diagram showing an example of information according to the first embodiment. FIG. 3 is a diagram showing an example of information according to the first embodiment. FIG. 4 is a diagram showing an example of group management processing according to the first embodiment. FIG. 5 is a diagram showing an example of information according to the first embodiment. FIG. 6 is a diagram showing an example of information according to the first embodiment. FIG. 7 is a diagram showing an example of group management processing according to a second embodiment.

[0014] (I) First Embodiment One embodiment of the present invention will be described in detail below, although the present invention is not limited to this embodiment.

[0015] The elevator of this embodiment includes a group control device that manages the operation of multiple cars, and a destination floor registration device that is provided at the landing and can register destination floors for car passengers. The group control device includes a memory unit, a calculation unit, and an allocation processing unit. The memory unit stores the number of passengers allocated to each car (number of passengers) for each departure floor. The calculation unit uses the number of passengers to calculate the number of passengers that can board a car (number of passengers that can board) for each departure floor. The allocation processing unit uses the output of the calculation unit to assign destination floors to the multiple cars.

[0016] In the above configuration, the storage unit may store the number of passengers for each departure floor and destination floor. The calculation unit may use the number of passengers for each departure floor and destination floor to calculate the number of passengers that can board each car for each departure floor and destination floor.

[0017] In the above configuration, for example, the upper limit (capacity) of the number of passengers that can board may differ for each departure floor. In this case, the calculation unit may calculate the congestion level of each floor based on the number of people waiting for each destination floor for each departure floor, set an upper limit for each departure floor based on the congestion level of each floor, and calculate the number of passengers that can board for each departure floor according to the set upper limit.

[0018] The designations "first," "second," "third," etc. in this specification are used to identify components and do not necessarily limit the number or order. Furthermore, numbers used to identify components are used in different contexts, and numbers used in one context do not necessarily indicate the same configuration in another context. Furthermore, this does not prevent a component identified by a certain number from also serving the function of a component identified by another number.

[0019] Next, an embodiment of the present invention will be described with reference to the drawings. The following description and drawings are examples for explaining the present invention, and some omissions and simplifications have been made as appropriate for clarity of explanation. The present invention can be implemented in various other forms. Unless otherwise specified, each component may be singular or plural.

[0020] In the following description, identical elements in the drawings are given the same numbers, and descriptions thereof are omitted as appropriate. Furthermore, when describing elements of the same type without distinguishing between them, the common portion (the portion excluding the branch number) of the reference sign including the branch number may be used, and when describing elements of the same type while distinguishing between them, the reference sign including the branch number may be used. For example, when describing destination floor registration devices without distinguishing between them, they may be described as "destination floor registration device 110," and when describing individual destination floor registration devices while distinguishing between them, they may be described as "destination floor registration device 110A," "destination floor registration device 110B," etc.

[0021] In FIG. 1, 1 indicates as a whole an elevator according to a first embodiment.

[0022] 1 is a diagram showing an example of the configuration of an elevator 1. The elevator 1 includes a group control device 100, a destination floor registration device 110, a car 120, and a car control device 130.

[0023] The group control device 100 manages the operation of a plurality of cars 120 serving a plurality of floors. The group control device 100 includes a car information input / output unit 101, a floor information receiving unit 102, a memory unit 103, a calculation unit 104, an allocation processing unit 105, and a car information transmitting unit 106.

[0024] The car information input / output unit 101 inputs and outputs information about the car 120 (such as the number of passengers in the car 120, the current floor of the car 120, and the direction of movement of the car 120). For example, the car information input / output unit 101 receives information about the car 120 from the car control device 130. The floor information receiving unit 102 receives destination floor information (destination calls including information indicating the departure floor, information indicating the destination floor, etc.) registered by the destination floor registration device 110. The memory unit 103 stores the information input and output by the car information input / output unit 101, the information received by the floor information receiving unit 102, and the like. The calculation unit 104 performs a predetermined calculation using the information stored in the memory unit 103, and notifies the allocation processing unit 105 of the result. The allocation processing unit 105 determines a car 120 to which the destination call is to be allocated (a car excluded from allocation) based on the information received from the calculation unit 104, creates an allocation candidate car group, and then determines a car 120 to which the destination call is to be allocated (a boarding car to which the user will actually board), and notifies information of the determined boarding car to the boarding car information transmission unit 106. The boarding car information transmission unit 106 transmits the information received from the allocation processing unit 105 to the destination floor registration device 110.

[0025] The destination floor registration device 110 is provided at the landing, registers the destination floor specified by the user of the car 120, and transmits information about the registered destination floor to the group control device 100. When the destination floor registration device 110 is operated by a user, the destination floor registration device 110 displays for a certain period of time to the user the destination floor specified by the user and the car name received from the group control device 100. Note that in this embodiment, an example will be described in which all users operating the destination floor registration device 110 individually specify a destination floor.

[0026] As will be explained below, it is clear that this embodiment can be implemented without being limited by the number of cars or the number of floors.

[0027] 2 and 3 are diagrams showing examples of information stored (managed) in the storage unit 103. The storage unit 103 stores, for example, passenger information 201 in each car, information 202 about each car, information 301 about the number of people waiting by departure floor and destination floor, information 302 about the number of users assigned to each car, and total call history information 303.

[0028] The in-car passenger information 201 and the in-car information 202 are assumed to constantly reflect information about each car 120. The in-car passenger information 201, for example, stores information about the departure floor and destination floor for passengers in the car 120. The in-car information 202, for example, stores the current floor of each car 120, the direction of movement of each car 120, the capacity of each car 120, etc.

[0029] The information 301 on the number of people waiting by departure floor and destination floor is updated every time a destination floor is registered by the destination floor registration device 110 in response to an operation by a user. The information 302 on the number of users assigned to each car is updated every time a destination call is assigned to a car 120 by the allocation processing unit 105. The total call history information 303 is information indicating the history of destination calls for a predetermined period of time, and is updated every time a destination floor is registered by the destination floor registration device 110. Note that although the total call history information 303 indicates information for each departure floor and destination floor, it may also be information for each departure floor.

[0030] Next, an example of the operation (group management processing) of the group management device 100 having the above-described configuration will be described with reference to FIG.

[0031] 4 is a diagram showing an example of the group management process. For example, the group management process starts when a destination floor is registered by the destination floor registration device 110.

[0032] In step S401 , the floor information receiving unit 102 receives a destination call from the destination floor registration device 110 .

[0033] In step S402, the calculation unit 104 acquires information stored in the memory unit 103. The calculation unit 104 acquires the passenger information 201 in each car, the information 202 in each car, the number of people waiting by departure floor and destination floor 301, the information 302 on the number of users assigned to each car, the total call history information 303, and the like.

[0034] In step S403, the calculation unit 104 calculates the congestion degree. The congestion degree may be, for example, the ratio of passengers who have not yet boarded the destination call that has occurred so far at the floor where the destination call occurred and that is in the same direction as the destination call, at the time the destination call occurred. This ratio can be calculated, for example, using the information 301 on the number of passengers waiting by departure floor destination floor and the information 303 on all call history. However, the method for calculating the congestion degree is not limited to this. For example, other methods may include the number of destination calls that occurred at the floor where the destination call occurred within a certain time interval, the ratio of the number of passengers waiting at the floor where the destination call occurred to the number of passengers waiting at all the halls, or simply using the information 301 on the number of passengers waiting by departure floor destination floor.

[0035] In step S404, the calculation unit 104 calculates the number of passengers that can board each car 120 at the floor where the destination call occurred, based on the information acquired from the memory unit 103 in step S402 and the congestion degree calculated in step S403.

[0036] The upper limit (upper limit value) of the number of people who can board the car 120 from each floor may be set according to the degree of congestion, as in the passenger-number upper limit value information 500 of FIG. 5. The "low," "medium," and "high" degrees of congestion in the passenger-number upper limit value information 500 may be set to any value depending on the situation at the site. Furthermore, such a relationship table between the upper limit value and the degree of congestion may be set according to the time period, as in the passenger-number upper limit value information 600 of FIG. 6, or may be set for each combination of departure floor and destination floor, as in the passenger-number upper limit value information 700 of FIG. 7. Additionally, the passenger-number upper limit value information 500, the passenger-number upper limit value information 600, and the passenger-number upper limit value information 700 are stored in the memory unit 103.

[0037] Here, a case will be described in which a destination call (destination call A) is generated from the sixth floor to the second floor. If the number of destination calls in the same direction that have occurred on the floor where destination call A occurs (the sixth floor) is 20, the number of unboarded passengers on the floor where destination call A occurs is 13, and the congestion level is the unboarded rate on the floor where destination call A occurs, the congestion level will be 65% (= 13 / 20 × 100). In this case, if the congestion level is 60% or higher and the upper limit for the departure floor for each car 120 is set to five passengers, and the number of passengers assigned to car 120A (car A), car 120B (car B), and car 120C (car C) is five, five, and three, respectively, the number of passengers that can board car A and car B will be calculated as zero, and the number of passengers that can board car C will be calculated as two.

[0038] In step S405, the allocation processing unit 105 determines whether or not there is a car 120 whose number of passengers has reached the upper limit (whether or not there is a car 120 whose number of passengers is zero). If the allocation processing unit 105 determines that there is a car 120, it proceeds to step S406, and if it determines that there is no car 120, it proceeds to step S407.

[0039] In step S406, the allocation processing unit 105 sets the car 120 in which the number of passengers has reached the upper limit as a car not to be allocated. In the above case, the cars A and B are set as cars not to be allocated.

[0040] In step S407, the allocation processing unit 105 calculates an evaluation value for each car 120 to which a destination call can be assigned, and selects a car to which the destination call should be assigned based on the calculated evaluation value. Note that the cars 120 to which a destination call can be assigned do not include cars that are excluded from allocation. Additionally, an existing evaluation formula may be used as the evaluation formula for calculating the evaluation value.

[0041] According to this embodiment, it is possible to limit the number of passengers allowed to board for each departure floor. For example, if too much priority is given to putting passengers going to the same floor in the same car, there will be many cars going from one crowded floor to another. However, according to this embodiment, it is possible to limit the number of passengers allowed to board for each departure floor, so it is possible to avoid situations where uneven car allocation occurs.

[0042] Furthermore, in this embodiment, for example, information on the waiting time of users waiting at a landing is stored for each departure floor, or for each departure floor and destination floor, and the upper limit is changed according to the waiting time, so that it is not necessary to change the allocation of users whose elapsed time since the issuance of a destination call exceeds a threshold. In this case, there are no problems such as the waiting time of a user whose allocation has been changed being the sum of the waiting time for the car that the user was originally scheduled to board and the waiting time for the car after the allocation change, and the burden of confirming the allocation change being imposed.

[0043] (II) Second Embodiment In this embodiment, differences from the first embodiment will be mainly described.

[0044] In Figure 8, some steps are different from those in the procedure from the generation of a destination call to the selection of a car shown in Figure 4. Steps S801, S802, S804, S805, and S808 are the same as steps S401, S402, and S405 to S407, respectively. Figure 8 differs from Figure 4 in steps S803, S806, and S807, and the processing in these steps will be described below.

[0045] In step S803, the calculation unit 104 calculates the number of passengers that can board each car 120 at a floor where a destination call occurs, based on the information acquired from the storage unit 103 in step S802. For example, the calculation unit 104 refers to the passenger capacity upper limit information 600 and calculates the number of passengers that can board each car 120 at a floor where a destination call occurs, for each departure floor. Furthermore, for example, the calculation unit 104 may refer to the passenger capacity upper limit information 700 and calculate the number of passengers that can board each car 120 at a floor where a destination call occurs, for each departure floor and destination floor. Additionally, the calculation unit 104 may calculate the congestion degree and calculate the number of passengers that can board according to the congestion degree, as shown in the first embodiment.

[0046] In step S806, the allocation processing unit 105 determines whether there is a car 120 to which a destination call with the same combination of departure floor and destination floor as the generated destination call is assigned. If the allocation processing unit 105 determines that there is, it proceeds to step S807, and if it determines that there is not, it proceeds to step S808.

[0047] In step S807, the allocation processing unit 105 sets the car 120 that met the determination in step S807 as the allocation priority car. For example, if the generated destination call is going from the fourth floor to the second floor, car C is set as the allocation priority car based on the information 302 on the number of users already assigned to each car. In setting the allocation priority car, for example, a method of setting a weight so that a better evaluation value is calculated in the calculation of the evaluation value in step S808 can be considered, but the method is not limited to this.

[0048] According to this embodiment, if the number of passengers has not reached the upper limit, cars can be assigned so that passengers traveling from the same floor to the same floor board the same car, which leads to a reduction in waiting time at the entire platform.

[0049] (III) Supplementary Notes The above-described embodiment includes, for example, the following contents.

[0050] In the above embodiment, the present invention is described as being applied to an elevator, but the present invention is not limited to this and can be widely applied to various other systems, devices, methods, and programs.

[0051] The group management device 100 is an example of an information processing device (computer), such as a laptop computer or server device, and may be configured to include a CPU (Central Processing Unit), RAM (Random Access Memory), ROM (Read Only Memory), HDD (Hard Disk Drive), communication unit, etc., which are not shown in the figure.

[0052] The functions of the group control device 100 (such as the car information input / output unit 101, floor information receiving unit 102, memory unit 103, calculation unit 104, allocation processing unit 105, and car information transmitting unit 106) may be realized, for example, by a CPU reading a program stored in ROM into RAM and executing it (software), or by hardware such as a dedicated circuit, or by a combination of software and hardware. The functions of the group control device 100 may be a virtual machine (VM) running on a computer, a container running on an operating system (OS), or an application running on an OS. Note that one function of the group control device 100 may be divided into multiple functions, or multiple functions may be combined into one function. Furthermore, some of the functions of the group control device 100 may be provided as separate functions or may be included in other functions. Furthermore, all or some of the functions of the group control device 100 may be realized by another computer capable of communicating with the group control device 100, or may be realized on a cloud system. In addition to the above functions, the group management device 100 may further include functions such as an operating system, a device driver, a file system, and a database management system (DBMS).

[0053] Furthermore, in the above-described embodiment, some or all of the programs may be installed from a program source into a device such as a computer that realizes group management device 100. The program source may be, for example, a program distribution server connected via a network or a computer-readable recording medium (e.g., a non-transitory recording medium). Furthermore, in the above description, two or more programs may be realized as one program, or one program may be realized as two or more programs.

[0054] Furthermore, in the above-described embodiment, the configuration of each table is an example, and one table may be divided into two or more tables, or all or part of two or more tables may be one table.

[0055] In the above embodiment, for the sake of convenience, elevator-related information has been described using a table, but the data structure is not limited to a table. Elevator-related information may be expressed using a data structure other than a table, such as XML (Extensible Markup Language), YAML (YAML Ain't a Markup Language), a hash table, or a tree structure.

[0056] In addition, in the above description, information such as programs, tables, files, etc. that realize each function can be stored in a storage device such as a memory, a hard disk, or an SSD (Solid State Drive), or in a recording medium such as an IC card, an SD card, or a DVD.

[0057] The above-described embodiment has the following characteristic configurations, for example.

[0058] (1) The elevator of this embodiment is an elevator (e.g., elevator 1) equipped with a destination floor registration device (e.g., destination floor registration device 110) that can register the destination floor of a car specified by a user from among multiple cars (e.g., car 120), and is equipped with: a memory unit (e.g., memory unit 103) that stores, for each departure floor, information indicating the number of users assigned to each car (e.g., information 302 on the number of users assigned to each car); a calculation unit (e.g., calculation unit 104) that calculates, for each departure floor, the number of passengers that can board each car, based on the information indicating the number of users stored in the memory unit; and an allocation processing unit (e.g., allocation processing unit 105) that allocates the destination floor registered by the destination floor registration device to one of the cars based on the number of passengers calculated by the calculation unit.

[0059] In the above configuration, the number of passengers allowed on each departure floor is set to transport passengers evenly, preventing an excessive increase in the number of people waiting. Leveling out passenger waiting times leads to a reduction in waiting times at the entire platform. It also makes it easier for passengers waiting on floors between the departure floor and the destination floor, where there are many passengers, to board, leading to a reduction in waiting times at the entire platform.

[0060] (2) The memory unit stores information indicating the number of passengers, which is the number of passengers assigned to each car, for each departure floor and for each destination floor (see, for example, Figure 3), and the calculation unit calculates the number of passengers that can board each car, which is the number of passengers that can board, for each departure floor and for each destination floor based on the information indicating the number of passengers stored by the memory unit (see, for example, Figures 4 to 8).

[0061] According to the above configuration, for example, by setting the number of passengers that can board for each departure floor and destination floor, passenger transportation can be controlled in more detail, allowing passengers to be transported more evenly and leading to reduced waiting times at the entire boarding area.

[0062] (3) The memory unit stores information indicating the number of waiting passengers, which is the number of passengers waiting at the boarding area (e.g., information 301 on the number of waiting passengers by departure and destination floor), and the calculation unit calculates a congestion level indicating the degree of congestion at the boarding area based on the information indicating the number of waiting passengers stored in the memory unit, and calculates the number of passengers that can board based on the calculated congestion level (e.g., see Figure 4).

[0063] According to the above configuration, even if the trend in the number of users changes, for example, by setting the number of passengers that can board according to the degree of congestion, the waiting time of users can be leveled out, which leads to a reduction in waiting time across the entire boarding area.

[0064] (4) In a destination floor registration device installed on a first floor, when a user indicates a second floor different from the first floor, the first floor is the departure floor and the second floor is the destination floor, and the allocation processing unit sets a car assigned the same departure floor and destination floor as the departure floor and destination floor as the allocation priority car (see, for example, Figure 8).

[0065] According to the above configuration, for example, when the number of passengers has not reached the upper limit, the assigned priority car is set so that passengers heading to the same floor board the same car, which leads to a reduction in waiting time at the entire platform.

[0066] (5) The allocation processing unit sets a car with a capacity of zero passengers as an excluded car, and allocates the destination floor registered by the destination floor registration device to any car other than the excluded car (see, for example, Figures 4 and 8).

[0067] According to the above configuration, for example, in the case of a car with a capacity of zero passengers, even if the car itself has vacant seats, no destination floor is assigned to the car, thereby making it possible to avoid a situation in which too many passengers board at a particular floor.

[0068] Furthermore, the above-described configurations may be modified, rearranged, combined, or omitted as appropriate within the scope of the present invention.

[0069] It should be understood that items included in a list in the format "at least one of A, B, and C" can mean (A), (B), (C), (A and B), (A and C), (B and C), or (A, B, and C). Similarly, items listed in the format "at least one of A, B, or C" can mean (A), (B), (C), (A and B), (A and C), (B and C), or (A, B, and C).

[0070] 1... elevator, 103... memory unit, 104... calculation unit, 105... allocation processing unit, 110... destination floor registration device, 120... cage

Claims

1. An elevator equipped with a destination floor registration device that can register a destination floor for a car specified by a user from among multiple cars, the elevator comprising: a memory unit that stores information indicating the number of users, which is the number of users assigned to each car, for each departure floor; a calculation unit that calculates, for each departure floor, a maximum number of passengers, which is the number of users who can board, for each car based on the information indicating the number of users stored in the memory unit; and an allocation processing unit that allocates the destination floor registered by the destination floor registration device to one of the cars based on the maximum number of passengers calculated by the calculation unit.

2. The elevator described in claim 1, wherein the memory unit stores information indicating the number of users, which is the number of users assigned to each car, for each departure floor and for each destination floor, and the calculation unit calculates the maximum number of passengers, which is the number of users who can board each car, for each departure floor and for each destination floor based on the information indicating the number of users stored by the memory unit.

3. The elevator described in claim 1, wherein the memory unit stores information indicating a waiting number of people, which is the number of users waiting at the landing, and the calculation unit calculates a congestion level indicating the degree of congestion at the landing based on the information indicating the waiting number stored in the memory unit, and calculates the number of people that can board based on the calculated congestion level.

4. The elevator described in claim 1, wherein, when a second floor different from the first floor is specified by a user in a destination floor registration device installed on a first floor, the first floor is the departure floor and the second floor is the destination floor, and the allocation processing unit sets a car assigned the same departure floor and destination floor as the departure floor and the destination floor as an allocation priority car.

5. The elevator described in claim 1, wherein the allocation processing unit sets a car with a capacity of zero passengers as an excluded car, and allocates a destination floor registered by the destination floor registration device to any car other than the excluded car that has been set.

6. An elevator control method for an elevator equipped with a destination floor registration device capable of registering a destination floor for a car specified by a user from among a plurality of cars, the elevator equipped with a memory unit that stores, for each departure floor, information indicating the number of users, which is the number of users assigned to each car; a calculation unit that calculates, for each departure floor, a maximum number of passengers, which is the number of users who can board, for each car based on the information indicating the number of users stored in the memory unit; and an allocation processing unit that allocates the destination floor registered by the destination floor registration device to one of the cars based on the maximum number of passengers calculated by the calculation unit.

Images