Method of controlling intelligent destination elevators with selected operation modes

Abstract
A method of controlling an intelligent destination elevator control system streamlines the control of two or more destination elevators. Operations of a group of destination elevators are monitored to gain experience about how the population is served by the group of destination elevators that serves a building or a building zone. The analysis of measured and/or modeled data and conditions with data about traffic patterns and traffic characteristics enables the system to dynamically control the destination elevators. The system may enhance passengers' experience through efficiency and/or with an improved comfort level.
Description
BACKGROUND OF THE INVENTION

1. Technical Field


This application relates to elevator control systems, and more particularly, to intelligent destination elevator control systems.


2. Related Art


Buildings are served by elevators. Traditionally, elevators may include “collective selective” controls, such as up and down buttons at the elevator lobbies and individual floor buttons in the elevator cars. Movement of these elevators may be directed by the random destinations of passengers which may result in an inefficient distribution of the passengers into the building.


Some buildings use elevator systems that require passengers to enter their floor destinations on panels in the elevator lobbies. These systems assign passengers to specific cars based on their destinations. Distribution of the passengers in these systems are based on the passenger selected destinations. These systems may not rely on options that may aid in the distribution of the passengers.


SUMMARY

An intelligent destination elevator control system streamlines the efficiency and control of destination elevators. The system monitors a building's population and predicts elevator traffic conditions. The system may monitor attributes of the destination elevators. Based on the monitored data, the system may generate a data structure that renders time-tables and target elevator service quality parameters that may control the destination elevators. A time-table and target elevator service quality parameters may be selected to control destination elevators according to one or more customer selectable mode of operation parameters. The data structure may be processed to control UP and/or DOWN transportation capacities of the destination elevators while satisfying the one or more customer selectable mode of operation parameters.


Some intelligent destination elevator control systems may control when elevator cars of a group service the floors of a building. Control of the elevator cars may be flexible to allow the system to increase or decrease transportation capacities of the elevator cars in accordance with anticipated traffic conditions.


Other systems, methods, features, and advantages will be, or will become, apparent to one with skill in the art upon examination of the following figures and detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the following claims.





BRIEF DESCRIPTION OF THE DRAWINGS

The system may be better understood with reference to the following drawings and description. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention. Moreover, in the figures, like referenced numerals designate corresponding parts throughout the different views.



FIG. 1 is an exemplary system of an intelligent destination elevator control system.



FIG. 2 is an exemplary representation of roundtrip data that may accessed by an intelligent destination elevator control system.



FIG. 3 an exemplary representation of comparative data that may be accessed an intelligent destination elevator control system.



FIG. 4 is an exemplary process that controls a group of destination elevators.



FIG. 5 is an exemplary process that controls a group of destination elevators according to a first come first served process.



FIG. 6 is an exemplary process that controls a group of destination elevators according to a direct trip process.



FIG. 7 is An exemplary graphical representation of a direct trip pattern.



FIG. 8 is a second exemplary system of an intelligent destination elevator control system.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

An intelligent destination elevator control system streamlines the control of two or more destination elevators. The system monitors operations of a group of destination elevators to gain experience about how the population served by the group of destination elevators makes use of the services provided by these elevators. The analysis of measured and/or modeled data and conditions with data about traffic patterns and traffic characteristics enables the system to dynamically control the destination elevators. The system may enhance passengers' experiences through efficiency and/or with an improved comfort level.


The system may generate and/or evaluate building or user data and traffic density data to select a mode of operation for the destination elevators that satisfies one or more service quality requirements. Based on the selected mode of operation, additional service quality parameters that satisfy the service quality requirements may be configured. By monitoring traffic density and operation of the group of elevators, the system may dynamically adjust the destination elevator service quality parameters to satisfy the selected service quality requirements. Adjustments may be made to the destination elevator service quality parameters before traffic densities change, and may appear to be instantaneous (e.g., real-time), about real-time, or during a time period that will occur in the future (e.g., batch processing).


The intelligent destination elevator control system 100 of FIG. 1 may include a group of devices or structures that may convey persons or things to different levels within a building 102. Movement of the elevator cars 102 may be controlled by an elevator control system 104 that may comprise a local area and/or wide area network. The local area network may comprise a local or remote computer or controller that may execute various computer applications to control how quickly an elevator car 102 may move between levels within the building. In some systems, the elevator control system 104 may comprise a drive train (e.g., a rope/chain system driven by a motor and gears). In some systems, the elevator control system 104 may include counterweights which may control movement of an elevator car 102. The elevator car 102 and/or the counterweights may travel within a guide rail assembly. Brakes may be used to hold the elevator car 102 in place when it has reached the desired destination. A safety brake may prevent the elevator car 102 from falling in the event of a failure. Other elevator control systems 104 may use alternative systems (e.g., hydraulic or pneumatic systems) for raising and/or lowering an elevator car 102.


Movement of an elevator car 102 between floors or levels within the building may be associated with controlling ancillary functions such as attributes related to the elevator car 102. In some systems, these attributes may include the closing and opening of the elevator car doors, detecting and/or measuring a load in the elevator 102, controlling motor functions, locking the doors, controlling brake functions, controlling the flight of the elevator car 102, and/or other attributes. Control of the flight of the elevator 102 may include controlling acceleration, deceleration, and/or jerk rates of the elevator 102. The elevator control system 104 may further comprise one or more optical or electronic sensors that may detect and/or measure some or each of the attributes. The sensors may monitor one or more levels within the building.


A group of elevators 102 may comprise destination elevators cars. “Collective Selective Controls” may be absent from elevator lobbies and destination elevators cars. Instead, input/output device(s) 106 may be present in an elevator lobby. Passengers may use the input portion of the device 106 to select a floor destination. The system may evaluate a selected destination, a traffic density, a traffic density pattern, an operational status and/or an operation mode of two or more (e.g., a group) elevators 102. Based on an automated analysis a processor or controller may assign passengers to an elevator car that will service their desired floor(s). The output portion of the device 106 may indicate to the passenger the destination elevator car to which it is assigned.


The input/output device(s) 106 may be separate devices or may be a unitary device. The input device 106 may receive a passenger's destination through a speech input, a touch input, and/or an interface that receives an electronic signal transmitted through a wireless or wired communication medium. The output device 106 may be an audio device that converts an electrical signal to an aural signal which is presented to the passenger. In other systems, the output device 106 may be a visual device that provides a visual indication of the passenger's assigned elevator car. In yet other systems, the output device may comprise a combined audio/video device.


A sensor or network/array of sensors 108 may be positioned on or within an elevator car 102, and/or within an elevator shaft in which an elevator car travels. The sensor(s) 108 may be a single or multifunctional controllable sensor capable of detecting, measuring, and/or modeling in real-time, near real-time, or delayed time elevator attributes. The elevator attributes may include an elevator car travel time (e.g., flight time) between floors; an amount of time for the elevator doors to open, remain open, close, and/or lock; the speed at which the elevator doors open and/or close, and/or the period of time an elevator car waits at a particular floor. In some systems, the sensor(s) 108 may detect, measure, and/or model a moving speed of an elevator car 102, and/or rates of acceleration, deceleration, and jerk. Data detected or measured by the sensor(s) 108 may occur through continuous periods, or may occur at intervals, such as a seasonal time period, months, days, hours, and/or a predetermined range of time (e.g., about every 5 minutes or about every 10 minutes).


