WO2020261361A1 - エレベーター群管理システム - Google Patents

エレベーター群管理システム Download PDF

Info

Publication number
WO2020261361A1
WO2020261361A1 PCT/JP2019/025065 JP2019025065W WO2020261361A1 WO 2020261361 A1 WO2020261361 A1 WO 2020261361A1 JP 2019025065 W JP2019025065 W JP 2019025065W WO 2020261361 A1 WO2020261361 A1 WO 2020261361A1
Authority
WO
WIPO (PCT)
Prior art keywords
destination floor
car
floor
group management
destination
Prior art date
Application number
PCT/JP2019/025065
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
颯 棚林
孝道 星野
訓 鳥谷部
知明 前原
貴大 羽鳥
Original Assignee
株式会社日立製作所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社日立製作所 filed Critical 株式会社日立製作所
Priority to PCT/JP2019/025065 priority Critical patent/WO2020261361A1/ja
Priority to JP2021528682A priority patent/JP7169448B2/ja
Priority to CN201980097826.5A priority patent/CN114007971B/zh
Publication of WO2020261361A1 publication Critical patent/WO2020261361A1/ja

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/02—Control systems without regulation, i.e. without retroactive action
    • B66B1/06—Control systems without regulation, i.e. without retroactive action electric
    • B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
    • B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages

