JPH10218508A - Operation control unit of elevator - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make the occurrence of a hall call in a building predictable yet more accurately by renewing storage contents by the collected results according to a fact that a scheduled setup has been done. SOLUTION: In formation on a call registered in a hall call means 3 being installed at each floor, the position and state of a car 1, a destination floor record in the car and suchlike are all transmitted to a control unit 4, and thereby an operation controlling means 4-5 in this control unit 4 determines the car operation, operating the car 1 via a deriving device 2. In addition, information out of the hall call means 3 is transmitted to a learning means 4-2, and it is learned with a time output of a clocking means 4-1, and when the setting of a learning propriety setting means 5 accepts this learning, the contents of a learning data storage means 4-3 are renewed. In succession, a car distributive determiner means 4-4 determines a floor, where the car is distributed by the contents of the learning data storage means 4-3 and the time output of the clocking means 4-1, in the case where the setting of a car distribution propriety setting means 6 accepts the car distribution, and thus is commands the operation controlling means 4-5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an operation control device for an elevator, and more particularly to learning the occurrence of hall calls.
The present invention relates to an improvement in an elevator operation control device that preliminarily allocates an elevator to a floor where a user is expected to be.

[0002]

2. Description of the Related Art Elevators are serviced according to hall calls registered by waiting passengers in elevator halls and destination floor information by car calls registered by passengers in the car. When all of the registered calls have been answered and there are no more calls to be serviced, either "drop-off" to wait at the final destination floor or "distributed standby" to move to a specific floor is performed. Examples of the prior art for performing the decentralized standby include a floor with many hall calls, a distributed floor,
A system for determining the number of standby units is disclosed in Japanese Patent Application Laid-Open No. 54-162357.

As an example of setting the standby floor in more detail, Japanese Patent Laid-Open Publication No. Hei 7-2434 discloses an elevator for a private house in which hall calls are regularly generated. A technique has been disclosed in which, when hall call registration is continued within a certain time range on a specific floor, a car is put on standby in advance on that floor to reduce the user's waiting time when statistical processing is performed on a specific floor. .

[0004]

The technique of predicting the occurrence of a hall call by learning as described above and allocating an elevator is based on the premise that a hall call is regularly generated.

[0005] However, on the day when you move in your apartment,
When exceptional demand is learned, such as when holidays such as Golden Week continue, the learning data contradicts the normal occurrence situation in the building. As a result, regular hall calls cannot be predicted, which adversely affects the operation.

[0006] In addition, since the movement status of the elevator user is different between weekdays and holidays, the occurrence status of hall calls does not match. Japanese Patent Application Laid-Open No. Hei 7-2434 discloses a method of distinguishing this change by day of the week, but cannot deal with holidays.

An object of the present invention is to provide an elevator operation control device provided with means for more accurately predicting the occurrence of a hall call in a building.

Another object of the present invention is to allocate an elevator in advance to a floor where a large number of hall calls are generated without being adversely affected by specific irregular traffic demand, and to make an elevator wait in advance. It is an object of the present invention to provide an elevator operation control device that can be used.

Another object of the present invention is to efficiently detect regular hall calls from a mixture of regular hall calls and random hall calls.

It is another object of the present invention to reduce the waiting time of a regular hall call when the occurrence of the regular hall call is expected.

[0011]

The features of the present invention include an elevator for servicing a plurality of floors, a hall call means for each floor, and an operation control means for operating the elevator in accordance with the hall call. In the elevator operation control device provided, means for collecting the state of occurrence of hall calls, means for storing the result of collection, setting means which is manually operated, and schedule setting are set by the setting means. Means is provided for updating the storage content of the storage means according to the collection result of the collection means.

Another feature of the present invention is that
Means for collecting the state of occurrence of hall calls, means for storing this collection result, setting means which is artificially operated, and collection by said collecting means in accordance with the scheduled setting by said setting means A means for updating the storage content of the storage means based on the result and a dispatch floor determining means for determining a dispatch floor for waiting for an elevator having no call to be serviced by using the collection result are provided.

