CN106197431A - Elevator related personnel's shortest path planning system - Google Patents
Elevator related personnel's shortest path planning system Download PDFInfo
- Publication number
- CN106197431A CN106197431A CN201610692985.8A CN201610692985A CN106197431A CN 106197431 A CN106197431 A CN 106197431A CN 201610692985 A CN201610692985 A CN 201610692985A CN 106197431 A CN106197431 A CN 106197431A
- Authority
- CN
- China
- Prior art keywords
- elevator
- merger
- related personnel
- location point
- empty
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 claims abstract description 152
- 230000008569 process Effects 0.000 claims abstract description 137
- 230000003466 anti-cipated effect Effects 0.000 claims abstract description 18
- 230000005611 electricity Effects 0.000 claims description 7
- 238000012217 deletion Methods 0.000 claims description 5
- 230000037430 deletion Effects 0.000 claims description 5
- 238000012423 maintenance Methods 0.000 abstract description 21
- 230000008439 repair process Effects 0.000 abstract description 20
- 238000007689 inspection Methods 0.000 abstract description 9
- 238000004364 calculation method Methods 0.000 abstract description 2
- 230000007704 transition Effects 0.000 abstract description 2
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Elevator Control (AREA)
- Indicating And Signalling Devices For Elevators (AREA)
Abstract
The invention provides a kind of elevator related personnel's shortest path planning system, including: device MA: set elevator related personnel's information and target elevator information to be arrived；Device MB: according to target elevator information to be arrived and elevator related personnel's information, obtain the arrival path under constraints.The present invention provides the numerical procedure of the shortest route problem of confinement time, from the beginning of elevator related personnel's starting point, travel through all pending elevators and can obtain elevator anticipated elevator process time priority an active path, and result of calculation can be sent to elevator related personnel mobile phone enterprising walking along the street footpath prompting；The present invention is applied in the platforms such as elevator repair and maintenance, inspection, process circuit planing method can be made to obtain actual application, cook up row line for elevator related personnel and provide method, improve the promptness of elevator normal handling work, shorten the transition road in the work of elevator normal handling.
Description
Technical field
The present invention relates to the process field such as elevator repair and maintenance, inspection, in particular it relates to elevator related personnel's shortest path planning
System, particularly relates to a kind of method for searching shortest route, and it is applied in elevator repair and maintenance, inspection cloud platform.
Background technology
Along with the increase day by day of city elevator recoverable amount, elevator repair and maintenance, inspection etc. reason workload increases, the most year by year
The elevator number wanting repair and maintenance and inspection etc. to process increases year by year.As a example by repair and maintenance, existing elevator repair and maintenance company is by needs on the same day
The elevator of maintenance is assigned to repair and maintenance technician, repair and maintenance technician individual arrange by oneself repair and maintenance route.But, pre-due to each portion elevator
It is different that meter elevator processes the time, and distributing position more disperses, defect of both below the existence of above-mentioned way: allows for
Repair and maintenance technician is easily subject to the impact of other factors when arranging repair and maintenance circuit, and the reasonability of elevator repair and maintenance circuit remains to be discussed；
Two are a lack of standardization Route Planning Algorithm will cause repair and maintenance route difficult quality to be guaranteed, and then makes elevator repair and maintenance
Promptness is difficult to ensure that.
Summary of the invention
For defect of the prior art, it is an object of the invention to provide a kind of elevator related personnel shortest path planning system
System.
A kind of elevator related personnel's shortest path planning system provided according to the present invention, including:
Device MA: set elevator related personnel's information and target elevator information to be arrived；
Device MB: according to target elevator information to be arrived and elevator related personnel's information, obtain the arrival under constraints
Path.
Preferably, described constraints include following any one or appoint multiple condition:
-elevator processes shortest time；
-arrival path is the shortest；
-carry out elevator process according to priority.
Preferably, described device MA includes device M1；
Device M1: set elevator related personnel's starting point s and pending elevator set D；
D={di, i=1,2 ..., n
Wherein, n is positive integer, diRepresent i-th elevator in pending elevator set D；
diUse many tuple (i, amounti,pi,ti) represent, wherein, i represents sequence number, piRepresent i-th elevator position
Point, tiRepresent that the anticipated elevator of i-th elevator processes the time；amountiRepresent elevator quantity and the number of i-th elevator merger
It is worth 1 sum, amounti=1 represent i-th elevator the most not with other elevator merger；
Described device MB includes following device:
Device M2: if n < 2, then arriving path R is from elevator related personnel's starting point s to the 1st elevator d1Location point,
Enter device M12；If n >=2, then trigger device M3 and continue executing with；
Device M3: the n portion elevator in pending elevator set D is obtained pending elevator merger set by merger sequence
D ＇；
D ＇={ dj＇ }, j=1,2 ..., m
Wherein, m is positive integer, dj＇ represents the jth portion merger elevator in pending elevator set D ＇；
dj＇ uses tuple (j, amount more than onej,pnj,tnj) represent, wherein, j represents merger sequence number, pnjRepresent the
J portion merger elevator position point, tnjRepresent that the anticipated elevator of jth portion merger elevator processes time, amountjRepresent the merger of jth portion
The elevator quantity of elevator merger and numerical value 1 sum；
Device M4: if m < 2, then arriving path R is from elevator related personnel's starting point s to the 1st merger elevator d1The position of ＇
Put a little, trigger device M12；If m >=2, then trigger device M5 and continue executing with；
Device M5: by location point in pending elevator merger set D ＇ and elevator related personnel's starting point s distance less than L or
Person estimates that elevator processes the time merger elevator less than T and puts into the first process elevator set S1, pending elevator merger set D ＇
In remaining merger elevator put into the second process elevator set S2, wherein, L is distance threshold, and T is time threshold；
Device M6: the current location point pc arranging elevator related personnel is elevator related personnel's starting point s, and add current
Location point pc is to arriving in the R of path；
Device M7: if the first process elevator set S1 is empty, then the merger during searching loop second processes elevator set S2
Elevator, until the second process elevator set S2 is empty, triggers device M12；Wherein, when traveling through, select location point distance to work as every time
Merger elevator nearest for front position point pc adds in arrival path R, updates the location point that current location point pc is this merger elevator,
And delete this merger elevator from the second process elevator set S2；
If the first process elevator set S1 is not empty, then triggers device M8 and continue executing with；
Device M8: if the second process elevator set S2 is empty, then the merger during searching loop first processes elevator set S1
Elevator, until the first process elevator set S1 is empty, triggers device M12: wherein, when traveling through every time, and selection location point distance ought
Merger elevator nearest for front position point pc adds in arrival path R, updates the location point that current location point pc is this merger elevator,
And delete this merger elevator from the first process elevator set S1；
If the second process elevator set S2 is not empty, then triggers device M9 and continue executing with；
Device M9: when the first process elevator set S1 and the second process elevator set S2 is not the most empty, then at first
Reason elevator set S1 selects a merger elevator to be designated as s1, processes from second and elevator set S2 selects a merger elevator note
For s2, make the distance between s1 and s2 location point the shortest, and s1 is processed deletion elevator set S1 from first, by s2 at second
Reason elevator set S2 deletes；
Device M10: if the first process elevator set S1 is empty, s1, s2 is added arrive path R the most successively, trigger device
M11；
If the first process elevator set S1 is not empty, then searching loop first processes elevator set S1, until first processes
Elevator set S1 is empty, then s1, s2 add arrival path R successively, triggers device M11；Wherein, when traveling through, select position every time
Putting a merger elevator nearest for distance current location point pc to add in arrival path R, updating current location point pc is this merger electricity
The location point of ladder, and delete this merger elevator from the first process elevator set S1；
Device M11: arranging current location point pc is the location point of s2；
If the second process elevator set S2 is empty, then trigger device M12；
If the second process elevator set S2 is not empty, then searching loop second processes elevator set S2, until second processes
Elevator set S2 is empty, triggers device M12；Wherein, when traveling through, select location point distance current location point nearest the returning of pc every time
And elevator adds in arrival path R, update the location point that current location point pc is this merger elevator, and process elevator collection from second
Close in S2 and delete this merger elevator；
Device M12: output arrives path R.
Preferably, described device M3 includes following device M:
Device M3.1: newly-built pending elevator merger set D ＇, and it is set as empty set；
Device M3.2: set elevator merger wheel number x=1；
Device M3.3: take out the elevator d of current smallest sequence number u from pending elevator set Du(u,amountu,pu,
tu)；Wherein, puRepresent u portion elevator position point, tuRepresent that the anticipated elevator of u portion elevator processes the time；amountuRepresent the
The elevator quantity of u portion elevator merger and numerical value 1 sum；
Device M3.4: traversal calculates duOther each portion elevator d in pending elevator set Dv(v,amountv,pv,tv) it
Between mutual air line distance, wherein v | n > v > u}, pvRepresent v portion elevator position point, tvRepresent the anticipated elevator of v portion elevator
The process time；amountvRepresent elevator quantity and numerical value 1 sum of the elevator merger of v portion；
If mutually air line distance is less than air line distance threshold alpha, then from pending elevator set D, delete dv, and update du=
dw(w,amountw,pw,tw), the smaller value during wherein w is u, v, amountwFor amountuWith amountvSum, pnwFor puWith
pvThe midpoint of line, twFor tuAnd tvIn smaller value；
Device M3.5: add d at pending elevator merger set D ＇x＇ (x, amountx,pnx,tnx), wherein amountx=
amountu, pnx=pu, tnx=tu, from pending elevator set D, after having added, delete du；
Device M3.6: judge whether currently pending elevator set D is empty, if empty set, then merger terminates, otherwise by x
After value increases by 1, trigger device M3.3 and perform.
Preferably, described elevator related personnel's shortest path planning system also includes device:
Device M13: arrival path R is sent to the terminal of elevator related personnel.
Compared with prior art, the present invention has a following beneficial effect:
The present invention provides the numerical procedure of the shortest route problem of confinement time, from the beginning of elevator related personnel's starting point,
Travel through all elevators needing repair and maintenance or inspection etc. to process and the anticipated elevator of elevator can be obtained process one of time priority and have
Effect path, and result of calculation can be sent to the mobile phone enterprising walking along the street footpath prompting of elevator related personnel；The present invention is applied to elevator
In repair and maintenance, inspection platform, repair and maintenance, inspection layout of roads method can be made to obtain actual application, for elevator, related personnel cooks up
Row line provides method, improves the daily repair and maintenance of elevator, the promptness of inspecting, shortens the daily repair and maintenance of elevator, inspection
Transition road in work.
Accompanying drawing explanation
By the detailed description non-limiting example made with reference to the following drawings of reading, the further feature of the present invention,
Purpose and advantage will become more apparent upon:
The steps flow chart of elevator related personnel's shortest path planning method in the first embodiment that Fig. 1 provides for the present invention
Figure.
The steps flow chart of elevator related personnel's shortest path planning method in the second embodiment that Fig. 2 provides for the present invention
Figure.
The apparatus structure of elevator related personnel's shortest path planning method in the 3rd embodiment that Fig. 3 provides for the present invention
Figure.
Detailed description of the invention
Below in conjunction with specific embodiment, the present invention is described in detail.Following example will assist in the technology of this area
Personnel are further appreciated by the present invention, but limit the present invention the most in any form.It should be pointed out that, the ordinary skill to this area
For personnel, without departing from the inventive concept of the premise, it is also possible to make some changes and improvements.These broadly fall into the present invention
Protection domain.
First embodiment
A kind of elevator related personnel's shortest path planning method provided according to the present invention, comprises the steps:
Step A: set elevator related personnel's information and target elevator information to be arrived；
Step B: according to target elevator information to be arrived and elevator related personnel's information, obtain the arrival road under constraints
Footpath.
Wherein, described constraints include following any one or appoint multiple condition:
-elevator processes shortest time；
-arrival path is the shortest；
-carry out elevator process according to priority.
Second embodiment
The present embodiment can be understood as a preference of first embodiment, and wherein, described step A includes step 1, described
Step B includes that step 2, to step 12, the most also includes step 13.
Specifically, in the present embodiment, described elevator related personnel's shortest path planning method, comprise the steps:
Step 1: set elevator related personnel's starting point s and pending elevator set D；
D={di, i=1,2 ..., n
Wherein, n is positive integer, diRepresent i-th elevator in pending elevator set D；
diUse many tuple (i, amounti,pi,ti) represent, wherein, i represents sequence number, piRepresent i-th elevator position
Point, tiRepresent that the anticipated elevator of i-th elevator processes the time；amountiRepresent elevator quantity and the number of i-th elevator merger
It is worth 1 sum, amounti=1 represent i-th elevator the most not with other elevator merger, if amounti=2 represent i-th elevator
With with other 1 elevator merger；
Step 2: if n < 2, then arriving path R is from elevator related personnel's starting point s to the 1st elevator d1Location point,
Enter step 12；If n >=2, then enter step 3 and continue executing with；
Step 3: the n portion elevator in pending elevator set D is obtained pending by merger sequence (MERGE-SORT)
Elevator merger set D ＇；
D ＇={ dj＇ }, j=1,2 ..., m
Wherein, m is positive integer, dj＇ represents the jth portion merger elevator in pending elevator set D ＇；
dj＇ uses tuple (j, amount more than onej,pnj,tnj) represent, wherein, j represents merger sequence number, pnjRepresent the
J portion merger elevator position point, tnjRepresent that the anticipated elevator of jth portion merger elevator processes time, amountjRepresent the merger of jth portion
The elevator quantity of elevator merger and numerical value 1 sum；
Step 4: if m < 2, then arriving path R is from elevator related personnel's starting point s to the 1st merger elevator d1The position of ＇
Put a little, enter step 12；If m >=2, then enter step 5 and continue executing with；
Step 5: by location point in pending elevator merger set D ＇ and elevator related personnel's starting point s distance less than L or
Person estimates that elevator processes the time merger elevator less than T and puts into the first process elevator set S1, pending elevator merger set D ＇
In remaining merger elevator put into the second process elevator set S2, wherein, L is distance threshold, and T is time threshold；
Step 6: the current location point pc arranging elevator related personnel is elevator related personnel's starting point s, and add current
Location point pc is to arriving in the R of path；
Step 7: if the first process elevator set S1 is empty, then the merger electricity during searching loop second processes elevator set S2
Ladder, until the second process elevator set S2 is empty, enters step 12；Wherein, when traveling through, select location point distance present bit every time
Putting merger elevator nearest for a pc and add in arrival path R, renewal current location point pc is the location point of this merger elevator, and from
Second process elevator set S2 deletes this merger elevator；
If the first process elevator set S1 is not empty, then enters step 8 and continue executing with；
Step 8: if the second process elevator set S2 is empty, then the merger electricity during searching loop first processes elevator set S1
Ladder, until the first process elevator set S1 is empty, enters step 12: wherein, when traveling through every time, selects location point distance present bit
Putting merger elevator nearest for a pc and add in arrival path R, renewal current location point pc is the location point of this merger elevator, and from
First process elevator set S1 deletes this merger elevator；
If the second process elevator set S2 is not empty, then enters step 9 and continue executing with；
Step 9: when the first process elevator set S1 and the second process elevator set S2 is not the most empty, then process from first
Elevator set S1 selects a merger elevator be designated as s1, process from second and elevator set S2 selects a merger elevator be designated as
S2, makes the distance between s1 and s2 location point the shortest, and from first, s1 is processed deletion elevator set S1, is processed from second by s2
Elevator set S2 deletes；
Step 10: if the first process elevator set S1 is empty, s1, s2 is added arrive path R the most successively, enter step
11；
If the first process elevator set S1 is not empty, then searching loop first processes elevator set S1, until first processes
Elevator set S1 is empty, then s1, s2 add arrival path R successively, enters step 11；Wherein, when traveling through, select position every time
Merger elevator nearest for some distance current location point pc adds in arrival path R, and updating current location point pc is this merger elevator
Location point, and process elevator set S1 from first and delete this merger elevator；
Step 11: arranging current location point pc is the location point of s2；
If the second process elevator set S2 is empty, then enter step 12；
If the second process elevator set S2 is not empty, then searching loop second processes elevator set S2, until second processes
Elevator set S2 is empty, enters step 12；Wherein, when traveling through, select location point distance current location point nearest the returning of pc every time
And elevator adds in arrival path R, update the location point that current location point pc is this merger elevator, and process elevator collection from second
Close in S2 and delete this merger elevator；
Step 12: output arrives path R.
Further, described step 3 comprises the steps:
Step 3.1: newly-built pending elevator merger set D ＇, and it is set as empty set；
Step 3.2: set elevator merger wheel number x=1；
Step 3.3: take out the elevator d of current smallest sequence number u from pending elevator set Du(u,amountu,pu,tu)；
Wherein, puRepresent u portion elevator position point, tuRepresent that the anticipated elevator of u portion elevator processes the time；amountuRepresent u portion
The elevator quantity of elevator merger and numerical value 1 sum；
Step 3.4: traversal calculates duOther each portion elevator d in pending elevator set Dv(v,amountv,pv,tv) it
Between mutual air line distance, wherein v | n > v > u}, pvRepresent v portion elevator position point, tvRepresent the anticipated elevator of v portion elevator
The process time；amountvRepresent elevator quantity and numerical value 1 sum of the elevator merger of v portion；
If mutually air line distance is less than air line distance threshold alpha, then from pending elevator set D, delete dv, and update du=
dw(w,amountw,pw,tw), the smaller value during wherein w is u, v, amountwFor amountuWith amountvSum, pnwFor puWith
pvThe midpoint of line, twFor tuAnd tvIn smaller value；
Step 3.5: add d at pending elevator merger set D ＇x＇ (x, amountx,pnx,tnx), wherein amountx=
amountu, pnx=pu, tnx=tu, from pending elevator set D, after having added, delete du；
Step 3.6: judge whether currently pending elevator set D is empty, if empty set, then merger terminates, otherwise by x value
After increasing by 1, return step 3.3.
Further, described elevator related personnel's shortest path planning method, comprise the steps:
Step 13: arrival path R is sent to the terminal of elevator related personnel.
Further, elevator related personnel's terminal shows arrival path R, specifically refers to: be each by arrive in the R of path
Location point shows on the electronic chart of elevator related personnel's terminal.
3rd embodiment
With a kind of elevator related personnel's shortest path planning system provided according to the present invention, including device:
Device MA: set elevator related personnel's information and target elevator information to be arrived；
Device MB: according to target elevator information to be arrived and elevator related personnel's information, obtain the arrival under constraints
Path.
Wherein, described constraints include following any one or appoint multiple condition:
-elevator processes shortest time；
-arrival path is the shortest；
-carry out elevator process according to priority.
4th embodiment
The present embodiment can be understood as a preference of the 3rd embodiment, and wherein, described device MA includes device M1；
Device M1: set elevator related personnel's starting point s and pending elevator set D；
D={di, i=1,2 ..., n
Wherein, n is positive integer, diRepresent i-th elevator in pending elevator set D；
diUse many tuple (i, amounti,pi,ti) represent, wherein, i represents sequence number, piRepresent i-th elevator position
Point, tiRepresent that the anticipated elevator of i-th elevator processes the time；amountiRepresent elevator quantity and the number of i-th elevator merger
It is worth 1 sum, amounti=1 represent i-th elevator the most not with other elevator merger；
Described device MB includes following device:
Device M2: if n < 2, then arriving path R is from elevator related personnel's starting point s to the 1st elevator d1Location point,
Enter device M12；If n >=2, then trigger device M3 and continue executing with；
Device M3: the n portion elevator in pending elevator set D is obtained pending elevator merger set by merger sequence
D ＇；
D ＇={ dj＇ }, j=1,2 ..., m
Wherein, m is positive integer, dj＇ represents the jth portion merger elevator in pending elevator set D ＇；
dj＇ uses tuple (j, amount more than onej,pnj,tnj) represent, wherein, j represents merger sequence number, pnjRepresent the
J portion merger elevator position point, tnjRepresent that the anticipated elevator of jth portion merger elevator processes time, amountjRepresent the merger of jth portion
The elevator quantity of elevator merger and numerical value 1 sum；
Device M4: if m < 2, then arriving path R is from elevator related personnel's starting point s to the 1st merger elevator d1The position of ＇
Put a little, trigger device M12；If m >=2, then trigger device M5 and continue executing with；
Device M5: by location point in pending elevator merger set D ＇ and elevator related personnel's starting point s distance less than L or
Person estimates that elevator processes the time merger elevator less than T and puts into the first process elevator set S1, pending elevator merger set D ＇
In remaining merger elevator put into the second process elevator set S2, wherein, L is distance threshold, and T is time threshold；
Device M6: the current location point pc arranging elevator related personnel is elevator related personnel's starting point s, and add current
Location point pc is to arriving in the R of path；
Device M7: if the first process elevator set S1 is empty, then the merger during searching loop second processes elevator set S2
Elevator, until the second process elevator set S2 is empty, triggers device M12；Wherein, when traveling through, select location point distance to work as every time
Merger elevator nearest for front position point pc adds in arrival path R, updates the location point that current location point pc is this merger elevator,
And delete this merger elevator from the second process elevator set S2；
If the first process elevator set S1 is not empty, then triggers device M8 and continue executing with；
Device M8: if the second process elevator set S2 is empty, then the merger during searching loop first processes elevator set S1
Elevator, until the first process elevator set S1 is empty, triggers device M12: wherein, when traveling through every time, and selection location point distance ought
Merger elevator nearest for front position point pc adds in arrival path R, updates the location point that current location point pc is this merger elevator,
And delete this merger elevator from the first process elevator set S1；
If the second process elevator set S2 is not empty, then triggers device M9 and continue executing with；
Device M9: when the first process elevator set S1 and the second process elevator set S2 is not the most empty, then at first
Reason elevator set S1 selects a merger elevator to be designated as s1, processes from second and elevator set S2 selects a merger elevator note
For s2, make the distance between s1 and s2 location point the shortest, and s1 is processed deletion elevator set S1 from first, by s2 at second
Reason elevator set S2 deletes；
Device M10: if the first process elevator set S1 is empty, s1, s2 is added arrive path R the most successively, trigger device
M11；
If the first process elevator set S1 is not empty, then searching loop first processes elevator set S1, until first processes
Elevator set S1 is empty, then s1, s2 add arrival path R successively, triggers device M11；Wherein, when traveling through, select position every time
Putting a merger elevator nearest for distance current location point pc to add in arrival path R, updating current location point pc is this merger electricity
The location point of ladder, and delete this merger elevator from the first process elevator set S1；
Device M11: arranging current location point pc is the location point of s2；
If the second process elevator set S2 is empty, then trigger device M12；
If the second process elevator set S2 is not empty, then searching loop second processes elevator set S2, until second processes
Elevator set S2 is empty, triggers device M12；Wherein, when traveling through, select location point distance current location point nearest the returning of pc every time
And elevator adds in arrival path R, update the location point that current location point pc is this merger elevator, and process elevator collection from second
Close in S2 and delete this merger elevator；
Device M12: output arrives path R.
Preferably, described device M3 includes following device M:
Device M3.1: newly-built pending elevator merger set D ＇, and it is set as empty set；
Device M3.2: set elevator merger wheel number x=1；
Device M3.3: take out the elevator d of current smallest sequence number u from pending elevator set Du(u,amountu,pu,
tu)；Wherein, puRepresent u portion elevator position point, tuRepresent that the anticipated elevator of u portion elevator processes the time；amountuRepresent the
The elevator quantity of u portion elevator merger and numerical value 1 sum；
Device M3.4: traversal calculates duOther each portion elevator d in pending elevator set Dv(v,amountv,pv,tv) it
Between mutual air line distance, wherein v | n > v > u}, pvRepresent v portion elevator position point, tvRepresent the anticipated elevator of v portion elevator
The process time；amountvRepresent elevator quantity and numerical value 1 sum of the elevator merger of v portion；
If mutually air line distance is less than air line distance threshold alpha, then from pending elevator set D, delete dv, and update du=
dw(w,amountw,pw,tw), the smaller value during wherein w is u, v, amountwFor amountuWith amountvSum, pnwFor puWith
pvThe midpoint of line, twFor tuAnd tvIn smaller value；
Device M3.5: add d at pending elevator merger set D ＇x＇ (x, amountx,pnx,tnx), wherein amountx=
amountu, pnx=pu, tnx=tu, from pending elevator set D, after having added, delete du；
Device M3.6: judge whether currently pending elevator set D is empty, if empty set, then merger terminates, otherwise by x
After value increases by 1, trigger device M3.3 and perform.
Preferably, described elevator related personnel's shortest path planning system also includes device:
Device M13: arrival path R is sent to the terminal of elevator related personnel.
One skilled in the art will appreciate that except realizing, in pure computer readable program code mode, the system that the present invention provides
And beyond each device, module, unit, by method step is carried out programming in logic, the present invention can be provided completely
System and each device, module, unit with gate, switch, special IC, programmable logic controller (PLC) and embedding
Enter the form of the controller etc. that declines to realize identical function.So, the system of present invention offer and every device, module, list
Unit is considered a kind of hardware component, and to include in it for realizing the device of various function, module, unit also may be used
With the structure being considered as in hardware component；Can also by being used for realizing the device of various function, module, unit are considered as both can being real
The software module of existing method can be again the structure in hardware component.
Above the specific embodiment of the present invention is described.It is to be appreciated that the invention is not limited in above-mentioned
Particular implementation, those skilled in the art can make a variety of changes within the scope of the claims or revise, this not shadow
Ring the flesh and blood of the present invention.In the case of not conflicting, the feature in embodiments herein and embodiment can any phase
Combination mutually.
Claims (5)
1. elevator related personnel's shortest path planning system, it is characterised in that including:
Device MA: set elevator related personnel's information and target elevator information to be arrived；
Device MB: according to target elevator information to be arrived and elevator related personnel's information, obtain the arrival path under constraints.
Elevator related personnel's shortest path planning system the most according to claim 1, it is characterised in that described constraints
Including following any one or appoint multiple condition:
-elevator processes shortest time；
-arrival path is the shortest；
-carry out elevator process according to priority.
Elevator related personnel's shortest path planning system the most according to claim 1, it is characterised in that described device MA bag
Include device M1；
Device M1: set elevator related personnel's starting point s and pending elevator set D；
D={di, i=1,2 ..., n
Wherein, n is positive integer, diRepresent i-th elevator in pending elevator set D；
diUse many tuple (i, amounti,pi,ti) represent, wherein, i represents sequence number, piRepresent i-th elevator position point, ti
Represent that the anticipated elevator of i-th elevator processes the time；amountiRepresent the elevator quantity of i-th elevator merger and numerical value 1 it
With, amounti=1 represent i-th elevator the most not with other elevator merger；
Described device MB includes following device:
Device M2: if n < 2, then arriving path R is from elevator related personnel's starting point s to the 1st elevator d1Location point, enter
Device M12；If n >=2, then trigger device M3 and continue executing with；
Device M3: the n portion elevator in pending elevator set D is obtained pending elevator merger set D ＇ by merger sequence；
D ＇={ dj＇ }, j=1,2 ..., m
Wherein, m is positive integer, dj＇ represents the jth portion merger elevator in pending elevator set D ＇；
dj＇ uses tuple (j, amount more than onej,pnj,tnj) represent, wherein, j represents merger sequence number, pnjRepresent jth portion
Merger elevator position point, tnjRepresent that the anticipated elevator of jth portion merger elevator processes time, amountjRepresent jth portion merger elevator
The elevator quantity of merger and numerical value 1 sum；
Device M4: if m < 2, then arriving path R is from elevator related personnel's starting point s to the 1st merger elevator d1The location point of ＇,
Trigger device M12；If m >=2, then trigger device M5 and continue executing with；
Device M5: by location point in pending elevator merger set D ＇ and elevator related personnel's starting point s distance less than L or pre-
Meter elevator processes the time merger elevator less than T and puts into the first process elevator set S1, remaining in pending elevator merger set D ＇
Under merger elevator put into the second process elevator set S2, wherein, L is distance threshold, and T is time threshold；
Device M6: the current location point pc arranging elevator related personnel is elevator related personnel's starting point s, and adds current location
Point pc is to arriving in the R of path；
Device M7: if the first process elevator set S1 is empty, then the merger elevator during searching loop second processes elevator set S2,
Until the second process elevator set S2 is empty, trigger device M12；Wherein, when traveling through, select location point distance current location every time
The point nearest merger elevator of pc adds and arrives in the R of path, updates the location point that current location point pc is this merger elevator, and from the
Two process elevator set S2 delete this merger elevator；
If the first process elevator set S1 is not empty, then triggers device M8 and continue executing with；
Device M8: if the second process elevator set S2 is empty, then the merger elevator during searching loop first processes elevator set S1,
Until the first process elevator set S1 is empty, trigger device M12: wherein, when traveling through every time, select location point distance current location
The point nearest merger elevator of pc adds and arrives in the R of path, updates the location point that current location point pc is this merger elevator, and from the
One process elevator set S1 deletes this merger elevator；
If the second process elevator set S2 is not empty, then triggers device M9 and continue executing with；
Device M9: when the first process elevator set S1 and the second process elevator set S2 is not the most empty, then process electricity from first
Ladder set S1 selects a merger elevator to be designated as s1, processes from second and elevator set S2 selects a merger elevator be designated as
S2, makes the distance between s1 and s2 location point the shortest, and from first, s1 is processed deletion elevator set S1, is processed from second by s2
Elevator set S2 deletes；
Device M10: if the first process elevator set S1 is empty, s1, s2 is added arrive path R the most successively, trigger device M11；
If the first process elevator set S1 is not empty, then searching loop first processes elevator set S1, until first processes elevator
Set S1 is empty, then s1, s2 add arrival path R successively, triggers device M11；Wherein, when traveling through, select location point every time
Merger elevator nearest for distance current location point pc adds in arrival path R, and updating current location point pc is this merger elevator
Location point, and delete this merger elevator from the first process elevator set S1；
Device M11: arranging current location point pc is the location point of s2；
If the second process elevator set S2 is empty, then trigger device M12；
If the second process elevator set S2 is not empty, then searching loop second processes elevator set S2, until second processes elevator
Set S2 is empty, triggers device M12；Wherein, when traveling through, select merger electricity nearest for location point distance current location point pc every time
Ladder adds in arrival path R, updates the location point that current location point pc is this merger elevator, and processes elevator set S2 from second
This merger elevator of middle deletion；
Device M12: output arrives path R.
Elevator related personnel's shortest path planning system the most according to claim 1, it is characterised in that described device M3 bag
Include following device M:
Device M3.1: newly-built pending elevator merger set D ＇, and it is set as empty set；
Device M3.2: set elevator merger wheel number x=1；
Device M3.3: take out the elevator d of current smallest sequence number u from pending elevator set Du(u,amountu,pu,tu)；Its
In, puRepresent u portion elevator position point, tuRepresent that the anticipated elevator of u portion elevator processes the time；amountuRepresent u portion electricity
The elevator quantity of ladder merger and numerical value 1 sum；
Device M3.4: traversal calculates duOther each portion elevator d in pending elevator set Dv(v,amountv,pv,tvBetween)
Mutually air line distance, wherein v | n > v > u}, pvRepresent v portion elevator position point, tvRepresent that the anticipated elevator of v portion elevator processes
Time；amountvRepresent elevator quantity and numerical value 1 sum of the elevator merger of v portion；
If mutually air line distance is less than air line distance threshold alpha, then from pending elevator set D, delete dv, and update du=dw
(w,amountw,pw,tw), the smaller value during wherein w is u, v, amountwFor amountuWith amountvSum, pnwFor puWith pv
The midpoint of line, twFor tuAnd tvIn smaller value；
Device M3.5: add d at pending elevator merger set D ＇x＇ (x, amountx,pnx,tnx), wherein amountx=
amountu, pnx=pu, tnx=tu, from pending elevator set D, after having added, delete du；
Device M3.6: judge whether currently pending elevator set D is empty, if empty set, then merger terminates, and otherwise x value is increased
After adding 1, trigger device M3.3 and perform.
Elevator related personnel's shortest path planning system the most according to claim 1, it is characterised in that also include:
Device M13: arrival path R is sent to the terminal of elevator related personnel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610692985.8A CN106197431B (en) | 2016-08-19 | 2016-08-19 | Elevator related personnel shortest path planning system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610692985.8A CN106197431B (en) | 2016-08-19 | 2016-08-19 | Elevator related personnel shortest path planning system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106197431A true CN106197431A (en) | 2016-12-07 |
| CN106197431B CN106197431B (en) | 2020-04-21 |
Family
ID=57523225
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610692985.8A Active CN106197431B (en) | 2016-08-19 | 2016-08-19 | Elevator related personnel shortest path planning system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106197431B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113213296A (en) * | 2021-04-27 | 2021-08-06 | 重庆千跬科技有限公司 | Automatic matching method for target elevator and scattered maintenance personnel |
| CN115159289A (en) * | 2022-07-13 | 2022-10-11 | 北京云迹科技股份有限公司 | Elevator interaction method, device, electronic equipment and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101539431A (en) * | 2009-04-28 | 2009-09-23 | 华北电网有限公司张家口供电公司 | Intelligent navigation data logging device and method for improving navigation accuracy |
| CN103745316A (en) * | 2013-12-27 | 2014-04-23 | 江南大学 | Method and system for monitoring elevator maintenance person to make maintenance response in time |
| CN104299077A (en) * | 2014-09-30 | 2015-01-21 | 广州供电局有限公司 | Onsite inspection path planning and onsite inspection problem handling method |
| CN104316043A (en) * | 2014-10-23 | 2015-01-28 | 冀亚男 | Positioning and navigation system and method of common transformers |
-
2016
- 2016-08-19 CN CN201610692985.8A patent/CN106197431B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101539431A (en) * | 2009-04-28 | 2009-09-23 | 华北电网有限公司张家口供电公司 | Intelligent navigation data logging device and method for improving navigation accuracy |
| CN103745316A (en) * | 2013-12-27 | 2014-04-23 | 江南大学 | Method and system for monitoring elevator maintenance person to make maintenance response in time |
| CN104299077A (en) * | 2014-09-30 | 2015-01-21 | 广州供电局有限公司 | Onsite inspection path planning and onsite inspection problem handling method |
| CN104316043A (en) * | 2014-10-23 | 2015-01-28 | 冀亚男 | Positioning and navigation system and method of common transformers |
Non-Patent Citations (1)
| Title |
|---|
| DAWEI E,: ""The Design and Implementation of Remote Elevator Monitoring System Based on GPRS and Embedded Technology"", 《XIAMEN MUNICIPAL SCIENCE AND TECHNOLOGY PROGRAM》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113213296A (en) * | 2021-04-27 | 2021-08-06 | 重庆千跬科技有限公司 | Automatic matching method for target elevator and scattered maintenance personnel |
| CN113213296B (en) * | 2021-04-27 | 2022-07-29 | 重庆青云电梯安装工程有限公司 | Automatic matching method for target elevator and scattered maintenance personnel |
| CN115159289A (en) * | 2022-07-13 | 2022-10-11 | 北京云迹科技股份有限公司 | Elevator interaction method, device, electronic equipment and medium |
| CN115159289B (en) * | 2022-07-13 | 2023-12-08 | 北京云迹科技股份有限公司 | Elevator interaction method, device, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106197431B (en) | 2020-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104504065B (en) | Navigation way generation method and device | |
| EP1079204B1 (en) | Optimization engine for flight assignment, scheduling and routing of aircraft in response to irregular operations | |
| Solano-Charris et al. | Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios | |
| Van der Hurk et al. | Shuttle planning for link closures in urban public transport networks | |
| US9097535B2 (en) | Public transportation journey planning | |
| CN106205120B (en) | A kind of method and device for extracting road cross traffic limitation | |
| CN106845630A (en) | Unordered process must be through the shortest path acquisition methods and device of point | |
| Rambha et al. | Adaptive transit routing in stochastic time-dependent networks | |
| Balasubramanian et al. | An adaptive long-term bus arrival time prediction model with cyclic variations | |
| Xu et al. | A robust mixed-integer linear programming model for mitigating rail transit disruptions under uncertainty | |
| CN106197431A (en) | Elevator related personnel's shortest path planning system | |
| CN107167151A (en) | Bus routes method to set up, route planning method and device | |
| CN109871423A (en) | The update method and device of public bus network crestal line | |
| Vieira et al. | Exact and heuristic approaches to reschedule helicopter flights for personnel transportation in the oil industry | |
| Bast et al. | Efficient generation of geographically accurate transit maps | |
| Srivastava et al. | Learning to Forecast and Forecasting to Learn from the COVID-19 Pandemic | |
| Nassir et al. | Modeling transit passenger choices of access stop | |
| Kang | Degradable airline scheduling: an approach to improve operational robustness and differentiate service quality | |
| CN106295901A (en) | Elevator related personnel's shortest path planning method | |
| El-Gharably et al. | Optimization using simulation of the vehicle routing problem | |
| CN108257014A (en) | Core protects flow creation method and device | |
| López et al. | Techniques in multimodal shortest path in public transport systems | |
| CN110162033A (en) | The complicated method for driving manipulation that route planning and processing are forbidden | |
| Nassir et al. | Modeling transit access stop choices | |
| CN109472289A (en) | Critical point detection method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: The shortest path planning system for elevator related personnel Effective date of registration: 20230216 Granted publication date: 20200421 Pledgee: Jiujiang Bank Co.,Ltd. Hefei Dangtu Road sub branch Pledgor: ANHUI ORIOC TECHNOLOGY CO.,LTD. Registration number: Y2023980032691 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Granted publication date: 20200421 Pledgee: Jiujiang Bank Co.,Ltd. Hefei Dangtu Road sub branch Pledgor: ANHUI ORIOC TECHNOLOGY CO.,LTD. Registration number: Y2023980032691 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right |