CN112541987A - Electronic patrol route generation method and device and computer storage medium - Google Patents
Electronic patrol route generation method and device and computer storage medium Download PDFInfo
- Publication number
- CN112541987A CN112541987A CN202011495196.8A CN202011495196A CN112541987A CN 112541987 A CN112541987 A CN 112541987A CN 202011495196 A CN202011495196 A CN 202011495196A CN 112541987 A CN112541987 A CN 112541987A
- Authority
- CN
- China
- Prior art keywords
- route
- patrol
- node
- target
- point
- 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
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C1/00—Registering, indicating or recording the time of events or elapsed time, e.g. time-recorders for work people
- G07C1/20—Checking timed patrols, e.g. of watchman
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Remote Sensing (AREA)
- Navigation (AREA)
Abstract
The embodiment of the application discloses a method and a device for generating an electronic patrol route and a computer storage medium, which are used for automatically generating the electronic patrol route so as to improve building management efficiency and guarantee building safety. The embodiment of the application comprises the following steps: and sequentially determining each patrol point of the target floor as a route node, sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequential determination sequence according to the sequential determination sequence to form an initial patrol route, determining a target node with the shortest distance from the nth route node in the initial patrol route, and connecting the nth route node to the target node in the initial patrol route, so that the nth route node is added into the initial patrol route to obtain the target patrol route. The automatic generation of the electronic patrol route is realized, a manager of the building can execute an actual patrol task according to the automatically generated patrol route, the patrol route is not required to be designed manually, and the patrol efficiency and the floor management efficiency are greatly improved.
Description
Technical Field
The embodiment of the application relates to the field of night patrol management, in particular to a method and a device for generating an electronic night patrol route and a computer storage medium.
Background
Electronic tours are a means for managers to investigate whether a patrol person will travel a route to a specified location at a specified time. Compared with the traditional patrol, in the field of electronic patrol, each floor of a building is respectively provided with a plurality of Bluetooth or radio frequency identification RFID devices, and patrol personnel use electronic equipment to check in at patrol points, so that patrol operation is recorded.
In the existing electronic patrol method, a patrol task is generated according to an electronic patrol route and a patrol schedule, the generated patrol task is issued to a target patrol user, a patrol record uploaded by the target patrol user is received, and the execution condition of the patrol task can be confirmed according to the patrol record.
However, the existing electronic patrol method cannot automatically generate an electronic patrol route, and cannot effectively arrange patrol tasks in the building management process, so that patrol efficiency is low, building management capacity is poor, and building safety guarantee is not in place.
Therefore, a technical solution capable of automatically generating an electronic patrol route is needed to improve building management efficiency and guarantee building safety.
Disclosure of Invention
The embodiment of the application provides an electronic patrol route generation method, an electronic patrol route generation device and a computer storage medium, which are used for automatically generating an electronic patrol route so as to improve building management efficiency and guarantee building safety.
A first aspect of the embodiments of the present application provides a method for generating an electronic patrol route, including:
acquiring a floor plan of a target floor of a target building, wherein the floor plan is marked with a plurality of point locations, and the plurality of point locations comprise n night patrol points of the target floor; wherein n is a positive integer greater than 1;
according to the sequence, sequentially determining each patrol point as a route node to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route;
determining a target node with the shortest distance to the nth route node in the initial patrol route;
and connecting the nth route node with a target node in the initial patrol route so as to enable the nth route node to be added into the initial patrol route to obtain a target patrol route.
A second aspect of the embodiments of the present application provides an electronic patrol route generation apparatus, including:
the system comprises an acquisition unit, a storage unit and a processing unit, wherein the acquisition unit is used for acquiring a floor plan of a target floor of a target building, the floor plan is marked with a plurality of point positions, and the plurality of point positions comprise n night watching points of the target floor; wherein n is a positive integer greater than 1;
the first determining unit is used for sequentially determining each patrol point as a route node according to a sequence determining order to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route;
a second determining unit, configured to determine a target node in the initial patrol route, where the distance from the nth route node is shortest;
and the generating unit is used for connecting the nth route node with a target node in the initial patrol route so as to enable the nth route node to be added into the initial patrol route to obtain the target patrol route.
A third aspect of the embodiments of the present application provides an electronic patrol route generation apparatus, including:
a processor, a memory, an input and output device;
the processor is connected with the memory and the input and output equipment;
the processor is used for acquiring a floor plan of a target floor of a target building, wherein the floor plan is marked with a plurality of point positions, and the plurality of point positions comprise n night watching points of the target floor; wherein n is a positive integer greater than 1; according to the sequence, sequentially determining each patrol point as a route node to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route; determining a target node with the shortest distance to the nth route node in the initial patrol route; and connecting the nth route node with a target node in the initial patrol route so as to enable the nth route node to be added into the initial patrol route to obtain a target patrol route.
A fourth aspect of embodiments of the present application provides a computer storage medium having instructions stored therein, which when executed on a computer, cause the computer to perform the method of the first aspect.
A fifth aspect of embodiments of the present application provides a computer device, including a memory and a processor, where the memory stores a computer program, and the processor implements the method of the first aspect when executing the computer program.
According to the technical scheme, the embodiment of the application has the following advantages:
in the embodiment of the application, each patrol point of a target floor is sequentially determined as a route node by the electronic patrol route generation device, the 1 st route node to the n-1 st route node determined based on the sequential determination sequence are sequentially connected according to the sequential determination sequence to form an initial patrol route, a target node with the shortest distance from the nth route node in the initial patrol route is determined, and the nth route node is connected with the target node in the initial patrol route, so that the nth route node is added into the initial patrol route to obtain a complete target patrol route.
Drawings
Fig. 1 is a schematic flow chart of a method for generating an electronic patrol route in an embodiment of the present application;
FIG. 2 is another schematic flow chart illustrating a method for generating an electronic patrol route according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic patrol route generation device in the embodiment of the present application;
fig. 4 is another schematic structural diagram of the electronic patrol route generating device in the embodiment of the present application.
Detailed Description
The embodiment of the application provides an electronic patrol route generation method, an electronic patrol route generation device and a computer storage medium, which are used for automatically generating an electronic patrol route so as to improve building management efficiency and guarantee building safety.
Referring to fig. 1, an embodiment of a method for generating an electronic patrol route in an embodiment of the present application includes:
101. acquiring a floor plan of a target floor of a target building;
the method of the present embodiment is applicable to an electronic patrol route generation apparatus, which may be a server, a terminal, or the like, capable of performing data processing. When the device is a terminal, the device can be a Personal Computer (PC), a desktop computer and other terminal equipment; when the server is a server, the server can be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, and a cloud server for providing basic cloud computing services such as a cloud database, cloud computing, a big data and artificial intelligence platform and the like.
The electronic patrol route generating device may be used to plan and generate an electronic patrol route for a target floor of a target building. When generating the patrol route of the target floor, importing a floor plan of the target floor into the electronic patrol route generating device, wherein the floor plan is labeled with a plurality of points in advance, the points comprise n patrol points of the target floor, and n is a positive integer greater than 1. After the electronic patrol route generation device acquires the floor plan of the target floor, in the subsequent steps, a target patrol route of the target floor is generated according to the floor plan. The manager of the target building can perform an actual patrol operation according to the target patrol route and select an optimal patrol route from among the plurality of target patrol routes according to the patrol effect.
102. According to the sequence, sequentially determining each patrol point as a route node to obtain n route nodes;
the electronic patrol route generation device determines each patrol point in the floor plan of the target floor as a route node in turn according to the sequence of the route nodes, and the route node is a node in the target patrol route, so that n route nodes are obtained. In this embodiment, since there is a determination order between each route node, the n route nodes may be sorted based on the determination order, so as to determine the 1 st route node to the nth route node. And the 1 st route node to the n-1 st route node determined based on the sequence determination order are sequentially connected according to the sequence determination order to form an initial patrol route, namely the 1 st route node is connected with the 2 nd route node, the 2 nd route node is connected with the 3 rd route node … …, and the like until the 1 st route node is connected with the n-1 st route node, so that the initial patrol route is obtained.
103. Determining a target node with the shortest distance to the nth route node in the initial patrol route;
and calculating the distance between each route node in the initial patrol route and the nth route node, and determining a target node with the shortest distance between the nth route node and the initial patrol route.
104. Connecting the nth route node with a target node in the initial patrol route so that the nth route node is added into the initial patrol route to obtain a target patrol route;
after the target node in the initial patrol route is determined, the nth route node is connected with the target node in the initial patrol route, so that the nth route node is added into the initial patrol route, all patrol points of the target floor are connected into a complete patrol route at the moment, and the target patrol route is obtained.
In this embodiment, the electronic patrol route generating device sequentially determines each patrol point of the target floor as a route node, and the 1 st route node to the n-1 st route node determined based on the sequential determination order are sequentially connected according to the sequential determination order to form an initial patrol route, determine a target node in the initial patrol route, which is the shortest in distance from the nth route node, and connect the nth route node to the target node in the initial patrol route, so that the nth route node is added to the initial patrol route to obtain a complete target patrol route.
The embodiments of the present application will be described in further detail below on the basis of the aforementioned embodiment shown in fig. 1. Referring to fig. 2, another embodiment of the method for generating an electronic patrol route according to the embodiment of the present application includes:
201. acquiring a floor plan of a target floor of a target building;
in this embodiment, the floor plan of the target floor may be labeled with patrol points in advance, the labeled patrol points may be labeled manually or by an electronic patrol route generating device, that is, the electronic patrol route generating device may deploy a pre-trained network model in advance, the pre-trained network model may perform target detection and classification on the floor plan, the detected targets may include position targets such as a floor entrance and exit position and a floor corridor passageway in the floor plan, and the detected targets are determined as patrol points, thereby achieving labeling of patrol points.
After the floor plan is imported, a coordinate system can also be established based on the floor plan, and the coordinates of the night patrol point in the coordinate system are determined. The coordinates of the patrol points can be used to calculate the distance between the patrol points in a subsequent step.
202. According to the sequence, sequentially determining each patrol point as a route node to obtain n route nodes;
in this embodiment, the plurality of points pre-labeled by the floor plan include a route planning starting point in addition to the n patrol points, and the route planning starting point may be an exit point of the target floor or an entry point of the target floor. Therefore, when the patrol point is determined as the route node, the 1 st route node is the patrol point with the shortest distance from the route planning starting point in the n patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the n patrol points, and the remaining patrol points of the n patrol points comprise patrol points which are not determined as the route nodes currently in the n patrol points.
For example, assuming that 4 patrol points (assumed as A, B, C, D four points) and route planning starting points are marked in the floor plan, when determining the 1 st route node, the distance between each patrol point and the route planning starting point is calculated, and assuming that the distance between the B point and the route planning starting point is shortest, the B point is the 1 st route node; next, 2 nd route node is determined, the distance from B point in the remaining night patrol points (i.e. A, C, D points) of the 4 night patrol points is calculated, and assuming that the distance between D point and B point is shortest, D point is 2 nd route node … … and so on, and 3 rd and 4 th route nodes are determined respectively.
The route nodes are determined based on the condition that only one route planning starting point exists, or an entry point of a target floor and an exit point of the target floor can be simultaneously used as the route planning starting points, when the route nodes are determined, n patrol points in a floor plan are divided into two groups, wherein the number of the patrol points in one group is m, and the patrol points in the m groups correspond to the entry points of the target floor; the number of the other polling points is k, and the k polling points correspond to the exit points of the target floors. Sequentially determining each patrol point in the m patrol points as a route node corresponding to the entry point to obtain m route nodes corresponding to the entry point; and sequentially determining each patrol point in the k patrol points as a route node corresponding to the exit point to obtain k route nodes corresponding to the exit point. Wherein m + k is n and m and k are both positive integers greater than 1.
In one embodiment of determining the patrol points as the route nodes, the 1 st route node of the m route nodes corresponding to the entry point is a patrol point with the shortest distance from the entry point of the m patrol points, and after the 1 st route node is determined, the route node determined each time is a patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the m patrol points, and the remaining patrol points of the m patrol points include patrol points which are not currently determined as route nodes in the m patrol points.
Similarly, the 1 st route node of the k route nodes corresponding to the exit point is the routing point with the shortest distance to the exit point in the k routing points, and after the 1 st route node is determined, the route node determined each time is the routing point with the shortest distance to the route node determined last time in the remaining routing points of the k routing points, and the remaining routing points of the k routing points include routing points which are not currently determined as route nodes in the k routing points.
For example, assume that 8 patrol points (assume points a to H) are marked in the floor plan, and the 8 patrol points are equally divided into two dials, with points a to D corresponding to the entry points of the target floor and points E to H corresponding to the exit points of the target floor. When determining the route node corresponding to the entry point, the 1 st route node corresponding to the entry point is the patrol point (assumed to be point B) with the shortest distance to the entry point among the 4 patrol points from point a to point D, the 2 nd route node is the patrol point … … with the shortest distance to point B among the 3 patrol points from point a, point C and point D, and so on, and the 3 rd and 4 th route nodes corresponding to the entry point can be determined respectively.
Similarly, when the route node corresponding to the exit point is determined, the 1 st route node corresponding to the exit point is the patrol point (assumed to be point E) with the shortest distance from the exit point among the 4 patrol points from point E to point H, the 2 nd route node is the patrol point … … with the shortest distance from point E among the 3 patrol points of points F, G and point H, and so on, and the 3 rd and 4 th route nodes corresponding to the exit point can be respectively determined.
After the route nodes corresponding to the entry points are determined, the 1 st route node to the m-1 st route node determined based on the sequence determined in the m route nodes corresponding to the entry points are sequentially connected according to the sequence determined in order to form a first initial patrol route, namely, the 1 st route node is connected with the 2 nd route node, the 2 nd route node is connected with the 3 rd route node … …, and so on until the m-1 st route node is connected, so that the first initial patrol route is obtained.
After the route nodes corresponding to the exit points are determined, the 1 st route node to the (k-1) th route node determined based on the sequence determined in the k route nodes corresponding to the exit points are sequentially connected according to the sequence determined in the sequence.
In this embodiment, the way of calculating the distance between the patrol points and the route planning starting point may be calculating the distance according to the coordinates of the patrol points and the coordinates of the route planning starting point, or calculating the distance according to a map scale of a floor plan, and the way of calculating the distance between the patrol points and the route planning starting point is not limited.
203. Determining a target node with the shortest distance to the nth route node in the initial patrol route;
in this embodiment, when the route planning starting point is only an entry point of a target floor or an exit point of the target floor, each patrol point in the floor plan of the target floor is sequentially determined as a route node, and a 1 st route node to an n-1 st route node determined based on a sequential determination order are sequentially connected according to the sequential determination order to form an initial patrol route, where the initial patrol route includes n-1 route nodes, and a target node in the initial patrol route, which is the shortest in distance from the n-th route node, is determined.
When the entry point of the target floor and the exit point of the target floor are both route planning starting points, as can be seen from step 202, route nodes are determined based on the entry point and the exit point, respectively, and a first initial patrol route and a second initial patrol route are obtained. Then, a target node in the first initial patrol route, which is the shortest in distance from the mth route node, is determined, and a target node in the second initial patrol route, which is the shortest in distance from the kth route node, is determined.
204. Connecting the nth route node with a target node in the initial patrol route so that the nth route node is added into the initial patrol route to obtain a target patrol route;
when the route planning starting point is only the entry point of the target floor or the exit point of the target floor, after the target node with the shortest distance to the nth route node in the initial patrol route is determined, the nth route node is connected with the target node in the initial patrol route, so that the nth route node is added into the initial patrol route, and all patrol points of the floor plan of the target floor are connected into one route to obtain the target patrol route.
For example, assuming that the floor plan includes 4 patrol points, where the 1 st route node is point B, the 2 nd route node is point D, the 3 rd route node is point a, and the 4 th route node is point C, it may be determined that the initial patrol route is point B → D → a, and at this time, the target node in the initial patrol route, which is the shortest distance from the 4 th route node C, is point D, the point C connects the point D to obtain the target patrol route.
When the entry point of the target floor and the exit point of the target floor are route planning starting points, connecting the mth route node corresponding to the entry point with the target node in the first initial patrol route, so that the mth route node is added into the first initial patrol route to obtain a first sub-patrol route; and connecting the kth route node corresponding to the exit point with the target node in the second initial patrol route, so that the kth route node is added into the second initial patrol route to obtain a second sub-patrol route. And then, determining an associated route node with the shortest distance from the mth route node corresponding to the entry point in the second sub-patrol route, and connecting the mth route node corresponding to the entry point with the associated route node, so that the first sub-patrol route is connected with the second sub-patrol route to obtain the target patrol route.
For example, assume that the floor plan includes 8 patrol points (assume points a to H), where points a to D correspond to entry points of the target floor and points E to H correspond to exit points of the target floor. And if the 1 st route node corresponding to the entry point is a point B, the 2 nd route node is a point D, the 3 rd route node is a point A, and the 4 th route node is a point C, the first initial patrol route can be determined to be B → D → A, and at the moment, the target node with the shortest distance from the 4 th route node C in the initial patrol route is the point D, the point C is connected with the point D, and the first sub-patrol route is obtained. And if the 1 st route node corresponding to the exit point is the point E, the 2 nd route node is the point H, the 3 rd route node is the point G, and the 4 th route node is the point F, the first initial itinerant route can be determined to be E → H → G, and at the moment, the target node with the shortest distance from the 4 th route node point F in the initial itinerant route is the point E, the point F is connected with the point E, and a second sub-itinerant route is obtained.
And if the associated route node with the shortest distance to the 4 th route node C corresponding to the entry point in the second sub-itinerant route is the G point, connecting the C point with the G point, so that the first sub-itinerant route is connected with the second sub-itinerant route to obtain the target itinerant route.
In each of the above-described manners, a destination patrol route of the destination floor can be determined.
205. In a binary tree structure of the target patrol route, determining a check-in sequence of the target patrol route;
the route node in the target patrol route is a patrol point, an actual patrol task can be executed according to the target patrol route, and when the patrol is carried out, a patrol person arrives at the patrol point and checks in at the patrol point. Therefore, the check-in order of the patrol points in the target patrol route can be determined in advance.
When the target patrol route is presented in a binary tree structure, in the binary tree structure, the check-in sequence comprises one or more of a first check-in sequence, a second check-in sequence and a third check-in sequence, wherein the first check-in sequence is to check in a root node of the binary tree structure firstly, then check in route nodes in a left subtree of the binary tree structure in sequence, and finally check in route nodes in a right subtree of the binary tree structure in sequence, namely a forward sequence traversal method of the binary tree structure; the second sign-in sequence is to sign in the route nodes in the left subtree of the binary tree structure in sequence, then to sign in the root nodes of the binary tree structure, and finally to sign in the route nodes in the right subtree of the binary tree structure in sequence, namely the backward sequence traversal method of the binary tree structure; the third check-in sequence is to check-in route nodes in the left subtree of the binary tree structure in sequence, check-in route nodes in the right subtree of the binary tree structure in sequence, and check-in root nodes of the binary tree structure, namely, the middle-order traversal method of the binary tree structure.
206. Connecting an exit point and an entry point between adjacent target floors to enable target patrol routes of the adjacent target floors to be connected, and obtaining a patrol route of a target building;
in this embodiment, the target building includes a plurality of target floors, each of which includes an entry point and an exit point, and then the entry point of the target floor is connected to the 1 st route node in the target patrol route of the target floor, and the exit point of the target floor is connected to the nth route node in the target patrol route of the target floor, that is, the exit point is connected to the last route node in the target patrol route.
Therefore, the exit point and the entry point between the adjacent target floors in the target building can be connected according to the ascending direction and the descending direction of the target building, so that the target patrol routes of the adjacent target floors are connected, and the patrol route of the whole target building is obtained.
It can be understood that, if the target building includes a plurality of buildings and adjacent buildings are communicated with each other through a common area, the target patrol route of the target floor of one building may be connected to the target patrol route of the target floor communicated with another building, or may be connected to the target patrol route of the previous floor or the next floor of the building.
It should be noted that, the execution order between step 206 and step 205 is not limited herein.
After the night patrol route of the target building is obtained, the night patrol task can be generated according to the night patrol route of the target building and night patrol scheduling conditions. In the process that the night patrol personnel actually execute the night patrol tasks, the night patrol personnel records the distance of an actual travelling route and the actual night patrol duration of each night patrol point in real time, and introduces the execution condition of the night patrol tasks into the electronic night patrol route generation device, so that the electronic night patrol route generation device can adjust the number of the night patrol points in the night patrol route of the target building according to the execution condition of the night patrol tasks, and if the distance of the actual travelling route exceeds the preset distance, the execution duration of the night patrol tasks is overtime or the actual night patrol duration of the night patrol points is overtime, the number of the night patrol points of the night patrol routes can be reduced, thereby ensuring that the night patrol personnel can complete the night patrol tasks on time, and improving the night patrol efficiency.
The embodiment provides various modes for generating the target patrol routes of the target floors, the check-in sequence of each target patrol route can be selected according to the actual conditions of the target floors, and a building manager can select the optimal patrol route according to the patrol execution conditions, so that the scheme realizability is improved.
With reference to fig. 3, the method for generating an electronic patrol route in the embodiment of the present application is described above, and an embodiment of the electronic patrol route generating device in the embodiment of the present application includes:
an obtaining unit 301, configured to obtain a floor plan of a target floor of a target building, where the floor plan is marked with a plurality of point locations, where the plurality of point locations include n night watching points of the target floor; wherein n is a positive integer greater than 1;
a first determining unit 302, configured to determine each patrol point as a route node in turn according to a sequence determined in sequence, so as to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route;
a second determining unit 303, configured to determine a target node in the initial patrol route, where the distance from the nth route node is shortest;
and the generating unit 304 is configured to connect the nth route node to the target node in the initial patrol route, so that the nth route node is added to the initial patrol route to obtain the target patrol route.
In a preferred implementation manner of this embodiment, the plurality of point locations further include a route planning starting point;
the first determining unit 302 is specifically configured to sequentially determine each patrol point as a route node, where the 1 st route node is a patrol point with the shortest distance from the route planning starting point in the n patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the n patrol points, and the remaining patrol points of the n patrol points comprise patrol points which are not determined as the route nodes currently in the n patrol points.
In a preferred embodiment of this embodiment, the route planning starting point is an exit point of the target floor or an entry point of the target floor.
In a preferred implementation manner of this embodiment, the number of route planning starting points is 2, where one route planning starting point is an entry point of a target floor, and the other route planning starting point is an exit point of the target floor;
the first determining unit 302 is specifically configured to sequentially determine each of the m patrol points as a route node corresponding to the entry point, and sequentially determine each of the k patrol points as a route node corresponding to the exit point, where m + k is n and m and k are positive integers greater than 1; and the 1 st route node to the m-1 st route node determined based on the sequence determined by the entry point are sequentially connected according to the sequence determined to form a first initial patrol route, and the 1 st route node to the k-1 st route node determined based on the sequence determined by the exit point are sequentially connected according to the sequence determined to form a second initial patrol route.
In a preferred implementation manner of this embodiment, the 1 st route node in the m route nodes corresponding to the entry point is a patrol point with the shortest distance from the entry point in the m patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the m patrol points, and the remaining patrol points of the m patrol points comprise patrol points which are not determined as the route nodes currently in the m patrol points;
the 1 st route node in the k route nodes corresponding to the exit point is the patrol point with the shortest distance to the exit point in the k patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the k patrol points, and the remaining patrol points of the k patrol points comprise patrol points which are not determined as the route nodes currently in the k patrol points.
In a preferred implementation manner of this embodiment, the second determining unit 303 is specifically configured to determine a target node in the first initial patrol route, which is the shortest distance from the mth route node, and determine a target node in the second initial patrol route, which is the shortest distance from the kth route node;
the generating unit 304 is specifically configured to connect the mth route node to a target node in the first initial patrol route, so that the mth route node is added to the first initial patrol route to obtain a first sub-patrol route; connecting the kth route node with a target node in the second initial patrol route so as to add the kth route node into the second initial patrol route to obtain a second sub-patrol route; and determining the associated route node with the shortest distance to the mth route node in the second sub-patrol route, and connecting the mth route node with the associated route node so as to connect the first sub-patrol route with the second sub-patrol route to obtain the target patrol route.
In a preferred implementation manner of this embodiment, the electronic patrol route generating device further includes:
a third determining unit 305, configured to determine, in a binary tree structure of the target patrol route, a check-in order of the target patrol route, where the check-in order includes one or more of a first check-in order, a second check-in order, and a third check-in order, where the first check-in order is to check in a root node of the binary tree structure first, then check in route nodes in a left subtree of the binary tree structure in sequence, and finally check in route nodes in a right subtree of the binary tree structure in sequence;
the second sign-in sequence is that firstly, route nodes in the left subtree of the binary tree structure are signed in sequence, then, the root nodes of the binary tree structure are signed in, and finally, route nodes in the right subtree of the binary tree structure are signed in sequence;
and the third check-in sequence is to perform check-in on route nodes in the left subtree of the binary tree structure in sequence, perform check-in on route nodes in the right subtree of the binary tree structure in sequence, and perform check-in on a root node of the binary tree structure.
In a preferred embodiment of this embodiment, the target building includes a plurality of target floors, each of which includes an entry point and an exit point, the entry point of the target floor is connected to the 1 st route node in the target patrol route of the target floor, and the exit point of the target floor is connected to the nth route node in the target patrol route of the target floor;
the generating unit 304 is further configured to connect the exit point and the entry point between the adjacent target floors, so that the target patrol routes of the adjacent target floors are connected to obtain a patrol route of the target building.
In a preferred implementation manner of this embodiment, the electronic patrol route generating device further includes:
the patrol management unit 306 is used for generating a patrol task according to the patrol route and the patrol scheduling condition of the target building; and adjusting the number of patrol points in the patrol route of the target building according to the execution condition of the patrol task.
In this embodiment, the operations performed by each unit in the electronic patrol route generating device are similar to those described in the embodiments shown in fig. 1 to fig. 2, and are not described again here.
In the present embodiment, the first determination unit 302 determines each patrol point of the target floor as a route node in turn, and the 1 st route node to the n-1 st route node determined based on the order of determination are sequentially connected according to the order of determination to form an initial patrol route, the second determining unit 303 determines a target node in the initial patrol route, which is the shortest in distance from the nth route node, the generating unit 304 connects the nth route node to the target node in the initial patrol route, thereby leading the nth route node to be added into the initial patrol route to obtain a complete target patrol route, therefore, the automatic generation of the electronic patrol route is realized, a manager of the building can execute an actual patrol task according to the automatically generated patrol route, the patrol route does not need to be designed manually, and the patrol efficiency and the floor management efficiency are greatly improved.
Referring to fig. 4, an electronic patrol route generating device in an embodiment of the present application is described below, where an embodiment of the electronic patrol route generating device in the embodiment of the present application includes:
the electronic patrol route generating apparatus 400 may include one or more Central Processing Units (CPUs) 401 and a memory 405, where one or more applications or data are stored in the memory 405.
The electronic patrol generating device 400 may also include one or more power supplies 402, one or more wired or wireless network interfaces 403, one or more input-output interfaces 404, and/or one or more operating systems, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
The central processing unit 401 may perform the operations performed by the electronic patrol route generating device in the embodiments shown in fig. 1 to fig. 2, which are not described herein again.
An embodiment of the present application further provides a computer storage medium, where one embodiment includes: the computer storage medium stores instructions that, when executed on a computer, cause the computer to perform the operations performed by the electronic patrol route generation apparatus in the embodiments shown in fig. 1 to 2.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like.
Claims (10)
1. An electronic patrol route generation method, characterized by comprising:
acquiring a floor plan of a target floor of a target building, wherein the floor plan is marked with a plurality of point locations, and the plurality of point locations comprise n night patrol points of the target floor; wherein n is a positive integer greater than 1;
according to the sequence, sequentially determining each patrol point as a route node to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route;
determining a target node with the shortest distance to the nth route node in the initial patrol route;
and connecting the nth route node with a target node in the initial patrol route so as to enable the nth route node to be added into the initial patrol route to obtain a target patrol route.
2. The method of claim 1, wherein the plurality of point locations further comprises a routing start point, the routing start point being an exit point of the target floor and/or an entry point of the target floor;
determining each patrol point as a route node in sequence, comprising:
sequentially determining each patrol point as a route node, wherein the 1 st route node is the patrol point with the shortest distance from the route planning starting point in the n patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the n patrol points, and the remaining patrol points of the n patrol points include patrol points which are not currently determined as route nodes in the n patrol points.
3. Method according to claim 2, characterized in that the number of route planning starting points is 2, wherein one route planning starting point is an entry point of the target floor and the other route planning starting point is an exit point of the target floor;
determining each patrol point as a route node in sequence, comprising:
sequentially determining each patrol point in the m patrol points as a route node corresponding to the entry point, and sequentially determining each patrol point in the k patrol points as a route node corresponding to the exit point, wherein m + k is n, and m and k are positive integers greater than 1;
and the 1 st route node to the m-1 st route node determined based on the sequence determined by the entry point are sequentially connected according to the sequence determined to form a first initial patrol route, and the 1 st route node to the k-1 st route node determined based on the sequence determined by the exit point are sequentially connected according to the sequence determined to form a second initial patrol route.
4. The method according to claim 3, wherein the 1 st route node of the m route nodes corresponding to the entry point is a patrol point having the shortest distance from the entry point of the m patrol points; after the 1 st route node is determined, each determined route node is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the m patrol points, and the remaining patrol points of the m patrol points comprise patrol points which are not determined as route nodes currently in the m patrol points;
the 1 st route node in the k route nodes corresponding to the exit point is the patrol point with the shortest distance to the exit point in the k patrol points; after the 1 st route node is determined, the route node determined each time is the patrol point with the shortest distance from the route node determined last time in the remaining patrol points of the k patrol points, and the remaining patrol points of the k patrol points include the patrol points which are not determined as the route nodes currently in the k patrol points.
5. The method of claim 4, wherein determining the target node of the initial patrol route having the shortest distance to the nth route node comprises:
determining a target node with the shortest distance to the mth route node in the first initial patrol route, and determining a target node with the shortest distance to the kth route node in the second initial patrol route;
the connecting the nth route node to the target node in the initial patrol route includes:
connecting the mth route node with a target node in the first initial patrol route, so that the mth route node is added into the first initial patrol route to obtain a first sub-patrol route;
connecting the kth route node with a target node in the second initial patrol route so as to enable the kth route node to be added into the second initial patrol route to obtain a second sub-patrol route;
and determining an associated route node with the shortest distance to the mth route node in the second sub-patrol route, and connecting the mth route node with the associated route node so as to connect the first sub-patrol route with the second sub-patrol route to obtain the target patrol route.
6. The method of claim 1, further comprising:
in a binary tree structure of the target patrol route, determining a check-in sequence of the target patrol route, wherein the check-in sequence comprises one or more of a first check-in sequence, a second check-in sequence and a third check-in sequence, the first check-in sequence is to check in a root node of the binary tree structure firstly, then check in route nodes in a left subtree of the binary tree structure in sequence, and finally check in route nodes in a right subtree of the binary tree structure in sequence;
the second check-in sequence is to perform check-in on route nodes in the left subtree of the binary tree structure in sequence, perform check-in on root nodes of the binary tree structure, and perform check-in on route nodes in the right subtree of the binary tree structure in sequence;
and the third check-in sequence is to perform check-in on route nodes in the left subtree of the binary tree structure in sequence, perform check-in on route nodes in the right subtree of the binary tree structure in sequence, and perform check-in on a root node of the binary tree structure.
7. The method according to any one of claims 1 to 6, wherein the target building comprises a plurality of the target floors, each target floor comprising an entry point and an exit point, the entry point of a target floor connecting the 1 st route node in the target round trip route of the target floor, the exit point of a target floor connecting the nth route node in the target round trip route of the target floor;
the method further comprises the following steps:
and connecting the exit point and the entry point between the adjacent target floors to enable the target patrol routes of the adjacent target floors to be connected, so as to obtain the patrol route of the target building.
8. An electronic patrol route generation device, characterized by comprising:
the system comprises an acquisition unit, a storage unit and a processing unit, wherein the acquisition unit is used for acquiring a floor plan of a target floor of a target building, the floor plan is marked with a plurality of point positions, and the plurality of point positions comprise n night watching points of the target floor; wherein n is a positive integer greater than 1;
the first determining unit is used for sequentially determining each patrol point as a route node according to a sequence determining order to obtain n route nodes; sequentially connecting the 1 st route node to the n-1 st route node determined based on the sequence determination order according to the sequence determination order to form an initial patrol route;
a second determining unit, configured to determine a target node in the initial patrol route, where the distance from the nth route node is shortest;
and the generating unit is used for connecting the nth route node with a target node in the initial patrol route so as to enable the nth route node to be added into the initial patrol route to obtain the target patrol route.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method according to any one of claims 1 to 7 when executing the computer program.
10. A computer storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011495196.8A CN112541987A (en) | 2020-12-17 | 2020-12-17 | Electronic patrol route generation method and device and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011495196.8A CN112541987A (en) | 2020-12-17 | 2020-12-17 | Electronic patrol route generation method and device and computer storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112541987A true CN112541987A (en) | 2021-03-23 |
Family
ID=75018644
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011495196.8A Pending CN112541987A (en) | 2020-12-17 | 2020-12-17 | Electronic patrol route generation method and device and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112541987A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113192226A (en) * | 2021-04-29 | 2021-07-30 | 重庆天智慧启科技有限公司 | Intelligent management system for community patrol |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH03231372A (en) * | 1990-02-06 | 1991-10-15 | Nec Corp | Automatic wiring method |
| CN107966150A (en) * | 2017-11-21 | 2018-04-27 | 武汉中元华电软件有限公司 | Substation's Work robot path planning and navigation locating method based on crossing point and section |
| CN110457421A (en) * | 2019-08-14 | 2019-11-15 | 广州视源电子科技股份有限公司 | Display method and device of moving position and running machine |
| CN110488813A (en) * | 2019-07-29 | 2019-11-22 | 广州启盟信息科技有限公司 | A kind of building robot patrol method and building robot |
| CN110509963A (en) * | 2019-09-16 | 2019-11-29 | 中国铁道科学研究院集团有限公司通信信号研究所 | Job sequence selection method suitable for STP operation test |
| CN110737798A (en) * | 2019-09-26 | 2020-01-31 | 万翼科技有限公司 | Indoor inspection method and related product |
-
2020
- 2020-12-17 CN CN202011495196.8A patent/CN112541987A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH03231372A (en) * | 1990-02-06 | 1991-10-15 | Nec Corp | Automatic wiring method |
| CN107966150A (en) * | 2017-11-21 | 2018-04-27 | 武汉中元华电软件有限公司 | Substation's Work robot path planning and navigation locating method based on crossing point and section |
| CN110488813A (en) * | 2019-07-29 | 2019-11-22 | 广州启盟信息科技有限公司 | A kind of building robot patrol method and building robot |
| CN110457421A (en) * | 2019-08-14 | 2019-11-15 | 广州视源电子科技股份有限公司 | Display method and device of moving position and running machine |
| CN110509963A (en) * | 2019-09-16 | 2019-11-29 | 中国铁道科学研究院集团有限公司通信信号研究所 | Job sequence selection method suitable for STP operation test |
| CN110737798A (en) * | 2019-09-26 | 2020-01-31 | 万翼科技有限公司 | Indoor inspection method and related product |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113192226A (en) * | 2021-04-29 | 2021-07-30 | 重庆天智慧启科技有限公司 | Intelligent management system for community patrol |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Beck et al. | Online planning for collaborative search and rescue by heterogeneous robot teams | |
| CN106528513B (en) | Operation report generation method and device based on unmanned aerial vehicle operation | |
| CN113177968A (en) | Target tracking method and device, electronic equipment and storage medium | |
| CN107026845A (en) | Task cheating recognition methods and device | |
| CN113627792A (en) | Unmanned vehicle scheduling management method, device, equipment, storage medium and program | |
| CN114778774B (en) | Greenhouse gas monitoring method based on artificial intelligence and related equipment | |
| CN113128788A (en) | Power emergency material conveying path optimization method and device and storage medium | |
| CN113109816A (en) | Echo block tracking method and device of radar echo image and storage medium | |
| CN112541987A (en) | Electronic patrol route generation method and device and computer storage medium | |
| CN114492849B (en) | Model updating method and device based on federal learning | |
| CN111324680B (en) | Information display method and device | |
| CN113821579A (en) | Route generation method and device, electronic equipment and memory | |
| CN112541464A (en) | Method and device for determining associated road object, road side equipment and cloud control platform | |
| CN115146847A (en) | Tour route generation method, tour route generation device, tour route generation equipment and storage medium | |
| CN115841197A (en) | Path planning method, device, equipment and storage medium | |
| CN114394099A (en) | Vehicle driving abnormity identification method and device, computer equipment and storage medium | |
| CN114969576A (en) | Method for training journey planning model and journey planning method | |
| CN112749822B (en) | Method and device for generating route | |
| CN112650156B (en) | Method and device for displaying operation condition of unmanned equipment | |
| Guezouli et al. | Efficient golden-ball algorithm based clustering to solve the multi-depot VRP with time windows | |
| CN114118645A (en) | Order distribution method and device, readable storage medium and electronic equipment | |
| CN113537853A (en) | Order distribution method, order distribution device, readable storage medium and electronic equipment | |
| CN113836252B (en) | Method and device for determining geographic coordinates | |
| CN115249134B (en) | Resource allocation method, device and equipment for unmanned aerial vehicle and storage medium | |
| CN117690095B (en) | Intelligent community management system based on three-dimensional scene |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210323 |