CN116227775A - Method, device and storage medium for determining road maintenance operation route - Google Patents

Method, device and storage medium for determining road maintenance operation route Download PDF

Info

Publication number
CN116227775A
CN116227775A CN202310499029.8A CN202310499029A CN116227775A CN 116227775 A CN116227775 A CN 116227775A CN 202310499029 A CN202310499029 A CN 202310499029A CN 116227775 A CN116227775 A CN 116227775A
Authority
CN
China
Prior art keywords
target
point
node
determining
road
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
Application number
CN202310499029.8A
Other languages
Chinese (zh)
Inventor
姜宏维
张艳红
李雅鑫
李志忠
田佳磊
仝鑫隆
李宇轩
孙天成
何建彬
郭晨伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Checsc Highway Maintenance And Test Technology Co ltd
Inner Mongolia Hohhot New Airport Expressway Management Co ltd
China Highway Engineering Consultants Corp
CHECC Data Co Ltd
Original Assignee
Checsc Highway Maintenance And Test Technology Co ltd
Inner Mongolia Hohhot New Airport Expressway Management Co ltd
China Highway Engineering Consultants Corp
CHECC Data Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Checsc Highway Maintenance And Test Technology Co ltd, Inner Mongolia Hohhot New Airport Expressway Management Co ltd, China Highway Engineering Consultants Corp, CHECC Data Co Ltd filed Critical Checsc Highway Maintenance And Test Technology Co ltd
Priority to CN202310499029.8A priority Critical patent/CN116227775A/en
Publication of CN116227775A publication Critical patent/CN116227775A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/20—Administration of product repair or maintenance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention provides a method, a device and a storage medium for determining a road maintenance operation route, wherein the method comprises the following steps: determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required; acquiring a departure point position of at least one departure point and node positions of a plurality of nodes of a target road network; determining shortest lines between each departure point and the target operation point according to the operation point position, the departure point position of at least one departure point and the node positions of a plurality of nodes; and determining a target line reaching the target operation point according to the shortest line between each departure point and the target operation point. The method can automatically generate the target line reaching the target operation point, can ensure that the target operation point is reached in time, and improves the operation efficiency of road maintenance operation.

Description

