1977
DOI: 10.1080/00207727708942042
|View full text |Cite
|
Sign up to set email alerts
|

Optimal control of elevators†

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(7 citation statements)
references
References 2 publications
0
7
0
Order By: Relevance
“…As examples, we can cite Levy et al [10] who used dynamic programming to minimize the expected length of a busy period of an elevator. Pepyne and Cassandras [14] used Markov decision theory to show that the optimal policy for controlling uppeak traffic (moves from first floor up) closes the doors after a critical number of passengers have entered the elevator.…”
Section: Introductionmentioning
confidence: 99%
“…As examples, we can cite Levy et al [10] who used dynamic programming to minimize the expected length of a busy period of an elevator. Pepyne and Cassandras [14] used Markov decision theory to show that the optimal policy for controlling uppeak traffic (moves from first floor up) closes the doors after a critical number of passengers have entered the elevator.…”
Section: Introductionmentioning
confidence: 99%
“…1 shows an example of a tall crane whose payload may bounce. One area where cable-stretch bouncing has received some attention is elevator control [15]- [18]. However, cranes with extensible cables have challenges that Manuscript do no arise in elevator control.…”
Section: Introductionmentioning
confidence: 99%
“…Levy et al used dynamic programming (DP) to minimize the expected time needed for completion of the current busy period (8) . To keep the system manageable, the number of buttons that can be on simultaneously is restricted and unlimited capacity of elevator cars is considered.…”
Section: Related Strategiesmentioning
confidence: 99%