In a preferred embodiment of the present invention,
If a regular hall call can be detected by learning, advance dispatch is started, and even if there is no hall call in recent days on the floor where regular hall calls are continuously registered in the past, Continue pre-allocation. For example, a floor where a large number of regular hall calls occur within a predetermined period, such as three out of the last five days, is targeted for pre-allocation, and conversely, a floor where a regular hall call occurs for a long period of time. For example, even if a hall call does not occur in a short period of about five days recently due to a business trip of the user or the like, it is desirable to set a floor as a target floor for prior dispatch.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention will be described below with reference to FIGS.

First, means for constituting the invention necessary for the present embodiment and an outline thereof will be described. FIG. 1 is a system configuration diagram of an embodiment of the present invention.

The system is roughly divided into a car 1, a drive unit 2, a hall calling unit 3, a control unit 4, a learning possibility setting unit 5, a vehicle assignment setting unit 6, and a date attribute (clock) information setting unit 7. You. The control device 4 includes a clock means 4
-1, learning means 4-2, learning data storage means 4-3, dispatch floor determining means 4-4, and operation control means 4-5. Here, the operation in the control device 4 is generally configured by software using a computer and a memory. In this case, it is possible to configure the respective means without clarity, but in the description of the present embodiment, each means is described as separate means corresponding to the constituent means of the invention.

Information such as the call registered in the hall call means 3 provided on each floor, the position and state of the car 1, and the registration of the destination floor in the car are transmitted to the control device 4, and the operation in the control device 4 is performed. The control means 4-5 determines the operation of the car and operates the car 1 via the drive device 2.

The information of the hall calling means 3 is stored in the learning means 4
When the learning is enabled using the time output of the clock means 4-1 and the setting of the learning possibility setting means 5 allows the learning, the contents of the learning data storage means 4-3 are updated.
As described above, the means for collecting the hall call occurrence situation data is configured. The storage area of the learning data to be updated here can be changed by the input of the day attribute information setting unit 7 via the learning destination switching unit 4-3-2 described later.

The vehicle allocation floor determining means 4-4, based on the contents of the learning data storage means 4-3 and the time output of the clock means 4-1 when the setting of the vehicle allocation permission / non-permission setting means 6 permits the vehicle allocation. And instructs the operation control means 4-5.

FIG. 2 is a diagram showing the configuration of the learning data storage means 4-3.

The learning data storage means 4-3 includes a learning data storage area on the day 4-3-1, a learning destination switching means 4-3-2.
Normal short-term learning data storage area 4-3-3, normal long-term learning data storage area 4-3-4, special day short-term learning data storage area 4-3-5, special day long-term learning data storage area 4- 3-6.

Now, in order to avoid learning of exceptional demand, a learning possibility setting means 5 is provided in FIG.

The learning possibility setting means 5 may be a single ON / OFF switch in a minimum configuration. Further, it may be input software on a computer for setting whether or not learning is possible at each time. Also, during the time when the maintenance operation switch and the dedicated operation switch are operated in the elevator, it is considered that the operation is an exceptional operation, so it should not be learned. Therefore, the operation of the maintenance operation switch and the dedicated operation switch in the elevator may automatically constitute one of the learning rejection setting means.

Further, in order to prevent the operation based on the prediction of the occurrence of the hall call on the day when the exceptional demand is generated, a vehicle allocation availability setting means 6 is provided.

As for the vehicle allocation permission / prohibition setting means 6, only one ON / OFF switch may be used in the minimum configuration. Further, according to the embodiment, this switch is provided with a learning possibility setting means 5.
May be shared with the ON / OFF switch. Further, it may be input software on a computer for setting whether or not the vehicle can be dispatched for each time and each floor.

In order to change the learning area according to the attribute of the target day, the learning data storage means 4-3 has the same day learning data storage area 4-3-1, the learning destination switching means 4-3-2, and the short-term for normal use. Learning data storage area 4-3-3, normal long-term learning data storage area 4-3-4, special day short-term learning data storage area 4-3-5, special day long-term learning data storage area 4-3-6 It has. Conversely, when the learning area is not changed according to the attribute of the target day and learning other than normal learning is not performed, the learning destination switching unit 4-3-2, the short-term learning data storage area for special day 4-3-5. There is no need to provide the special daily long-term learning data storage area 4-3-6.