Method, device and storage medium for determining road maintenance operation route
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method and apparatus for determining a road maintenance route, and a storage medium.
Background
With the development of public transportation, the maintenance of the highway is also more and more important, for example, when the highway maintenance facility fails, the fault needs to be maintained in time so as to ensure that the highway can be recovered to the normal use state as soon as possible.
The rapid repair of faults places high demands on repair time. Because the highway is characterized by a strip-shaped engineering in linear distribution, the faults on the highway, which need maintenance, are dynamically changed and distributed in a scattered way. On the one hand, in the traditional technology, the operation route reaching the fault point is usually determined based on empirical data according to a manual planning method, so that the efficiency is low, the problem of maintenance resource waste exists, and the road passing efficiency and the service level are greatly influenced; in particular, for faults involving road safety, the repair aging requirements are higher. On the other hand, the requirement of timely determining the operation route cannot be met by a manual planning method.
That is, in the related art, there is a technical problem that an operation route satisfying the requirement of highway maintenance operation cannot be determined in time. In order to improve the repair efficiency of highway maintenance faults and the optimal configuration of maintenance resources, the operation path needs to be optimized.
Disclosure of Invention
The embodiment of the invention provides a method, a device and a storage medium for determining a road maintenance operation route, which are used for solving the technical problem that the operation route meeting the requirement of road maintenance operation cannot be determined in time in the prior art.
In a first aspect, the present invention provides a method for determining a road maintenance route, including: determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required; acquiring a departure point position of at least one departure point and node positions of a plurality of nodes of the target road network; determining shortest lines between each departure point and the target operation point according to the operation point position, the departure point position of the at least one departure point and the node positions of the plurality of nodes; and determining a target line reaching the target operation point according to the shortest line between each starting point and the target operation point.
Optionally, the determining the operation point position of the target operation point in the target road network includes: collecting safety information of a target road section in the target road network by using safety information collecting equipment;
determining whether the target road section has a road fault according to the safety information; if the target operation point exists, determining the position of the safety information acquisition equipment as the operation point position of the target operation point.
Optionally, the security information includes a security parameter value of a preset security parameter; the determining whether the road fault exists in the target road section according to the safety information comprises the following steps: and determining whether a road fault exists in the target road section according to the safety parameter value and a preset safety parameter threshold value.
Optionally, the method further comprises: if the road fault exists, determining a target fault type of the road fault; and determining a target job task type corresponding to the target fault type according to the mapping relation between the fault type and the job task type and the target fault type.
Optionally, the determining the shortest line between each departure point and the target operation point according to the operation point position, the departure point position of the at least one departure point, and the node positions of the plurality of nodes includes: determining a plurality of nodes in the target operation point, the departure point and the target road network as nodes to be processed; for each departure point, the following operations are performed: determining a departure point as a target node, and constructing a target node set according to the target node; the following operations are circularly executed until the target operation point is added into the target node set: for each node to be processed except for a target node in all nodes to be processed, respectively acquiring a first distance between the node to be processed and the target node adjacent to the node to be processed according to the node position of the node to be processed and the node position of each target node, determining a third distance between the node to be processed and the starting point according to the first distance and a second distance between the adjacent target node and the starting point, determining the node to be processed with the minimum third distance as the target node, and adding the node to be processed with the minimum third distance into the target node set; and determining the shortest line between each departure point and the target operation point according to the target node set which corresponds to each departure point and is added into the target operation point.
Optionally, acquiring a second distance between the neighboring target node and the departure point includes: and acquiring a fourth distance between each pair of target nodes adjacent to each other in all target nodes on a line from the adjacent target nodes to the departure point, and acquiring the second distance according to the fourth distance.
Optionally, determining a target route reaching the target job point according to the shortest route between each departure point and the target job point includes: and determining the shortest line with the minimum distance as the target line reaching the target working point.
In a second aspect, the present invention provides a road maintenance route determining apparatus, comprising: the first determining module is used for determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required; the acquisition module is used for acquiring the departure point position of at least one departure point and the node positions of a plurality of nodes of the target road network; the second determining module is used for determining the shortest line between each departure point and the target operation point according to the operation point position, the departure point position of the at least one departure point and the node positions of the plurality of nodes; and the third determining module is used for determining a target line reaching the target operation point according to the shortest line between each departure point and the target operation point.
In a third aspect, the present invention provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of determining a road maintenance job route as in any one of the first aspects when the program is executed.
In a fourth aspect, the present invention provides a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of determining a road maintenance job route as defined in any one of the first aspects.
The invention provides a method, a device and a storage medium for determining a road maintenance operation route, wherein the method comprises the following steps: determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required; acquiring a departure point position of at least one departure point and node positions of a plurality of nodes of a target road network; determining shortest lines between each departure point and the target operation point according to the operation point position, the departure point position of at least one departure point and the node positions of a plurality of nodes; and determining a target line reaching the target operation point according to the shortest line between each departure point and the target operation point. Compared with the related art, the method for manually planning the operation route can automatically generate the target route reaching the target operation point, so that the target operation point can be ensured to be reached in time, and the operation efficiency of road maintenance operation is improved. The method solves the problem that in the related art, the operation route meeting the requirement of highway maintenance operation cannot be determined in time.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for determining a road maintenance route according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a target road network according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a target road network according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of a road maintenance route determining device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The method, apparatus and storage medium for determining a road maintenance route according to the present invention are described below with reference to fig. 1 to 5.
Fig. 1 is a flow chart of a method for determining a road maintenance route according to an embodiment of the present invention, referring to fig. 1, the method may include the following steps:
s100, determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required.
The target road network is the road network where the target road section requiring road maintenance is located. For example, the target road network may be composed of nodes and road segments connecting the nodes. The nodes can comprise road intersections and other preset nodes.
In one embodiment, security information of a corresponding road segment is obtained according to an internet of things sensor deployed on a target road segment in a target road network. After the safety information of the corresponding road section is acquired by the internet of things sensor, whether a road fault exists on the corresponding road section is determined according to the acquired safety information, and when the road fault exists, a corresponding road maintenance operation task is triggered according to a preset operation task.
The road fault may be a road surface defect, for example, the road fault may include a road maintenance facility fault, or may include other faults affecting normal use of the road. By way of example, road faults may include cracks in the road, malfunctions in the road, bridge deformations, or other faults affecting the normal use of the road.
S102, acquiring the departure point position of at least one departure point and the node positions of a plurality of nodes of the target road network.
The departure point is a place where the road maintenance worker or the working equipment departs. The method for obtaining the node positions of the plurality of nodes of the target road network is various, and the target road network information may be obtained according to a geographic information system (Geographic Information System, GIS), or may be obtained according to another system, which is not limited herein. The obtained target road network information may include node positions of a plurality of nodes in the target road network and distances between the nodes.
S104, determining the shortest line between each departure point and the target operation point according to the operation point position, the departure point position of at least one departure point and the node positions of a plurality of nodes.
In one embodiment, based on the location of the job point, the location of the departure point of the at least one departure point, and the locations of the plurality of nodes, at least one route from each departure point to the target job point may be determined, and a shortest route between the corresponding departure point and the target job point may be determined from the at least one route.
In one embodiment, each departure point, each target operation point and each node are determined to be nodes to be processed, and according to the distance between adjacent nodes to be processed, the distance from each departure point to at least one line of the target operation point can be determined, wherein the line with the shortest distance is the shortest line between the corresponding departure point and the target operation point.
S106, determining a target line reaching the target operation point according to the shortest line between each departure point and the target operation point.
In one embodiment, if the number of the departure points is one, the shortest line between each departure point and the target job point is also one, and the shortest line is the target line reaching the target job point.
In another embodiment, the number of the departure points is multiple, each departure point has a corresponding shortest route, and the shortest route with the smallest distance can be determined as the target route reaching the target operation point.
In this alternative embodiment, the operation point position of the target operation point in the target road network is determined; acquiring a departure point position of at least one departure point and node positions of a plurality of nodes of a target road network, and respectively determining the shortest line between each departure point and a target operation point according to the operation point position, the departure point position of at least one departure point and the node positions of the plurality of nodes so as to acquire a target line reaching the target operation point. Compared with the related art, the method for manually planning the operation route can automatically generate the target route reaching the target operation point, so that the target operation point can be ensured to be reached in time, and the operation efficiency of road maintenance operation is improved. The method solves the problem that in the related art, the operation route meeting the requirement of highway maintenance operation cannot be determined in time.
In some alternative embodiments, determining the location of the target job point in the target road network may include the following schemes:
s200, acquiring safety information of a target road section in a target road network by using safety information acquisition equipment.
The target road section is a road section needing road maintenance monitoring. The target road sections can be all the road sections in the target road network, or can be part of the road sections selected from all the road sections of the target road network according to the requirements of users.
S202, determining whether the road fault exists in the target road section according to the safety information.
In one embodiment, the safety information is image information acquired by the image acquisition device, and correspondingly, according to the safety information, determining whether the road fault exists in the target road section may include the following scheme: and determining whether the road fault exists in the target road section according to the image information and the trained road fault recognition model. The road fault recognition model is obtained by training the image recognition model according to the image sample acquired by the image acquisition equipment on the corresponding target road section, wherein the image sample comprises: the image and the label with road fault or without road fault marking are carried out on the image, wherein the image recognition model is various and is not limited herein.
The image acquisition device is installed at a preset position of the target road section and is used for acquiring image information in a target area on the target road section.
For example, a camera is deployed in a road section requiring maintenance, and image information of a corresponding target road section is acquired by the camera. The camera is provided with a data processing module, the data processing module determines whether a crack exists on the road surface of the corresponding target road section according to the image information, if the crack exists, the width of the crack is calculated, and if the width of the crack is larger than a preset crack width value, the road fault exists in the target road section.
Specifically, the image information is input into a trained image recognition model, and whether cracks exist or not is determined according to the image recognition model. The image recognition model is obtained by training an image sample of the target road section acquired by the camera, wherein the image recognition model is used for training to carry out label marking with or without cracks. When the crack exists on the road surface, determining the actual width of the crack according to the ratio of the image size to the actual size of the corresponding road section and the size of the crack in the image. If the obtained crack width is larger than the preset crack width, determining the crack as a road fault requiring maintenance, and triggering an operation task.
For example, a camera is deployed in a road section requiring maintenance, and image information of a corresponding road section is acquired by the camera. The camera is provided with a data processing module, the data processing module determines whether an obstacle exists on the road surface of the corresponding road section according to the image information, if the obstacle exists, the size information of the obstacle is extracted, and if the size of the obstacle is larger than a preset size, the road fault exists in the target road section.
Specifically, the image information is input into a trained image recognition model, and whether an obstacle exists or not is determined according to the image recognition model. The image recognition model is obtained by training the image sample of the road section acquired by the camera, wherein the image sample used for training the image recognition model is labeled with a label with or without an obstacle. When it is determined that an obstacle exists on the road surface, determining the actual width of the obstacle according to the ratio of the image size to the actual size of the corresponding target road section and the size of the obstacle in the image. And if the size of the obstacle is larger than the preset size, determining that the road fault exists in the target road section.
In one embodiment, the safety information is a safety parameter value of a preset safety parameter acquired by the sensor device of the internet of things, and whether a road fault exists in the target road section is determined according to the safety parameter value.
In one embodiment, to ensure accuracy of road fault determination, further confirmation may be performed manually from the acquired image information or safety parameter values after road fault determination by the machine model.
S204, if the safety information acquisition equipment exists, determining the position of the safety information acquisition equipment as the position of the working point of the target working point.
It should be noted that, there may be a deviation in the position of the operation point where the actual obstacle point is located and the position where the safety information collecting device is located. However, in practical application, the deviation is usually not large, and the position of the safety information acquisition equipment is used as a working task point, so that the positioning requirement on a fault point can be met. In addition, when the safety information acquisition equipment is arranged, the position information of the safety information acquisition equipment is recorded and stored, and based on the method, the position of the safety information acquisition equipment is used as a working task point, and the position of a fault point is not required to be repositioned, so that the positioning requirement on the fault point can be met, the repositioning time of the fault point can be saved, and the road maintenance efficiency is improved.
In this optional embodiment, according to the safety information acquisition device, the safety information of the target road section in the target road network is acquired, whether the road fault exists in the target road section is determined according to the safety information, and if so, the position of the safety information acquisition device is determined to be the position of the working point of the target working point. Compared with the method that the maintenance tasks are required to be manually preset in the related art, the method can dynamically determine whether the road fault exists in the target road section according to real-time feedback of the road site, and rapidly determine the position of the working point where the road maintenance operation is required, so that the road maintenance operation can be timely performed, and the road maintenance operation efficiency is improved.
In an alternative embodiment, the security information comprises security parameter values of preset security parameters.
Accordingly, determining whether a road fault exists in at least one road segment according to the safety parameter value comprises: and determining whether a road fault exists in at least one road section according to the safety parameter value and a preset safety parameter threshold value.
In the optional embodiment, whether the road fault exists in the target road section can be automatically and quickly determined through the safety parameter value and the preset safety parameter threshold value, so that the road fault can be timely processed, and the purpose of timely maintenance of the road can be achieved.
In an alternative embodiment, the method for determining the road maintenance operation route further includes:
and S300, if the road fault exists, determining the target fault type of the road fault.
For example, a target fault type of the corresponding road fault is determined from the safety information. For example, if the safety information is bridge displacement, when the bridge displacement value exceeds a set threshold value, determining that a road fault occurs in the corresponding bridge, wherein the target fault type of the road fault is that the bridge displacement is overlarge.
S302, determining a target job task type corresponding to the target fault type according to the mapping relation between the fault type and the job task type and the target fault type.
In the alternative embodiment, the type of the target operation task is determined through the type of the target fault, so that the operation task of the corresponding type can be accurately triggered, the road maintenance personnel can carry out maintenance operation on the road fault in a targeted manner, and the road maintenance efficiency is improved.
In an alternative embodiment, determining the shortest line between each departure point and the target operation point according to the location of the operation point of the failure point, the location of the departure point of at least one departure point and the node locations of a plurality of nodes, respectively, includes:
s400, determining a plurality of nodes in the target operation point, the departure point and the target road network as to-be-processed nodes.
In one embodiment, after the target road network is acquired, the starting point and the target operation point are added into the target road network according to the starting point position of the starting point and the operation point position of the target operation point, so that the target road network is expanded. All nodes in the expanded target road network can be marked as to-be-processed nodes.
In one embodiment, the departure point position of the departure point is obtained in advance, the departure point is added to the target road network, and the target road network information added to the departure point is stored. After the operation point position of the target operation point is determined, adding the target operation point into the stored target road network information to obtain an expanded target road network, and marking all nodes in the expanded target road network as nodes to be processed.
S402, for each departure point, performing the following operations: determining a departure point as a target node, and constructing a target node set according to the target node; the following operations are circularly executed until the target operation point is added into the target node set: for all the nodes to be processed except the target node, respectively acquiring a first distance between the node to be processed and the target node adjacent to the node to be processed according to the node position of the node to be processed and the node position of each target node, determining a third distance between the node to be processed and the starting point according to the first distance and a second distance between the adjacent target node and the starting point, determining the node to be processed with the minimum third distance as the target node, and adding the node to be processed with the minimum third distance into the target node set.
Illustratively, determining the departure point as the target node, and constructing the target node set according to the target node may include the following schemes: and constructing an empty set, adding the target node serving as a set element into the constructed empty set, and acquiring the target node set.
Illustratively, determining a target node adjacent to the node to be processed may include the following: if the node to be processed and the target node are located on the same road section, determining whether other target nodes exist on the road section between the node to be processed and the target node; if the node to be processed and the target node are positioned on the same road section, and other target nodes do not exist on the road section between the node to be processed and the target node, determining that the node to be processed is adjacent to the target node, wherein the target node is the adjacent target node of the node to be processed; otherwise, determining that the target node is not a neighboring target node of the node to be processed.
Illustratively, a first distance between the node to be processed and the adjacent target node is determined based on the node location of the node to be processed and the node location of the adjacent target node adjacent to the node to be processed.
Illustratively, determining the second distance between the target node and the departure point may include: fourth distances of all sub-sections between the target node and the departure point are obtained, all the fourth distances are summed, and a second distance between the target node and the departure point is obtained. The sub-road segments are road segments between adjacent node pairs between the target node and the departure point.
For example, the first distance and the second distance are summed, and the result of the summation is determined to be a third distance.
It should be noted that, after obtaining the third distances of all the nodes to be processed except the target node, comparing the third distances corresponding to the nodes to be processed respectively, determining the node to be processed with the minimum third distance according to the comparison result, and adding the node to be processed into the target node set.
S404, determining the shortest line between each departure point and the target operation point according to the target node set corresponding to each departure point after the target operation point is added.
In one embodiment, only one line is formed by the departure point, the target operation point and each target node between the departure point and the target operation point in the target node set, and the line is the shortest line between the departure point and the target operation point.
In another embodiment, if there are multiple routes formed by the departure point, the destination operation point, and each destination node between the departure point and the destination operation point in the destination node set, one of the multiple routes with the shortest distance is determined to be the shortest route between the departure point and the destination operation point.
In the optional embodiment, a plurality of nodes in the target operation point, the departure point and the target road network are determined to be nodes to be processed; for each departure point, the following operations are performed: determining a departure point as a target node, and constructing a target node set according to the target node; the following operations are circularly executed until the target operation point is added into the target node set: for each to-be-processed node except for the target node in all to-be-processed nodes, respectively acquiring a first distance between the to-be-processed node and at least one target node adjacent to the to-be-processed node according to the node position of the to-be-processed node and the node position of each target node, determining a third distance between the to-be-processed node and the corresponding starting point according to the first distance and a second distance between the adjacent target node and the starting point, determining the to-be-processed node with the minimum third distance as the target node, and adding the to-be-processed node with the minimum third distance into the target node set; and determining the shortest line between each departure point and the target operation point according to the target node set which corresponds to each departure point and is added into the target operation point. Compared with the method for determining the operation line through manual planning in the related art, the method can automatically determine the shortest line between the starting point and the target operation point, improves the efficiency of determining the shortest line, and further improves the efficiency of road maintenance operation.
In an alternative embodiment, obtaining a second distance between the neighboring target node and the departure point includes: and acquiring a fourth distance between each pair of target nodes adjacent to each other in all target nodes on the route from the adjacent target node to the departure point, and acquiring the second distance according to the fourth distance.
It should be noted that, in this alternative embodiment, the adjacent target node refers to a target node adjacent to the node to be processed, and all the target nodes in this scheme also include a departure point and an adjacent target node.
For example, by summing a fourth distance between at least one pair of target nodes, the result of the summation is determined as a second distance between a neighboring target node adjacent to the node to be processed and the departure point.
In this optional embodiment, by acquiring the fourth distance between each pair of target nodes adjacent to each other in all the target nodes on the route from the adjacent target node to the departure point, the second distance between the adjacent target node and the departure point may be quickly acquired according to the fourth distance.
In one embodiment, determining a target route to a target job point based on a shortest route between each departure point and the target job point includes: and determining the shortest line with the smallest distance as a target line reaching the target operation point.
In the alternative embodiment, the shortest route with the smallest distance is determined to be the target route reaching the target working point, so that the shortest distance from the departure point to the target working point can be ensured, the shortest time reaching the target working point is ensured, and the efficiency of road maintenance operation is improved.
Based on the foregoing embodiments and optional embodiments, the present invention further provides an optional implementation manner of the road maintenance operation route determining method, and the detailed description of this optional implementation manner will be given below with reference to fig. 2 and 3. The method may comprise the steps of:
s50, obtaining the road network information of the target road network in the maintenance management service coverage area from the GIS system, wherein the obtained road network information comprises the node positions of a plurality of nodes and the connecting distance between adjacent nodes. And identifying departure point positions of departure of operators in the target road network, wherein the number of the departure point positions can be multiple or only one.
The target road network is represented in a two-dimensional undirected graph mode. Fig. 2 is a schematic structural diagram of a target road network according to an embodiment of the present invention, and referring to fig. 2, from node 2 to node 3 in the figure, from node 5 to node 10 are nodes of the target road network, and the nodes may be intersections. The connection between the nodes represents a route between the corresponding two nodes. Node 1 and node 4 are two departure points for the operator, which is typically the location of the operator's premises.
The departure point may be an intersection node in the target road network, or may be a node added to the target road network according to the location of the departure point.
S51, arranging the Internet of things monitoring equipment in a target road section needing maintenance, recording and storing the positions of the Internet of things monitoring equipment, and setting a job task determination strategy. And determining whether the operation task needs to be triggered or not according to the data collected by the internet of things monitoring equipment and a preset operation task determining strategy.
For example, the job task determination policy may include: and triggering a job task when the road fault exists in the target road section.
The target road sections to be maintained are part of or all of the road sections in the target road network, and are specifically set according to the requirements of users.
For example, according to the data collected by the internet of things monitoring device and a preset job task determining policy, determining whether the job task needs to be triggered may include one or more of the following methods:
and arranging a camera in a road section needing maintenance, and collecting image information of the corresponding road section through the camera. The camera is provided with a data processing module, the data processing module determines whether a crack exists on the road surface of the corresponding road section according to the image information, if the crack exists, the width of the crack is calculated, and if the width of the crack is larger than a preset crack width value, an operation task is triggered.
And arranging a camera in a road section needing maintenance, and collecting image information of the corresponding road section through the camera. The camera is provided with a data processing module, the data processing module determines whether an obstacle exists on the road surface of the corresponding road section according to the image information, if the obstacle exists, the size information of the obstacle is extracted, and if the size of the obstacle is larger than a preset size, the operation task is triggered.
An internet of things sensor is deployed in a road section needing maintenance, and safety parameter values of preset safety parameters of the corresponding road section are acquired through the internet of things sensor. And if the safety parameter value exceeds the preset safety parameter threshold value, triggering the operation task.
S52, if the trigger operation task is determined, the position of the Internet of things monitoring equipment is used as an operation task point.
And S53, marking the target operation point in the target road network, expanding the original target road network as a new node, and adding the operation point position information of the target operation point in the node position information originally stored in the target road network.
In this alternative embodiment, the determined target operation point is marked as a target operation point 11, and after the target operation point 11 is added to the target road network shown in fig. 2, the obtained target road network diagram is shown in fig. 3. Referring to fig. 3, the target road network after adding the target operation point 11 includes 11 nodes to be processed, where the target operation point 11 is specifically located between the nodes to be processed 5 and 6.
S54, obtaining the distance between any two nodes to be processed.
Specifically, for each to-be-processed node, determining that the to-be-processed node which is positioned on the same road section with the to-be-processed node and has no other to-be-processed nodes spaced between the to-be-processed node is adjacent to the to-be-processed node. For example, referring to fig. 3, the node 2 to be processed and the node 5 to be processed are located at the same road section, and other nodes to be processed are not spaced between the node 2 to be processed and the node 5 to be processed, whereby it can be determined that the node 2 to be processed and the node 5 to be processed are nodes to be processed adjacent to each other. While the node to be processed 3 is present between the nodes to be processed 2 and 4, and thus the nodes to be processed 2 and 4 are not adjacent to each other.
And E (i, j) represents the distance between the ith to-be-processed node and the jth to-be-processed node, wherein the distance between two adjacent to each other to-be-processed nodes is the connecting line distance between the two to-be-processed nodes, and the distance between the two to-be-processed nodes which are not adjacent to each other is set to infinity (++).
Referring to fig. 3, the distance E (1, 2) =9 between the 1 st and 2 nd to-be-processed nodes, and the distance E (1, 3) = infinity between the 1 st and 3 rd to-be-processed nodes.
S55, for each departure point, the following operations are performed, and the shortest route between each departure point and the target job point is acquired.
In this alternative embodiment, the departure points include departure point 1 and departure point 4.
S551, taking the departure point, the target operation point and other nodes in the target road network as nodes to be processed, taking the departure point as a target node to be placed in a target node set R, and placing other nodes to be processed in an un-traversed set M. For each node to be processed outside the target node set, the information of the ith node to be processed is represented by D (i, di), wherein di represents the shortest distance between the ith node to be processed and the departure point.
S552, the node to be processed with the minimum third distance is taken out of the non-traversal set M and is taken as a target node to be placed in the target node set. The non-traversed set M is then updated according to the following rules:
for each pending node k remaining in M: and obtaining a third distance dk of the node k, wherein the third distance dk is equal to a second distance ds between each target node s in the target node set R and the departure point, and the minimum value of the sum of the distances between the node k to be processed and the target nodes s in the target node set R is added.
S553, repeatedly executing the step S552 until the target job point is added into the target node set.
S56, determining the shortest route with the smallest distance as a target route, and issuing the target route to an operator.
Through steps S50 to S55, the shortest route of each departure point is obtained, the distances of the shortest routes are compared, and the shortest route with the smallest distance is determined as the target route.
The above alternative embodiments are further described below with reference to fig. 2 and 3.
The method for acquiring the shortest line and the distance of the shortest line corresponding to the departure point 1 comprises the following steps:
and constructing a target node set R by taking the starting point 1 as a target node, and constructing a non-traversal set M= { D (2, 9), D (3, +_E), D (4, +_E), D (5, +_E), D (6, +_E), D (7, +_E), D (8, 22), D (9, +_E), D (10, +_E) and D (11, +_E) based on other nodes to be processed outside the target node.
And if the distance between the node 2 to be processed and the departure point 1 is minimum, adding the node 2 to be processed as a target node into the target node set R, and updating the target node set R and the non-traversed set M.
Updating the non-traversed set M includes: and deleting the nodes 2 to be processed from the M, and updating the shortest distance from each node to be processed in the non-traversed set to the departure point 1. For example, for the node 3 to be processed, the third distance between the node 3 to be processed and the departure point is equal to the sum of the first distance between the node 3 to be processed and the adjacent target node 2 and the second distance between the target node 2 and the departure point, referring to fig. 3, the first distance is equal to 7Km, and the second distance is equal to 9Km, so that the shortest distance between the node 3 to be processed and the departure point can be calculated to be 16, and based on this, the shortest distance between the node 3 to be processed and the departure point is updated. And a third distance between the node 5 to be processed and the departure point 1 is equal to 14Km, and based on the third distance, the shortest distance between the node 5 to be processed and the departure point is updated.
The result after the first update of the target node set R and the non-traversed set M is: r= { D (1, 0), D (2, 9) }, M= { D (3, 16), D (4, +), D (5, 14), D (6, ++), D (7, +), D (8, 22), D (9, +), D (10, +), D (11, +), respectively.
The target node set R and the non-traversed set M are updated for the second time, and the updated result is as follows: r= { D (1, 0), D (2, 9), D (5, 14) }; m= { D (3, 16), D (4, +_d (6, +_d), D (7, +_d (8, 22)), D (9, +_d (10, +_d), D (11, 19) }.
After the target node set R is updated for the third time, the updated result is: r= { D (1, 0), D (2, 9), D (5, 14), D (11, 19) }.
After the third update is performed on the target node set R, the target job point 11 joins the target node set R, and stops performing on the target node set R and the non-traversed set M at this time.
According to the final updated target node set R, the shortest route between the departure point 1 and the target operation point 11 is {1,2,5, 11}, which is a route from the departure point 1, sequentially passes through the node to be processed 2 and the node to be processed 5, and then reaches the target operation point 11. And the distance of the shortest route is equal to the distance between the to-be-processed 1 and the target working point 11, which is 19.
The method for acquiring the shortest line and the distance of the shortest line corresponding to the departure point 4 comprises the following steps:
the departure point 4 is used as a target node to construct a target node set, and the target node set R= { D (4, 0) }, and the non-traversal set M= { D (1, +_D (2, +_C) is constructed based on other nodes to be processed except the target node, D (3, 6), D (5, +_C), D (6, +_C), D (7, 10), D (8, +_C), D (9, +_C), D (10, +_C) and D (11, fact) }.
And if the distance between the node 3 to be processed and the departure point 4 is minimum, adding the node as a target node into the target node set R, and updating the target node set and the non-traversed set M for the first time.
Updating the non-traversed set M includes: and deleting the nodes 3 to be processed from the M, and updating the shortest distance from each node to be processed in the non-traversed set to the departure point 1.
Correspondingly, the result after the target node set R and the non-traversed set M are updated for the first time is: r= { D (4, 0), D (3, 6) }; m= { D (1, +), D (2, 13), D (5, +), D (6, 17), D (7, 10), D (8, +), D (9, +), D (10, +), D (11, ++).
Based on the method, the target node set R and the non-traversed set M are updated for the second time, and the updated result is as follows: r= { D (4, 0), D (3, 6), D (7, 10) }; m= { D (1, +), D (2, 13), D (5, +), D (6, 17), D (8, +), D (9, +), D (10, +), D (11, +) }
Based on the method, the target node set R is updated for the third time, and the updated result is as follows: r= { D (4, 0), D (3, 6), D (7, 10), D (2, 13) }; m= { D (1, 22), D (5, 18), D (6, 17), D (8, infinity), D (9, +_D (10, +_D (11, +_infinity))
Based on the method, the target node set R is updated for the fourth time, and the updated result is that r= { D (4, 0), D (3, 6), D (7, 10), D (2, 13), D (6, 17) }; m= { D (1, 22), D (5, 18), D (8, ++), D (9, 22), D (10, infinity), D (11, 20) }
Based on the method, the target node set R is updated for the fifth time, and the updated result is as follows: r= { D (4, 0), D (3, 6), D (7, 10), D (2, 13), D (6, 17), D (5, 18) }; m= { D (1, 22), D (8, +), D (9, 22), D (10, +_D (11, 20)
Based on the method, the target node set R is updated for the sixth time, and the updated result is as follows: r= { D (4, 0), D (3, 6), D (7, 10), D (2, 13), D (6, 17), D (5, 18), D (11, 20) }.
After the sixth update is performed on the target node set R, the target job point 11 joins the target node set R, and stops updating the target node set R and the non-traversed set M.
According to the final updated target node set R, a plurality of routes between the departure point 4 and the target operation point 11 are acquired, distances of the routes are acquired respectively, one of the shortest distances is determined as a shortest route between the departure point and the target operation point, the shortest route is {4,3,6, 11}, and the shortest route represents a route from the departure point 4, sequentially passes through the node to be processed 3 and the node to be processed 6, and then reaches the target operation point 11. And the distance of the shortest route is equal to the distance between the departure point 4 and the target working point 11, which is 20.
According to the above analysis, the distance 19 of the shortest route between the departure point 1 and the target working point 11, the distance 20 of the shortest route between the departure point 4 and the target working point 11, and the distance of the shortest route between the departure point 1 and the target working point 11 are smaller, and thus the shortest route between the departure point 1 and the target working point 11 is determined as the optimal target route. And send the shortest line {1,2,5, 11} from the departure point 1 to the target operation point 11 to the personnel related to the point A for operation
According to the method and the system for automatically generating the road maintenance operation task, the road maintenance operation task can be automatically generated according to real-time sensing data of the internet of things monitoring equipment deployed on the target road section and the preset operation task triggering condition, so that the response to the operation task is more timely. In addition, an optimal operation route is automatically generated according to the road network condition and the target operation point position in the operation range, so that the actual operation time is shorter and the operation efficiency is higher.
Fig. 4 is a schematic structural diagram of a road maintenance route determining apparatus according to an embodiment of the present invention, and referring to fig. 4, the apparatus includes a first determining module 600, an obtaining module 602, a second determining module 604, and a third determining module 606, where:
a first determining module 600, configured to determine a working point position of a target working point in a target road network, where the target working point is a place where a road maintenance operation needs to be performed; an obtaining module 602, configured to obtain a departure point position of at least one departure point, and node positions of a plurality of nodes of a target road network; a second determining module 604, configured to determine shortest lines between each departure point and the target operation point according to the operation point position, the departure point position of at least one departure point, and the node positions of the plurality of nodes; the third determining module 606 is configured to determine a target route reaching the target job point according to the shortest route between each departure point and the target job point.
In a further illustration of the above apparatus, the first determining module 600 is further configured to: collecting safety information of a target road section in a target road network by using safety information collecting equipment; determining whether a road fault exists in the target road section according to the safety information; if the safety information is present, determining the position of the safety information acquisition equipment as the position of the working point of the target working point.
In a further illustration of the above apparatus, the security information comprises security parameter values of preset security parameters; accordingly, the first determining module 600 is further configured to determine whether a road fault exists in the target road segment according to the safety parameter value and the preset safety parameter threshold value.
In a further illustration of the apparatus above, the apparatus further comprises a fourth determination module: the method comprises the steps of determining a target fault type of a road fault in the case of the road fault; and determining the target job task type corresponding to the target fault type according to the mapping relation between the fault type and the job task type and the target fault type.
In a further illustration of the apparatus described above, the second determining module 604 is further configured to: for each departure point, the following operations are performed: determining a departure point as a target node, and constructing a target node set according to the target node; the following operations are circularly executed until the target operation point is added into the target node set: for each node to be processed except for the target node in all the nodes to be processed, respectively acquiring a first distance between the node to be processed and the target node adjacent to the node to be processed according to the node position of the node to be processed and the node position of each target node, determining a third distance between the node to be processed and the starting point according to the first distance and a second distance between the adjacent target node and the starting point, determining the node to be processed with the minimum third distance as the target node, and adding the node to be processed with the minimum third distance into the target node set; and determining the shortest line between each departure point and the target operation point according to the target node set which corresponds to each departure point and is added into the target operation point.
In a further illustration of the apparatus described above, the second determining module 604 is further configured to: and acquiring a fourth distance between each pair of target nodes adjacent to each other in all target nodes on a line from the adjacent target nodes to the departure point, and acquiring the second distance according to the fourth distance.
In a further description of the above apparatus, the third determining module 606 is further configured to determine the shortest route with the smallest distance as the target route reaching the target working point.
Since the apparatus of the embodiment of the present invention is the same as the principle of the method of the above embodiment, the explanation of the apparatus in more detail is not repeated here.
It should be noted that, in the embodiment of the present invention, the related functional modules may be implemented by a hardware processor (hardware processor).
Fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, as shown in fig. 5, the electronic device may include: processor 71 (processor), communication interface 72 (Communications Interface), memory 73 (memory), and communication bus 74, wherein processor 71, communication interface 72, memory 73 accomplish communication with each other through communication bus 74. The processor 71 may call logic instructions in the memory 73 to perform the method of determining the route of the road maintenance operation.
Further, the logic instructions in the memory 73 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method of the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the method of determining a road maintenance work route provided by the methods described above.
In yet another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the method for determining a road maintenance job route provided by the above embodiments.
The apparatus embodiments described above are merely illustrative, wherein elements illustrated as separate elements may or may not be physically separate, and elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on such understanding, the foregoing technical solutions may be embodied essentially or in part in the form of a software product, which may be stored in a computer-readable storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the various embodiments or methods of some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (10)

1. A method of determining a path of a road maintenance operation, comprising:
determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required;
acquiring a departure point position of at least one departure point and node positions of a plurality of nodes of the target road network;
determining shortest lines between each departure point and the target operation point according to the operation point position, the departure point position of the at least one departure point and the node positions of the plurality of nodes;
and determining a target line reaching the target operation point according to the shortest line between each starting point and the target operation point.
2. The method of claim 1, wherein determining the location of the target job point in the target road network comprises:
collecting safety information of a target road section in the target road network by using safety information collecting equipment;
determining whether the target road section has a road fault according to the safety information;
if the target operation point exists, determining the position of the safety information acquisition equipment as the operation point position of the target operation point.
3. The method according to claim 2, wherein the security information comprises security parameter values of preset security parameters;
the determining whether the road fault exists in the target road section according to the safety information comprises the following steps: and determining whether a road fault exists in the target road section according to the safety parameter value and a preset safety parameter threshold value.
4. The method as recited in claim 2, further comprising:
if the road fault exists, determining a target fault type of the road fault;
and determining a target job task type corresponding to the target fault type according to the mapping relation between the fault type and the job task type and the target fault type.
5. The method of claim 1, wherein the determining the shortest route between each departure point and the target job point based on the job point location, the departure point location of the at least one departure point, and the node locations of the plurality of nodes, respectively, comprises:
determining a plurality of nodes in the target operation point, the departure point and the target road network as nodes to be processed;
for each departure point, the following operations are performed: determining a departure point as a target node, and constructing a target node set according to the target node; the following operations are circularly executed until the target operation point is added into the target node set: for each node to be processed except for a target node in all nodes to be processed, respectively acquiring a first distance between the node to be processed and the target node adjacent to the node to be processed according to the node position of the node to be processed and the node position of each target node, determining a third distance between the node to be processed and the starting point according to the first distance and a second distance between the adjacent target node and the starting point, determining the node to be processed with the minimum third distance as the target node, and adding the node to be processed with the minimum third distance into the target node set;
And determining the shortest line between each departure point and the target operation point according to the target node set which corresponds to each departure point and is added into the target operation point.
6. The method of claim 5, wherein obtaining a second distance between an adjacent target node and the departure point comprises:
and acquiring a fourth distance between each pair of target nodes adjacent to each other in all target nodes on a line from the adjacent target nodes to the departure point, and acquiring the second distance according to the fourth distance.
7. The method of claim 1, wherein determining a target route to the target job point based on a shortest route between the respective departure point and the target job point comprises:
and determining the shortest line with the minimum distance as the target line reaching the target working point.
8. A road maintenance work route determining apparatus, comprising:
the first determining module is used for determining the position of a working point of a target working point in a target road network, wherein the target working point is a place where road maintenance work is required;
the acquisition module is used for acquiring the departure point position of at least one departure point and the node positions of a plurality of nodes of the target road network;
The second determining module is used for determining the shortest line between each departure point and the target operation point according to the operation point position, the departure point position of the at least one departure point and the node positions of the plurality of nodes;
and the third determining module is used for determining a target line reaching the target operation point according to the shortest line between each departure point and the target operation point.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of determining a road maintenance work route according to any one of claims 1 to 7 when the program is executed by the processor.
10. A non-transitory computer-readable storage medium, on which a computer program is stored, characterized in that the computer program, when executed by a processor, implements the steps of the method of determining a road maintenance work route according to any one of claims 1 to 7.
CN202310499029.8A 2023-05-06 2023-05-06 Method, device and storage medium for determining road maintenance operation route Pending CN116227775A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310499029.8A CN116227775A (en) 2023-05-06 2023-05-06 Method, device and storage medium for determining road maintenance operation route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310499029.8A CN116227775A (en) 2023-05-06 2023-05-06 Method, device and storage medium for determining road maintenance operation route

Publications (1)

Publication Number Publication Date
CN116227775A true CN116227775A (en) 2023-06-06

Family

ID=86587600

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310499029.8A Pending CN116227775A (en) 2023-05-06 2023-05-06 Method, device and storage medium for determining road maintenance operation route

Country Status (1)

Country Link
CN (1) CN116227775A (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102761894A (en) * 2012-06-30 2012-10-31 华为技术有限公司 Method, device and system for acquiring paths
CN111506048A (en) * 2020-04-24 2020-08-07 深圳市元征科技股份有限公司 Vehicle fault early warning method and related equipment
CN112013860A (en) * 2019-05-29 2020-12-01 北京四维图新科技股份有限公司 Safe travel route planning and managing method and device
CN114485611A (en) * 2021-12-28 2022-05-13 中科星图股份有限公司 Three-dimensional space shortest path planning method and device based on Beidou grid code
WO2022143920A1 (en) * 2020-12-31 2022-07-07 广州极飞科技股份有限公司 Path shortening method and apparatus, unmanned device, and storage medium
CN114723594A (en) * 2022-03-24 2022-07-08 施佳薇 Urban road maintenance system and method based on Internet of things
CN115049309A (en) * 2022-07-19 2022-09-13 中环洁环境有限公司 Garbage collection and transportation route planning method and system
CN116029470A (en) * 2022-12-05 2023-04-28 电子科技大学 Public transport route planning method based on crowd sensing

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102761894A (en) * 2012-06-30 2012-10-31 华为技术有限公司 Method, device and system for acquiring paths
CN112013860A (en) * 2019-05-29 2020-12-01 北京四维图新科技股份有限公司 Safe travel route planning and managing method and device
CN111506048A (en) * 2020-04-24 2020-08-07 深圳市元征科技股份有限公司 Vehicle fault early warning method and related equipment
WO2022143920A1 (en) * 2020-12-31 2022-07-07 广州极飞科技股份有限公司 Path shortening method and apparatus, unmanned device, and storage medium
CN114485611A (en) * 2021-12-28 2022-05-13 中科星图股份有限公司 Three-dimensional space shortest path planning method and device based on Beidou grid code
CN114723594A (en) * 2022-03-24 2022-07-08 施佳薇 Urban road maintenance system and method based on Internet of things
CN115049309A (en) * 2022-07-19 2022-09-13 中环洁环境有限公司 Garbage collection and transportation route planning method and system
CN116029470A (en) * 2022-12-05 2023-04-28 电子科技大学 Public transport route planning method based on crowd sensing

Similar Documents

Publication Publication Date Title
CN111199346B (en) Utility tunnel supervision method, device, computer equipment and storage medium
CN106130761A (en) The recognition methods of the failed network device of data center and device
JP2019057192A (en) Structure inspection support system
CN114756034B (en) Robot real-time obstacle avoidance path planning method and device
US11605158B2 (en) System and method for early identification and monitoring of defects in transportation infrastructure
CN111126802A (en) Highway inspection and evaluation method and system based on artificial intelligence
CN111177485B (en) Parameter rule matching based equipment fault prediction method, equipment and medium
CN114814877A (en) Tunnel data acquisition method, equipment and medium based on inspection robot
CN116227775A (en) Method, device and storage medium for determining road maintenance operation route
CN114286086B (en) Camera detection method and related device
CN113379363A (en) Urban water supply informatization intelligent management platform
JP2021156655A (en) Device, method, and program for specifying sewer damage
CN116582414A (en) Fault root cause positioning method, device, equipment and readable storage medium
KR102464457B1 (en) Ai based predicting system of bridge management method and costs according to damage types
CN115116214A (en) Road detection method and road fault processing system
CN114881265A (en) Method and device for generating gas safety maintenance scheme and electronic equipment
CN115345446A (en) Unmanned aerial vehicle line patrol and point cloud data-based project completion acceptance method
JP4885008B2 (en) Maintenance planning method
JP2021127683A (en) Construction management device
CN114338088A (en) Evaluation algorithm and evaluation system for network security level of transformer substation power monitoring system
CN111523008A (en) River channel environment management method and device, computer equipment and storage medium
CN117171935B (en) Pipe network topology structure repairing method, equipment, system and chip
Marzouk et al. Predicting telecommunication tower costs using fuzzy subtractive clustering
US20240071199A1 (en) Ai based system and method for generating warning alerts for a location to be excavated
CN114339155B (en) Snapshot vulnerability route determining method and related device

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

Application publication date: 20230606

RJ01 Rejection of invention patent application after publication