CN1857981A - Group control lift dispatching method based on CMAC network - Google Patents

Abstract

The group controlled lift dispatching method based on CMAC network includes the following steps: 1. determining static parameters, dynamic parameters, passenger arrival model, CMAC network parameters and intensified learning parameters before triggering lift group control system; 2. observing lift state and calculating Q(x, run) and Q(x, stop); 3. selecting lift action; 4. setting the next decision point of each lift and renewing the lift R[i] value; 5. regulating the Q(s, a) estimations of each lift; 6. updating CMAC network weight value based on the expression; and 7. going to the step 1 after x-y and tx-ty. The present invention can raise lift dispatching efficiency and reduce the wait time of passengers.

Description

Multiple control lift dispatching method based on the CMAC network

One, technical field

The present invention relates to a kind of dispatching method of elevator, relate in particular to a kind of elevator group controlling dispatching method.

Two, background technology

Individual calling ladder signal form is adopted in early stage elevator control, development along with computer controlled and intellectual technology, calling and command signal by one group of elevator of computing machine unified management, according to the optimization aim of default and the actual traffic situation in the building, produce optimum elevator dispatching strategy, Here it is present common multiple lift control system, the essence of its scheduling is to open, in the dynamic complex environment, a plurality of optimization aim such as passenger waiting time, passenger journey time, degree of congestion and energy consumption are being optimized control.At present the multiple control lift dispatching method relate generally to partitioning algorithm, based on the algorithm of search and rule-based algorithm or the like.Along with the development of intellectual technology, more and more researchers adopts the adaptive learning algorithms of technical study such as expert system, fuzzy control, artificial neural net (ANN) and genetic algorithm.But because elevator operates in the continuous time system, its state space higher-dimension, therefore external status perception and change and dynamically change with passenger's arrival rate is fully simultaneously effectively calculated optimal policy that elevator group controlling dispatches and is remained one of main difficult problem that research circle and industrial community face.

Consider that the actual environment that elevator faces is unknown, uncertain, and scheduling is the on-line optimization that arrives model at client.Therefore intensified learning (Reinforcement learning) technology is applied in the elevator group controlling scheduling, shows that by emulation experiment its method compares with at present existing calculation method, can obtain less client's average latency.

Three, summary of the invention

1, goal of the invention: the purpose of this invention is to provide a kind of efficient elevator group controlling dispatching method that can reduce passenger's average latency.

2, in order to reach above-mentioned goal of the invention, the present invention includes following step:

(1) determines that static parameter, dynamical parameter, passenger arrive model, CMAC network parameter and intensified learning parameter, trigger multiple lift control system then, wherein, static parameter is elevator number and floor number, dynamical parameter is that interfloor flight time, elevator stop/time to turn and passenger transfer time, the passenger arrives model parameter and is passenger's arrival-time distribution, the CMAC network parameter is input node, output node and extensive parameter, and the intensified learning parameter is exponential damping speed β and learning rate α;

(2) be located at t _xConstantly elevator i arrives a decision point, and observing and obtaining state is x, according to the CMAC network calculations draw Q (x, run) and Q (x, stop), wherein, Q (x, run) be the Q value function that elevator continues operation under the x state, (x stop) is the Q value function of elevator parking to Q;

(3) select action a according to following formula:

$\mathrm{Pr}\left(\mathrm{stop}\right)=\frac{e^{Q(x,\mathrm{run})/T}}{e^{Q(x,\mathrm{stop})/T}+e^{Q(x,\mathrm{run})/T}}$

Wherein, T is temperature parameter and T＞0;

(4) make the next decision point of elevator i occur in t _yConstantly, its corresponding state is y, according to formula

$\mathrm{\ΔR}\left[i\right]=e^{-\mathrm{\β}(t_0-d[i\left]\right)}\underset{b}{\mathrm{\Σ}}\{\frac{2{\mathrm{\λ}}_b(1-e^{-\mathrm{\β}(t_1-t_0)})}{{\mathrm{\β}}^4}+(\frac{2}{{\mathrm{\β}}^3}+\frac{2w_0\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^2\left(b\right)}{\mathrm{\β}})$

$-e^{-\mathrm{\β}(t_1-t_0)}(\frac{2}{{\mathrm{\β}}^3}+\frac{2w_1\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^2\left(b\right)}{\mathrm{\β}})+{\mathrm{\λ}}_b[(\frac{2w_0\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_0^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^3\left(b\right)}{3\mathrm{\β}})-$

$e^{-\mathrm{\β}(t_1-t_0)}(\frac{2w_1\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_1^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^3\left(b\right)}{3\mathrm{\β}})\left]\right\}$

Upgrade the acquisition R[i of all elevators] value, wherein, R[i] be i portion elevator decision-making time point d[i from it] time begin total discount reinforcement value of accumulative total, t ₀Be the time that a last incident takes place, t ₁Be the time that current event takes place, for each at t ₀And t ₁Between actv. elevator-calling key b, make w ₀(b) and w ₁(b) be respectively t ₀And t ₁The time that passes after button b presses constantly, β is an exponential damping speed in the formula, and λ is client's a Poisson arrival rate;

