CN113436329A - Visual elevator taking method and device, computer equipment and readable storage medium - Google Patents
Visual elevator taking method and device, computer equipment and readable storage medium Download PDFInfo
- Publication number
- CN113436329A CN113436329A CN202110708161.6A CN202110708161A CN113436329A CN 113436329 A CN113436329 A CN 113436329A CN 202110708161 A CN202110708161 A CN 202110708161A CN 113436329 A CN113436329 A CN 113436329A
- Authority
- CN
- China
- Prior art keywords
- elevator
- elevator taking
- taking
- current floor
- user
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Remote Sensing (AREA)
- Computer Graphics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Indicating And Signalling Devices For Elevators (AREA)
- Elevator Control (AREA)
Abstract
The application belongs to the technical field of artificial intelligence, and provides a visual elevator taking method, a visual elevator taking device, computer equipment and a readable storage medium, wherein the method comprises the following steps: when a user elevator taking request is received, extracting the current floor where the user is located from the elevator taking request; collecting images of each elevator taking area in the current floor, and determining the number of people to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area; acquiring the state information of each elevator, and determining the time length required by each elevator to reach the current floor according to the state information of each elevator; planning elevator taking paths of users according to a preset shortest path algorithm by combining the number of people to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor; and rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display. The intelligent elevator taking system can improve the intelligence of taking the elevator, reduce the unknown waiting time when the user takes the elevator, and accordingly improve the experience of taking the elevator.
Description
Technical Field
The application relates to the technical field of artificial intelligence, in particular to a visual elevator taking method and device, computer equipment and a readable storage medium.
Background
As building technology matures, the more floors are built, the larger the area of each floor is, and the demand of elevators becomes higher.
At present, when a user takes an elevator, the user must select one elevator taking area to go to wait at random or according to habits from a plurality of elevator taking areas distributed around the floor where the user is located. When the floor is higher and the number of users is more, the floors that the elevator needs to stop are also more, even can show the floor figure in real time when the elevator goes up and down, the elevator that takes advantage of the terraced region that the user selected also must not arrive earlier, the user also does not know how long to wait and just can take, and the ageing can't be guaranteed, and the user experience of taking advantage of terraced is relatively poor.
Disclosure of Invention
The application mainly aims to provide a visual elevator taking method, a visual elevator taking device, computer equipment and a readable storage medium, and aims to solve the technical problem that timeliness cannot be guaranteed due to the fact that an unknown waiting time exists for a user in an existing elevator taking mode.
In a first aspect, the present application provides a visual elevator taking method, including:
when a user elevator taking request is received, extracting the current floor where the user is located from the elevator taking request;
collecting images of each elevator taking area in the current floor, and determining the number of people to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area;
acquiring state information of each elevator, and determining the time length required by each elevator to reach the current floor according to the state information of each elevator;
planning an elevator taking path of the user according to a preset shortest path algorithm by combining the number of people to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor;
and rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
In a second aspect, the present application further provides a visual elevator taking device, including:
the system comprises an extraction module, a control module and a display module, wherein the extraction module is used for extracting a current floor where a user is located from an elevator taking request when the elevator taking request of the user is received;
the first determining module is used for acquiring images of each elevator taking area in the current floor and determining the number of people waiting to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area;
the second determining module is used for acquiring the state information of each elevator and determining the time length required by each elevator to reach the current floor according to the state information of each elevator;
the planning module is used for planning the elevator taking path of the user according to a preset shortest path algorithm by combining the number of people waiting for taking the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area;
and the rendering module is used for rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
In a third aspect, the present application further provides a computer device comprising a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the visual elevator taking method as described above.
In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, where the computer program, when executed by a processor, implements the visual elevator taking method as described above.
The application discloses a visual elevator taking method, a visual elevator taking device, computer equipment and a readable storage medium, the visual elevator taking method comprises the steps of extracting the current floor where a user is located from an elevator taking request when the elevator taking request of the user is received, then collecting the images of each elevator taking area in the current floor, determining the number of people waiting for taking the elevator corresponding to each elevator taking area according to the images of each elevator taking area, then obtaining the state information of each elevator, determining the time required by each elevator to reach the current floor where the user is located according to the state information of each elevator, further planning the elevator taking path of the user according to a preset shortest path algorithm by combining the number of people to take the elevator corresponding to each elevator taking area and the time required by each elevator to reach the current floor, and finally rendering the navigation route corresponding to the elevator taking path in a pre-established three-dimensional building model for visual presentation. By the mode, when a user needs to take the elevator, the user does not need to arrive at an elevator taking area to wait for taking the elevator randomly or according to habit selection, can directly view the visual navigation route corresponding to the planned elevator taking route in situ, and then can take the elevator along with the visual navigation route, so that the intelligence of taking the elevator is improved, the unknown waiting time is reduced, and the elevator taking experience of the user is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a visual elevator boarding method according to an embodiment of the present application;
fig. 2 is a schematic flow chart of another embodiment of a visual elevator boarding method according to the present application;
fig. 3 is an exemplary diagram illustrating an optimized selection of a path from the user to each elevator riding area according to Dijkstra algorithm according to an embodiment of the visualized elevator riding method of the present application;
fig. 4 is a schematic block diagram of a visualized elevator riding device according to an embodiment of the present application;
fig. 5 is a block diagram schematically illustrating a structure of a computer device according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The flow diagrams depicted in the figures are merely illustrative and do not necessarily include all of the elements and operations/steps, nor do they necessarily have to be performed in the order depicted. For example, some operations/steps may be decomposed, combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
It is to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
The embodiment of the application provides a visual elevator taking method and device, computer equipment and a readable storage medium. The visual elevator taking method is mainly applied to visual elevator taking equipment, the visual elevator taking equipment can be mobile terminals (such as smart phones, portable computers and tablet computers) and terminal equipment with a data processing function, such as servers, and the visual elevator taking equipment carries a visual elevator taking system.
The visual elevator-taking system can be implemented as a part of an H5 application or an H5 application, and is installed in a mobile terminal, so that the mobile terminal has a visual elevator-taking function, and the H5 application refers to an application program developed based on an HTML5(HyperText Markup Language5, a latest revised version of HTML, which is a HyperText Markup Language) technology. The visual elevator taking system can also be realized as a part of a browser with a built-in H5 engine, and is installed in a mobile terminal, so that the mobile terminal has the visual elevator taking function; the visualized elevator taking system can also be applied to a background server of an H5 application and a browser, so that the server provides a visualized elevator taking function for the H5 application or the browser of the mobile terminal.
Some embodiments of the present application will be described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Referring to fig. 1, fig. 1 is a schematic flow chart of a visualized elevator boarding method according to an embodiment of the present application.
As shown in fig. 1, the visual elevator boarding method includes steps S101 to S105.
Step S101, when a user elevator taking request is received, extracting the current floor where the user is located from the elevator taking request.
The visualized elevator riding method is applied to a server as an example for explanation.
In some embodiments, in order to provide a visual experience of taking a flight to a user, a three-dimensional simulation environment corresponding to a building needs to be established in advance, and specifically, before step S101, the method includes: acquiring a building image, and acquiring global information of a static scene and global information of a dynamic scene from the building image; according to the global information of the static scene, carrying out three-dimensional modeling on the static object in the building image to obtain a static object model, and according to the global information of the dynamic scene, carrying out three-dimensional modeling on the dynamic object in the building image to obtain a dynamic object model; and obtaining a building three-dimensional model according to the static object model and the dynamic object model.
The building can be an office building, a shopping mall, a residential building and the like. The building image is obtained through a management terminal, the building image is divided into regions manually at the management terminal, the region of the building image containing a static object is divided into static scene regions, the region containing a dynamic image is divided into dynamic scene regions, the building image after the region division is completed is sent to a server through the management terminal, the server receives the building image after the region division is completed sent by the management terminal, and the global information of the static scene and the global information of the dynamic scene are obtained from the building image after the region division is completed. The static objects comprise walls, floors, stairs, elevator shafts, a plurality of elevator taking areas of all floors and the like, and the global information of the static scene refers to the information of the characteristics, such as color, shape, texture, position and the like, corresponding to the static objects contained in the static scene areas in the building image; the dynamic object comprises an elevator, and the global information of the dynamic scene refers to the information of the characteristics such as color, shape, texture, position and the like corresponding to the dynamic object contained in the dynamic scene area in the building image.
Then, analyzing static objects in the building image and classifying spatial features based on the global information of the static scene, and determining the static objects and the spatial positions of the static objects; and analyzing the dynamic objects in the building image and classifying the spatial features based on the global information of the dynamic scene, and determining the dynamic objects and the spatial positions of the dynamic objects. Then, according to the static object and the space position of the static object, performing 3D modeling on the static object to obtain a static object model in an Obj format; and 3D modeling is carried out on the dynamic object according to the dynamic object and the space position of the dynamic object to obtain a dynamic object model in Fbx format, and it can be understood that the dynamic object model mainly comprises an elevator model, the elevator model can be made into a dynamic model without texture maps when 3D modeling is carried out on the elevator, and meanwhile, a floor selection item control is created for the elevator model to enhance the visual effect and realize smooth browsing and interaction of the elevator model.
And further outputting the static object model and the dynamic object model to an H5 engine according to a preset proportion to obtain a 3D view model (defined as a building three-dimensional model) corresponding to the building, wherein the preset proportion can be flexibly set according to actual needs, and is not limited here. The three-dimensional building model can completely express the spatial distribution of elements in the building, comprises complete building walls, building floors, stairs, elevators and other elements, and has a visualization function. It is also necessary to mark the boarding areas B, C, D, e. corresponding to a plurality of elevators on each floor in the three-dimensional model of the building.
When a user needs to take an elevator, the user does not need to select one elevator taking area randomly or according to habits from the elevator taking areas of the floor where the user is located to immediately go to wait for taking the elevator, the user only needs to use the mobile terminal to open the H5 application or the browser in situ, the H5 application or the browser starts the building three-dimensional model, a floor selection item control is loaded under the elevator model in the building three-dimensional model, and the user selects the current floor where the user is located through clicking operation on the floor selection item control to trigger an elevator taking request. The server receives the elevator taking request of the user and extracts the current floor where the user is located from the elevator taking request of the user.
And S102, acquiring images of each elevator taking area in the current floor, and determining the number of people to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area.
The image acquisition devices (such as cameras) are correspondingly arranged in the elevator taking areas of all floors in the building, and the arrangement positions enable the acquisition ranges of the image acquisition devices to cover the elevator taking areas. When the current floor where the user is located is extracted from the elevator taking request of the user, the image acquisition device is triggered to acquire images of all elevator taking areas in the current floor, so that the number of people waiting to take the elevator in each elevator taking area in the current floor is identified according to the images of all elevator taking areas in the current floor.
In some embodiments, the images of the elevator taking areas include a top view, and the determining the number of people to take the elevator corresponding to each elevator taking area according to the images of the elevator taking areas specifically includes: performing feature extraction on the top view of each elevator taking area to obtain a feature map of each elevator taking area; screening a head-shoulder target frame from the characteristic diagrams of each elevator taking area by adopting a preset classification model; and counting the number of the head and shoulder target frames screened out from each elevator taking area to obtain the number of people to take the elevator corresponding to each elevator taking area.
In consideration of the situation that people to be carried in the elevator carrying area are dense, in order to improve the accuracy of identifying the number of people to be carried in the elevator carrying area, the image acquisition equipment is triggered to acquire the top view of each elevator carrying area in the current floor as the image of each elevator carrying area in the current floor, so that the head and shoulder parts of the people to be carried in the images of each elevator carrying area in the current floor are mainly shown, and the shielding overlapping situation caused by the dense people is effectively eliminated.
For example, after the images of each elevator taking area in the current floor are acquired, a preset Adaboost classifier can be used to extract candidate frames with possible heads and shoulders from the images of each elevator taking area (detect the shape of 'omega'), feature extraction is performed on the candidate frames extracted from the images of each elevator taking area by using a preset convolutional neural network to generate feature maps corresponding to each elevator taking area, then a preset SVM classifier is used to further screen out head and shoulder target frames from the feature maps corresponding to each elevator taking area, and the number of people to be taken in the elevator taking area corresponding to the current floor is determined by counting the number of the head and shoulder target frames screened from the feature maps corresponding to each elevator taking area.
For example, the method may further include performing feature extraction on an image of each elevator taking region in the current floor by using a preset convolutional neural network to obtain a feature map corresponding to each elevator taking region, then performing softxmax classification on the feature map corresponding to each elevator taking region by using a preset SSD classification regression model to obtain a head and shoulder target frame existing in the feature map corresponding to each elevator taking region, and then counting the number of people to be taken in the elevator taking region corresponding to each elevator taking region in the current floor based on the number of the head and shoulder target frames existing in the feature map corresponding to each elevator taking region.
And S103, acquiring the state information of each elevator, and determining the time required for each elevator to reach the current floor according to the state information of each elevator.
And further acquiring the state information of all elevators in the building, and calculating the time of each elevator reaching the current floor where the user is located according to the state information of each elevator.
In some embodiments, the state information includes a current floor number and a stop number of the elevator, and the time length required for each elevator to reach the current floor is determined according to the state information of each elevator, specifically: and calculating the time length required by each elevator to reach the current floor according to the current floor number and the stopping times of each elevator by combining a preset calculation formula T | (m-n) | T + x × T ', wherein T represents the time length required by the elevator to reach the current floor, m represents the current floor number of the elevator, n represents the current floor where the user is located, x represents the stopping times of the elevator, and T' are constant values and respectively represent the time length required by single-floor operation of the elevator and the average time length required by single stopping waiting.
It is understood that the number of times the elevator stops refers to the number of times the elevator needs to stop; the time required by single-layer operation refers to the time required by the elevator to pass through a single floor, can be obtained from the running speed of the elevator and the inter-floor distance, and is generally a constant value; the average time length of waiting required by single stop is the average time length of waiting required by starting the elevator once again after single stop, the average value calculated by the time length of waiting required by historical stop of the elevator can be obtained in advance, the average value can also be obtained by appointed times or periods, and differentiated values are obtained according to different scenes. Such as eight to nine points earlier and five to six points later, taking the average waiting duration of the peak period (the peak period waiting duration is generally longer than the regular period waiting duration).
According to the current floor number and the stopping times of each elevator, the time of each elevator reaching the current floor where the user is located can be calculated by combining the following preset calculation formula:
T＝|(m-n)|*t+x*t′
wherein T represents the time period required for the elevator to reach the current floor;
m represents the current floor number of the elevator;
n represents the current floor where the user is located;
x represents the number of elevator stops;
t and t' are constant values and respectively represent the time length required by single-floor operation of the elevator and the average waiting time length required by single stop.
And step S104, planning the elevator taking path of the user according to a preset shortest path algorithm by combining the number of people waiting for taking the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area.
After the number of people waiting to take the elevator and the time length required for each elevator to reach the current floor where the user is located are obtained, a preset shortest path algorithm is adopted, the number of people waiting to take the elevator and the time length required for each elevator to reach the current floor where the user is located are combined, each path from the position of the user to each elevator taking area is optimally selected, and the elevator taking path of the user is planned based on the optimally selected shortest path.
In some embodiments, as shown in fig. 2, step S104 includes sub-steps S1041 to S1042.
And a substep S1041 of performing optimization selection on the path from the user to each elevator taking region according to a preset Dijkstra algorithm to obtain the shortest path from the user to each elevator taking region.
The preset shortest path algorithm comprises a Dijkstra (Dijkstra) algorithm, which is a typical single-source shortest path algorithm and is proposed in 1959 by dickstra, a netherlands computer scientist, and is a shortest path algorithm from one vertex to other vertexes, and the shortest path problem in the directed graph is solved. The Dijkstra algorithm is mainly characterized in that the Dijkstra algorithm expands outwards layer by taking a starting point as a center until the Dijkstra algorithm expands to an end point. The implementation process of the Dijkstra algorithm comprises the following steps: an array dis is asserted to hold the shortest distances from the source point to the vertices and a set T of vertices for which the shortest path has been found, and initially, the path weight of the origin s is assigned to 0(dis [ s ] ═ 0). If there is a directly reachable edge (s, m) for vertex s, dis [ m ] is set to w (s, m), and the path lengths of all other vertices (where s cannot be directly reached) are set to infinity. Initially, the set T has only vertices s. Then, the minimum value is selected from the dis array, then this value is the shortest path from the source point s to the vertex to which this value corresponds, and this point is added to T, at which point a vertex is completed, then it is necessary to see if the newly added vertex can reach other vertices and to see if the path length through this 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.
Firstly, the position of a user on the current floor is obtained, each path from the position of the user to each elevator taking area is optimized and selected by adopting a Dijkstra algorithm, and the shortest path from the user to each elevator taking area is obtained. It should be noted that the path weight of this step only takes into account the path distance.
For better understanding, the process of optimally selecting each path from the user position to the respective landing zone using Dijkstra's algorithm is described below in connection with the exemplary diagram shown in fig. 2.
Assuming that B, C, D, E four elevator taking areas exist on the current floor where the user is located, each path from the user position A node to B, C, D, E four nodes is optimally selected by adopting Dijkstra algorithm:
1. introducing two sets (S, U), S set containing points for which the shortest path has been found (and the corresponding shortest length), U set containing points for which the shortest path has not been found (and the path of A to that point, note that A- > C is initially ∞ since there is no direct connection, as shown in FIG. 2);
2. initializing two sets, wherein the S set initially has only nodes to be calculated currently, A- > A is 0, the U set initially has A- > B is 4, A- > C is infinity, A- > D is 2, and A- > E is infinity;
3. finding out the point with the shortest path from the U set, and adding an S set, wherein the A- > D is 2;
4. update the U set path, if ('distance from D to B, C, E' + 'AD distance' < 'a to B, C, E'), then update U;
5. and (4) circularly executing the steps 3 and 4 until the traversal is finished, finishing the optimization selection, and obtaining the shortest path from the node A to other nodes, namely obtaining the shortest path from the user to each elevator taking area.
And a substep S1042 of determining the elevator taking route of the user from each shortest route according to the number of people waiting for elevator taking and the time required for each elevator to reach the current floor corresponding to each elevator taking area.
Considering that the shortest path from the user to each elevator taking area only provides convenience for the user on the distance factor, and saves the elevator taking time of the user, therefore, after the shortest path from the user to each elevator taking area is obtained, an optimal path is selected from the shortest paths from the optimally selected user to each elevator taking area by combining the number of people waiting for elevator taking corresponding to each elevator taking area and the time required by each elevator to reach the current floor, and the optimal path is used as the elevator taking path of the user, wherein the more the number of people waiting for elevator taking is, the longer the time required by the elevator to reach the current floor is, the longer the time for the user to wait for the elevator is, and further saving the elevator taking time of the user on the basis of the distance factor and on the time factor of the elevator waiting for the time factor is realized. It can be understood that the end point of the elevator taking path is a target elevator taking area corresponding to the elevator to be taken by the user.
In some embodiments, the step of determining the elevator taking route of the user from each shortest route according to the number of people waiting for elevator taking and the time required for each elevator to reach the current floor corresponding to each elevator taking area includes: scoring each shortest path according to the number of people waiting to take the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area, to obtain a score value of each shortest path; and determining the elevator taking path of the user from each shortest path according to the score value of each shortest path.
After the shortest paths from the users to the elevator taking areas are obtained, the shortest paths from the users to the elevator taking areas can be scored according to two factors of the number of people to take the elevator corresponding to the elevator taking areas and the time required for the elevators to reach the current floors, and therefore one shortest path from the shortest paths from the users to the elevator taking areas is selected as the elevator taking path of the users according to scoring results. Specifically, the scoring is realized by distributing and adding weights, namely, the weight values corresponding to the number of people waiting to take the elevator are preset (using a)1Representing) the weight value (denoted by a) corresponding to the time period required for the elevator to reach the current floor1Represents) a1And a2Is taken to satisfy a1+a21 is enough. Thus, the shortest distance from the user to each elevator taking area can be calculated according to the following scoring calculation formulaScoring value corresponding to the path:
y＝a1T+a2X
wherein y represents the score value, T represents the time required for the elevator to reach the current floor where the user is located, and X represents the number of people waiting to take the elevator in the elevator taking area.
The scoring values corresponding to the shortest paths from the users to each elevator taking area are arranged from large to small, the higher the scoring value is, the longer the time of the elevator such as the users is, and therefore the shortest path with the minimum scoring value is selected to serve as the elevator taking path of the users.
In some embodiments, the planning an elevator taking path of the user according to a preset shortest path algorithm by combining the number of people waiting to take the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area, specifically includes: configuring the path weight from the user to each elevator taking area according to the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor; and replacing corresponding path distances in a preset Dijkstra algorithm with the path weights from the users to the elevator taking areas for operation, so as to select a path corresponding to the minimum path weight as the elevator taking path of the users.
Unlike the aforementioned way in which the path weight only considers the path distance, the path weight in this embodiment not only considers the path distance, but also considers two factors, i.e., the number of people waiting to take the elevator and the time required for each elevator to reach the current floor, corresponding to each elevator-taking area. Specifically, the path weight from the user to each elevator taking area is configured according to the number of people waiting for elevator taking and the time required for each elevator to reach the current floor corresponding to each elevator taking area and by combining the path distance. The configuration of the path weight is realized by distributing and adding the weight, namely, the weight value corresponding to the path distance is preset (by w)1Indicating), weight value (by w) corresponding to the number of persons waiting to take the elevator2Represented) and the weight value (in w) corresponding to the time required for the elevator to reach the current floor3Represents) w1、w2And w3Is taken to satisfy w1+w2+w3This is true for 1, and thus a common is calculated from the path weights shown belowCalculating the path weight of the user to each elevator taking area by the formula:
z＝w1L+w2T+w3X
wherein z represents the path weight, L represents the path distance, T represents the time required by the elevator to reach the current floor where the user is located, and X represents the number of people waiting to take the elevator in the elevator taking area.
And then, replacing the corresponding path distance in the Dijkstra algorithm by the path weight to perform the operation of improving the Dijkstra algorithm, and selecting the path corresponding to the minimum path weight as the elevator taking path of the user.
And S105, rendering a navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
After the elevator taking path of the user is obtained, a navigation route corresponding to the elevator taking path can be rendered in a building three-dimensional model started by an H5 application or a browser for visual display, and the user is guided to go to take the elevator. Therefore, the intelligent elevator taking device has the advantages that the intelligent elevator taking is realized, the elevator taking time can be saved for users, and convenience is brought to the users.
In the visual elevator taking method provided by the embodiment, when an elevator taking request of a user is received, the current floor where the user is located is extracted from the elevator taking request, then, images of each elevator taking area in the current floor are collected, the number of persons to be taken in each elevator taking area is determined according to the images of each elevator taking area, state information of each elevator is obtained, the time required for each elevator to reach the current floor where the user is located is determined according to the state information of each elevator, the elevator taking path of the user is planned according to a preset shortest path algorithm by combining the number of persons to be taken in each elevator taking area and the time required for each elevator to reach the current floor, and finally, a navigation route corresponding to the elevator taking path is rendered in a pre-established building three-dimensional model for visual presentation. By the mode, when a user needs to take the elevator, the user does not need to arrive at an elevator taking area to wait for taking the elevator randomly or according to habit selection, can directly view the visual navigation route corresponding to the planned elevator taking path in situ, and then can take the elevator along with the visual navigation route, so that the intelligence of taking the elevator is improved, the unknown waiting time of the user is reduced, and the elevator taking experience of the user is improved.
Referring to fig. 4, fig. 4 is a schematic block diagram of a visual elevator riding device according to an embodiment of the present application.
As shown in fig. 4, the apparatus 400 includes: an extraction module 401, a first determination module 402, a second determination module 403, a planning module 404 and a rendering module 405.
The extraction module 401 is configured to, when an elevator taking request of a user is received, extract a current floor where the user is located from the elevator taking request;
a first determining module 402, configured to collect images of each elevator taking area in the current floor, and determine, according to the images of each elevator taking area, the number of people to take the elevator corresponding to each elevator taking area;
a second determining module 403, configured to obtain status information of each elevator, and determine, according to the status information of each elevator, a time period required for each elevator to reach the current floor;
a planning module 404, configured to plan an elevator taking path of the user according to a preset shortest path algorithm, by combining the number of people to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor;
and the rendering module 405 is configured to render the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
It should be noted that, as will be clear to those skilled in the art, for convenience and brevity of description, the specific working processes of the apparatus and the modules and units described above may refer to the corresponding processes in the foregoing visual elevator riding method embodiment, and are not described herein again.
The apparatus provided by the above embodiments may be implemented in the form of a computer program that can be run on a computer device as shown in fig. 5.
Referring to fig. 5, fig. 5 is a schematic block diagram of a computer device according to an embodiment of the present disclosure. The computer device may be a Personal Computer (PC), a server, or the like having a data processing function.
As shown in fig. 5, the computer device includes a processor, a memory, and a network interface connected by a system bus, wherein the memory may include a nonvolatile storage medium and an internal memory.
The non-volatile storage medium may store an operating system and a computer program. The computer program includes program instructions that, when executed, cause a processor to perform any one of the visual boarding methods.
The processor is used for providing calculation and control capability and supporting the operation of the whole computer equipment.
The internal memory provides an environment for running a computer program in the non-volatile storage medium, which when executed by the processor causes the processor to perform any one of the visual elevator boarding methods.
The network interface is used for network communication, such as sending assigned tasks and the like. Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
It should be understood that the Processor may be a Central Processing Unit (CPU), and the Processor may be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Wherein, in one embodiment, the processor is configured to execute a computer program stored in the memory to implement the steps of:
when a user elevator taking request is received, extracting the current floor where the user is located from the elevator taking request; collecting images of each elevator taking area in the current floor, and determining the number of people to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area; acquiring state information of each elevator, and determining the time length required by each elevator to reach the current floor according to the state information of each elevator; planning an elevator taking path of the user according to a preset shortest path algorithm by combining the number of people to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor; and rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
In some embodiments, the state information includes a current floor number and a stop number of the elevator, and the processor is configured to, when determining a time period required for each elevator to reach the current floor according to the state information of each elevator, implement:
and calculating the time length required by each elevator to reach the current floor according to the current floor number and the stopping times of each elevator by combining a preset calculation formula T | (m-n) | T + x × T ', wherein T represents the time length required by the elevator to reach the current floor, m represents the current floor number of the elevator, n represents the current floor where the user is located, x represents the stopping times of the elevator, and T' are constant values and respectively represent the time length required by single-floor operation of the elevator and the average time length required by single stopping waiting.
In some embodiments, the processor is configured to, when planning the elevator taking route of the user according to the preset shortest path algorithm by combining the number of people waiting to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor, implement:
carrying out optimization selection on the path from the user to each elevator taking area according to a preset Dijkstra algorithm to obtain the shortest path from the user to each elevator taking area;
and determining the elevator taking path of the user from each shortest path according to the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor.
In some embodiments, the processor is configured to determine an elevator taking route of the user from each shortest route according to the number of people waiting for taking the elevator and the time required for each elevator to reach the current floor corresponding to each elevator taking area, and is configured to:
scoring each shortest path according to the number of people waiting to take the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area, to obtain a score value of each shortest path;
and determining the elevator taking path of the user from each shortest path according to the score value of each shortest path.
In some embodiments, the processor is configured to, when planning the elevator taking route of the user according to the preset shortest path algorithm by combining the number of people waiting to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor, implement:
configuring the path weight from the user to each elevator taking area according to the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor;
and replacing corresponding path distances in a preset Dijkstra algorithm with the path weights from the users to the elevator taking areas for operation, so as to select a path corresponding to the minimum path weight as the elevator taking path of the users.
In some embodiments, the image includes a top view, and the processor, when determining the number of people to take the elevator corresponding to each elevator taking area according to the image of each elevator taking area, is configured to:
performing feature extraction on the top view of each elevator taking area to obtain a feature map of each elevator taking area;
screening a head-shoulder target frame from the characteristic diagrams of each elevator taking area by adopting a preset classification model;
and counting the number of the head and shoulder target frames screened out from each elevator taking area to obtain the number of people to take the elevator corresponding to each elevator taking area.
In some embodiments, the processor implements the following steps before extracting the current floor where the user is located from the elevator taking request when the elevator taking request of the user is received:
acquiring a building image, and acquiring global information of a static scene and global information of a dynamic scene from the building image;
according to the global information of the static scene, carrying out three-dimensional modeling on the static object in the building image to obtain a static object model, and according to the global information of the dynamic scene, carrying out three-dimensional modeling on the dynamic object in the building image to obtain a dynamic object model;
and obtaining a building three-dimensional model according to the static object model and the dynamic object model.
Embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, where the computer program includes program instructions, and when the program instructions are executed, a method implemented by the computer program instructions may refer to various embodiments of the visualized elevator taking method of the present application.
The computer-readable storage medium may be an internal storage unit of the computer device described in the foregoing embodiment, for example, a hard disk or a memory of the computer device. The computer readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device.
Further, the computer-readable storage medium may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the blockchain node, and the like.
The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments. While the invention has been described with reference to specific embodiments, the scope of the invention is not limited thereto, and those skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A visual elevator boarding method, characterized in that the method comprises the following steps:
when a user elevator taking request is received, extracting the current floor where the user is located from the elevator taking request;
collecting images of each elevator taking area in the current floor, and determining the number of people to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area;
acquiring state information of each elevator, and determining the time length required by each elevator to reach the current floor according to the state information of each elevator;
planning an elevator taking path of the user according to a preset shortest path algorithm by combining the number of people to take the elevator corresponding to each elevator taking area and the time required for each elevator to reach the current floor;
and rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
2. The visual elevator taking method according to claim 1, wherein the state information comprises the current floor number and the number of stops of the elevator;
the determining a time period required for each elevator to reach the current floor according to the state information of each elevator comprises:
and calculating the time length required by each elevator to reach the current floor according to the current floor number and the stopping times of each elevator by combining a preset calculation formula T | (m-n) | T + x × T ', wherein T represents the time length required by the elevator to reach the current floor, m represents the current floor number of the elevator, n represents the current floor where the user is located, x represents the stopping times of the elevator, and T' are constant values and respectively represent the time length required by single-floor operation of the elevator and the average time length required by single stopping waiting.
3. The visual elevator taking method according to claim 1, wherein the planning of the elevator taking route of the user according to a preset shortest path algorithm by combining the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor comprises:
carrying out optimization selection on the path from the user to each elevator taking area according to a preset Dijkstra algorithm to obtain the shortest path from the user to each elevator taking area;
and determining the elevator taking path of the user from each shortest path according to the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor.
4. The visual elevator taking method according to claim 3, wherein the step of determining the elevator taking path of the user from each shortest path according to the number of people waiting for elevator taking and the time required for each elevator to reach the current floor, which correspond to each elevator taking area, comprises:
scoring each shortest path according to the number of people waiting to take the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area, to obtain a score value of each shortest path;
and determining the elevator taking path of the user from each shortest path according to the score value of each shortest path.
5. The visual elevator taking method according to claim 1, wherein the planning of the elevator taking route of the user according to a preset shortest path algorithm by combining the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor comprises:
configuring the path weight from the user to each elevator taking area according to the number of people waiting for elevator taking corresponding to each elevator taking area and the time required for each elevator to reach the current floor;
and replacing corresponding path distances in a preset Dijkstra algorithm with the path weights from the users to the elevator taking areas for operation, so as to select a path corresponding to the minimum path weight as the elevator taking path of the users.
6. The visual boarding method of claim 1, wherein the image comprises a top view;
the determining the number of people to take the elevator, corresponding to each elevator taking area, according to the images of the elevator taking areas comprises the following steps:
performing feature extraction on the top view of each elevator taking area to obtain a feature map of each elevator taking area;
screening a head-shoulder target frame from the characteristic diagrams of each elevator taking area by adopting a preset classification model;
and counting the number of the head and shoulder target frames screened out from each elevator taking area to obtain the number of people to take the elevator corresponding to each elevator taking area.
7. The visual elevator taking method according to claim 1, wherein when a user elevator taking request is received, extracting a floor before the current floor where the user is located from the elevator taking request comprises:
acquiring a building image, and acquiring global information of a static scene and global information of a dynamic scene from the building image;
according to the global information of the static scene, carrying out three-dimensional modeling on the static object in the building image to obtain a static object model, and according to the global information of the dynamic scene, carrying out three-dimensional modeling on the dynamic object in the building image to obtain a dynamic object model;
and obtaining a building three-dimensional model according to the static object model and the dynamic object model.
8. A visual elevator riding device is characterized by comprising:
the system comprises an extraction module, a control module and a display module, wherein the extraction module is used for extracting a current floor where a user is located from an elevator taking request when the elevator taking request of the user is received;
the first determining module is used for acquiring images of each elevator taking area in the current floor and determining the number of people waiting to take the elevator corresponding to each elevator taking area according to the images of each elevator taking area;
the second determining module is used for acquiring the state information of each elevator and determining the time length required by each elevator to reach the current floor according to the state information of each elevator;
the planning module is used for planning the elevator taking path of the user according to a preset shortest path algorithm by combining the number of people waiting for taking the elevator and the time required for each elevator to reach the current floor, which correspond to each elevator taking area;
and the rendering module is used for rendering the navigation route corresponding to the elevator taking path in a pre-established building three-dimensional model for visual display.
9. A computer arrangement, characterized in that the computer arrangement comprises a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein the computer program, when executed by the processor, carries out the steps of the visual boarding method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, wherein the computer program, when being executed by a processor, carries out the steps of the visual boarding method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110708161.6A CN113436329A (en) | 2021-06-24 | 2021-06-24 | Visual elevator taking method and device, computer equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110708161.6A CN113436329A (en) | 2021-06-24 | 2021-06-24 | Visual elevator taking method and device, computer equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113436329A true CN113436329A (en) | 2021-09-24 |
Family
ID=77754193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110708161.6A Pending CN113436329A (en) | 2021-06-24 | 2021-06-24 | Visual elevator taking method and device, computer equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113436329A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113872850A (en) * | 2021-09-27 | 2021-12-31 | 东莞市亚太未来软件有限公司 | Real-time communication method and system |
| CN113887842A (en) * | 2021-12-03 | 2022-01-04 | 浙江慧享信息科技有限公司 | Intelligent ladder-contracting method, system and equipment based on ant colony algorithm |
| CN116975394A (en) * | 2023-09-22 | 2023-10-31 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103287939A (en) * | 2012-02-24 | 2013-09-11 | 东芝电梯株式会社 | Apparatus for measuring number of people in elevator, elevator having the apparatus, and elevator system including a plurality of elevators with the apparatus |
| CN107289923A (en) * | 2016-04-01 | 2017-10-24 | 奥的斯电梯公司 | Boarding navigation terminal, system and method in building |
| US20180101873A1 (en) * | 2016-10-12 | 2018-04-12 | International Business Machines Corporation | Elevator multimedia information display |
| CN109489662A (en) * | 2018-09-26 | 2019-03-19 | 中国平安人寿保险股份有限公司 | Boarding guidance method, device, computer equipment and storage medium |
| CN110342355A (en) * | 2019-07-12 | 2019-10-18 | 苏州健雄职业技术学院 | A kind of intelligent building elevator dispatching plateform system and its working method |
| CN111559677A (en) * | 2020-07-20 | 2020-08-21 | 北京云迹科技有限公司 | Multi-elevator transfer method and device |
| CN112465211A (en) * | 2020-11-24 | 2021-03-09 | 北京交通大学 | Rail transit train full load rate control method and application |
| CN112698647A (en) * | 2020-12-14 | 2021-04-23 | 深圳市普渡科技有限公司 | Cross-floor path planning method and device, computer equipment and storage medium |
-
2021
- 2021-06-24 CN CN202110708161.6A patent/CN113436329A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103287939A (en) * | 2012-02-24 | 2013-09-11 | 东芝电梯株式会社 | Apparatus for measuring number of people in elevator, elevator having the apparatus, and elevator system including a plurality of elevators with the apparatus |
| CN107289923A (en) * | 2016-04-01 | 2017-10-24 | 奥的斯电梯公司 | Boarding navigation terminal, system and method in building |
| US20180101873A1 (en) * | 2016-10-12 | 2018-04-12 | International Business Machines Corporation | Elevator multimedia information display |
| CN109489662A (en) * | 2018-09-26 | 2019-03-19 | 中国平安人寿保险股份有限公司 | Boarding guidance method, device, computer equipment and storage medium |
| CN110342355A (en) * | 2019-07-12 | 2019-10-18 | 苏州健雄职业技术学院 | A kind of intelligent building elevator dispatching plateform system and its working method |
| CN111559677A (en) * | 2020-07-20 | 2020-08-21 | 北京云迹科技有限公司 | Multi-elevator transfer method and device |
| CN112465211A (en) * | 2020-11-24 | 2021-03-09 | 北京交通大学 | Rail transit train full load rate control method and application |
| CN112698647A (en) * | 2020-12-14 | 2021-04-23 | 深圳市普渡科技有限公司 | Cross-floor path planning method and device, computer equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 于泉;姚宗含;: "动态重规划的多目标路径产生方法研究", 交通运输工程与信息学报, no. 04 * |
| 石美;: "电梯群的算法及优化", 无线互联科技, no. 13 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113872850A (en) * | 2021-09-27 | 2021-12-31 | 东莞市亚太未来软件有限公司 | Real-time communication method and system |
| CN113887842A (en) * | 2021-12-03 | 2022-01-04 | 浙江慧享信息科技有限公司 | Intelligent ladder-contracting method, system and equipment based on ant colony algorithm |
| CN116975394A (en) * | 2023-09-22 | 2023-10-31 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
| CN116975394B (en) * | 2023-09-22 | 2023-12-19 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113436329A (en) | Visual elevator taking method and device, computer equipment and readable storage medium | |
| US10083517B2 (en) | Segmentation of an image based on color and color differences | |
| CN110008808B (en) | Panorama segmentation method, device and system and storage medium | |
| Roh et al. | An object-based 3D walk-through model for interior construction progress monitoring | |
| KR102160990B1 (en) | Server and method for 3d city modeling based on object, and system using the same | |
| JP2022511491A (en) | Generation of integrated circuit floor plans using neural networks | |
| CN109409612B (en) | Path planning method, server and computer storage medium | |
| KR102365967B1 (en) | Recommendation method and system using content containing location data | |
| KR102216749B1 (en) | Method, apparatus and computer program for coloring of a target image | |
| Alatalo et al. | VirtualOulu: collaborative, immersive and extensible 3D city model on the web | |
| CN114758337B (en) | Semantic instance reconstruction method, device, equipment and medium | |
| US11887224B2 (en) | Method, apparatus, and computer program for completing painting of image, and method, apparatus, and computer program for training artificial neural network | |
| CN107506499A (en) | The method, apparatus and server of logical relation are established between point of interest and building | |
| US20220035974A1 (en) | Movement route prediction system, movement route prediction method, and recording medium | |
| CN110378947A (en) | 3D model reconstruction method, device and electronic equipment | |
| US20220276058A1 (en) | Systems and methods for utilizing modeling to automatically generate paths for indoor navigation | |
| CN112328880A (en) | Geographical region clustering method and device, storage medium and electronic equipment | |
| Adreani et al. | A photorealistic 3D city modeling framework for smart city digital twin | |
| Adreani et al. | Implementing integrated digital twin modelling and representation into the Snap4City platform for smart city solutions | |
| CN111199440A (en) | Event prediction method and device and electronic equipment | |
| Shariatpour et al. | Urban 3D Modeling as a Precursor of City Information Modeling and Digital Twin for Smart City Era: A Case Study of the Narmak Neighborhood of Tehran City, Iran | |
| CN112734900A (en) | Baking method, baking device, baking equipment and computer-readable storage medium of shadow map | |
| CN113989680B (en) | Automatic building three-dimensional scene construction method and system | |
| CN113468626B (en) | Drawing generation method and device, electronic equipment and storage medium | |
| Adreani et al. | Rendering 3D city for smart city digital twin |
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 |