In some systems, the detected, measured, and/or modeled data may be transmitted to a processing and/or storage device, such as a processor 110, a data warehouse 112, a memory 114, and/or other processing or storage devices. In some systems the processor 110 may comprise a controller. The processor 110 may be part of a local area and/or wide area network and may be linked to the data warehouse 112 (e.g., one or more databases that may be distributed and accessible to one or more computers and which may retain data structures from one or many sources in a common or variety of formats) and the memory 114, and in some alternative systems, linked to external computers, databases, processors, and/or storage devices. The transmission of the detected, measured, and/or modeled data may pass through a wireless or wired communication medium. In some systems, the transmission of this data may occur automatically (e.g., pushed). In these systems, the data may be transmitted upon an event, a detection, measurement, and/or completion of the modeling. Alternatively, the data may be transmitted to the processing and/or storage device at periodic intervals. In other systems, the data may be transmitted in response to a request from a higher level device to transmit the data (e.g., pull technology).


Some or all of the detected, measured, and/or modeled data may be retained in the data warehouse 112 and/or memory 114 and may be combined and/or recombined by the processor 110 to generate subsidiary data representing attributes of the group of elevators and/or a building's traffic flows. In some systems, the combination and/or recombination of data may comprise the processor 110 applying one or more expressions to one or multiple elements of the received and/or retained data. The processing of the received and/or retained data may render data that represents the operation or movement of the elevator cars and/or passengers. Alternatively, the processor 110 may perform a statistical analysis of some or all of the received or retained data to generate probabilistic estimates/analysis of the operation or movement of the elevator cars and/or passengers throughout the building. In yet other systems, the data may be combined and/or recombined in other manners to generate the subsidiary data. Some or all of the data may be retained in one or more data structures in the data warehouse 112 and/or the memory 114 for future use or analysis.


Based on the data, and one or more customer selectable mode of operation parameters, the processor 110 may access one or more of the data structures to determine a mode of operation for the destination elevators 102. Target service quality parameters corresponding to the selected operation mode may be used to control the destination elevators 102. Through continuous or periodic monitoring of data and the programmed target service quality parameters, the processor 110 may determine if an operation mode of the destination elevators 102 should be changed. Alternatively, through the continuous or periodic monitoring of the data and the programmed target service quality parameters, the processor 110 may determine that an adjustment to an operational parameter of a destination elevator is necessary. In these situations, the system may modify one or more operational parameters of one or more of the destination elevators as required.


The databases that form the data warehouse 112 (e.g., Structured Query Language databases or SQL DBs, databases that comprise one or more flat files, such as 2-dimensional arrays, multi-dimensional arrays, etc. retained in a memory) may include data structures that contain fields together with a set of operations that facilitate searching, sorting, recombining, and other functions. While the data warehouse 112 may be distributed across remote locations, accessed by several computers, and contain information from multiple sources in a variety of formats, some data warehouses 112 may be local to the intelligent destination elevator control system 100 or controller. For longer term storage or data analysis, data may be retained in archival databases(s). Some systems include a backup that allows the data warehouse 112 to be restored to previous state. The system may restore the data warehouse 112 when a software or hardware error has rendered some or the entire data warehouse 112 unusable. When some errors occur to some or all of the databases, the backup data warehouse may automatically step in and assume the processes and functionality as a primary data warehouse 112.


The databases may comprise hierarchical databases that retain searchable indices within the database that reference distinct portions of the database and/or data locations within ancillary storage devices or remote databases. The databases and storage devices may be accessible through a database management system which may include data about how the databases are organized, how data within a database and/or across multiple databases are related, and/or how to maintain the databases. In some systems, the databases may comprise network databases that retain data with links to other records within a similar or different database. Data within a network database may be accessed without accessing some of the higher level information that corresponds to the accessed data. In yet other systems, the databases may comprise relational databases that retain data in a tabular format which may be accessed through searchable indices.


A roundtrip computer database may be part of the data warehouse 112. The roundtrip computer database may comprise data representing movement of an elevator car 102 from the time the elevator car 102 leaves a reference floor (e.g., the main floor) of a building until the time the elevator car 102 returns to the reference floor. In some systems, the roundtrip computer database may include the measured number of stops an elevator car makes during an UP trip, the number of passengers in an elevator car during an UP trip, the building level (e.g., floor) where an elevator reverses direction and starts traveling in a downward direction, the number of stops during a DOWN trip, and the number of passengers in an elevator car during a DOWN trip. In some systems, the number of passengers in an elevator car during an UP or DOWN trip may be measured by a sensor that senses a number of passengers in an elevator car (e.g., an elevator car load). Based on the load in the elevator car, the system may calculate the number or average number of persons in the elevator car. In other systems, an optical sensor may detect when passengers cross the threshold of the elevator car. In yet other systems, other sensors based on the interpretation of video, infrared data, and/or floor pressure patterns may be used to detect the number of passengers in the elevator car. An evaluation of this data may be used to determine how many passengers enter, leave, and are in the elevator car at any time.



FIG. 2 is an exemplary representation of data that may be accessed from the roundtrip computer database and used in establishing a roundtrip travel time-table for a destination elevator. In FIG. 2, a roundtrip data structure shows how the roundtrip time of a destination elevator may be affected by the number of UP or DOWN stops a destination elevator makes, and the number of passengers transported during a roundtrip.


The data structure of FIG. 2 illustrates exemplary data for a destination elevator that serves 13 upper floors (e.g., 13 floors above the main lobby) that are spaced approximately 4 meters apart, and where the destination elevator travels at a speed of approximately 2.5 m/s. The data may vary with a building's configuration, the elevator car's 102 design, and/or the reversal floor. As shown in FIG. 2, the value in the top left corner may represent the time for an empty destination elevator to travel non-stop from a reference floor (e.g., floor zero) to a reversal floor and return non-stop to the reference floor. In FIG. 2, the reversal floor is the top floor of the building (e.g., floor 13), and the time period for this roundtrip is about 57.6 seconds. When the reversal floor is on a floor lower than the top floor, the time for the empty non-stop roundtrip would replace the about 57.6 second time period shown in FIG. 2. Although the data structure of FIG. 2 only shows the affects of 12 additional stops and the transportation of up to 16 passengers, the data structure may be expanded to account for the maximums for each trip (e.g., stopping at each floor on an UP and DOWN trip and/or transporting a maximum number of passengers permitted in the elevator car at one time). While the data of FIG. 2 is shown in a table format, the system need not generate this table, and/or include all of the information shown in FIG. 2. In some systems, some, all, or more data may be accessed from the data warehouse and used by other elements or processes of the system to control a destination elevator.


During a roundtrip of a destination elevator, each additional stop and each additional passenger transported during the roundtrip increases the total roundtrip travel time of the elevator car. Sensors may detect, measure, and/or monitor the amount of time that the roundtrip time is increased for each additional stop and the amount of time for each additional passenger to enter or leave the destination elevator. On the basis of predicted traffic conditions and/or one or more customer selectable mode of operation parameters, data may be accessed from the roundtrip computer database and used to establish a roundtrip time-table for a destination elevator.


