CN111507544A - Intelligent building service method and system based on minimum path - Google Patents
Intelligent building service method and system based on minimum path Download PDFInfo
- Publication number
- CN111507544A CN111507544A CN202010610138.9A CN202010610138A CN111507544A CN 111507544 A CN111507544 A CN 111507544A CN 202010610138 A CN202010610138 A CN 202010610138A CN 111507544 A CN111507544 A CN 111507544A
- Authority
- CN
- China
- Prior art keywords
- gate
- guest
- path
- data
- unit
- 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 title claims abstract description 27
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Time Recorders, Dirve Recorders, Access Control (AREA)
Abstract
The invention discloses an intelligent building service method based on minimum path data, and belongs to the data processing and control technology. The first storage unit generates a first path document and a second path document. The second storage unit stores a first time table when the guest enters any second gate through the first gate and a second time table when the guest enters the third gate through any second gate. When the guest passes through the first gate, the control unit generates a total time length table according to the unit information of the guest. And determining a second gate with the shortest total time length, and opening the passing permission of the second gate to the guest. The invention also discloses an intelligent building service system based on the minimum path data.
Description
Technical Field
The invention relates to an intelligent building service method and system based on a minimum path, and belongs to the data processing and control technology.
Background
The traffic efficiency can be improved by reasonably distributing passenger flow. In the prior art, the passenger flow state can adopt an accurate positioning or number prediction algorithm. The concrete schemes are described in a fishing boat port-entering and port-exiting scheduling method of CN201910228091.7 and a subway station passenger flow organization system and method of CN 202010041482.0. The traffic efficiency is an important index of the intelligent degree of the building. PCT/EP2016/067817 discloses a method for evacuating buildings. The method includes determining an instantaneous location of the mobile device in the building, the data being associated with a location of the first fixed point marker in a database. The current traffic situation for each floor is obtained based on the instantaneous location of the mobile device. The already-used efficiency of the scheme is used as a parameter for predicting the communication condition at the current time, and can be used as a reference for the application. In addition, the direction of the passenger flow can be guided through the control of the gate. The conventional gate control technology refers to CN 201910202958.1 and is based on a wing gate control method and system of a mobile management terminal.
In light of the above, it is desirable to provide an intelligent building service method for solving traffic efficiency, especially during peak hours.
Disclosure of Invention
The invention provides an intelligent building service method and system based on a minimum path, which are used for guiding passenger flow, improving traffic efficiency and reducing congestion.
A minimum path-based intelligent building service method is characterized by comprising the following steps,
arranging a first gate at the entrance of a building, arranging a second gate at the entrances of a plurality of passages, arranging a third gate at the entrances of a plurality of units, determining the position information of the first gate, the second gate and the third gate,
the first storage unit stores the minimum path data of the guest entering the corresponding unit through any second gate and generates a first path document
And a second path document
Wherein, in the step (A),
is the serial number of the unit,
the number of the channel is the serial number of the channel,
the path length of the first gate and any second gate,
the path length of any second gate and the unit,
preset walking speed
The second storage unit stores a first time table of the guest entering any second gate through the first gate according to the first path document
，
，
，
And storing a second time table of the guest entering a third gate through any second gate according to the second path document
,
，
，
，
Processing unit generates delay table
，
The number of the floor is the number of the floor,
when a guest passes through the first gate, the control unit generates a total time schedule according to the unit information of the guest
For the preset unit number, obtaining the delay table of the corresponding floor,
，
，
，
determining the second gate with the shortest total time, opening the passing authority of the second gate to the guest, displaying the channel number of the second gate to the corresponding guest,
wherein, the time interval of each guest passing through the second gate and the third gate is obtained
Determining the guest's latency data
，
，
Counting the average time delay of the third gate entering each floor through any second gate in a preset period for the time-consuming data reaching the third gate from the corresponding second gate in the second time delay table, and generating the time delay table of the next period
，
Dividing a building plane into a plurality of passageways and nodes, counting distance data of various routes of a first gate entering a second gate through any passageway and node, counting distance data of various routes of the second gate entering a third gate through any passageway and node, determining minimum path data in the various distance data by adopting Dijkstra shortest path algorithm,
counting the time interval of each guest passing through the second gate and the third gate, calculating the speed data of each guest according to the first path document, and correcting the walking speed by using the speed data
。
In the invention, the first gate, the second gate and the third gate are provided with timers for recording the time data when the guest passes through the first gate, the second gate and the third gate.
In the invention, any guest has an identification device, and the first gate and/or the second gate and/or the third gate can determine the unit information of the guest through the identification device.
In the invention, the passage is a vertical elevator, and the second time table comprises the minimum time length of the vertical elevator entering the corresponding unit floor.
In the invention, in a preset period, if a floor without delay data exists, the delay data of the floor is preset as an arithmetic mean value of the delay data of all other floors corresponding to the second gate.
In the invention, in the preset period, if the floor without the delay data exists, the delay data of the floor is preset as the weighted average of the delay data of all other floors corresponding to the second gate.
An intelligent building service system based on minimum path data is characterized in that the intelligent building service system comprises,
a first gate, which is arranged at the entrance of the building,
a plurality of second gates provided at the plurality of passage inlets, the second gates allowing authorized guests to pass through,
a plurality of third gates provided at the plurality of unit entrances, the third gates allowing guests of the unit to pass therethrough,
a first storage unit for counting the position information of all units, storing the minimum path data of guests entering corresponding units through any second gate, and generating a first path document
And a second path document
Wherein, in the step (A),
is the serial number of the unit,
the number of the channel is the serial number of the channel,
the path length of the first gate and any second gate,
the path length of any second gate and the unit,
a second storage unit for storing a first time table of the guest entering any second gate via the first gate according to the first path document
，
，
．．．
And storing a second time table of the guest entering a third gate through any second gate according to the second path document
，
，
．．．
，
In order to set the walking speed to a preset value,
a processing unit for generating a delay table
，
The number of the floor is the number of the floor,
a control unit for generating a total time schedule according to the unit information of the guest when the guest passes through the first gate
For the preset unit number, obtaining the delay table of the corresponding floor,
，
．．．
determining the second gate with the shortest total time, opening the passing authority of the second gate to the guest, and displaying the channel number of the second gate to the corresponding guest,
wherein, the processing unit obtains the time interval of each guest passing through the second gate and the third gate
Determining the guest's latency data
，
，
Counting the average delay of the third gate entering each floor through any second gate in a preset period for the time data corresponding to the second gate in the second delay table to generate a delay table of the next period
。
The intelligent building service method and system based on the minimum path predict the passing time of any unit according to the walking time and the waiting time, and provide the optimal walking method. By controlling the running states of the three gates, the optimal passing path is selected for guests, the passing efficiency of the building is improved, and the service content of the intelligent building is further expanded.
Drawings
FIG. 1 is a plan view of a building 1 according to the present invention;
FIG. 2 is a plan view of a 17 th intelligent building according to the present invention;
FIG. 3 is a diagram of the path of a guest entering the second gate A2 through the first gate, wherein the dashed line is the shortest path;
FIG. 4 is a diagram of the path of a guest entering the B17 unit third gate through the second gate of A2, wherein the dashed line is the shortest path;
FIG. 5 is a flowchart of a minimum path based intelligent building service method of the present invention;
fig. 6 is a block diagram of a minimum path data based intelligent building service system according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention.
Such as the intelligent building floor plan shown in fig. 1 and 2. One floor of the building is provided with an entrance, and any floor can be reached by taking four groups of elevators through the entrance. Each floor is provided with a plurality of tenant units. And guests (staff) of the tenant unit can enter the corresponding floor after the identity of the tenant unit is verified. Due to the fact that the number of the guests on different floors is different, the guests on the same floor enter the building at different time. A situation may arise in which part of the elevators are congested and part of the elevators are empty during work. The intelligent building service method based on the minimum path can play a role in shunting. Namely, the method for predicting the congestion degree of the current elevator, planning the floor entering and distributing the number of guests of different elevators. The intelligent building service method based on the minimum path comprises the following steps.
A first gate is arranged at a building entrance, a second gate is arranged at a plurality of passage entrances, and a third gate is arranged at a plurality of unit entrances. The first gate is a door entrance guard for determining the identity of a building entering a guest, and the second gate is used for guiding the guest to enter different channels (elevators). The guest carries an identification device, and the first gate and/or the second gate and/or the third gate are/is provided with an RF card reading device, so that the information of the unit where the guest is located can be determined through the identification device. And the third gate is an entrance access control system of a unit. And determining the position information of the first gate, the second gate and the third gate, in particular the plane position information of the gates. The passageway may be a vertical elevator. The second time table comprises the minimum time length for the vertical elevator to enter the corresponding unit floor.
The first storage unit stores the minimum path data of the guest entering the corresponding unit through any second gate to generate a first path document
And a second path document
。
Is the serial number of the unit,
the number of the channel is the serial number of the channel,
the path length of the first gate and any second gate,
the path length of any second gate and the unit. For different units
In the corresponding path document
Different from each other. Dividing a building plane into a plurality of passageways and nodes, counting distance data of various routes of a first gate entering a second gate through any passageway and node, counting distance data of various routes of the second gate entering a third gate through any passageway and node, and determining minimum path data in the various distance data by adopting Dijkstra (Dikstra) shortest path algorithm. FIGS. 3 and 4 show the guests entering the B17 unit through the A2 second gateThe path data of (1). The path of the dotted line can be determined to be the shortest path according to a shortest path algorithm. The Dijkstra algorithm is used to compute the shortest path from one node to all other nodes. The method is mainly characterized in that the expansion is carried out layer by layer towards the outer part by taking the starting point as the center until the end point is reached. The Dijkstra algorithm solves the problem of the single-source shortest path of the weighted directed graph or the undirected graph by using breadth-first search, and finally obtains a shortest path tree. In principle, Dijkstra's algorithm employs a greedy strategy that states an array dis to store the shortest distance from the source point to each vertex and a set of vertices for which the shortest path has been found: and T. Initially, the path weight of the origin s is given 0 (dis [ s ]]= 0). If there is a directly reachable edge (s, m) for vertex s, then dis [ m [ [ m ] is assigned]Let w (s, m). While the path length of all other vertices (where s cannot be directly reached) is set to infinity. Initially, the set T has only vertices s. Then, the minimum value is selected from the dis array, which is the shortest path from the source point s to the vertex to which the value corresponds, and this point is added to T, which completes a vertex. It is then determined whether the newly added vertex can reach other vertices and the path length through the vertex to other points is shorter than the direct arrival of the source point, and if so, the values of these vertices in dis are replaced. Then, the minimum value is found again from dis, and the above-described actions are repeated until T includes all the vertices of the graph. From the disclosure of the prior art and the above description, one skilled in the art can determine the basic implementation of Dijkstra. Due to space limitations, the detailed steps of Dijkstra's algorithm are not developed by this application.
Preset walking speed
The second storage unit stores a first time table of the guest entering any second gate through the first gate according to the first path document
，
，
．．．
And storing a second time table of the guest entering a third gate through any second gate according to the second path document
,
，
．．．
. In the present invention, the traveling speed may be 100 m/min. In addition, the time interval of each guest passing through the second gate and the third gate can be counted and obtained, the speed data of each guest is calculated according to the first path document, and the walking speed is corrected by the speed data
。
Processing unit generates delay table
，
Is floor data. Specifically, the time interval of each guest passing through the second gate and the third gate is firstly obtained
. The first gate, the second gate and the third gate are provided with timers for recording the time when the guest passes through the first gate, the second gate and the third gateData from which time intervals are obtained
. The processing unit determines the delayed data of the guest
，
，
For the time-lapse data in the second delay schedule from the corresponding second gate to the third gate: (
). For example the guest enters through elevator a1,
. For any guest, its floor number F can be determined from its unit number D. The guest delay data can be regarded as delay data of a corresponding floor. For example, the preset period is 10min, and the average delay of each guest entering the third gate of each floor through any second gate within 10min is counted. The average delay can be regarded as the congestion degree of different second gates (elevators) in the current period, and the delay data can be used as a reference for selecting the second gates in the next period. Finally generating a delay table of all second gates in the next period
. Further, in the above-mentioned case,
when the time delay data is determined for basic use of entering a third gate through a second gate, the corresponding time delay data is rejected
Can reduceThe effect of this time-use data on the total duration estimate.
When a guest passes through the first gate, the control unit generates a total time schedule according to the unit information of the guest
. And determining a second gate with the shortest total time length from the total time length table, opening the passing permission of the second gate to the guest, and displaying the channel number of the second gate to the corresponding guest. The calculation method of the total time length table comprises the following steps:
，
．．．
。
the invention also discloses an intelligent building service system based on the minimum path data, which comprises a first gate, a plurality of second gates, a plurality of third gates, a first storage unit, a second storage unit, a processing unit and a control unit. The gate of the present invention includes a gate system, control elements, and the like. The storage unit refers to a computer device with a non-temporary storage function. The processing unit periodically reads data from the storage unit and the gate to generate a temporary file. The control unit is a main control device of the service system and controls the starting and stopping of the gate.
In the invention, the first gate is arranged at the entrance of the building. The second gate is arranged at the inlets of the plurality of channels, and the second gate allows authorized guests to pass through. A third gate is provided at the plurality of unit entrances, the third gate allowing guests of the unit to pass therethrough. The first storage unit counts position information of all units, stores minimum path data of a guest entering the corresponding unit through any second gate, and generates a first path document and a second path document. The first path document includes a unit number, a minimum path from the first gate to each of the second gates. The second path document includes a unit number, a minimum path from each second gate to a corresponding third gate. The second storage unit stores a first time table when the guest enters any second gate through the first gate according to the first path document, and stores a second time table when the guest enters a third gate through any second gate according to the second path document. The first time table comprises unit numbers and the time spent from the first gate to each second gate. The second time table includes unit numbers, and the time from each second gate to the third gate. When the guest passes through the first gate, the control unit generates a total time length table according to the unit information of the guest. The total time length table comprises unit numbers and the total time length of entering a corresponding unit (a third gate) through each second gate in the period. The total time length consists of the time length from the first gate to the second gate, the time length from the second gate to the third gate and the operation time length of the last period of the elevator. And determining a second gate with the shortest total time length from the total time length table, and opening the passing permission of the second gate to the guest. The number of the second gate is displayed to the corresponding guest through a display and the like.
In the invention, the processing unit acquires the time interval of each guest passing through the second gate and the third gate, determines the delay data of the guest, counts the average delay of the third gate entering the corresponding floor through any second gate in a preset period, and generates the delay table of the next period. In a preset period, if a floor without delay data exists, it is indicated that a guest enters the floor in the preset period, and the delay data has two processing ways. The delay data of the floor is preset to be the arithmetic mean of the delay data of all other floors corresponding to the second gate. Or the delay data of the floor is preset as a weighted average of the delay data of all other floors corresponding to the second gate. The first method has smaller data processing amount, and the second method has more accurate data.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (7)
1. A minimum path-based intelligent building service method is characterized by comprising the following steps,
arranging a first gate at the entrance of a building, arranging a second gate at the entrances of a plurality of passages, arranging a third gate at the entrances of a plurality of units, determining the position information of the first gate, the second gate and the third gate,
the first storage unit stores the minimum path data of the guest entering the corresponding unit through any second gate and generates a first path document
And a second path document
Wherein, in the step (A),
is the serial number of the unit,
the number of the channel is the serial number of the channel,
the path length of the first gate and any second gate,
the path length of any second gate and the unit,
preset walking speed
The second storage unit stores a first time table of the guest entering any second gate through the first gate according to the first path document
，
，
．．．
And storing a second time table of the guest entering a third gate through any second gate according to the second path document
,
，
．．．
，
Processing unit generates delay table
，
The number of the floor is the number of the floor,
when a guest passes through the first gate, the control unit generates a total time schedule according to the unit information of the guest
For the preset unit number, obtaining the delay table of the corresponding floor,
，
．．．
，
determining the second gate with the shortest total time, opening the passing authority of the second gate to the guest, displaying the channel number of the second gate to the corresponding guest,
wherein, the time interval of each guest passing through the second gate and the third gate is obtained
Determining the guest's latency data
，
，
Counting the average time delay of the third gate entering each floor through any second gate in a preset period for the time-consuming data reaching the third gate from the corresponding second gate in the second time delay table, and generating the time delay table of the next period
，
Dividing a building plane into a plurality of passageways and nodes, counting distance data of various routes of a first gate entering a second gate through any passageway and node, counting distance data of various routes of the second gate entering a third gate through any passageway and node, determining minimum path data in the various distance data by adopting Dijkstra shortest path algorithm,
counting the time interval of each guest passing through the second gate and the third gate, calculating the speed data of each guest according to the first path document, and correcting the walking speed by using the speed data
。
2. The minimum-path-based intelligent building service method as claimed in claim 1, wherein the first gate, the second gate and the third gate have a timer for recording time data of the guest passing through the first gate, the second gate and the third gate.
3. The minimum-path-based intelligent building service method as claimed in claim 1, wherein any guest has an identification device, and the first gate and/or the second gate and/or the third gate can determine information of the unit where the guest is located through the identification device.
4. The intelligent building service method based on minimum path as claimed in claim 1, wherein the passageway is a vertical elevator, and the second time table includes a minimum time period for the vertical elevator to enter the corresponding unit floor.
5. The intelligent building service method based on the minimum route as claimed in claim 1, wherein if there is a floor without delay data in the predetermined period, the delay data of the floor is preset as an arithmetic mean of delay data of all other floors corresponding to the second gate.
6. The intelligent building service method based on the minimum path as claimed in claim 1, wherein if there is a floor without delay data in the preset period, the delay data of the floor is preset as a weighted average of delay data of all other floors corresponding to the second gate.
7. An intelligent building service system based on minimum path data is characterized in that the intelligent building service system comprises,
a first gate, which is arranged at the entrance of the building,
a plurality of second gates provided at the plurality of passage inlets, the second gates allowing authorized guests to pass through,
a plurality of third gates provided at the plurality of unit entrances, the third gates allowing guests of the unit to pass therethrough,
a first storage unit for counting the position information of all units, storing the minimum path data of guests entering corresponding units through any second gate, and generating a first path document
And a second path document
Wherein, in the step (A),
is the serial number of the unit,
the number of the channel is the serial number of the channel,
the path length of the first gate and any second gate,
the path length of any second gate and the unit,
a second storage unit for storing a first time table of the guest entering any second gate via the first gate according to the first path document
，
，
．．．
And storing a second time table of the guest entering a third gate through any second gate according to the second path document
,
，
．．．
，
In order to set the walking speed to a preset value,
a processing unit for generating a delay table
，
The number of the floor is the number of the floor,
a control unit for generating a total time schedule according to the unit information of the guest when the guest passes through the first gate
For the preset unit number, obtaining the delay table of the corresponding floor,
，
．．．
determining the second gate with the shortest total time, opening the passing authority of the second gate to the guest, and displaying the channel number of the second gate to the corresponding guest,
wherein, the processing unit obtains the time interval of each guest passing through the second gate and the third gate
Determining the guest's latency data
，
，
Counting the average delay of the third gate entering each floor through any second gate in a preset period for the time data corresponding to the second gate in the second delay table to generate a delay table of the next period
。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010610138.9A CN111507544B (en) | 2020-06-30 | 2020-06-30 | Intelligent building service method and system based on minimum path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010610138.9A CN111507544B (en) | 2020-06-30 | 2020-06-30 | Intelligent building service method and system based on minimum path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111507544A true CN111507544A (en) | 2020-08-07 |
| CN111507544B CN111507544B (en) | 2020-12-15 |
Family
ID=71875307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010610138.9A Active CN111507544B (en) | 2020-06-30 | 2020-06-30 | Intelligent building service method and system based on minimum path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111507544B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110295647A1 (en) * | 2008-12-05 | 2011-12-01 | Hisaya Ishibashi | Manufacturing plan drawing-up system and method |
| CN102616614A (en) * | 2011-01-31 | 2012-08-01 | 株式会社日立制作所 | Elevator syntaxic group management system |
| CN103723584A (en) * | 2012-10-15 | 2014-04-16 | 通用电梯（中国）有限公司 | Elevator selection system |
| CN109059926A (en) * | 2018-08-07 | 2018-12-21 | 北京云迹科技有限公司 | Across floor paths planning method and system |
| CN109250593A (en) * | 2018-11-05 | 2019-01-22 | 上海木木聚枞机器人科技有限公司 | A kind of dispatching method and system of multirobot and more elevators |
| CN109761120A (en) * | 2019-02-28 | 2019-05-17 | 杭州西奥电梯有限公司 | A kind of elevator control method and system based on prediction floor arrival number |
| US20190193991A1 (en) * | 2017-12-22 | 2019-06-27 | Laurie Kohl | Vertical transportation like elevator, escalator, dumbwaiter and lift systems monitoring, maintenance, repair, inspection, testing and modernizaton system and method |
| CN110182655A (en) * | 2019-06-06 | 2019-08-30 | 上海三菱电梯有限公司 | The elevator control method of prediction passenger's boarding demand for single ladder |
| CN111302166A (en) * | 2020-02-27 | 2020-06-19 | 日立电梯（中国）有限公司 | Elevator management and control system |
-
2020
- 2020-06-30 CN CN202010610138.9A patent/CN111507544B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110295647A1 (en) * | 2008-12-05 | 2011-12-01 | Hisaya Ishibashi | Manufacturing plan drawing-up system and method |
| CN102616614A (en) * | 2011-01-31 | 2012-08-01 | 株式会社日立制作所 | Elevator syntaxic group management system |
| CN103723584A (en) * | 2012-10-15 | 2014-04-16 | 通用电梯（中国）有限公司 | Elevator selection system |
| US20190193991A1 (en) * | 2017-12-22 | 2019-06-27 | Laurie Kohl | Vertical transportation like elevator, escalator, dumbwaiter and lift systems monitoring, maintenance, repair, inspection, testing and modernizaton system and method |
| CN109059926A (en) * | 2018-08-07 | 2018-12-21 | 北京云迹科技有限公司 | Across floor paths planning method and system |
| CN109250593A (en) * | 2018-11-05 | 2019-01-22 | 上海木木聚枞机器人科技有限公司 | A kind of dispatching method and system of multirobot and more elevators |
| CN109761120A (en) * | 2019-02-28 | 2019-05-17 | 杭州西奥电梯有限公司 | A kind of elevator control method and system based on prediction floor arrival number |
| CN110182655A (en) * | 2019-06-06 | 2019-08-30 | 上海三菱电梯有限公司 | The elevator control method of prediction passenger's boarding demand for single ladder |
| CN111302166A (en) * | 2020-02-27 | 2020-06-19 | 日立电梯（中国）有限公司 | Elevator management and control system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111507544B (en) | 2020-12-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KEMLOH WAGOUM et al. | Modeling the dynamic route choice of pedestrians to assess the criticality of building evacuation | |
| CN110210652B (en) | Rail transit station passenger flow control method and device | |
| CN112988847B (en) | Scenic spot people number prediction system and method based on big data | |
| JP7477656B2 (en) | Method for realizing reservation of passage in road traffic, system for realizing reservation of passage in road traffic, electronic device and computer-readable storage medium | |
| Alam et al. | Investigation of the impacts of shared autonomous vehicle operation in Halifax, Canada using a dynamic traffic microsimulation model | |
| JP5130674B2 (en) | Method for determining travel-related time of navigation system, navigation system and program for executing the method | |
| JP2017522652A5 (en) | ||
| CN105654711B (en) | A kind of passenger on public transport recognition methods and system | |
| CN112686417B (en) | Subway large passenger flow prediction method, system and electronic equipment | |
| US11928963B2 (en) | System and method for tracking egress times from a parking facility and providing action recommendations | |
| CN113807790A (en) | Path planning method and device for robot, electronic equipment and storage medium | |
| CN114180423B (en) | Elevator dispatching method, device, equipment and storage medium | |
| CN111507544B (en) | Intelligent building service method and system based on minimum path | |
| CN116109081A (en) | Dynamic bus scheduling optimization method and device based on Internet of things | |
| US11217054B2 (en) | Access gate arrangement | |
| Henderson et al. | Estimating ambulance requirements in Auckland, New Zealand | |
| CN116844354A (en) | Vehicle priority traffic management method | |
| CN115099685A (en) | Urban public transport service level evaluation method based on multi-source data | |
| CN115619176A (en) | Comprehensive scheduling method and system for people in scenic spot | |
| Wang et al. | Boarding Time Estimation Using the Passenger Density Distribution on the Bus | |
| JP7277257B2 (en) | Movement demand estimation system and people flow estimation system | |
| Christofa | Traffic signal optimization with transit priority: A person-based approach | |
| CN114812584B (en) | Path planning method, system, storage medium and equipment | |
| Kuo et al. | Using variance neighbourhood search to optimize the bus waiting allocation problem in a multi-floor bus station | |
| Pinto | A reservation based parking lot system to maximize occupancy and revenue |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 330000 No. 688, aixihu North Road, high tech Development Zone, Nanchang City, Jiangxi Province Patentee after: Nanchang Zhongzhan Shuzhi Technology Co.,Ltd. Address before: 330000 No. 688, aixihu North Road, high tech Development Zone, Nanchang City, Jiangxi Province Patentee before: ZTE software technology (Nanchang) Co.,Ltd. |
|
| CP03 | Change of name, title or address |