Method and system for scheduling elevator cars in a group elevator system with uncertain information about arrivals of future passengers

Patent metadata

Field	Value
Publication number	US-9834405-B2
Application number	US-201414536806-A
Country	US
Kind code	B2
Filing date	Nov 10, 2014
Priority date	Nov 10, 2014
Publication date	Dec 5, 2017
Grant date	Dec 5, 2017

Abstract

A method schedules elevator cars in a group elevator system in a building by first generating a set of probability distributions for arrivals of future passengers at any floor of the building, wherein the set of probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of service requests by the future passengers and a probability of possible times of the service requests. A schedule for the elevator cars is based on the set of probabilistic distribution. Then, the schedule is provided to a controller of the group elevator system to move the elevator cars according to the schedule.

First claim

I claim:

1. A method for scheduling elevator cars in a group elevator system in a building, wherein a decision of which an elevator car serves a newly arrived passenger in time is made at a time of arrival of the newly arrived passenger, and not at a later time, comprising steps of:
registering a request for service by the newly arrived passenger by a signal at an elevator landing;
accessing data from a memory, wherein the data includes arrival information of future passengers, wherein the processor is in communication with the memory, and the processor is configured for:
generating a set of probability distributions for arrivals of future passengers at any floor of the building, wherein the set of probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of a number of service requests by the future passengers and a probability of a possible number of times of the service requests;
determining a schedule for the elevator cars based on the set of probabilistic distribution using the arrival information by generating multiple continuation sets from some probabilistic variables of the probabilistic variables for arrivals of future passengers, and determining an optimal elevator car assignment for the newly arrived passenger that registered the request for service, by averaging an average waiting time (AWT) of all newly arrived passengers over all continuation sets, after finding assignments for all future passengers in the continuation sets of the multiple continuation sets; and
providing the schedule to a controller of the group elevator system to move the elevator cars according to the schedule, wherein the processor is in communication with the controller.

2. The method of claim 1 , wherein the probabilistic variables are determined using a statistical distribution including a Gauss-Bernoulli distribution or a Poisson distribution or an another distribution, that is based on historical passenger arrival information.

3. The method of claim 1 , wherein the arrival information is based on arrival history information acquired by sensors, such that the arrival history information includes arrival statistics stored in a table in the memory.

4. The method of claim 1 , wherein the scheduling is performed in real time.

5. The method of claim 1 , wherein the arrival information is based on arrival history information acquired by sensors in the building, such that the sensors include motion detectors.

6. The method of claim 5 , further comprising:
correlating sensed data with actual service requests via registered requests for service by the newly arrived passengers, such that the sensed data includes a sensed presence of potential passengers in other locations of the building.

7. The method of claim 1 , wherein the scheduling minimizes an average waiting time.

8. The method of claim 1 , wherein schedule includes passengers that have made requests for service.

9. The method of claim 1 , wherein the probability distributions for arrival times of the future passengers are characterized by Gauss-Bernoulli variables.

10. The method of claim 1 , wherein the probability distributions for arrival rates of the future passengers are characterized by Poisson variables.

11. The method of claim 1 , further comprising:
sampling the arrival information to generate multiple continuation sets, wherein each continuation set includes information about assigned waiting passengers, a current requesting passenger, and future passengers, and wherein arrival of future passenger arrivals are sampled from the set of probability distributions.

12. The method of claim 11 , wherein a length of the continuation sets vary from minutes to hours, and further comprising:
determining an optimal cumulative waiting time for all continuation sets, over all possible assignments of the passengers represented in the multiple continuation sets.

13. The method of claim 11 , wherein the current requesting passenger and the future passengers are all scheduled in an immediate assignment mode.

14. The method of claim 11 , wherein the current requesting passenger is scheduled in an immediate assignment mode, and the future passengers are scheduled in a reassignment mode.

15. The method of claim 11 , wherein the current requesting passenger and the future passengers are all scheduled in a reassignment mode.

16. A system for scheduling elevator cars in a group elevator system in a building, wherein a decision of which an elevator car serves a newly arrived passenger in time is made at a time of arrival of the newly arrived passenger, and not at a later time, comprising:
a memory having stored data including arrival information of future passengers;
a processor in communication with the memory, is configured to:
register a request for service by the newly arrived passenger by a signal at an elevator landing;
generate probability distributions for arrivals of future passengers at any floor of the building, wherein the probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of a number of service requests by the future passengers and a probability of a possible number of times of the service requests;
determine a schedule for the elevator cars based on the probabilistic distributions using the arrival information by generating multiple continuation sets from some probabilistic variables of the probabilistic variables for arrivals of future passengers, and determining an optimal elevator car assignment for the newly arrived passenger that registered the request for service, by averaging an average waiting time (AWT) of all newly arrived passengers over all continuation sets, after finding assignments for all future passengers in the continuation sets of the multiple continuation sets; and

a controller of the group elevator system to move the elevator cars according to the schedule.

17. A method for scheduling elevator cars in a group elevator system in a building, wherein a decision of which an elevator car serves a newly arrived passenger in time is made at a time of arrival of the newly arrived passenger, and not at a later time, comprising:
registering a request for service by the newly arrived passenger by a signal at an elevator landing;
accessing data from a memory, wherein the data includes arrival information of future passengers, wherein the processor in communication with the memory, is configured for:
generating a set of probability distributions for arrivals of future passengers at any floor of the building, wherein the set of probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of a number of service requests by the future passengers and a probability of a possible number of times of the service requests;
determining a schedule for the elevator cars based on the set of probabilistic distribution using the arrival information by generating multiple continuation sets from some probabilistic variables of the probabilistic variables for arrivals of future passengers;
determining an optimal elevator car assignment for the newly arrived passenger that registered the request for service; and
providing the schedule to a controller of the group elevator system to move the elevator cars according to the schedule, wherein the processor is in

Assignees

• Mitsubishi Electric Res Laboratories Inc

Inventors

• Nikovski Daniel Nikolaev

Classifications

• B66B2201/234

  Taking into account uncertainty terms for predicted values, e.g. the predicted arrival time of an elevator car at the floor where a call is made · CPC title

• B66B2201/102

  Up or down call input · CPC title

• B66B2201/402

  by historical, statistical or predicted traffic data, e.g. by learning · CPC title

• B66B1/2458 Primary

  For elevator systems with multiple shafts and a single car per shaft · CPC title

• B66B2201/211

  Waiting time, i.e. response time · CPC title