Through the combination and/or recombination of data retained in the roundtrip computer database, subsidiary data representing the movement of the elevator cars, their loads, destinations, and passengers may be determined. Recombination of this data may be used to determine an UP and/or DOWN distribution/transportation capacity of a group during a predetermined time period (e.g., a percentage of a buildings population that may be distributed/transported by a group of elevators during the predetermined time period). In some systems, the data retained in the roundtrip computer database may be used to calculate the time interval that passes between two elevator cars leaving an elevator lobby (e.g., departure interval), an average amount of time that a passenger has to wait before its assigned elevator car departs for its destination (e.g. AWT), and/or an average amount of time a passenger spends in an elevator traveling to its destination (e.g. ATTD).


Data representing each service call of an elevator may be stored in a service calls computer database retained within the data warehouse 112. The service data retained in the service calls computer database may comprise the time of a service call (e.g., a request for an elevator to transport a passenger to another level of a building), the floor from which the service call is placed, the requested destination, the assigned elevator car, and/or the number of repeat calls from the same floor to the same destination after the first call and before the assigned elevator car departs.


The traffic density patterns of each floor within a building as well as the entire building may be retained in a traffic density pattern computer database. The data within the traffic density pattern computer database may track over time how many persons enter or exit a specific floor. The building population may be determined by tracking the total number of persons entering or exiting all of the floors within the building.


The system may retain within a systems operation computer database data which may reflect whether the elevator control system 104 and/or subsystems are functioning correctly. In some systems, monitoring/sensing of the elevator cars and/or elevator control system 104 may provide data such as, the time the doors of an elevator car start to close, the time the elevator cars doors are fully closed, and/or the time the elevator car doors are locked. Other sensed system operation data may include the time the elevator car starts to accelerate, the maximum speed reached during each trip, the time the car reaches its maximum speed, and/or the time the elevator car starts deceleration. Yet other sensed system operation data may include the time the elevator car doors start to open, the time the elevator car floor is level with the destination floor, and/or the time the elevator car doors are fully open.


Programmed operational ranges, as set by building management or other personnel, for sensed system operation data may also be retained within the systems operation computer database. When the system determines, through a comparison or other evaluation techniques, that one or more of the sensed times are outside of the selected operational range, the system may provide a feedback signal and/or alert message through a tangible or physical link to a reporting system or maintenance personnel. The alert message may indicate a potential problem with the elevator system, and may identify the device that is out of its operational range. When it is determined that the elevator control system 104 and/or subsystems are operating outside of the permissible ranges, the intelligent destination elevator control system 100 may take corrective action. Corrective action may include automatically adjusting a configurable elevator systems operation parameter. Alternatively, correction action may include removing an elevator car from service and/or generating and/or transmitting a service request to maintenance personnel.


Additional computer databases may retain data received from external sources. Data from the external sources may be received through wired or wireless networks. In some systems, the wireless networks may include satellite systems, signals transmitted through cellular networks, or other wireless systems. The external data may include information regarding weather conditions, disruptions of public transportation systems, vehicular traffic conditions, roadway or highway construction notices, emergency notices, and/or power failures. One or more of these situations/conditions may affect the arrival or departure rate of persons within the building and therefore may affect the transportation density within a building and/or the use of the group of elevators 102.


A performance computer database may be retained in the data warehouse 112. The performance computer database may comprise one or more data structures of data collected from some or all of the other computer databases retained in the data warehouse 112. The performance data structures may identify destination elevator systems operation parameters and available target service quality parameters for a destination elevators for the one or more customer selectable mode of operation parameters. In some systems, a performance data structure may include simulated data for a “collective selective” elevator. This information may be used by a reporting system to provide a comparison data of the intelligent destination elevator system to a “collective selective” system. Although the computer databases within the data warehouse 112 have been described individually, in some systems, some or all of this data may be retained in one or more multidimensional databases.


A reporting module 116 may provide information regarding operation of the intelligent destination elevator control system 100 and/or the group of elevators 102. The reporting module may be in communication with the processor 110 and may receive input through a system input/output device 106. The reporting module 116 may provide information to tenants of a building, to building managers, security personnel, and/or others individuals/entities that have been configured to receive reporting data. Reporting data may be provide on a display screen or transmitted through a communication medium to the selected recipients. In some systems, reporting data may be provided through electronic mail, to a mobile telephone, to a pager, to a landline telephone, and/or other computers and/or storage devices.



FIG. 3 is an exemplary representation of performance data that may be accessed from a performance computer database and/or other computer databases retained in the data warehouse. The data shown in FIG. 3 may comprise elevator car and/or building population data that was detected, measured, and/or modeled and which may be used to disclose the modes of car operations based on one or more customer selectable mode of operation parameters. In some instances, the data may be the result of the combination or recombination of other detected, measured, and/or modeled data retained in one or more of the data warehouse's databases.


The data shown in FIG. 3 is an exemplary portion of a performance data structure comprising data that may be accessed from the data warehouse. The exemplary data of FIG. 3 is for a group of 4 destination elevators and discloses possible modes of operation for an anticipated UP distribution capacity for a 5 minute period (DC5) of 13.2%. As shown in FIG. 3, for this UP distribution capacity, 10 different modes of operation for controlling the group of destination elevators may be available. Based on one or more customer selectable mode of operation parameters, the intelligent destination elevator control system 100 may select the mode of operation for the destination elevators. In some systems, the one or more customer selectable mode of operation parameters may be any of the destination elevator service quality parameters. For instance, in some systems, a customer (e.g., a building manager, security personnel, user, and/or other personnel) may determine that a mode of operation should be selected using a maximum number of permitted destinations during an UP trip as a customer selectable mode of operation parameter. In other systems, a customer may determine that a mode of operation should be selected using the shortest average waiting time as a customer selectable mode of operation parameter. In yet other systems, a customer may determine that a mode of operation should be selected using an average waiting time that does not exceed a predetermined time period. In yet other systems, a customer may determine that a mode of operation should be selected using the shortest average time to a destination as a customer selectable mode of operation parameter. Identifying the mode of car operation enables the intelligent elevator system to determine target service quality parameters for each roundtrip of a destination elevator and for the group of destination elevators.


As shown in FIG. 3, if a customer selectable mode of operation parameter was an average car load of about 10 passengers, the system may establish a time-table for the next departing destination elevator car to have an average roundtrip time (Ave RTT) of about 108 seconds, an average waiting time (AWT) of about 23 seconds, and an elevator car departure interval (Dep INT) of about 27 seconds. Additionally, selecting this mode of operation would imply that the system would accept a maximum number of UP destinations for the next departing roundtrip to be about 5 or about 6. The performance data structure also identifies other target service quality parameters (e.g., the average travel time in a car (ATTC), an average travel time to a destination (ATTD), an average time for all of the elevator cars to serve all of the floors once (Cycle RTT), an average reversal floor level, and/or other target service quality parameters), building information (e.g., the number of floors in the building, the top floor in the building, distance between floors), and/or elevator information (e.g., a maximum speed of the elevator car, acceleration/deceleration rate, etc.).