Definitions

  • the present invention relates to an elevator group management system.
  • the elevator group management system provides more effective operation services to users by treating a plurality of cars as one group. Specifically, when multiple cars are managed as one group and the landing destination floor is registered on a certain floor, one of the most suitable cars is selected from this group, and the above car is used as the above. Perform the process of allocating the landing call.
  • Destination floor reservation system type group management (hereinafter referred to as destination floor reservation type group management) is a group management method in which the destination floor is registered with the destination floor registration device provided at the platform before boarding the car. Is.
  • destination floor reservation type group management In general elevator group management, an up or down call is registered at the platform and the destination floor is registered after getting in the car that arrived, whereas in the destination floor reservation type group management, the user's destination floor Is known in advance, so it is possible to allocate a more optimal car according to the destination floor.
  • Patent Document 1 the number of registered calls registered in the destination floor registration device at the landing is counted, and if the number of floors registered for the landing destination floor button exceeds a predetermined value, another car is provided.
  • Technology is disclosed that additionally allocates, predicts the congestion situation of the landing before the allocated car arrives, allocates multiple cars appropriately according to the congestion state, and reduces the leftover of the user. ..
  • a stable car call occurrence probability is calculated based on the traffic flow of an elevator, and cars are assigned, or by destination floor.
  • a technology for predicting car calls in consideration of designated landing call information and allocating cars in response to changes in traffic flow more accurately is disclosed.
  • the present invention provides an elevator group management system that can improve operation efficiency by increasing the number of passengers in the same car having the same destination floor.
  • the elevator group management device that manages the operation of a plurality of cars serving on a plurality of floors and the destination floor of the elevator user are registered at the landing.
  • the elevator group management device is provided with a destination floor registration device provided, and the elevator group management device includes an allocation processing unit that allocates the registered destination floor to a predetermined car among the plurality of cars, and a destination floor of an elevator user that will occur in the future.
  • the destination floor prediction processing unit that predicts the above, the destination floor call fullness determination unit that determines whether the number of registered people allocated in the predetermined car is equal to or greater than the first predetermined value, and the newly registered destination floor are described above.
  • the same floor determination unit that determines whether the destination floor is the same as the destination floor already registered in the predetermined car, and determines whether the number of floors of the destination floor already registered in the predetermined car is equal to or greater than the second predetermined value.
  • the elevator group management device determines whether the number of registrants assigned to the predetermined car is equal to or more than the third predetermined value.
  • the destination floor information of the user generated in the future output by the destination floor prediction processing unit is used. It is characterized by further including a future destination floor determination unit that excludes the allocation of a predetermined car.
  • an elevator group management system capable of improving operation efficiency by increasing the number of passengers in the same car having the same destination floor. Issues, configurations and effects other than those described above will be clarified by the description of the following embodiments.
  • FIG. 1 It is an overall block diagram of the destination floor reservation type group management system of Example 1 which concerns on one Example of this invention. It is a figure which shows the output data of the destination floor prediction processing unit which constitutes the elevator group management apparatus shown in FIG. 1, and is an example of a destination floor prediction table. It is a flowchart which shows the processing flow of the allocation target car determination part which constitutes the elevator group management apparatus shown in FIG. It is a figure which shows the output data structure of the destination floor number grasping part constituting the elevator group management apparatus shown in FIG. 1, and is an example of the registered number table A by the car departure floor and the destination floor for car A. It is a figure which shows the output data structure of the destination floor number grasping part constituting the elevator group management apparatus shown in FIG.
  • FIG. 1 is an overall configuration diagram of a destination floor reservation type group management system according to a first embodiment of the present invention.
  • the car is assigned according to the destination floor, and the user gets into the car. It is a group management using a method of servicing the destination floor.
  • the main configurations of the elevator group management system 30 are three cars A1a, a car B1b, and a car C1c, a car control device A2a for controlling each car, a car control device B2b, and a car control device C2c.
  • the destination floor registration device 4 When the destination floor is registered, the destination floor registration device 4 displays the car name received from the destination floor and the boarding car information transmitting unit 18, displays the car name for a certain period of time, and then returns to the initial screen. .. Therefore, in order to inform the operator who operates the destination floor registration device 4 of the registered destination floor and the assigned car name, it is assumed that all the users who come to the platform individually register the destination floor. ing.
  • the destination floor input to the destination floor registration device 4 is received by the destination floor information receiving unit 5 in the elevator group management device 3.
  • the predetermined value setting unit 6 sets a predetermined value used for determining the car to be allocated. This predetermined value is, for example, a determination value used for determining a full car.
  • the determination value is set to a value of 20 people when the occupancy rate of 80% is applied to a car with a capacity of 24 people.
  • the predetermined value used for determining the car to be allocated can be changed by the maintenance staff or the customer according to the local usability. Actually, it is desirable to determine a congested state, a normal state, or a quiet state according to traffic demand, and select a value corresponding to the result as a predetermined value. For example, in a congested state, by setting a high predetermined value for determining that the car is full, more people can be transported by one car and the transportation capacity can be improved. However, in normal times and off-peak hours, if many users are assigned to one car as in the case of congestion, users may be reluctant to ride in the crowded car and users may not board the assigned car. Therefore, by lowering the predetermined value for determining that the car is full, it is possible to provide an easy-to-use and lean operation service.
  • the elevator group management device 3 includes a destination floor information receiving unit 5, a predetermined value setting unit 6, a destination floor number grasping unit 7, a car information input / output unit 8, a learning processing unit 9, and a destination floor prediction processing. It is composed of a unit 10, an allocation target car determination unit 11, an allocation processing unit 17, and a passenger car information transmission unit 18.
  • the destination floor number grasping unit 7 uses the allocation result, for example, the registered number table A20 for each car departure floor and destination floor for car A, which will be described in detail later. Data is created by counting up the corresponding values in the registered number table B21 for each car departure floor and destination floor for car B in FIG. 5 and the registered number table C22 for each departure floor and destination floor for car C in FIG. .. That is, the registered number table 20, 21, 22 for each departure floor and destination floor for each car is provided with a table for each car, and the number of registered people is managed for each departure floor and each destination floor.
  • the car information input / output unit 8 measures the current position of the car, the open / closed state of the door, and the current load in the car by the load sensor in the car, and grasps the approximate number of people. Further, the car information input / output unit 8 transmits the allocation result referred to by the allocation processing unit 17 to the car control device A2a, the car control device B2b, and the car control device C2c, thereby responding to the service request of the user. To dispatch.
  • the learning processing unit 9 accumulates the number of passengers and the number of passengers getting off each floor in the past, which can be obtained by referring to the car information input / output unit 8. From the information of users that changes from moment to moment, it is judged what kind of elevator traffic demand is currently. Elevator traffic demand indicates the distribution of the number of passengers getting on and off the building. For example, when many users get on the entrance and get off at each floor, the traffic demand of the elevator when going to work in the building, and when the users get on from each floor and get off at the cafeteria floor, lunch in the building. The traffic demand of the elevator at that time, the state where the user gets on from each floor and gets off at the entrance floor is judged as the traffic demand of the elevator at the time of leaving work in the building.
  • the determination of elevator traffic demand is not limited to this.
  • By judging the traffic demand of the current elevator it becomes possible to predict from which floor the future user will get on and on which floor. For example, if a user is enrolled only on the 3rd floor of a 10-story building, the daily traffic demand of the elevator is learned from the usage situation of getting on from the entrance floor and getting off on the 3rd floor. Therefore, when the traffic demand of the elevator at the time of commuting is detected, it can be predicted that there is a user who moves to the 3rd floor out of the 10th floor. Using such data, it is predicted whether or not there will be users by departure floor and destination floor.
  • the number of passengers getting on / off, the current number of passengers, the running state of the elevator, the state of the door, etc. are detected, and the traffic demand of the elevator indicating the number of passengers getting on and off each floor in the building is calculated. It may be detected and the presence or absence of users by departure floor and destination floor may be predicted based on the characteristics of the traffic demand of this elevator.
  • the destination floor prediction processing unit 10 refers to the learning processing unit 9 and manages whether or not there are users by departure floor and destination floor in the destination floor prediction table 19 which will be described in detail later.
  • the above-mentioned destination floor number grasping unit 7, car information input / output unit 8, learning processing unit 9, and destination floor prediction processing unit 10 are, for example, processors such as a CPU (Central Processing Unit) (not shown) and various programs. It is realized by a ROM that stores data, a RAM that temporarily stores data in the calculation process, and a storage device such as an external storage device, and a processor such as a CPU reads and executes various programs stored in the ROM, and the execution result. The calculation result is stored in the RAM or an external storage device.
  • processors such as a CPU (Central Processing Unit) (not shown) and various programs. It is realized by a ROM that stores data, a RAM that temporarily stores data in the calculation process, and a storage device such as an external storage device, and a processor such as a CPU reads and executes various programs stored in the ROM, and the execution result.
  • the calculation result is stored in the RAM or an external storage device.
  • the allocation target car determination unit 11 constituting the elevator group management device 3 includes a destination floor call full determination unit 12, the same floor determination unit 13, a stop floor number suppression processing unit 14, and a future ride evaluation start processing unit. It is composed of 15 and a future destination floor determination unit 16.
  • the allocation target car determination unit 11 excludes the car satisfying the predetermined condition from the allocation target car, limits the selected car, and gives priority to the car satisfying the predetermined condition as the allocation target. Performs discrimination processing such as priority car selection.
  • the destination floor call fullness determination unit 12, the same floor determination unit 13, the stop floor number suppression processing unit 14, the future sharing evaluation activation processing unit 15, and the future destination floor determination unit 16 are, for example, CPUs (Central Processing Units) (not shown). It is realized by a processor such as Unit), a ROM that stores various programs, a RAM that temporarily stores data of the calculation process, and a storage device such as an external storage device, and various processors such as a CPU are stored in the ROM. The program is read and executed, and the calculation result, which is the execution result, is stored in the RAM or an external storage device.
  • CPUs Central Processing Units
  • the destination floor call fullness determination unit 12 is provided by the destination floor number grasping unit 7 on the floors from the departure floor to the destination floor, and the registered number table for each departure floor and destination floor. That is, the number of registered people table A20 by car departure floor and destination floor for car A, the number of registered people table B21 by car departure floor and destination floor for car B, and the number of registered people table C22 by car departure floor and destination floor for car C Therefore, it is judged that the car in which the number of registered people is equal to or more than the predetermined value A is full, and the car is excluded from the allocation because no more passengers can board.
  • the predetermined value A is set to 20 people when the occupancy rate of 80% is applied to a car with a capacity of 24 people.
  • the same floor determination unit 13 currently selects a car for which the same destination floor as the destination floor registered by the destination floor registration device 4 has already been registered as a priority car.
  • the reason for giving priority to cars with the same destination floor instead of deciding the allocation is that if there are two or more cars with the same destination floor, it is more appropriate to consider the registration status and position of the two cars. This is to allocate to the basket.
  • the stop floor number suppression processing unit 14 limits the number of destination floors assigned to one car to prevent the boarding time from becoming long.
  • the stop floor number suppression processing unit 14 temporarily allocates the departure floor and the destination floor registered this time to each car, and at that time, the car whose stop floor number of the car is the predetermined value B or more is excluded from the allocation.
  • the predetermined value B is set to four floors as the upper limit of the number of stopped floors.
  • the future sharing evaluation activation processing unit 15 excludes cars whose number of people registered in the car is less than the predetermined value C on the floors from the departure floor to the destination floor to be processed by the future destination floor determination unit 16. .. This process is to prevent users with the same destination floor from getting into different cars due to fullness unless the cars are assigned a certain number of people at the time of registration. It is done in.
  • a predetermined value C is used as a value for determining whether the number of people assigned to the car is close to full. For example, the predetermined value C is set to a value of 18 people. Since the car having a predetermined value A or more is excluded from the cars to be allocated by using the destination floor call fullness determination unit 12, the predetermined value C is set to a value having a relationship of predetermined value A> predetermined value C. Is desirable.
  • the future destination floor determination unit 16 determines that the destination floor of the user who will occur in the future is the same floor as the destination floor assigned to the car for the car determined to be near full by the future ride evaluation activation processing unit 15. Alternatively, if the destination floor of the user that occurs in the future is the same floor as the destination floor of the user who registered this time, the allocation exclusion of the car is excluded in order to promote the sharing of users on the same destination floor to the same car. Do. In the above process, in order to promote the sharing, it is necessary to use the prediction information of the time that the user can board before the car departs. This is because, for example, even if the user's prediction information after 5 minutes is used, if the car departs from the departure floor after 3 minutes, it is impossible to share the vehicle. Therefore, the presence or absence of the destination floor of the user that occurs before the car departs is used in the above processing.
  • the allocation processing unit 17 constituting the elevator group management device 3 refers to the determination processing results such as allocation exclusion and priority car selection of each car from the allocation target car determination unit 11, and is a car information input / output unit among the allocation target cars. From the car information obtained from 8, the most suitable car is assigned.
  • the boarding car information transmitting unit 18 refers to the allocation result from the allocation processing unit 17 and transmits the boarding car information to the destination floor registration device 4.
  • FIG. 2 is a diagram showing output data of the destination floor prediction processing unit constituting the elevator group management device 3, and shows an example of a destination floor prediction table.
  • the destination floor prediction processing unit 10 constituting the elevator group management device 3 creates a destination floor prediction table 19. As shown in FIG. 2, it manages the occurrence / non-occurrence prediction information of users who move from each departure floor to each destination floor every minute. In this example, it is predicted whether or not there will be users for each departure floor and destination floor after 1 minute and 2 minutes with respect to the current time, and 0/1 data is stored in the table data. "0" stores prediction information that has not occurred, and "1" stores prediction information that has occurred.
  • the 7:31 record stores user occurrence prediction information such as from the departure floor 3rd floor to the destination floor 2nd floor, 4th floor, 5th floor, 6th floor, and 7th floor.
  • the 7:32 record stores user occurrence prediction information such as from the departure floor 3rd floor to the destination floor 1st floor, 4th floor, 5th floor, 6th floor, and from the departure floor 4th floor to the destination floor 1st floor.
  • the 7:33 record stores user occurrence prediction information from the departure floor 3rd floor to the destination floor 2nd floor, 4th floor, 7th floor, and the like.
  • the 7:34 record stores user occurrence prediction information such as from the first floor of the departure floor to the second floor of the destination floor, and from the third floor of the departure floor to the first floor of the destination floor, the second floor, the third floor, and the sixth floor.
  • the prediction information of the destination floor prediction table 19 When using the destination floor prediction table 19, it is necessary to use the prediction information of the destination floor prediction table 19 for the time when the user can board before the car departs. This is because, for example, even if the user's prediction information after 5 minutes is used, if the car departs from the departure floor after 3 minutes, it is impossible to share the vehicle.
  • the current time is 7:30. If the car A is predicted to depart after 2 minutes, the prediction information in the destination floor prediction table 19 uses the records of 7:31 and 7:32. If the car B1b is expected to depart after 1 minute and 30 seconds, the forecast information in the destination floor forecast table 19 uses the record at 7:31. If the car C1c is expected to depart after 30 seconds, the prediction information in the destination floor prediction table 19 is not used.
  • the prediction information in the destination floor prediction table 19 is , Not available.
  • the case where the occurrence / presence / absence prediction information is managed every minute is shown, but the present invention is not limited to this, and for example, the occurrence / presence / absence prediction information may be managed every 30 seconds.
  • FIG. 4 is a diagram showing an output data structure of a destination floor number grasping unit constituting an elevator group management device, and is an example of a registered number table A for each car departure floor and destination floor for car A.
  • FIG. 5 is a diagram showing an output data structure of a destination floor number grasping unit constituting an elevator group management device, and is an example of a registered number table B for each car departure floor and destination floor for car B.
  • FIG. 6 is a diagram showing an output data structure of a destination floor number grasping unit constituting an elevator group management device, and is an example of a registered number table C for each car departure floor and destination floor for car C.
  • the destination floor number grasping unit 7 is a registration number table for each departure floor and destination floor for each car, that is, a registration number table A20 for each car departure floor and another destination floor for car A, and a registration for each car departure floor and destination floor for car B.
  • a number table B21 and a registered number table C22 for each car departure floor and destination floor for car C are created.
  • the registered number table A20 for each car departure floor and destination floor for car A the number of people moving from the departure floor 1st floor to the destination floor 4th floor is 20 and the departure floor 6th floor to the destination floor 2nd floor. It means that one person moves to the car, one person moves from the fourth floor of the departure floor to the third floor of the destination floor, and the car A1a (Fig.
  • the registered number table B21 for each car departure floor and destination floor for car B the number of people moving from the departure floor 1st floor to the destination floor 5th floor is 10 and the departure floor 3rd floor to the destination floor. It means that the number of people moving to the 5th floor is 2 and the number of people moving from the 5th floor of the departure floor to the 1st floor of the destination floor is 1 and is assigned to the car B1b (Fig. 1).
  • the registered number table C22 for each car departure floor and destination floor for car C shows that the number of people moving from the first floor of the departure floor to the sixth floor of the destination floor is 18 and is assigned to the car C1c. Represent.
  • FIG. 3 is a flowchart showing a processing flow of the allocation target car determination unit 11 constituting the elevator group management device 3 shown in FIG.
  • the destination floor call fullness determination unit 12 constituting the allocation target car determination unit 11 is set on the floors from the departure floor to the destination floor when the destination floor is registered. If the number of people registered in the car is equal to or greater than the specified value A, the car will be excluded from the allocation. On the other hand, for a car in which the number of people registered in the car is less than the predetermined value A (a car that does not correspond), the process of the next step S12 is performed.
  • step S12 the same floor determination unit 13 constituting the allocation target car determination unit 11 selects the car as the priority car for the currently registered destination floor and the car for which the same destination floor has already been registered.
  • the process of the next step S13 is executed for the car. For example, when registration is made from the 3rd floor of the departure floor to the 5th floor of the destination floor, if the 5th floor of the destination floor is already registered in the car B1b from any of the 1st to 4th floors of the departure floor, the car B1b has priority. Select as a basket.
  • the process of the next step S13 is executed for the car C1c. ..
  • step S13 the stop floor number suppression processing unit 14 constituting the allocation target car determination unit 11 temporarily allocates the destination floor registered this time to each car, and at that time, the car whose stop floor number of the car is a predetermined value B or more is assigned. Exclude allocation.
  • the process of the next step S14 is executed for the car whose stop floor number is less than the predetermined value B.
  • the predetermined value B which is the upper limit of the number of stopped floors, is a floor with four stopped floors, when registration is performed from the departure floor 3rd floor to the destination floor 5th floor, the 7th floor, 6th floor, and 3rd floor are already registered.
  • step S14 the future ride evaluation activation processing unit 15 constituting the allocation target car determination unit 11 is registered in the car on the floors from the departure floor to the destination floor when the destination floor is registered. Cars whose number of people is less than the predetermined value C are not excluded from the allocation, and the cars are subject to allocation.
  • the process of the next step S15 is executed for the car in which the number of people registered in the car is the predetermined value C or more.
  • the number of passengers in the car B1b upon arrival on the 3rd floor is as follows from the number of registered passengers table B21 (Fig. 5) by departure floor and destination floor for car B. Since it is predicted that there are 12 people and the number is less than 18 of the predetermined value C, the following steps S15 and S16 are not executed for the car B1b and are subject to allocation. From the registered number of passengers table C22 (Fig. 6) by departure floor and destination floor for car C, the number of passengers in car C1c when arriving on the 3rd floor is estimated to be 18, which is 18 or more of the predetermined value C. The following processes of step S15 and step S16 are executed for C1c.
  • step S15 the future destination floor determination unit 16 constituting the allocation target car determination unit 11 is a destination already registered with the user's destination floor that will occur in the future on the departure floor predicted by the destination floor prediction processing unit 10. Cars with matching floors will be deallocated.
  • the process of the next step S16 is executed for the car in which the destination floor of the user that occurs in the predicted departure floor and the destination floor already registered do not match.
  • Destination floor prediction table 19 departure floor by car, registration number table by destination floor, car departure floor, registration number table A20, car B, departure floor, destination floor, registration number table B21 , Car C1c, which is the target of step S15, when registration is performed from the departure floor 3rd floor to the destination floor 7th floor at 7:30 from the registered number table C22 by departure floor and destination floor for car C. If it is expected that the passenger will depart one minute later, the destination floor prediction table 19 predicts that users from the departure floor 3rd floor to the destination floor 6th floor will occur at 7:31, so the 6th floor that will occur in the future will be the destination floor. In order to allow users to ride in the car C1c, the car C1c is allocated and excluded.
  • step S16 performs allocation exclusion when the destination floor of the user that occurs in the future and the destination floor currently registered match. In order to allow future users who have the same destination floor as the registered user to ride in an empty car, the allocation of the car will be excluded. Similar to the process of step S15, this process is performed when the predicted user predicts that it will occur by the departure of the car that can be assigned at the time of process of step S16.
  • Destination floor prediction table 19 departure floor by car, registered number of people by destination floor, car for car A, registered number of people by destination floor, table A20, car for car B, registered number of people by destination floor, B21 , Car for car C Departure floor by destination floor Registration number table C22, from 7:30, when registration is done from the departure floor 3rd floor to the destination floor 7th floor, the car B1b to be allocated is 1 minute If it is expected to depart later, the car C1c is allocated and excluded because the destination floor prediction table 19 predicts that users from the departure floor 3rd floor to the destination floor 7th floor will occur at 7:31, and the 7th floor will be assigned to the car B1b. Share the users who have it as the destination floor.
  • steps S15 and S16 may be configured to carry out either one or both. Further, when both step S15 and step S16 are carried out, the processes may be performed in the order of step S15 and step S16, or may be processed in the order of step S16 and step S15.
  • step S15 the car is subject to allocation.
  • each of the above configurations, functions, processing units and the like may be realized by hardware by designing a part or all of them by, for example, an integrated circuit.
  • each of the above configurations, functions, and the like may be realized by software by the processor interpreting and executing a program that realizes each function.
  • Information such as programs, tables, and files that realize each function can be placed in a memory, a hard disk, a recording device such as an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
PCT/JP2019/025065 2019-06-25 2019-06-25 エレベーター群管理システム WO2020261361A1 (ja)

Priority Applications (3)

Application Number Priority Date Filing Date Title
PCT/JP2019/025065 WO2020261361A1 (ja) 2019-06-25 2019-06-25 エレベーター群管理システム
JP2021528682A JP7169448B2 (ja) 2019-06-25 2019-06-25 エレベーター群管理システム
CN201980097826.5A CN114007971B (zh) 2019-06-25 2019-06-25 电梯组管理系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2019/025065 WO2020261361A1 (ja) 2019-06-25 2019-06-25 エレベーター群管理システム

Publications (1)

Publication Number Publication Date
WO2020261361A1 true WO2020261361A1 (ja) 2020-12-30

Family

ID=74060816

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2019/025065 WO2020261361A1 (ja) 2019-06-25 2019-06-25 エレベーター群管理システム

Country Status (3)

Country Link
JP (1) JP7169448B2 (zh)
CN (1) CN114007971B (zh)
WO (1) WO2020261361A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112660951A (zh) * 2020-12-31 2021-04-16 郭静炜 电梯群组调度策略方法及装置
JP2022105452A (ja) * 2021-01-04 2022-07-14 東芝エレベータ株式会社 エレベータ制御装置、エレベータ制御システム、方法及びプログラム

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0769551A (ja) * 1993-09-06 1995-03-14 Hitachi Ltd エレベーターの案内表示装置
JPH0986808A (ja) * 1995-09-25 1997-03-31 Hitachi Ltd エレベータの群管理制御装置
WO2009123014A1 (ja) * 2008-04-03 2009-10-08 三菱電機株式会社 エレベータの群管理装置
JP2010150013A (ja) * 2008-12-26 2010-07-08 Hitachi Ltd 乗り場行先階予約式群管理エレベーターの制御装置
JP2012140232A (ja) * 2011-01-05 2012-07-26 Toshiba Corp エレベータの群管理制御装置
JP2016113237A (ja) * 2014-12-12 2016-06-23 株式会社日立製作所 エレベーターシステム及びエレベーターシステムの管理方法
JP2017030893A (ja) * 2015-07-30 2017-02-09 株式会社日立製作所 群管理エレベータ装置
JP2017178474A (ja) * 2016-03-28 2017-10-05 株式会社日立製作所 エレベーター装置及びエレベーター装置の制御方法
WO2018131115A1 (ja) * 2017-01-12 2018-07-19 三菱電機株式会社 エレベータの群管理制御装置およびエレベータの群管理制御方法
JP2019006542A (ja) * 2017-06-22 2019-01-17 株式会社日立製作所 群管理エレベーターシステム
JP2019023124A (ja) * 2017-07-24 2019-02-14 株式会社日立製作所 エレベーターシステム、画像認識方法及び運行制御方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105324322B (zh) * 2013-04-18 2017-06-09 株式会社日立制作所 电梯系统
JP6212290B2 (ja) * 2013-06-05 2017-10-11 株式会社日立製作所 エレベーターシステムの群管理制御方法
JP6445401B2 (ja) * 2015-07-03 2018-12-26 株式会社日立製作所 エレベータ群管理システム
JP6622240B2 (ja) * 2017-03-22 2019-12-18 株式会社日立ビルシステム エレベータ利用者案内システム及び方法

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0769551A (ja) * 1993-09-06 1995-03-14 Hitachi Ltd エレベーターの案内表示装置
JPH0986808A (ja) * 1995-09-25 1997-03-31 Hitachi Ltd エレベータの群管理制御装置
WO2009123014A1 (ja) * 2008-04-03 2009-10-08 三菱電機株式会社 エレベータの群管理装置
JP2010150013A (ja) * 2008-12-26 2010-07-08 Hitachi Ltd 乗り場行先階予約式群管理エレベーターの制御装置
JP2012140232A (ja) * 2011-01-05 2012-07-26 Toshiba Corp エレベータの群管理制御装置
JP2016113237A (ja) * 2014-12-12 2016-06-23 株式会社日立製作所 エレベーターシステム及びエレベーターシステムの管理方法
JP2017030893A (ja) * 2015-07-30 2017-02-09 株式会社日立製作所 群管理エレベータ装置
JP2017178474A (ja) * 2016-03-28 2017-10-05 株式会社日立製作所 エレベーター装置及びエレベーター装置の制御方法
WO2018131115A1 (ja) * 2017-01-12 2018-07-19 三菱電機株式会社 エレベータの群管理制御装置およびエレベータの群管理制御方法
JP2019006542A (ja) * 2017-06-22 2019-01-17 株式会社日立製作所 群管理エレベーターシステム
JP2019023124A (ja) * 2017-07-24 2019-02-14 株式会社日立製作所 エレベーターシステム、画像認識方法及び運行制御方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112660951A (zh) * 2020-12-31 2021-04-16 郭静炜 电梯群组调度策略方法及装置
JP2022105452A (ja) * 2021-01-04 2022-07-14 東芝エレベータ株式会社 エレベータ制御装置、エレベータ制御システム、方法及びプログラム
JP7171774B2 (ja) 2021-01-04 2022-11-15 東芝エレベータ株式会社 エレベータ制御装置、エレベータ制御システム、方法及びプログラム

Also Published As

Publication number Publication date
JP7169448B2 (ja) 2022-11-10
CN114007971B (zh) 2023-04-18
CN114007971A (zh) 2022-02-01
JPWO2020261361A1 (zh) 2020-12-30

Similar Documents

Publication Publication Date Title
JP6552445B2 (ja) エレベーター装置及びエレベーター装置の制御方法
JP5464979B2 (ja) エレベータの群管理システム
JP5351510B2 (ja) 乗り場行先階予約式群管理エレベーターの制御装置
JP5566740B2 (ja) エレベータの群管理制御装置
JP5511037B1 (ja) エレベータの群管理システム
JP5705704B2 (ja) エレベータ群管理システムおよびその制御方法
KR920001299B1 (ko) 엘리베이터의 군관리장치
JP5951421B2 (ja) エレベータ群管理システム
JP2019081622A (ja) 外部システム連携配車システム及び方法
JP6894982B2 (ja) 群管理制御装置及び群管理制御方法
WO2020261361A1 (ja) エレベーター群管理システム
WO2019087250A1 (ja) 渋滞回避運転システム及び方法
JP5294171B2 (ja) エレベータの群管理制御装置
JP6503313B2 (ja) 群管理制御装置及び群管理制御システム
JPS62121186A (ja) エレベ−タの群管理制御方法
KR101024799B1 (ko) 승강기 통행 제어
JPS61136883A (ja) エレベ−タの群管理装置
JPS6153976B2 (zh)
JPH04286581A (ja) エレベーターの群管理制御装置
JPH0476914B2 (zh)
JP6420217B2 (ja) エレベータ装置及びエレベータ装置の制御方法
JP6759417B1 (ja) エレベータ割当装置
JPS6334111B2 (zh)
JPS6124295B2 (zh)
JPS6247787B2 (zh)

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19935267

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2021528682

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19935267

Country of ref document: EP

Kind code of ref document: A1