Elevator Car Assignment by Passenger Count and Capacity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Elevator systems often assign crowded cars to passengers and result in multiple unnecessary stops, failing to provide optimal service by not considering available passenger capacity and intended destinations effectively.

Innovation Solution

A method and system that detect the number of waiting passengers and available capacity in elevator cars using cameras, prioritize empty cars, and ensure cars only stop at intended destinations until all passengers exit, minimizing stops and crowding.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If traditional dispatching algorithms are used to assign elevator cars, then the system operates with simple control logic, but passengers experience crowded cars and multiple unnecessary stops

Engineering Contradiction:
Improvepassenger service qualityVSAvoidcontrol system complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The system performs preliminary detection of passenger waiting numbers and intended destinations before elevator car assignment. By gathering this information in advance through detectors and input devices, the dispatching algorithm can make informed decisions about which cars to assign and where to position them, preventing crowded cars and unnecessary stops before they occur.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback loops where detectors continuously monitor passenger waiting numbers, and the dispatching algorithm adjusts car assignments based on this real-time information. The system also monitors actual passenger boarding and provides feedback to optimize future assignments, creating a closed-loop control system that improves service quality.

Inventive Principle:
Principle #23Feedback

2Productivity

If elevator cars make multiple stops to serve different destinations, then more passengers can be served, but travel time increases and passenger experience deteriorates

Engineering Contradiction:
Improvepassenger throughputVSAvoidpassenger travel time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The system determines intended destinations of waiting passengers in advance using input devices and detectors. Based on this preliminary information, the dispatching algorithm groups passengers with similar destinations together and assigns them to the same elevator car, ensuring that the car makes minimal stops and reduces travel time while still serving multiple passengers.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system applies different stopping patterns to different elevator cars based on local conditions. Cars assigned to passengers with similar destinations are configured to make fewer stops, while other cars continue their normal operation. This localized optimization improves travel time for specific passenger groups without affecting overall system productivity.

Inventive Principle:
Principle #3Local quality

3Ease of operation

If empty elevator cars are prioritized for assignment, then passenger crowding is reduced, but system utilization efficiency may decrease

Engineering Contradiction:
Improvepassenger comfortVSAvoidsystem utilization
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The dispatching algorithm dynamically changes the assignment parameters based on real-time conditions. When waiting passenger numbers are low, the system prioritizes assigning empty or less-loaded cars to maintain comfort. When passenger demand increases, the algorithm adjusts to utilize more cars including partially loaded ones, balancing comfort and utilization efficiency through parameter adaptation.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system transitions from static car assignment rules to dynamic assignment that adapts to changing conditions. The dispatching algorithm continuously evaluates current passenger waiting numbers, car loading states, and destination patterns, dynamically adjusting which cars to assign and in what order, allowing the system to optimize for comfort when appropriate and for utilization when needed.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11724909B2Elevator car assignment based on a detected number of waiting passengers
Publication Date: 2023.08.15 OTIS ELEVATOR CO
  • US11724909B2 patent drawing
  • US11724909B2 patent drawing

AI summary

An illustrative example method of controlling an elevator system includes detecting a number of passengers waiting for elevator service at a landing, detecting an available passenger capacity of a plurality of elevator cars, respectively, and assigning at least one of the elevator cars to travel to the landing to provide elevator service to the passengers based on the detected number of passengers and the available passenger capacity of the at least one of the elevator cars.