Based on this selected mode of operation, the system may predict when this elevator car will return to the main lobby. When an additional stop is requested during the roundtrip of this elevator, or the expected return time to the main lobby is delayed (e.g. a passenger held the door open too long) or accelerated (e.g., more passengers exited the elevator car on a certain floor), the system may review the time-table and update the control of the elevator car or the mode of operation. For example, if on departure the car load exceeds 11 passengers, the system could determine that the actual traffic density is higher than the anticipated traffic density. In this instance, the system may alter the target quality service parameters for a next departing car (e.g., reduce the maximum number of destinations) which may reduce the RTT of the next departing car and increase the distribution of the arriving passengers into the building. In some systems, the system may try to alter target service quality parameters so as to equalize the roundtrip travel time (RTT) of all elevators in a group and maintain a consistent departure interval between the elevators.



FIG. 3 is only a portion of a performance data structure. This data structure shows 10 different modes of car operations for servicing a 12 floor building that satisfies one anticipated UP traveling distribution capacity. Each mode of car operation delivers the anticipated UP distribution capacity (e.g., a first customer selectable mode of operation parameter), but a mode of operation may be selected based on one or more other customer selectable mode of operation parameters which provide other improved service qualities and/or comfort levels to the passengers. Performance data structures may be created for other traffic conditions that disclose the modes of car operations based on any service quality parameter than may be detected, measured, or modeled. For instance, a performance data structure may be created that comprises similar information based on a different anticipated UP traveling distribution capacity (e.g., DC4, DC10). Alternatively, a performance data structure may be created that comprises information based on DOWN traveling traffic, such as an anticipated DOWN traffic density (e.g., TC4, TC5, TC10, etc.). In yet other alternatives, a performance data structure may include the information shown in FIG. 3 but that is expanded to also include service quality parameters based on DOWN traveling traffic (such as a number of allowed DOWN stops and/or passengers, adjustments to RTTs, AWTs, ATTDs, Cycle RTTs, and/or Departure Intervals based on anticipated DOWN stops) and/or other service quality parameters. Other performance data structures may be created, such as for emergency situations when traffic is heavy (e.g., evacuation of a building).



FIG. 4 is an exemplary method of using an intelligent destination elevator control system to control a group of destination elevators. At act 402 the process determines an anticipated UP and/or DOWN traffic density for a next predetermined time period. The predetermined time period may be a seasonal period, month, day, week, hour, minutes, or other predetermined period of time. Because the process monitors the use of the elevators and the number of passengers entering and exiting each elevator car throughout the day, the process has the ability to learn the population and traffic density patterns for any time period in the building or on an individual floor. This population and/or traffic density data may be retained within the intelligent destination elevator control system's data warehouse, such as in the traffic density pattern computer database or another computer database. In some processes, anticipated traffic densities may be determined for time periods of about 5 minutes, about 10 minutes, or other time periods.


At act 404, the process accesses data retained in the data warehouse to determine the possible modes of car operations that will satisfy the anticipated traffic density. At act 406, the process determines whether the anticipated traffic density exceeds a traffic density threshold. In some processes, the traffic density threshold may be based on an anticipated UP traffic density, an anticipated DOWN traffic density, or a combined anticipated UP and anticipated DOWN traffic density. The traffic density threshold may be a customer selectable mode of operation parameter. In some processes, this threshold may be selected so that when the threshold is not exceeded the group of destination elevators are operated according to a first come first server basis at act 408. When the threshold is exceeded, the group of destination elevators may be operated according to a direct trip process at act 410.


When the process operates in a first come first served process, passengers are assigned to an elevator car in an order of service call requests. From the available elevator car(s), the passengers are assigned to (elevator car)N—the elevator car that will depart next. Passengers will continue to be assigned to (elevator car)N until one or more customer selectable mode of operation parameters required to select a mode of operation are satisfied. In some processes, the other customer selectable mode of operation parameters may comprise a maximum number of stops during an UP and/or DOWN trip, a maximum number of passengers in an elevator car at one time, a passenger average waiting time, combinations of one or more of these parameters, or any other service quality parameter selectable by a building manager, authorized personnel, or elevator service provider. Once the one or more customer selectable mode of operation parameters are satisfied, (elevator car)N may depart and operate in accordance with the target service quality parameters that correspond to the selected mode of operation.


Passengers arriving after the one or more customer selectable mode of operation parameters for (elevator car)N have been satisfied are assigned to (elevator car)N+1. Passengers will continue to be assigned to this elevator car, which may use the same target service quality parameters as (elevator car)N, until the one or more customer selectable mode of operation parameters are satisfied for (elevator car)N+1. The assignment of passengers may continue using the elevator cars of the group of elevators in a circular manner.


Because the intelligent destination elevator control system collects data for all of the elevators and all of the floors of the building, the process may cause one elevator car (e.g., (elevator car)N) to deny a service call on its DOWN trip so that the elevator car may satisfy its target service quality parameters knowing that another elevator car (e.g., (elevator car)N+2) will be able to accept this denied service call and comply with its target service quality parameters. The continued or periodic monitoring of the attributes of the group of elevators allows the intelligent destination elevator control system to update the data retained in the data warehouse, learn new traffic trends for the building, and/or dynamically modify the control of the group of elevators if the elevator cars cannot satisfy the target service quality parameters. Various factors may contribute to an elevator car not satisfying the target service quality parameters. Some exemplary factors may be when a problem exists with the elevator car hardware, or when a passenger holds an elevator car on a floor longer than expected by the system.


Along with monitoring the movement of the individual destination elevator cars, the process may monitor the time and/or distances between the destination elevator cars. Based on the time and/or distance between destination elevators, the process may take corrective action to try and maintain a previously established time-table. For example, if a destination elevator car unexpectedly reaches full passenger capacity during a DOWN stop, and all of the passengers are traveling to the main lobby, the process may detect the full load and direct that this destination elevator car ignore any additional service calls and proceed non-stop to the main lobby. If during the non-stop trip to the main lobby this destination elevator car passes a second destination elevator car that was to arrive before the full car, the process detects that the cars have exchanged their relative position and may now delay the second car so as to maintain a time interval between the destination elevator cars. In some processes the speed of the second elevator may be slowed so as to delay this car's arrival in the main lobby. In other processes, the second car may stop at a floor to answer a service call that was previously assigned to the first car. Other circumstances may cause elevator cars to change relative positions, such as a destination elevator car that has a low reversal floor, a destination elevator car that is delayed by a passenger holding the doors open longer than an expected time period, a hardware and/or software problem, an/or other passenger influenced conditions. In some instances, an output through an elevator display or communication device unique to a passenger may display an approximate time/time period until a passenger's assigned car is to arrive. In the event that the assigned car does not arrive in the approximated time/time period, the passenger may re-request a service call.