Further, in order to set the attribute of the target date,
A day attribute information setting means 7 is provided.

In addition, in order to allocate vehicles in advance to floors where regular hall calls have occurred frequently in recent days, or to allocate vehicles in advance to floors where regular hall calls have occurred over a long period of time in the past. In order to continue without being affected by the recent several days, the learning data storage area 4-3-1 for the day and the short-term learning data storage area for normal use 4-3-3 for normal use are stored in the learning data storage means 4-3. Long-term learning data storage area 4-3
-4.

The learning availability setting means 5, vehicle allocation availability setting means 6, and day attribute information setting means 7 can be realized independently or in common, and hardware such as switches can be used. , Or as common software in a computer.

These setting means are installed in an operation panel in an elevator car and a control panel in an elevator machine room, and are installed in a manager's office and a maintenance company, and are connected to a control device 4 via a transmission line.
And can be connected.

When installed on the control panel in the elevator machine room, learning possibility setting means 5, vehicle assignment possibility setting means 6,
There is no need to prepare a new installation location for the day attribute information setting means 7. In the case of installation in an administrator's office, setting operations at the time of an exception such as a building holiday or moving are facilitated. When installed in a maintenance company, the maintenance company can collectively set a holiday, such as the day of the vernal equinox, whose date changes depending on the year, as an exception to the normal day.

The learning availability setting means 5, vehicle allocation availability setting means 6, and day attribute information setting means 7 may be installed at a plurality of locations as needed.

Next, an example of the operation and processing contents of each means will be described. In the following description of the processing, description and grammar in C language for computers are applied mutatis mutandis.

FIG. 3 is a flowchart showing the contents of the learning execution processing 10 in the learning means 4-2. The learning execution process 10 is executed periodically, such as every minute, or as an interrupt process when a new hall call is registered in the hall call means 3.

First, at step 10-1, the clock means 4
The current time h: m is read from -1. Here, the hour in the 24-hour system is h and the minute is m.

In step 10-2, it is determined from the setting of the learning possibility setting means 5 whether or not it is time to perform learning. This is whether the switch is ON when the learning possibility setting means 5 is a switch, and when the learning possibility setting means 5 is software, the target time h:
Whether or not the time including m is set to a learning-enabled time.

If it is the learning target time in step 10-2, the pointer lp of the data to be learned is set in step 10-3 according to equation (1).

Lp = h × 60 + m (Expression 1) Here, Expression (1) is an example in the case where the width of learning is set in one-minute intervals.

In step 10-4, a new hall call occurrence floor flr is read. Here, the number of service floors of the target building is Fmax, and the floor call occurrence floor flr is 0 to Fma
It is assumed to take a value up to x-1. In addition, in the present embodiment, the number of service floors Fmax is set to 32 floors or less in relation to on-the-day learning data lmem described later.

At step 10-5, the hall call generation floor
The floor mask fmsk that turns on the bit corresponding to flr
It is created by shifting 1 to the left flr times.

Fmsk = 1≪flr (Equation 2) In step 10-6, the bit pattern of the floor mask fmsk is added to the contents of the position of the learning pointer lp of the learning data lmem on the day.

Lmem [lp] | = fmsk (Equation 3)
Here, in the present embodiment, since the learning width is set to one minute, the learning data on the day is a data array lmem having a unit of 32 bits long unsigned integer and a storage area of 24 × 60.
[24 × 60].

If it is not the learning target time in step 10-2, the learning flag lf at the corresponding time is turned off in step 10-7. In the present embodiment, the learning flag is described as an array lf [24] with one-hour intervals.

Thus, one learning operation of the day is completed.

FIG. 4 is a flowchart showing the contents of the learning data management processing 20 in the learning data storage means 4-3. In the present embodiment, the learning data management processing 20 is executed once a day at exactly 0:00.