(5) elevator i is according to formula:

$Q(x,a)\←R\left[i\right]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′})$ Regulate its Q (s, valuation a);

(6) according to formula:

$\mathrm{\ΔW}=\mathrm{\α}\left[R\right[i]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′},W)$

$-Q_{\mathrm{cmac}}(x,a,W)]{\▿}_W{Q}_{\mathrm{cmac}}(x,a,W)$ Upgrade the CMAC network weight;

(7) with x ← y, t _x← t _y.. go to step 1, thereby realize the multiple control lift scheduling.

3, beneficial effect: its remarkable advantage is to reduce passenger's average latency effectively, improves the performance of elevator dispatching.

Table 1 only contains the contrast and experiment of down traffic pattern

Algorithm	AvgWait	SquaredWait	Percent＞60s
				SECTOR	21.4	674	1.12
RL-BP	21.2	569	0.09
				RL-CMAC	19.7	529	0.07

Table 2 contains the contrast and experiment of uplink traffic pattern

Algorithm	AvgWait	SquaredWait	Percent＞60s
				SECTOR	27.3	1252	9.24
RL-BP	24.3	1140	9.90
				RL-CMAC	21.8	1048	9.14

The contrast and experiment of table 3 twice uplink traffic

Algorithm	AvgWait	SquaredWait	Percent＞60s
				SECTOR	30.3	1643	13.50
RL-BP	27.8	1698	8.74
				RL-CMAC	23.4	1562	8.20

Below under three kinds of transit modes, experimentize respectively, experiment shows based on the multiple control lift dispatching algorithm of CMAC network compares team control dispatching algorithm and the classical SECTOR algorithm of employing based on BP network intensified learning, can obtain less client's average latency; Client's wait time significantly reduces above the ratio of 60s simultaneously.

Four, description of drawings

Fig. 1 is the constructional drawing of intensified learning Function Estimation;

Fig. 2 is a CMAC neural network structure scheme drawing.

Five, the specific embodiment

As shown in Figure 1 and Figure 2, present embodiment comprises the following steps:

(1) determines that according to table 4 static parameter, dynamical parameter, passenger arrive model, CMAC network parameter and intensified learning parameter, trigger multiple lift control system then;

Table 4 embodiment parameter configuration

	Parametric description	Parameter is provided with
			Static parameter	The elevator number	4
The floor number	10
		Assignment key number in the ladder		10
Rated passenger capacity	20
		Dynamical parameter		Interfloor flight time	1.45s
The elevator standing time	7.19s
			Elevator time to turn	1s
Passenger transfer time	Average is that the erlang of 1s distributes, scope from 0.6 to 6.0s
			Client arrives model	Time 00	Arrival rate 1
Time 05	Arrival rate 2
		Time 10		Arrival rate 4
Time 15	Arrival rate 4
		Time 20		Arrival rate 18
Time 25	Arrival rate 12
		Time 30		Arrival rate 8
Time 35	Arrival rate 7
		Time 40		Arrival rate 18
Time 45	Arrival rate 5
		Time 50		Arrival rate 3
Time 55	Arrival rate 2
		The CMAC network parameter		The input node	47
Output node	2
			Extensive parameter	3
The intensified learning parameter	Exponential damping speed β				0.01
		Learning rate α	Satisfy ∑ α=∞, ∑ α 2＜C＜∞

(2) be located at t _xConstantly elevator i arrives a decision point, and observing and obtaining state is x, according to the CMAC network calculations draw Q (x, run) and Q (x, stop), wherein, Q (x, run) be the Q value function that elevator continues operation under the x state, (x stop) is the Q value function of elevator parking to Q;

(3) select action a according to following formula:

$\mathrm{Pr}\left(\mathrm{stop}\right)=\frac{e^{Q(x,\mathrm{run})/T}}{e^{Q(x,\mathrm{stop})/T}+e^{Q(x,\mathrm{run})/T}}$

Wherein, T is temperature parameter and T＞0;

(4) make the next decision point of elevator i occur in t _yConstantly, its corresponding state is y, according to formula

$\mathrm{\ΔR}\left[i\right]=e^{-\mathrm{\β}(t_0-d[i\left]\right)}\underset{b}{\mathrm{\Σ}}\{\frac{2{\mathrm{\λ}}_b(1-e^{-\mathrm{\β}(t_1-t_0)})}{{\mathrm{\β}}^4}+(\frac{2}{{\mathrm{\β}}^3}+\frac{2w_0\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^2\left(b\right)}{\mathrm{\β}})$

$-e^{-\mathrm{\β}(t_1-t_0)}(\frac{2}{{\mathrm{\β}}^3}+\frac{2w_1\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^2\left(b\right)}{\mathrm{\β}})+{\mathrm{\λ}}_b[(\frac{2w_0\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_0^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^3\left(b\right)}{3\mathrm{\β}})-$

$e^{-\mathrm{\β}(t_1-t_0)}(\frac{2w_1\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_1^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^3\left(b\right)}{3\mathrm{\β}})\left]\right\}$ , upgrade the acquisition R[i of all elevators] value, wherein, R[i] be i portion elevator decision-making time point d[i from it] time begin total discount reinforcement value of accumulative total, t ₀Be the time that a last incident takes place, t ₁Be the time that current event takes place, for each at t ₀And t ₁Between actv. elevator-calling key b, make w0 (b) and w1 (b) be respectively t ₀And t ₁The time that passes after button b presses constantly, β is an exponential damping speed in the formula, and λ is client's a Poisson arrival rate;