When the process determines that the traffic density threshold has been exceeded at act 406, passengers are assigned to the elevator cars based on direct trip patterns at act 410. When the process controls the elevator cars in a direct trip pattern, each of the elevator cars are operated such that each may only service specific floors. The number of floors serviced by each elevator car identifies the pattern. When operated in a direct trip pattern, depending on a passenger's destination, a first arriving passenger may be assigned to an elevator car that will depart after later arriving passengers. For example, if a first elevator car's direct trip pattern services floors 1 (the first floor above the main lobby) to 5, and a second elevator car's direct trip pattern services floors 6 to 10, a first arriving passenger whose destination is floor 9 would be assigned to the second elevator car which would depart after the first elevator car to which a later arriving passenger whose destination is floor 3 may be assigned. A third passenger whose destination is floor 12 may be assigned to a third elevator car that services this floor.


Multiple direct trip patterns may exist to service the same total number of floors, and may depend on the number of elevator cars within the group of elevators. Where multiple direct trip patterns exist, process may select a direct trip pattern that satisfies one or more customer selectable mode of operation parameters.



FIG. 5 is an exemplary process of assigning passengers to an elevator according to a first come first served process by controlling the number of passengers in each destination elevator car. UP going passengers may have any floor above the main building lobby as their destination, therefore, the intelligent destination elevator control system may be configured for an anticipated UP traffic density (e.g., a first customer selectable mode of operation parameter) to control the number of floors stopped at during an UP trip (e.g., a second customer selectable mode of operation parameter). As shown in FIG. 4, the process has determined at act 402 an anticipated UP traffic density for an upcoming predetermined time period, such as the next about 5 minutes. Based on the anticipated traffic and past experience, the process may estimate the number of stops that are typically requested during the upcoming predetermined time period. The probable number of stops that an elevator car may make on an UP trip may depend on the number of floors within a building and the number of passengers in an elevator car. In some processes, the number of stops an elevator car makes on an UP trip may be monitored and the system may develop through a learning process of past trips a probable number of stops which may be retained in the data warehouse and/or in the comparative performance data structure. Alternatively, the probable number of stops may be determined based on one or more expressions. The results of the calculated probable number of stops may be retained in the data warehouse and may be part of the comparative performance data structure.


At act 502, the process selects from the possible modes of car operations a mode of car operation for the next departing car (e.g., elevator carN). The selected mode of car operation may be based on one or more customer selectable mode of operation parameter. Once the mode of operation for the next departing destination elevator car is selected, the time-table and target service quality parameters are known for this destination elevator.


At act 504 the process determines from the selected mode of car operation the number of destinations that may be assigned to the next departing car. At act 506, a time-table is created for the next roundtrip for the next departing car. The time-table may comprise a roundtrip travel time for the departing elevator car. Additionally, the process may assign the target service quality parameters that correspond to the selected mode of car operation. The target service quality parameters may comprise a time interval between two departing elevator cars, a minimum passenger average waiting time, a number of additional stops that may be accepted along the UP trip based on interfloor traffic, a number of stops for passengers traveling down to the main lobby, and/or a number of additional stops that may be accepted on the DOWN trip for interfloor traffic. The time-table times may be based on the data associated with the selected mode of car operation. At act 508, passengers and their destinations are assigned to the next elevator car. Passengers may be assigned to this next elevator car until the next passenger assigned would exceed the maximum number of passengers corresponding to the selected mode of car operation and until the departure time of the elevator car is reached. Once the limit of passengers or the departure time has been reached, additional passengers will be assigned to the next departing elevator car in the elevator group (e.g., (elevator car)N+1). At act 510, the time-table is adjusted if necessary. In some instances, the time-table may need to be adjusted where less than an expected number of destinations or passengers are assigned to the elevator car. The adjustment to the time-table may occur prior to the elevator car's departure.


At act 512, the process may monitor the group of elevator car's adherence to the time-table. The process may apply one or more performance rules while monitoring the destination elevators. In some first come first served processes, the performance rules may be stored in a volatile or non-volatile memory. In some first come first served processes, the performance rules may modify elevator service quality parameters to maintain roundtrip and/or interval times. In other methods, the performance rules may modify elevator service quality parameters to avoid average awaiting times that are less than an predetermined minimum waiting time. In yet other methods, the performance rules may accept or deny additional UP or DOWN stops and cause these additional service requests to be assigned to another elevator within the group. Assignment of these requests to another elevator car may prevent bunching of the elevator cars and assist with the maintenance of the elevator group's adherence to the established time-table. In yet other methods, a combination of these or other performance rules may be employed to control the group of elevators.


At act 514, passengers are assigned to (elevator car)N+1. These passengers may include passengers that were refused from (elevator car)N at act 508. When this is the case, the passengers that were refused from (elevator car)N will have priority of assignment for (elevator car)N+1. Passengers may continue to be assigned to (elevator car)N+1 the maximum number of passengers, based on the probable number of stops for (elevator car)N+1, are reached. The assignment of passengers may continue to the other elevator cars in the group in a circular manner such that acts 502-514 are followed for each additional elevator car in the group.



FIG. 6 is an exemplary process of controlling a group of destination elevators according to a direct trip pattern. At certain times (e.g., when traffic densities are heavy), elevator cars that serve all of the floors within a building may have many destinations causing many stops and long roundtrip travel times. At act 602 the process may select a direct trip pattern from the possible modes of car operations that will satisfy the anticipated traffic for a predetermined time period (act 402). A direct trip pattern may be a pattern where each elevator car of a group of elevators serves specific floors and omits service to all other floors. Often, there may be multiple direct elevator service patterns that may satisfy the anticipated traffic. In these instances, elevator performance rules stored in a volatile or non-volatile memory may be applied to determine an appropriate direct trip elevator service pattern. The application of the elevator performance rule may be based on a parameter. The customer selectable mode of operation parameter may comprise a roundtrip travel time, a departure interval time, a passenger waiting time, and/or other elevator service quality parameters that may be retained in the comparative performance data structure.


At act 604, a time-table is created for the next roundtrip for the next departing car. The time-table may comprise a roundtrip travel time for the departing elevator car. Additionally, the process may program the target service quality parameters that correspond to the selected mode of car operation. The target service quality parameters may comprise a time interval between two departing elevator cars, a minimum passenger average waiting time, and/or other service quality parameters.


At act 606, passengers may be assigned to an elevator car that will stop at the passenger's desired floor in accordance with the selected direct trip pattern. Depending on the selected direct trip pattern, a passenger may have to wait for one or more elevator cars from the elevator group to depart before the elevator car that will stop at the passenger's desired floor, in accordance with the selected direct trip pattern, departs.


At act 608 the time-table is adjusted if necessary. In some instances, the time-table may need to be adjusted where less than an expected number of destinations or passengers are assigned to the elevator car. The adjustment to the time-table may occur prior to the elevator car's departure.


At act 610, the process may monitor a destination elevator's adherence to the time-table. The process may apply one or more performance rules while monitoring the group of elevators. In some direct trip methods, the performance rules may be stored in a volatile or non-volatile memory. In some direct trip methods, the performance rules may modify elevator service quality parameters to maintain roundtrip and/or interval times. In other methods, the performance rules may modify elevator service quality parameters to avoid average awaiting times that are less than an established minimum waiting time. In yet other methods, the performance rules may accept or deny additional UP or DOWN stops at floors serviced according to the direct trip pattern. Denied service requests may be assigned to another elevator within the group, and the process may update the selected direct trip pattern for a next departing car. Assignment of these requests to another elevator car may assist with the maintenance of the elevator group's adherence to the established time-table. In yet other methods, a combination of performance rules may be employed to control the group of elevators.



