Patent classifications
B66B2201/233
REASSIGNMENT BASED ON PIGGYBACKING
A method of operating an elevator call control system including: receiving an first elevator call from a first individual carrying a first mobile device, the first elevator call including a destination request to travel from a first boarding floor to a destination floor; assigning a first elevator car to the first elevator call; detecting a location of the first mobile device; detecting a location of a second mobile device; and determining that a second individual carrying the second mobile device intends to board the first elevator car with the first individual carrying the first mobile device in response to determining the location of the first mobile device and the location of the second mobile device.
SYSTEM AND METHOD FOR PRIORITIZING SERVICE TO REMOTE ELEVATOR CALLS BASED ON PROXIMITY TO ELEVATOR LOBBY
Disclosed is an elevator system for a building including an elevator and an elevator controller for communicating with a plurality of smart devices for passengers disposed on building levels, the controller rendering determinations including: a first determination that the controller receives from the smart devices requests for elevator service, a second determination to effect monitoring of smart devices relative to area limits on the levels, the area limits including the lobbies, a third determination to identify a first group of the smart devices that are within the area limits, a fourth determination to identify a first schedule that prioritizes elevator service within the first group based on a time of placement of elevator service requests, a fifth determination to instruct the elevator to provide elevator service following the first schedule, and wherein the controller effects a first communication in which the controller instructs the elevator to effect the fifth determination.
Elevator control system overlay system
A method includes recording a primary destination dispatch request from a primary passenger at a first floor position via a destination dispatch controller 115, identifying a terminal floor, providing a terminal floor call signal to the elevator control system via an overlay controller 110, moving an assigned elevator car in a travel direction of the terminal floor, recording at least one secondary destination dispatch request from a secondary passenger at a respective at least one secondary floor position via the destination dispatch controller, approximating a position of the assigned elevator car, determining a target floor position via the destination dispatch controller, entering a target floor call corresponding to the target floor position at a calculated time to stop the assigned elevator car at the target floor position, cancelling all pending calls via the elevator control system 102, and entering at least one recorded destination dispatch request to the elevator control system.
SUPER GROUP ARCHITECTURE WITH ADVANCED BUILDING WIDE DISPATCHING LOGIC
A method of operating a building elevator system having a plurality of elevator systems organized into multiple elevator groups including: receiving an elevator call from a destination entry device in communication with the building elevator system; obtaining a favorability score from each of the multiple elevator groups of the building elevator system; determining an elevator group of the multiple elevator groups with the highest favorability score; and routing the elevator call to the elevator group of the multiple elevator groups with the highest favorability score.
ELEVATOR MOVEMENT PLAN GENERATION
One embodiment provides a method for optimizing schedules of a plurality of elevators in a building having a plurality of floors, including: receiving, from a user, an indication requesting that an elevator from the plurality of elevators stop at a particular floor, wherein each of the plurality of elevators has a schedule comprising floors where the elevator will stop; identifying the number of users in the elevator waiting area of each of the particular floors where an indication requesting a stop has been received; and updating, in view of the identified number of users at each of the particular floors, the schedule for the plurality of elevators to optimize the stops for the plurality of elevators, wherein the updating comprises dynamically routing the plurality of elevators upon (i) receipt of indications and (ii) identification of the number of users at each of the particular floors.
ELEVATOR CONTROL
According to an example embodiment, an apparatus for scheduling elevator transport in an elevator system comprising one or more elevators is provided. The apparatus may be configured to: obtain, for a plurality of passengers, a respective transport request for elevator transport using said one or more elevators, the transport request comprising at least respective indications of an origin floor, a destination floor and a requested transport time window; derive, in dependence of said plurality of transport requests, a transport schedule that includes a respective transport allocation for each of said plurality of passengers, wherein a transport allocation for a passenger is derived in accordance with the requested transport time window indicated for the respective passenger, in view of transport allocations derived for other passengers and in view of a transport capacity of said one or more elevators and wherein the transport allocation for a passenger comprises at least a scheduled transport time for the respective passenger; and operate said one or more elevators in accordance with the derived transport schedule.
Routing optimization in a multi-deck elevator
A method for a passenger-allocation in a multi-deck elevator group where the decks of the elevator cars are stacked above each other and being mounted in a car frame to be moved synchronously in an elevator shaft utilizes an improved allocation strategy. The method is performed by a control unit to dispatch the elevator cars for serving any passenger call which can be entered as a landing call or a car call, wherein a call creates plural allocation proposals calculated by an optimization algorithm carried out by the control unit for dispatching an elevator to a passenger call. The allocation proposals are then processed in a routing algorithm defining one serving deck to be taken for the allocation of a specific call, which routing algorithm is restarted for any further incoming call independent of whether a further incoming call is creating new elevator allocation proposal(s) or when a reallocation timeout has passed. A computer program carrying out the method is further disclosed.
Allocating destination calls using genetic algorithm employing chromosomes
A method of assigning destination call in an elevator group forms chromosomes including genes where each gene is a correlation of a call and an elevator trip, the possible round trips are calculated, each round trip is evaluated for optimization procedure. The calls are assigned to the elevators by the destination call control based on the best chromosome determined.
Variable elevator assignment
A system 110 includes an input/output 113 unit for receiving a user request to call an elevator 101, 102 and a processor 111 for processing the user request to assign an elevator to the user 105. The processor performs one of a first assignment process and a second assignment process. The first assignment process includes determining whether a delay condition exists for delaying assignment of the elevator to the user 202, delaying assignment of the elevator to the user based on determining that the delay condition exists 203, and assigning the elevator to the user based on determining that the delay condition does not exist 204. The second assignment process includes assigning the elevator to the user and notifying the user of the assignment, determining whether an assignment change condition exists 206, changing the assignment to another elevator based on determining that the assignment change condition exists 207, and notifying the user of the assignment change 208.
SYSTEMS AND METHODS FOR DISPATCHING ELEVATORS
A method for reassigning a first elevator car of a plurality of elevator cars that includes dispatching the first elevator car from a current location to a first destination location to pick up an occupant at the first destination location. The method includes determining the first elevator car stopped at an intermediate location positioned between the current location and the first destination location. The method further includes determining a number of occupants within the first elevator car is greater than at least a second elevator car of a plurality of elevator cars after the first elevator car stopped at the intermediate location, and directing the first elevator car to a second destination location different from the first destination location.