Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A computational approach for time-optimal planning of high-rise elevators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Schlemmer, M. ; Dept. of Mech. Eng., Delaware Univ., Newark, DE, USA ; Agrawal, S.K.

An important issue in elevatoring is to transport passengers in near-minimum time while satisfying the elevator's intrinsic dynamic constraints, such as allowable hoist torque/power, and extrinsically imposed comfort constraints, such as allowable acceleration and deceleration. Furthermore, a solution is sought in near-real-time using concurrently sensed data of passenger load and destination. In this paper, a new approach for minimum-time trajectory generation for high-rise elevators is presented. It is shown that, for systems characterized by linear differential equations, subject to linear or nonlinear inequality constraints, the time-optimal trajectory possesses the special property that at least one constraint is always active. This property is exploited to build an efficient algorithm to compute minimum-time solutions

Published in:

Control Systems Technology, IEEE Transactions on  (Volume:10 ,  Issue: 1 )