FIG. 7 is an exemplary graphical representation of a direct trip pattern. Direct trip patterns may represent a specific mode of car operation, and the pattern demonstrates how a group of destination elevators may distribute their service qualities over a series of floors. In FIG. 7, the pattern demonstrates how a group of destination elevators may distribute their service qualities equally over 12 floors by making 12 consecutive trips to 5 floors each. The pattern shown in FIG. 7 may be considered a direct trip pattern because the floors served during consecutive trips of the group of destination elevators do not overlap. In FIG. 7, the floors which may be served by consecutively departing elevators car from the main lobby are shown. During a first trip, the first destination elevator car services floors 1 through 5. During a second trip, a second destination elevator car services floors 6 through 10. During a third trip, a third destination elevator car services floors 11 and 12 and floors 1 through 3. Adherence to the pattern may continue with passengers being assigned to destination elevator cars that will service the passengers' destination. During the 12 trips shown in FIG. 7, each floor is serviced 5 times. Although 12 trips are shown in FIG. 7, a group of elevators do not have to complete all trips of a direct trip pattern. When traffic conditions change, a next departing car may use a different direct trip pattern or other mode of car operation (e.g., a first come first served, etc.).


Multiple direct trip patterns may be created based on the number of floors in a building that are served by a group of destination elevators. Each different pattern may provide slightly different time-tables and target service quality parameters, and the pattern used may be selected in accordance with a customer selectable mode of operation parameter. In some systems, direct trip patterns may be used to control the elevator cars of a group of destination elevators when a customer selectable traffic density threshold is exceeded. In other systems, direct trip patterns may be used to control the elevator cars of a group of destination elevators during emergency situations, such as the evacuation of one or more floors of a building.



FIG. 8 is an alternate intelligent destination elevator control system 800. In FIG. 8, a lobby network 802 may communicate with the intelligent destination elevator control system processor 110. The lobby network 802 may include a controller 804 which may be part of a local area network or a wide area network. The lobby network 802 may receive data from and/or transmit data to a personalized passenger device 810 through receiver 806 and/or transmitter 808. In some systems, the personalized passenger device 810 may comprise a handheld device that combines computing, telephone, facsimile, electronic mail, appointment scheduling, and/or networking features. In other systems, the personalized passenger device 810 may comprise a device for transmitting and/or receiving alpha-numeric message.


As shown in FIG. 8, communication between the lobby network 802 and the personalized passenger device 808 may be through a wireless communication medium. In some systems, the wireless communication mediums may be radio frequency signals, but other wireless communication mediums may be used as well. In other systems, the personalized passenger device 808 may be inserted into an interface/docking station and communication with the lobby network 802 may be through a wired communication medium. For security purposes, communications exchanged between the lobby network 802 and the personalized passenger device 808 and/or the lobby network 802 and the intelligent destination elevator control system 100 may be encrypted. In some systems, a lobby network 802 may be present on each floor of a building. In other systems, a lobby network receiver, transmitter, and/or docking interface may be present on each floor of a building while other components of the lobby network may be remotely located.


In some systems, when the personalized passenger device 808 is in proximity to the receiver 804 and/or transmitter 806 of the lobby network 802 (or when docked with the lobby network interface) data may be exchanged to register the passenger's arrival in the lobby. Registration of a passenger may include verifying that the passenger is an authorized person within the building. Verification may include accessing a database 812 that comprises individual's names, companies, destinations which the individual may access, time periods during which the individual may access specific destinations, an individual's “home” floor, and/or a time of arrival and/or departure. Visitors to the building may be required to receive a personalized passenger device 808 from a security or reception desk which may be programmed to define when and to which floors the visitor may travel. In situations where a passenger leaves an elevator car on an unauthorized floor, the lobby network 802 may identify this unauthorized access and generate a feedback message. The feedback message may be an audio, visual, and/or tactile message that may be received at the personalized passenger device 808 and/or at a reporting module that is part of the intelligent destination elevator control system 100. If the individual on the unauthorized floor does not respond to the feedback message and/or correct the unauthorized access within a predetermined time period, the system may transmit a security warning to security, building management, and/or other authorized personnel to indicate the unauthorized access.


In some systems, upon registration, the system may automatically determine a destination for an individual and assign the individual to a specific elevator car. Some systems may determine an individual's destination based on a time of day, week, month, and/or season. In other systems, upon registration an individual may manually enter a desired destination through its personalized passenger device 808. In response to the entry of the individual's desired destination, the system may assign the individual to a specific elevator car or may change a passenger's desired destination.


The methods and descriptions of FIGS. 4-6 may be programmed in one or more servers, distributed between one or more servers or may be encoded in a signal-bearing storage medium or a computer-readable medium. A signal-bearing medium or a computer-readable medium may comprise a memory that is unitary or separate from a device, programmed within a device, such as one or more integrated circuits, or retained in memory and/or processed by a controller or a computer. If the methods are performed by software, the software or logic may reside in a memory resident to or interfaced to one or more processors or controllers that may support a tangible communication interface, wireless communication interface, or a wireless system. The memory may include an ordered listing of executable instructions for implementing logical functions. A logical function may be implemented through digital circuitry, through source code, or through analog circuitry. The software may be embodied in any computer-readable medium or signal-bearing medium, for use by, or in connection with, an instruction executable system, apparatus, and device that controls a group of destination elevators. Such a system may include a computer-based system, a processor-containing system, or another system that includes an input and/or output interface that may communication with a publicly distributed network through a wireless or tangible communication bus though a public and/or proprietary protocol.


A “computer-readable storage medium,” “machine-readable medium,” “propagated-signal medium,” and/or “signal-bearing medium” may comprise any medium that contains, stores, communicates, propagates, or transports software for use by or in connection with an instruction executable system, apparatus, or device. The machine-readable medium may selectively be, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. A non-exhaustive list of examples of machine-readable medium includes: an electrical connection having one or more wires, a portable magnetic or optical disk, a volatile memory, such as a Random Access memory (RAM), a Read-Only Memory (ROM), an Erasable programmable Read-Only Memory (EPROM or Flash memory), or an optical fiber. A machine-readable medium may also include a tangible medium upon which software is printed, as the software may be electronically stored as an image or in another format (e.g., through an optical scan), then compiled, and/or interpreted or otherwise processed. The processed medium may then be stored in a computer and/or machine memory.


While various embodiments of the invention have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the invention. Accordingly, the invention is not to be restricted except in light of the attached claims and their equivalents.