The processing performed in the learning data management processing 20 is to copy the contents of the learning data storage area lmem for the current day to the short-term learning data storage area lr for Dmax days, and to copy the contents of the short-term learning data storage area lr for one day. The content of the long-term learning data storage area lb is updated by the data shifted by Dmax days from the short-term learning data storage area lr. In addition, the learning data storage area lmem is also cleared on the day. Here, the number of days Dmax for storing the short-term learning data
In this embodiment, for example, it is five days.

In step 20-1, the day attribute information dm is read from the clock means 4-1. Where day attribute information dm
Is 0 on a normal day and 1 on a special day.

Steps 20-2, 20-3, 20-14
Is a loop process for learning data increments. In step 20-2, the learning pointer lp is initialized to 0. If the learning pointer lp is less than 24 × 60 in step 20-3, the process proceeds to step 20-4.

In step 20-4, the setting of the learning flag lf is checked. If the learning flag lf [int (lp / 60)] corresponding to the learning pointer lp is OFF, the processing proceeds to step 20-14 without performing the following learning processing, and the value of the learning pointer lp is incremented by one. Return to 20-3. At step 20-4, the learning flag lf [int (lp / 6
0)] is ON, the process proceeds to step 20-5.

Steps 20-5, 20-6, 20-11
Is a loop process for the floor. At step 20-5, the floor pointer flr is initialized to 0, and at step 20-6.
If the floor pointer flr is less than Fmax at step 20
Proceed to -7.

In step 20-7, the floor pointer flr
Create a bit pattern of the floor mask fmsk corresponding to.

In step 20-8, the mode d of the day attribute
The contents of the long-term learning data storage area lb [dm] [flr] [lp] corresponding to the floor pointer flr and the learning pointer lp of m are updated by the equation (4) using a learning coefficient a of 0 or more and 1 or less. .