(5) elevator i is according to formula:

$Q(x,a)\←R\left[i\right]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′})$ Regulate its Q (s, valuation a);

(6) according to formula:

$\mathrm{\ΔW}=\mathrm{\α}\left[R\right[i]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′},W)$

$-Q_{\mathrm{cmac}}(x,a,W)]{\▿}_W{Q}_{\mathrm{cmac}}(x,a,W)$ Upgrade the CMAC network weight;

(7) with x ← y, t _x← t _y.. go to step 1, thereby realize the multiple control lift scheduling.

Claims (1)

1, a kind of multiple control lift dispatching method based on the CMAC network is characterized in that this method may further comprise the steps:

(1) determines that static parameter, dynamical parameter, passenger arrive model, CMAC network parameter and intensified learning parameter, trigger multiple lift control system then, wherein, static parameter is elevator number and floor number, dynamical parameter is that interfloor flight time, elevator stop/time to turn and passenger transfer time, the passenger arrives model parameter and is passenger's arrival-time distribution, the CMAC network parameter is input node, output node and extensive parameter, and the intensified learning parameter is exponential damping speed β and learning rate α;

(2) be located at t _xConstantly elevator i arrives a decision point, and observing and obtaining state is x, according to the CMAC network calculations draw Q (x, run) and Q (x, stop), wherein, Q (x, run) be the Q value function that elevator continues operation under the x state, (x stop) is the Q value function of elevator parking to Q;

(3) select action a according to following formula:

$\mathrm{Pr}\left(\mathrm{stop}\right)=\frac{e^{Q(x,\mathrm{run})/T}}{e^{Q(x,\mathrm{stop})/T}+e^{Q(x,\mathrm{run})/T}}$

Wherein, T is temperature parameter and T＞0;

(4) make the next decision point of elevator i occur in t _yConstantly, its corresponding state is y, according to formula

$\mathrm{\ΔR}\left[i\right]=e^{-\mathrm{\β}(t_0-d[i\left]\right)}\underset{b}{\mathrm{\Σ}}\{\frac{{2\mathrm{\λ}}_b(1-e^{-\mathrm{\β}(t_1-t_0)})}{{\mathrm{\β}}^4}+(\frac{2}{{\mathrm{\β}}^3}+\frac{{2w}_0\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^2\left(b\right)}{\mathrm{\β}})$

$-e^{-\mathrm{\β}(t_1-t_0)}(\frac{2}{{\mathrm{\β}}^3}+\frac{{2w}_1\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^2\left(b\right)}{\mathrm{\β}})+{\mathrm{\λ}}_b[(\frac{{2w}_0\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_0^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_0^3\left(b\right)}{3\mathrm{\β}})-$

$e^{-\mathrm{\β}(t_1-t_0)}(\frac{{2w}_1\left(b\right)}{{\mathrm{\β}}^3}+\frac{w_1^2\left(b\right)}{{\mathrm{\β}}^2}+\frac{w_1^3\left(b\right)}{3\mathrm{\β}})\left]\right\},$

Upgrade the acquisition R[i of all elevators] value, wherein, R[i] be i portion elevator decision-making time point d[i from it] time begin total discount reinforcement value of accumulative total, t ₀Be the time that a last incident takes place, t ₁Be the time that current event takes place, for each at t ₀And t ₁Between actv. elevator-calling key b, make w ₀(b) and w ₁(b) be respectively t ₀And t ₁The time that passes after button b presses constantly, β is an exponential damping speed in the formula, and λ is client's a Poisson arrival rate;

(5) elevator i is according to formula:

$Q(x,a)\←R\left[i\right]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′})$

Regulate its Q (s, valuation a);

(6) according to formula:

$\mathrm{\ΔW}=\mathrm{\α}\left[R\right[i]+e^{-\mathrm{\β}(t_y-t_x)}\underset{a^{\′}\∈\{\mathrm{stop},\mathrm{cont}\}}{\min }{Q}_{\mathrm{cmac}}(y,a^{\′},W)$

$-Q_{\mathrm{cmac}}(x,a,W){\▿}_W{Q}_{\mathrm{cmac}}(x,a,W)$ Upgrade the CMAC network weight;

(7) with x ← y, t _x← t _yGo to step 1, thereby realize the multiple control lift scheduling.

Images