Claims
  • 1. A computer implemented method that facilitates operation of a group of destination elevators, comprising: retaining a data structure, in a data warehouse, that represents modes of operations of a group of destination elevators that satisfy predetermined traffic conditions, the modes of operations comprising timing parameters for operating the group of destination elevators;identifying a subset of modes of operations from the data warehouse based on a first selected operation parameter;selecting a mode of operation from the subset of modes of operations that satisfies a second selected operation parameter;programming a processor with a timing parameter based on the selected mode of operation, the processor driving an elevator control system that operates the group of destination elevators; andassigning passengers to one of an elevator in the group of destination elevators until a maximum number of destinations provided by the selected mode of operation is reached.
  • 2. The method of claim 1, further comprising assigning passengers to the elevator in the group of destination elevators until a maximum number of additional stops on a downward trip is reached, the maximum number being defined by the selected mode of operation.
  • 3. The method of claim 2, further comprising monitoring a period of time that a first elevator in the group of destination elevators is at a destination floor.
  • 4. The method of claim 3, further comprising adjusting the mode of operation for a second elevator in the group of destination elevators when the first elevator in the group of destination elevators remains at the destination floor beyond a predetermined stopping threshold time period, and programming the processor with the mode of operation for the second elevator.
  • 5. The method of claim 1, where the timing parameter based on the selected mode of operation is a round trip travel time for a next departing elevator in the group of destination elevators.
  • 6. The method of claim 5, further comprising monitoring the round trip travel time for the next departing elevator in the group of destination elevators.
  • 7. The method of claim 6, further comprising dynamically adjusting the data structure with an updated round trip travel time of the one of the elevator in the group of destination elevators.
  • 8. The method of claim 1, further comprising selecting a second mode of operation for a next departing elevator in the group of destination elevators when a transport capacity parameter of the one of the elevator will not satisfy anticipated transportation demand, and programming the processor with the second mode of operation for the next departing elevator.
  • 9. The method of claim 8, where the second mode of operation comprises a direct trip pattern to one or more selected destinations.
  • 10. The method of claim 1, further comprising dynamically adjusting the data structure with updated timing parameters for the one of the elevators in group of destination elevators based on the operation of the one of the elevator in the group of destination elevators.
PRIORITY CLAIM

This application claims the benefit of priority from U.S. Provisional Application No. 60/957,032, filed Aug. 21, 2007, which is incorporated by reference.