Lb [dm] [flr] [lp] = (1-a) × lb [dm] [flr] [lp] (Equation 4) In step 20-9, the short-term learning data storage area of Dmax days before It is checked whether or not a hall call has occurred at the target time lr [dm] [Dmax-1] [lp], and if it has occurred, at step 20-10, the long-term learning data storage area lb [d
The value of the learning coefficient a is added to [m] [flr] [lp].

Here, the long-term learning data storage area is a three-dimensional real number array lb [2] [Fmax] [24 × 60] of the number of modes of the day attribute, the number of floors, and the number of learning steps.

The learning coefficient a is a real coefficient that adjusts how much past information is stored in the long-term learning data storage area lb. In this embodiment, the latest information is stored in the short-term learning data storage area lr. Since it is stored, it is set to a value close to 0, for example, 0.05.

In step 20-11, the floor pointer fl
The value of r is incremented by 1, and the process returns to step 20-6.

If the loop processing for the floor has been completed in step 20-6, the contents of the short-term learning data storage area lr are shifted by one day in step 20-12, and the learning data storage area lmem [lp] for the current day is shifted. Is copied to the short-term learning data storage area lr [dm] [0] [lp].

Here, the short-term learning data storage area is a three-dimensional 32-bit unsigned integer array lr [2] [Dmax] [2 of the number of day attribute modes, the number of short-term storage days, and the number of time steps for learning.
4 × 60].

Thereafter, in step 20-13, the contents of the learning data storage area lmem [lp] on that day are cleared, and the flow returns to step 20-14.

If the loop processing for learning data increments is completed in step 20-3, step 20-15
Resets all the learning flags lf to ON.

Thus, the learning data management processing 20 is completed.

Here, the learning destination changing means executes step 20
This is realized by switching the storage areas lr and lb of the learning data for the subsequent processing according to the day attribute dm read at −1. If it is not necessary to switch the learning destination, step 20-1 may be omitted, and the section regarding the day attribute dm in the learning data storage areas lr, lb may be removed.

When it is not necessary to store the long-term learning data, the processing of steps 20-5 to 20-11 can be omitted. If you do not need to store short-term learning data,
This can be realized by changing the data used in step 20-9 to the learning data storage area lmem [lp] on the day and excluding step 20-12.

It is also possible to adopt a configuration in which an erasure command is input to the learning possibility setting means so that a specific learning data storage area can be erased.

FIG. 5 is a flowchart showing the contents of the dispatch floor determining process 30 in the dispatch floor determining means 4-4.
It is assumed that the vehicle allocation floor determination processing 30 is periodically executed at intervals of the learning data, such as every minute.

In step 30-1, data is initialized. Where lrsum is real number data for sum of short-term learning data, lbsum is real number data for sum of long-term learning data,
wmax is a temporary variable of the maximum value of the total value, sflr is a vehicle allocation decision floor, and quit is a flag for ending the loop.

For the maximum value wmax, Lset representing the lower limit of the regularity of the learning data for performing vehicle allocation is set. Lset
Is 3/5 = 0.6 if there is a regular hall call in the last 5 days if there is a regular hall call.
Set to 0.6.

Here, the initial value of the dispatch determination floor sflr is set to Fma outside the service floor range from 0 to Fmax-1.
This is a setting example in which “drop-off” is set when there is no regular hall call occurrence floor to be allocated in advance as described later. If there is no regular hall call occurrence floor to be allocated in advance, and a floor to be "standby" is set separately, that floor may be set to sflr.

At step 30-2, the current time h: m and day attribute information dm are read from the clock means 4-1.

In step 30-2, it is determined whether or not it is time to dispatch the vehicle, based on the setting of the dispatching availability setting means 6. This is whether the switch is ON when the vehicle allocation possibility setting means 6 is a switch, and the target time h when the vehicle allocation possibility setting means 6 is software:
Whether or not the time including m is set to the time when dispatch is possible.

If it is the vehicle allocation target time in step 30-2, a pointer sb, which is the base of the time for vehicle allocation in step 30-3, is set by equation (5).

Sb = h × 60 + m + 1 (Equation 5) The equation (5) sets the base pointer sb for dispatch to one minute after the current time in consideration of the moving time.

Steps 30-5, 30-6, and 30-9 are a loop process relating to a time width t for detecting a regular hall call to be dispatched. At step 30-5, the time width t is initialized to 0, and at step 30-6, the time width t is set.
Is less than the maximum value Tmax of the time width, step 30-
Proceed to 7. This is because there are various types of regular hall calls, such as accurate one-minute calls and those with a variation of about 10 minutes. Therefore, when there is no learning data whose lower limit of the regularity exceeds Lset. The width of the learning data to be detected is gradually expanded. For example, 15 minutes is set as the maximum value Tmax of the time width.

At step 30-7, the vehicle allocation pointer sp indicating the search position of the learning data is changed to the vehicle allocation base pointer s
It is set at a position preceding the time width t from b. At this time, since the dispatch pointer sp is in a range of 0 or more and less than 24 × 60,
It is calculated as a remainder of (24 × 60).

Sp = (sb + t)% (24 × 60) (Equation 6) The subroutine 40 is a process of searching for an actual vehicle allocation floor, which will be described later. If successful, the dispatch target floor is set to sflr and the loop end flag quit is set to True.

If the result of the subroutine 40 is that the loop end flag quit remains False, step 30-
The process proceeds from Step 8 to Step 30-9, the time width t is increased by 1, and the process returns to Step 30-6.

If quit is True in step 30-8, the process exits from the loop processing for the time width t in step 30-8 and proceeds to step 30-10. Step 30
The process also proceeds to step 30-10 when the loop processing for the time width t is completed in -6. In step 30-10,
It is checked whether a valid service floor is set to the dispatching target floor sflr, and if it is set, step 30-11 is performed.
To set the dispatch command to the sflr floor in the operation control means 4-5.

[0094] The effective vehicle allocation target floor sf in step 30-10.
If lr is not set, the dispatch instruction to the operation control means 4-5 is cleared in step 30-12.

FIG. 6 is a flowchart showing the processing of the vehicle allocation floor search subroutine 40.

Steps 40-1, 40-2, 40-15
Is a loop process for the floor pointer flr. In step 40-1, the floor flr is initialized to 0, and in step 40
If the floor flr is less than the maximum value Fmax at -2, step 4
Go to 0-3.

In step 40-3, it is determined from the setting of the dispatching availability setting means 6 whether or not it is the floor to be dispatched. This is whether the switch is ON when the dispatching availability setting means 6 is a switch, and when the dispatching availability setting means 6 is software, the target floor fl
Whether r is set to be dispatchable. If it is not the vehicle allocation target floor, the process proceeds to step 40-15, and the processing target is the next floor. If the floor is a dispatch target floor, step 4
Proceed to 0-4, and the floor mask corresponding to the floor pointer flr
Create a bit pattern for fmsk.

Steps 40-5, 40-6, and 40-9 are a loop process for the number of days j of short-term learning. In step 40-5, the number of days j is initialized to 0, and in step 40-6.
If the number of days j is less than the maximum value Dmax, step 40-
Proceed to 7.

At step 40-7, at the target time on the target day,
If a hall call has occurred on the target floor, at step 40-8, (1.0 / Dmax) corresponding to the value for one day is added to the total value lrsum [flr] of the short-term learning data.

Thereafter, 1 is added to the number of days j in step 40-9, and if the loop ends in step 40-6, the flow advances to step 40-10.

In step 40-10, the corresponding part of the long-term learning data lb is added to the total value lbsum [flr] of the long-term learning data.

In step 40-11, the total value lrsum [flr] of the short-term learning data is compared with the maximum value wmax of the short-term learning data. If the total value is larger than wmax, wmax is updated to lrsum [flr] in step 40-12. Then, flr to the target floor sflr
And set the end flag quit to True.

Similarly, in step 40-13, the total value lbsum [flr] of the long-term learning data is compared with the maximum value wmax.
If it is greater than wmax, then in step 40-14 wmax
Is updated to lbsum [flr], flr is set to the allocation target floor sflr, and the end flag quit is set to True.

After the above processing is completed, the flow advances to step 40-15, and the processing is set as the next floor, and the processing is repeated until the loop ends in step 40-2.

When the loop processing is completed, the flow returns to the vehicle allocation floor determination processing 30 which has called the subroutine.

In FIG. 6, the vehicle allocation floor is determined by the total value lrsum of the short-term learning or the total value lbsum of the long-term learning, but the vehicle allocation is determined by the total of the total value lrsum of the short-term learning and the total value lbsum of the long-term learning. It is also possible to determine the floor.

According to the present embodiment, the total value of short-term learning
When lrsum or the total value lbsum of the long-term learning exceeds the set value Lset, the vehicle can be allocated in advance, so that the performance of the vehicle allocation service for a regular hall call can be improved.

Further, according to the present embodiment, it is possible to easily switch between pre-allocation, drop-off, or reference floor standby by initial setting of wmax for total determination.

Further, according to the present embodiment, the time width for judging the temporal variation of the hall call can be automatically set according to the frequency of occurrence of the hall call.

According to the present embodiment, it is possible to prevent the operation based on the prediction of the occurrence of the hall call on the day when the exceptional demand occurs, and it is possible to suppress the unnecessary operation of the elevator.

According to the present embodiment, a vehicle can be allocated in advance to a floor where a large number of regular hall calls have occurred in recent several days.

Further, according to the present embodiment, advance dispatch to the floor where a regular hall call has occurred over a long period in the past can be continued without being affected by the last few days.

According to the present embodiment, the waiting time when the occurrence of a regular hall call is predicted can be minimized.

[0098]

According to the present invention, exceptional demand can be avoided, and the occurrence of regular hall calls can be grasped with high efficiency.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram according to an embodiment of the present invention.

FIG. 2 is a diagram showing a configuration of a learning data storage unit.

FIG. 3 is a flowchart of a learning execution process.

FIG. 4 is a flowchart of a learning data management process.

FIG. 5 is a flowchart of a vehicle allocation floor determination process.

FIG. 6 is a flowchart of a vehicle allocation floor search process.

[Explanation of symbols]

3. Hall calling means, 4-1 Clock means, 4-2 Learning means, 4-3 Learning data storage means, 4-4 Vehicle floor determination means, 4-5 Operation control means, 5 Learning availability Setting means, 6 ... Distribution availability setting means, 7 ... Day attribute (clock) information setting means, 10 ... Learning execution processing, 20 ... Learning data management processing, 30 ... Distribution floor determination processing, 40 ... Distribution floor search processing.

 ──────────────────────────────────────────────────続 き Continued on front page (72) Inventor Hiroshi Nagase 1070 Ma, Hitachinaka City, Ibaraki Prefecture Inside Mito Plant, Hitachi, Ltd. (72) Inventor Kazuhiro Segawa 1070 Ma, Hitachinaka City, Ibaraki Hitachi, Ltd. Inside Mito Plant (72) Inventor Toru Yamaguchi 1070 Ma, Hitachinaka-shi, Ibaraki Prefecture Inside Mito Plant, Hitachi, Ltd. (72) Inventor Kenji Yoneda 1070 Ma, Hitachinaka-shi, Ibaraki Inside Mito Plant, Hitachi, Ltd.

Claims (8)

[Claims] 1. An elevator operation control device comprising: an elevator for servicing a plurality of floors; a hall calling means for each floor; and an operation control means for operating the elevator in accordance with the hall call. Means for collecting situation data, means for storing the collected data, setting means which is artificially operated, and the collection data in the collecting means according to the scheduled setting being made by the setting means, An operation control device for an elevator, comprising means for updating the contents stored in the storage means. 2. An elevator operation control apparatus comprising: an elevator for servicing a plurality of floors; a hall call means for each floor; and an operation control means for operating the elevator in accordance with the hall call. Means for collecting situation data, means for storing the collected data, setting means which is artificially operated, and the collection data in the collecting means according to the scheduled setting being made by the setting means, An elevator operation control device, comprising: means for updating the storage contents of the storage means; and dispatch floor determining means for determining a dispatch floor for waiting for an elevator having no call to be serviced using the collected data. . 3. An elevator operation control device comprising: an elevator serving a plurality of floors; a hall call means for receiving a use request at each floor; and an operation control means for operating the elevator in response to the hall call. Learning means for learning the occurrence state of a hall call, learning data storage means for storing the learned result, learning possibility setting means for artificially setting the possibility of learning, and setting of the learning possibility setting means for learning. An operation control device for an elevator, further comprising means for updating the storage content of the learning data storage means based on the learning result of the learning means only when it is permitted. 4. An elevator operation control device according to claim 1, further comprising clock means for outputting time information, wherein said setting means is configured to receive an input corresponding to time. 5. An elevator for servicing a plurality of floors, a hall calling means for each floor, an operation control means for operating the elevator in accordance with these hall calls, and a learning means for learning the occurrence status of the hall calls. Operation control of an elevator, comprising: learning data storage means for storing a learned result; and dispatch floor determining means for determining, using the learning result, a dispatch floor on which the elevator waits when there is no call to be served by the elevator. In the apparatus, means for setting whether or not learning is possible, means for setting whether or not vehicle allocation is possible, and when the setting of the learning possibility setting means allows learning, the contents stored in the learning data storage means based on the learning result of the learning means. Means for updating the call, and an elevator having no calls to be serviced when the setting of the dispatch possibility setting means permits dispatch. Elevator operation control device which is characterized by providing means for waiting for over to the dispatch floor. 6. An elevator operation control device according to claim 5, further comprising clock means for outputting time information, wherein said vehicle allocation availability setting means receives an input corresponding to time. 7. An elevator operation control device according to claim 5, wherein said learning availability setting means and said vehicle allocation availability setting means are common setting means. 8. An elevator operation control device according to claim 5, wherein said learning possibility setting means or said vehicle assignment possibility setting means is provided in an elevator car.