US Referenced Citations (247)
Number Name Date Kind
3561571 Gingrich Feb 1971 A
3589472 Hallene et al. Jun 1971 A
3625311 Nowak et al. Dec 1971 A
3682275 Loshbough et al. Aug 1972 A
3740709 Savino Jun 1973 A
3807531 Mandel Apr 1974 A
3828892 Winkler et al. Aug 1974 A
3841443 Booker, Jr. Oct 1974 A
3851735 Winkler et al. Dec 1974 A
3895692 Yeasting Jul 1975 A
3898611 Mandel Aug 1975 A
3902571 Iwasaka et al. Sep 1975 A
4037688 Winkler et al. Jul 1977 A
4043429 Hirasawa et al. Aug 1977 A
RE29543 Glaser Feb 1978 E
4124102 Doane et al. Nov 1978 A
4128143 Petterson et al. Dec 1978 A
4162719 Husson et al. Jul 1979 A
4245670 Bauer et al. Jan 1981 A
4263989 Zeindler et al. Apr 1981 A
4266632 Yoneda et al. May 1981 A
4298100 Suss et al. Nov 1981 A
4305479 Bittar et al. Dec 1981 A
4323142 Bittar Apr 1982 A
4341288 Bass Jul 1982 A
4349087 Bittar et al. Sep 1982 A
4350226 Sheehy et al. Sep 1982 A
4352410 Bittar et al. Oct 1982 A
4352411 Nowak et al. Oct 1982 A
4352412 Bittar et al. Oct 1982 A
4355705 Schröder et al. Oct 1982 A
4363381 Bittar Dec 1982 A
4379499 Nowak Apr 1983 A
4397377 Husson et al. Aug 1983 A
4401190 Bittar Aug 1983 A
4411337 Schroder et al. Oct 1983 A
4431085 MacDonald Feb 1984 A
4431086 Moser et al. Feb 1984 A
4434873 Ohta et al. Mar 1984 A
4448286 Kuzunuki et al. May 1984 A
4458787 Uetani Jul 1984 A
4463834 Polis et al. Aug 1984 A
4473134 Uetani Sep 1984 A
4492288 Schröder Jan 1985 A
4499973 De Lorenzi et al. Feb 1985 A
4511017 MacDonald Apr 1985 A
4531616 Uetani et al. Jul 1985 A
4568909 Whynacht Feb 1986 A
4582173 Schröder Apr 1986 A
4655325 Schröder et al. Apr 1987 A
4669579 Ookubo Jun 1987 A
4672531 Uetani Jun 1987 A
4685536 Ichioka Aug 1987 A
4691808 Nowak et al. Sep 1987 A
4709788 Harada Dec 1987 A
4711324 Schröder Dec 1987 A
4718520 Schröder Jan 1988 A
4719996 Tsuji Jan 1988 A
4724931 Ichioka Feb 1988 A
4735294 Schröder Apr 1988 A
4760896 Yamaguchi Aug 1988 A
4787481 Farrar et al. Nov 1988 A
4836336 Schröder Jun 1989 A
4838385 Ekholm Jun 1989 A
4844204 Ovaska et al. Jul 1989 A
4860207 Kubo Aug 1989 A
4869348 Schröder Sep 1989 A
4878562 Schröder Nov 1989 A
4895223 Ekholm et al. Jan 1990 A
4901822 Tsuji Feb 1990 A
4915197 Schröder Apr 1990 A
4926976 Schröder May 1990 A
4930603 Brenner Jun 1990 A
4939634 Schroder Jul 1990 A
4947965 Kuzunuki et al. Aug 1990 A
4958707 Yoneda et al. Sep 1990 A
4972926 Tsuji et al. Nov 1990 A
4979594 Begle et al. Dec 1990 A
4982817 Tsuji Jan 1991 A
4989694 Ueshima et al. Feb 1991 A
4989695 Kubo Feb 1991 A
4991694 Friedli Feb 1991 A
4993518 van Straaten et al. Feb 1991 A
5010472 Yoneda et al. Apr 1991 A
5020642 Tsuji Jun 1991 A
5031728 Amano Jul 1991 A
5042620 Yoneda et al. Aug 1991 A
5054585 Amano Oct 1991 A
5056628 Aime Oct 1991 A
5058711 Tsuji Oct 1991 A
5065846 Schroder Nov 1991 A
5086883 Schroder Feb 1992 A
5092431 Schroder Mar 1992 A
5142107 Yasuhiro Aug 1992 A
5168135 Kubo et al. Dec 1992 A
5183981 Thangavelu Feb 1993 A
5192836 Schroder Mar 1993 A
5202540 Auer et al. Apr 1993 A
5229559 Siikonen et al. Jul 1993 A
5235143 Bahjat et al. Aug 1993 A
5239141 Tobita et al. Aug 1993 A
5239142 Ekholm et al. Aug 1993 A
5250766 Hikita et al. Oct 1993 A
5252789 Sirag, Jr. et al. Oct 1993 A
5252790 Aime Oct 1993 A
5257176 Uetani Oct 1993 A
5258586 Suzuki et al. Nov 1993 A
5272287 Meguerdichian et al. Dec 1993 A
5272288 Kameli Dec 1993 A
5283399 Fujino et al. Feb 1994 A
5285028 Umeda et al. Feb 1994 A
5298696 Okataku et al. Mar 1994 A
5300739 Bittar Apr 1994 A
5306878 Kubo Apr 1994 A
5307903 Morita et al. May 1994 A
5317114 Pullela et al. May 1994 A
5331121 Tsuji Jul 1994 A
5334807 Kubo et al. Aug 1994 A
5354957 Robertson Oct 1994 A
5360952 Brajczewski et al. Nov 1994 A
5383535 Ando Jan 1995 A
5409085 Fujino et al. Apr 1995 A
5459665 Hikita et al. Oct 1995 A
5480005 Bittar Jan 1996 A
5480006 Kameli et al. Jan 1996 A
5503249 Virtamo et al. Apr 1996 A
5612519 Chenais Mar 1997 A
5616894 Nieminen et al. Apr 1997 A
5616896 Kontturi et al. Apr 1997 A
5663538 Sakita Sep 1997 A
5679932 Kim Oct 1997 A
5689094 Friedli et al. Nov 1997 A
5714725 Thangavelu Feb 1998 A
5750946 Thangavelu May 1998 A
5767460 Thangavelu Jun 1998 A
5767461 Nakagawa et al. Jun 1998 A
5767462 Thangavelu Jun 1998 A
5780789 Tsuji Jul 1998 A
5785153 Powell et al. Jul 1998 A
5786550 Thangavelu Jul 1998 A
5786551 Thangavelu Jul 1998 A
5789715 Kakko et al. Aug 1998 A
5808247 Thangavelu Sep 1998 A
5841084 Thangavelu Nov 1998 A
5848669 Park Dec 1998 A
5865274 Kiji et al. Feb 1999 A
5884729 Park et al. Mar 1999 A
5892190 Morita et al. Apr 1999 A
5907137 Tyni et al. May 1999 A
5932852 Tyni et al. Aug 1999 A
5955708 Amano et al. Sep 1999 A
6003637 Kim et al. Dec 1999 A
6065570 Friedli et al. May 2000 A
6145631 Hikita et al. Nov 2000 A
6176351 Ikeda et al. Jan 2001 B1
6237721 Siikonen May 2001 B1
6273217 Hikita Aug 2001 B1
6315082 Hikita Nov 2001 B2
6321877 Yamakawa Nov 2001 B2
6325178 Hikita et al. Dec 2001 B2
6328134 Hikita Dec 2001 B1
6330935 Systermans Dec 2001 B1
6345697 Siikonen Feb 2002 B1
6378662 Yamada Apr 2002 B1
6394232 Iwata et al. May 2002 B1
6401874 Siikonen Jun 2002 B2
6419051 Mori et al. Jul 2002 B2
6446761 Motoyama et al. Sep 2002 B1
6467583 Koura et al. Oct 2002 B1
6533075 Masuda Mar 2003 B2
6553269 Hikita Apr 2003 B1
6601678 Kostka et al. Aug 2003 B2
6619436 Hikita Sep 2003 B1
6619437 Hikita Sep 2003 B2
6644442 Ylinen et al. Nov 2003 B1
6655501 Kostka Dec 2003 B2
6708801 Nakai Mar 2004 B2
6735556 Copel May 2004 B2
6786306 Tiner Sep 2004 B2
6793044 Koehler et al. Sep 2004 B2
6896105 Yamakawa May 2005 B1
6902041 Eccleston Jun 2005 B2
6905003 Hirade Jun 2005 B2
6913117 Tyni et al. Jul 2005 B2
6945365 Matela Sep 2005 B2
6978863 Hikita Dec 2005 B2
6988071 Gazdzinski Jan 2006 B1
6991068 Siikonen et al. Jan 2006 B2
6998995 Nakajima Feb 2006 B2
7021428 Han et al. Apr 2006 B2
7021429 Hikita Apr 2006 B2
7032716 Meyle et al. Apr 2006 B2
7036635 Rintala et al. May 2006 B2
7083027 Siikonen et al. Aug 2006 B2
7093693 Gazdzinski Aug 2006 B1
7117980 Wyss et al. Oct 2006 B2
7128190 Kostka et al. Oct 2006 B2
7134530 Motoyama et al. Nov 2006 B2
20010000395 Hikita et al. Apr 2001 A1
20010002635 Yamakawa Jun 2001 A1
20010002636 Siikonen Jun 2001 A1
20010010278 Hikita Aug 2001 A1
20010032756 Mori et al. Oct 2001 A1
20010035314 Yoshida et al. Nov 2001 A1
20020023802 Ayano et al. Feb 2002 A1
20020036122 Fayette et al. Mar 2002 A1
20020112923 Nakai Aug 2002 A1
20030000776 Kostka Jan 2003 A1
20030006100 Masuda Jan 2003 A1
20030051947 Friedli Mar 2003 A1
20030070883 Foster et al. Apr 2003 A1
20030085079 Koehler et al. May 2003 A1
20030098208 Hikita May 2003 A1
20030164267 Hikita Sep 2003 A1
20040000453 Eccleston Jan 2004 A1
20040129502 Hikita Jul 2004 A1
20040154872 Hirade Aug 2004 A1
20040163895 Kostka et al. Aug 2004 A1
20040240627 Nakajima Dec 2004 A1
20040262092 Wyss et al. Dec 2004 A1
20050029054 Matela Feb 2005 A1
20050077116 Urata Apr 2005 A1
20050098391 Rintala et al. May 2005 A1
20050109562 Siikonen et al. May 2005 A1
20050126863 Hikita Jun 2005 A1
20050155821 Marterer Jul 2005 A1
20050189181 Meyle et al. Sep 2005 A1
20050217946 Siikonen et al. Oct 2005 A1
20050269164 Tyni et al. Dec 2005 A1
20050279584 Reuter et al. Dec 2005 A1
20060032711 Marchesi Feb 2006 A1
20060042884 Abe et al. Mar 2006 A1
20060065491 Zaharia et al. Mar 2006 A1
20060157305 DePlazes et al. Jul 2006 A1
20060175146 Hikita Aug 2006 A1
20060180406 Gremaud et al. Aug 2006 A1
20060213727 Hikita Sep 2006 A1
20060213728 Yoshikawa et al. Sep 2006 A1
20060242200 Horowitz et al. Oct 2006 A1
20060243536 Tyni et al. Nov 2006 A1
20060249335 Yoshikawa et al. Nov 2006 A1
20060271589 Horowitz et al. Nov 2006 A1
20060271623 Horowitz et al. Nov 2006 A1
20060289243 Hikita et al. Dec 2006 A1
20070017753 Ylinen et al. Jan 2007 A1
20070039785 Smith et al. Feb 2007 A1
20070080027 De Jong et al. Apr 2007 A1
Foreign Referenced Citations (3)
Number Date Country
2 276 470 Sep 1994 GB
WO 2004031062 Apr 2004 WO
WO 2007147927 Dec 2007 WO
Related Publications (1)
Number Date Country
20090050417 A1 Feb 2009 US
Provisional Applications (1)
Number Date Country
60957032 Aug 2007 US