CN114648259B - Urban road well lid management method - Google Patents
Urban road well lid management method Download PDFInfo
- Publication number
- CN114648259B CN114648259B CN202210559950.2A CN202210559950A CN114648259B CN 114648259 B CN114648259 B CN 114648259B CN 202210559950 A CN202210559950 A CN 202210559950A CN 114648259 B CN114648259 B CN 114648259B
- Authority
- CN
- China
- Prior art keywords
- information
- well lid
- user
- node
- executing
- 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.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims description 16
- 238000000034 method Methods 0.000 claims abstract description 30
- 238000005192 partition Methods 0.000 claims description 27
- 238000012545 processing Methods 0.000 claims description 22
- 230000000007 visual effect Effects 0.000 claims description 17
- 230000003190 augmentative effect Effects 0.000 claims description 14
- 230000002159 abnormal effect Effects 0.000 claims description 13
- 241001105160 Eleodes Species 0.000 claims description 12
- 230000002776 aggregation Effects 0.000 claims description 12
- 238000004220 aggregation Methods 0.000 claims description 12
- 238000012423 maintenance Methods 0.000 claims description 12
- 230000004931 aggregating effect Effects 0.000 claims description 8
- 238000010276 construction Methods 0.000 claims description 6
- 238000003825 pressing Methods 0.000 claims description 6
- 238000007689 inspection Methods 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012800 visualization Methods 0.000 description 2
- 206010039203 Road traffic accident Diseases 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- 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
- 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
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Human Resources & Organizations (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Educational Administration (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Software Systems (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Remote Sensing (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Computational Linguistics (AREA)
- Underground Structures, Protecting, Testing And Restoring Foundations (AREA)
- Instructional Devices (AREA)
Abstract
The application relates to a method for managing urban road well covers, which comprises the following steps: s100, acquiring a well lid and well lid information thereof in a target geographical area based on the target geographical area, and constructing a database well lid information table set, wherein the well lid information comprises position information and state information; s200, constructing an index structure by taking the spatial position of the well lid as main information and other information of the well lid as auxiliary information; s300, acquiring operation information of the well lid in a target geographic area range and classifying the operation information; by establishing the multi-factor real-time indexing technology and the rapid positioning technology for the municipal manhole cover, a user can change the method to detect the missing or needed manhole cover in real time and rapidly position the missing or needed manhole cover, and can rapidly update the manhole cover information, thereby bringing convenience to the management of the municipal manhole cover and eliminating hidden dangers for the traveling of urban residents.
Description
Technical Field
The application relates to the technical field of classification management, in particular to a method for managing urban road well lids.
Background
At present, with the rapid development of modern smart cities, the demand of the cities for road well covers begins to increase sharply, and the government investment on the road well covers of the cities is also increasing year by year. Because urban road well covers have the characteristics of large quantity, wide distribution and the like, related personnel have challenges in maintaining and managing the well covers in urban spaces, if the well covers needing to be maintained in a certain urban road cannot be found in time, urban traffic can be directly affected, for example, traffic accidents are probably caused by loss or maintenance of the well covers in the road, and potential safety hazards are brought to citizens going out.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
In order to solve the technical problems mentioned in the above background technology or at least partially solve the above technical problems, the present application provides an urban road manhole cover management method, including:
a method for managing urban road well covers comprises the following steps:
s100, acquiring a well lid and well lid information thereof in a target geographical area based on the target geographical area, and constructing a database well lid information table set, wherein the well lid information comprises position information and state information;
s200, constructing an index structure by taking the spatial position of the well lid as main information and other information of the well lid as auxiliary information;
s300, obtaining operation information of the well lid in a target geographic area range and classifying the operation information;
wherein, S100 comprises the following steps:
s110, constructing a plane rectangular coordinate system based on the target geographic area, dividing the target geographic area into M partitions and establishing a partition set R = { R = 1 ，R 2 ，……，R M }，R i Obtaining R for the ith subarea in the target geographical area and i is more than or equal to 1 and less than or equal to M i Position information (x) in a planar rectangular coordinate system imin ，x imax ，y imin ，y imax ），x imin Is R i Smallest abscissa, x, in a coordinate system imax Is R i Maximum abscissa, y, in the coordinate system imin Is R i Smallest ordinate, y, in the coordinate system imax Is R i The largest ordinate in the coordinate system;
s120, obtaining R i All well lids in the well lid model set P are constructed i ={P i1 ，P i2 ，……，P iq In which P is ik Is R i K is more than or equal to 1 and less than or equal to q of the kth well cover;
s130, based on R in database i Establishing an initial well cover information table T i ；
S140, based on P ik Acquiring well lid information which comprises position information P ik.position Current state information P ik.flag And future stateState information P ik.appoint ；
Wherein when P is ik.flag If = (1, null), it represents P ik Is available when P ik.flag If = (0, type), it represents P ik The status of (1) is unavailable, wherein, when type =0, the manhole cover is in the maintenance period, when type =1, the manhole cover is in the inspection period, when type =2, the manhole cover is in the maintenance period, and when type =3, the manhole cover is in the replacement period;
P ik.appoint =(t s , t e type), represents P ik At a starting time t s To the end time t e Treatment based on type in, P ik.appoint = null denotes P ik Is not reserved for processing.
Optionally, in step S140, P is ik The well lid information also includes P ik.id 、P ik.month 、P ik.info 、P ik.money And P ik.road ；
Wherein, P ik.id Is P ik The number information of (a);
P ik.month is P ik The applied time of (c);
P ik.info is P ik Processing performed before the current time point;
P ik.money is P ik Consumption generated before the current point in time;
P ik.road is P ik The street corresponding to the position of the street;
s150, storing the well lid information obtained in the step S140 into T i Internal;
s160, repeating the steps S140 to S150, and when the set P is obtained i All the well lid information of all the well lids is stored to T i If so, executing step S170;
s170, repeating the steps S120 to S160, obtaining the well lid information tables of all the partitions in the R, and obtaining a database well lid information table set T = { T = (the number of the partitions in the R is one) 1 ，T 2 ，……，T M }；
Wherein, S200 comprises the following steps:
s210 is based onT i Middle P i Position information of all manhole covers in the well, P i All manhole covers are gathered to obtain a gathering grouping set G = { G = } 1 ，G 2 ，……，G w }；
S220, grouping G based on aggregation n Construction of leaf node G' n N is more than or equal to 1 and less than or equal to w, and G' n Leaf node attribute of (2);
wherein the leaf node attributes include:
space range G' n.range For aggregating packet G n The two-dimensional space range covered by all the well covers is included;
optionally, child subset G' n.chilset1 Is composed of G n The well lids in available state form a set;
unavailable child subset G' n.chilset2 Is composed of G n The set is composed of all the well lids in the processing state;
neighborhood set G' n.roadset Is G' n.chilset2 A set formed by blocks where each well cover is located;
reservation set G' n.appoint ，G' n.appoint =0 for G n All the well lids in (1) are not reserved, and the reserved set G' n.appoint The manhole cover is formed by a reserved manhole cover;
s230, repeating the step S220 until the operation on all the elements in the set G is completed, and obtaining a set G '= { G' 1 ，G' 2 ，……，G' w Execution step S240;
s240, when w is less than or equal to N, executing the step S270, otherwise executing the step S250;
wherein N is a numerical value preset by a user, and N is a positive integer;
s250, based on a set G '= { G' 1 ，G' 2 ，……，G' w Aggregating all nodes in the cluster according to the coverage range to obtain an aggregated packet set F = { F = } 1 ，F 2 ，……，F w }。
S260, based on F n Constructing non-leaf node F' n To obtain a set of non-leaf nodes F '= { F' 1 ，F' 2 ，……，F' w And to non-leaf node F' n Setting node attributes, and executing step S240;
wherein the non-leaf node attribute includes a spatial range of F' n.range Is aggregate packet F' n A two-dimensional space range covered by all the previous layer of aggregation nodes; child attribute F' n.chilset Is of F' n A set of all previous level aggregation nodes included therein; available or unavailable of F' n.flag ，F' n.flag =0 denotes that it does not have available children, F' n.flag =1 indicates that there are children available; whether to reserve F' n.appoint ，F' n.appoint =0 denotes F' n All manhole covers included are F 'which are not reserved' n.appoint =1 denotes F' n Wherein the reserved well cover exists;
s270, F = { F 1 ，F 2 ，……，F w } or F '= { F' 1 ，……，F' w Constructing a root node root i Root node root of i The method comprises the following steps:
range attribute root i.range Is a partition R i A two-dimensional spatial range of (a);
child attribute root i.chilset Set G '= { G' 1 ，G' 2 ，……，G' w } or F '= { F' 1 ，F' 2 ，……，F' w }；
S280, judging T i Whether the information is the last well lid information table in T or not is judged, if yes, a set RootSet = { root) containing M root nodes is obtained 1 ,，……，root M And continue to execute step S290, otherwise execute step S210;
s290, based on any partition R in the partition set R i And its corresponding root node root i And establishing an index table.
Optionally, in step S290, a structure is adoptedThe index is built by building a hash table List, which is expressed as R i →root i 。
Step S300 further includes the steps of:
s310, establishing an operation queue, and acquiring a pair P in a target geographic region R based on a user u ik Generating operation information, and storing the operation information into the operation queue based on the acquisition time, wherein the operation information comprises (o) 1 ，o 2 ，x u ，y u ) Wherein x is u And y u Is the abscissa, o, of user u 1 And o 2 Is the operation type;
wherein when o 1 If =0, it is the query operation of the augmented reality that represents the feedback of the user u;
when o is 1 If =1, user u is fed back by 2 Constrained augmented reality query operation, where o 2 =0 indicates that the user has fed back that the manhole cover needs maintenance; o 2 =1 indicates that the user feedbacks the manhole cover to be checked; o. o 2 =2 indicates that the user feedbacks the manhole cover to be repaired; o 2 =3 indicates that the user feedback manhole cover needs to be replaced;
s320, shifting out the operation information in sequence according to the sequence in the operation queue, and judging o 1 When o is a value of 1 If =0, the step S330 is executed, if o 1 If =1, execute step S340;
s330, executing augmented reality query operation for the user, and feeding back a result to an equipment screen;
s340, according to o 2 The value of (a) is that a user executes a constrained augmented reality query operation, feeds back a result constrained by the user to an equipment screen, and further performs professional processing according to the user feedback result;
and S350, judging whether all the operations in the operation queue are processed, finishing when all the operations in the operation queue are processed, otherwise, jumping to the step S320.
The step S330 includes the steps of:
s331, creating a first minimum heap structure, and continuously executing the following steps to initialize the first minimum heap structure;
S332、traversing the index table, calculating R i To the user location (x) u ，y u ) And calculating R i Relative to the user position (x) u ，y u ) Spatial coverage of angular range [ alpha, beta ]]Acquiring the lens parameters of the electronic equipment and judging R according to the minimum distance and the space coverage angle range i Whether an intersection exists with the visual field range of the lens in space or not, and if the intersection exists, the root is determined i Storing into a first minimum stack structure;
s333, moving out a heap top node of the first minimum heap structure, judging the type of the heap top node, executing the step S334 when the heap top node is a non-leaf node, and executing the step S337 when the heap top node is a leaf node;
s334, sequentially acquiring the children in the child set of the heap top node, and calculating the range (x) of the child set u ，y u ) Further calculates the child set range relative (x) u ，y u ) When the child set range intersects with the lens view range, pressing the child into the first minimum heap structure;
s335, repeating the step S334 until the last child in the child set completes the step S334, and executing the following step S336;
s336, repeating S333-S335 until the first minimum stack structure is empty;
s337, sequentially acquiring well lids P which are combined and concentrated by the first child set and the second child set of the heap top node ik The first set of children is a subset of available children and the second set of children is a subset of unavailable children;
s338, calculating P ik Distance to user position and calculate p ik.position Angle θ relative to user position, based on P ik Distance to user location and p ik.position Angle theta relative to the user position determines P ik Whether it is within the visual field of the lens, when P ik If the lens is located within the field of view, go to step S339;
s339, adding P ik And P ik Is displayed in the screen of the electronic equipment so as to be usedThe method comprises the following steps that a user checks information of well covers distributed around the user in real time;
s3310, repeating steps S338-S339, when P is ik When the manhole cover is the last manhole cover in the union of the first child set and the second child set, executing step S3311;
s3311, repeating S337-S3310 until the first minimum heap structure is empty.
The step S340 includes the steps of:
s341, creating a second minimum heap structure, traversing the index table, and storing a root node which is intersected with the visual field of the user equipment lens into the second minimum heap structure, wherein the second minimum heap structure is automatically sequenced, so that a node closest to the user position is positioned at the top of a heap;
s342, moving out the heap top node of the second minimum heap structure, and judging the type of the heap top node; when the heap top node is a non-leaf node, executing step S343, and when the heap top node is a leaf node, executing step S346;
s343, judging whether the heap top node is intersected with the view field of the equipment lens, executing S344 when the heap top node is intersected with the view field of the equipment lens, otherwise executing the step S345;
s344, when the heap top node has an available child subset or a reserved manhole cover, pressing all children of the heap top node into a second minimum heap structure, otherwise, executing the step S345;
s345, when the second minimum stack structure is empty, executing the step S349, otherwise executing the step S342;
s346, judging whether the heap top node is intersected with the equipment lens visual field, if so, executing a step S347, otherwise, executing a step S345;
s347, when the first child set is empty or the top-piling node does not have a reserved manhole cover, executing the step S345, otherwise, pressing all manhole covers of the first child set and the reserved manhole cover in the top-piling node into a second minimum pile structure;
s348, when the heap top node is of a point type and is positioned in the visual field of the lens of the user equipment, according to the value o 2 Is equal to (0, type) or is equal to (t) s ，t e ，type) Type = o in 2 The well lid visualization is shown on the user device screen and step S345 is performed.
S349, checking whether abnormal well lid P at the position of the user exists in the visually displayed well lids on the screen ik If the abnormal well lid P exists, the abnormal well lid P is finished, otherwise, the device background receives the abnormal well lid P ik The image information of (1).
S3410 based on abnormal well lid P ik Is judged and classified to perform processing, and the parameter P is updated according to the progress of the processing ik.appoint And P ik.flag And updating the background database table after the processing is finished.
S3411 based on P ik Obtaining P ik.road Based on P ik.road And acquiring related users and sending prompt information.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages:
the method is not only oriented to professional managers, but also oriented to common resident users, the management and maintenance efficiency of the road well lid in the smart city space is improved through the common assistance of the city resident users, and the potential safety hazards of residents are further avoided through a short message prompting function; by establishing the index and the augmented reality search method, the method fully considers various factors such as the position, the state, whether reservation processing is performed and the like of the well lid data, designs the database table structure for storing the well lid data, provides technical support for realizing humanized and efficient management of the urban road well lid, and has strong expansibility and convenient maintenance.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a flowchart of an urban road manhole cover management method according to an embodiment of the present application;
fig. 2 is a schematic diagram of a target geographical area and a partition according to an embodiment of the present disclosure;
fig. 3 is a schematic view of a camera view and node aggregation of an apparatus according to an embodiment of the present disclosure;
fig. 4 is an intention of indicating manhole cover information according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
For convenience of understanding, the following describes in detail a method for managing an urban road manhole cover according to an embodiment of the present application, and refer to fig. 1.
The embodiment of the application provides a method for managing urban road well covers, which specifically comprises the following steps:
s100, acquiring the well lid and well lid information thereof in the target geographical area based on the target geographical area, and constructing a database well lid information table set, wherein the well lid information comprises position information and state information.
Specifically, in step S100, the manhole cover information table is constructed by the following steps:
s110, constructing a plane rectangular coordinate system based on the target geographic area, dividing the target geographic area into M partitions and establishing a set R = { R = 1 ，R 2 ，……，R M }，R i Is the ith zone within the target geographic area, anI is more than or equal to 1 and less than or equal to M, and R is obtained i Position information (x) in a rectangular plane coordinate system imin ，x imax ，y imin ，y imax ），x imin Is R i Smallest abscissa, x, in a coordinate system imax Is R i Maximum abscissa, y, in the coordinate system imin Is R i Smallest ordinate, y, in the coordinate system imax Is R i The largest ordinate in the coordinate system.
S120, obtaining R i All well lids in the well lid model set P are constructed i ={P i1 ，P i2 ，……，P iq In which P is ik Is R i The k-th well cover in the well cover is more than or equal to 1 and less than or equal to q.
S130, based on R in database i Establishing an initial well cover information table T i 。
S140, based on P ik Acquiring well lid information, wherein the well lid information comprises position information P ik.position Current state information P ik.flag And future state information P ik.appoint ；
Preferably, the expression of the position information in the present application is P ik Coordinates in the coordinate system, the abscissa being P ik.x Ordinate is P ik.y ；
Specifically, when P is ik.flag If = (1, null), it represents P ik When P is available ik.flag If = (0, type), it represents P ik The status of (1) is unavailable, wherein, when type =0, the manhole cover is in the maintenance period, when type =1, the manhole cover is in the inspection period, when type =2, the manhole cover is in the maintenance period, and when type =3, the manhole cover is in the replacement period;
in particular, P ik.appoint =(t s , t e Type), represents P ik At a starting time t s To the end time t e Treatment based on type in, P ik.appoint = null denotes P ik Not reserved, preferably, the starting time t s After the current point in time.
Preferably, the well lid informationAnd also includes P ik.id 、P ik.month 、P ik.info 、P ik.money And P ik.road ；
Wherein, P ik.id Is P ik The serial number information of (a);
P ik.month is P ik Is preferably applied to the exact month;
P ik.info is P ik Processing performed before the current time point;
P ik.money is P ik Consumption generated before the current point in time;
P ik.road is P ik The street corresponding to the position.
S150, storing the well lid information obtained in the step S140 into T i And (4) inside.
Preferably, P is ik Information storage to P ik The rows, in the present embodiment, are shown in fig. 4.
S160, repeating the steps S140 to S150, and when the set P is obtained i All the well lid information of all the well lids is stored to T i In the meantime, step S170 is executed.
S170, repeating the steps S120 to S160, obtaining the well lid information tables of all the partitions in the R, and obtaining a database well lid information table set T = { T = (the number of the partitions in the R is one) 1 ，T 2 ，……，T M }。
In the embodiment of the present application, as shown in fig. 2, a planar rectangular coordinate system is constructed based on the target geographic area, so that the target geographic area can be represented by (x) min ，x max ，y min ，y max ) And constraining, further dividing the target geographic area into M partitions with similar sizes, and obtaining a partition set R = { R when M =12 1 , R 2 , ..., R 12 Any one of the partitions R therein i Is still composed of (x) imin ，x imax ，y imin ，y imax ) Constraint, i is more than or equal to 1 and less than or equal to 12; the electronic equipment can depict the geographic space coverage area of the lens of the electronic equipment through the optical parameters and the position of the lens of the electronic equipment, and the geographic space coverage area represents the shooting range of the lens of the electronic equipment in spaceThe shooting range is represented as a fan in a two-dimensional plane space, and is a device lens view field, hereinafter denoted by FOV.
S200, using a well cover P ik The spatial position of the well cover P is main body information ik And other information of the well lid is used for constructing an index structure for the auxiliary information, so that all information of the well lid is organized according to an index hierarchy.
Wherein S200 further comprises the steps of:
s210, based on T i Middle P i Position information of all manhole covers in the well, P i All manhole covers are gathered to obtain a gathering grouping set G = { G = } 1 ，G 2 ，……，G w }。
One skilled in the art knows that one or more aggregation modes in the prior art are selected for P according to actual needs i All the well lids are gathered, so that the detailed description is omitted.
S220, based on G n Construction of leaf node G' n N is more than or equal to 1 and less than or equal to w, and G' n The leaf node attribute of (2).
Wherein the leaf node attributes include:
space range G' n.range For aggregating packet G n The two-dimensional space range covered by all the well covers is included;
available child subset G' n.chilset1 Is composed of G n The well lids in available state form a set;
unavailable child subset G' n.chilset2 Is composed of G n The set is composed of all the well lids in the processing state;
neighborhood set G' n.roadset Is G' n.chilset2 A set formed by blocks where each well cover is located;
reservation set G' n.appoint ，G' n.appoint =0 for G n All the well lids in (1) are not reserved, and the reserved set G' n.appoint Is composed of a well cover which is reserved for treatment.
S230, repeating the step S220 until the operation on all the elements in the set G is completed, obtaining a set G '= { G' 1 ，G' 2 ，……，G' w And step S240 is performed.
S240, when w is less than or equal to N, executing the step S270, otherwise executing the step S250.
Preferably, N is a numerical value preset by a user, and N is a positive integer.
S250, based on a set G '= { G' 1 ，G' 2 ，……，G' w All nodes in the cluster are aggregated according to coverage, and an aggregated packet set F '= { F' 1 ，F' 2 ，……，F' w }。
Wherein the coverage of the node is through (x) ikmin ，x ikmax ，y ikmin ，y ikmax ) Obtaining, wherein x ikmin Is P ik In a coordinate system, x ikmax Is P ik The maximum abscissa, y, of the spatial coverage in the coordinate system ikmin Is P ik In a coordinate system, the smallest ordinate, y ikmax Is P ik Is the largest ordinate in the coordinate system.
One skilled in the art knows that one or more aggregation modes in the prior art are selected for P according to actual needs i All the well lids are gathered, so that the detailed description is omitted.
S260, based on F' n Construction of non-leaf node F' n Get a set of non-leaf nodes { F' 1 ，……，F' w And for non-leaf node F' n Node attribute setting is performed, and step S240 is performed.
Wherein the node attribute comprises a spatial range F' n.range Is aggregate packet F' n A two-dimensional space range covered by all the previous layer of aggregation nodes; child attribute F' n.chilset Is of F' n Formed by all preceding level aggregation nodes includedA collection; available or unavailable of F' n.flag ，F' n.flag =0 denotes that it does not have available children, F' n.flag =1 indicates that there are children available; whether to reserve F' n.appoint ，F' n.appoint =0 denotes F' n All manhole covers included are not reserved, F' n.appoint =1 denotes F' n Wherein a reserved well cover exists.
S270, G '= { G' 1 ，G' 2 ，……，G' w } or F '= { F' 1 ，F' 2 ，……，F' w Constructing a root node root i Root node root, the root node i The method comprises the following steps:
range attribute root i.range Is a partition R i A two-dimensional spatial range of (a);
child attribute root i.chilset Set G '= { G' 1 ，G' 2 ，……，G' w } or F '= { F' 1 ，F' 2 ，……，F' w }。
S280, judging T i Whether the information is the last well lid information table in T or not is judged, if yes, a set RootSet = { root) containing m root nodes is obtained 1 , ..., root m And continues to step S290, otherwise, jumps to step S210.
S290, based on any partition R in the partition set R i And its corresponding root node root i Establishing an index table, preferably, establishing an index in the form of R in the embodiment of the present application by constructing a hash table List i →root i 。
As shown in FIG. 3, in the embodiment of the present application, the FOV is defined by (u, r, η) with north as the reference direction 1 ，η 2 ) Description, where u is the spatial location of the device, η 1 And η 2 The angle range that the lens can shoot, and r is the visible distance of the lens.
In one exemplary embodiment of the present application, a partition r is constructed, as shown in FIG. 3 i Inner index structure, in which a partition R is shown i A set of manhole covers in the road, a set of manhole coversThe road well covers are aggregated into 5 groups, and respectively form leaf nodes G '= { G' 1 ，G' 2 ，G' 3 ，G' 4 ，G' 5 Then further aggregating the 5 leaf nodes into a 2-set of two non-leaf nodes F '= { F' 1 ，F' 2 }, finally 2 non-leaf nodes F '= { F' 1 ，F' 2 Construction of the partition R i Corresponding root node root i By the device, the well lid p shot by the lens can be displayed in the mobile phone screen for user augmented reality 11 、p 12 And p 13 。
S300, obtaining the pair P in the target geographic area range ik And carrying out classification processing on the operation information.
Specifically, S300 further includes the following steps:
s310, establishing an operation queue OptioQue, and acquiring a pair P in a target geographic region R based on a user u ik Generating operation information, and storing the operation information into the operation queue based on the acquisition time, wherein the operation information comprises (o) 1 ，o 2 ，x u ，y u ) Wherein x is u And y u Is the abscissa, o, of user u 1 And o 2 As the type of operation, when 1 That means user u feeds back augmented reality query operation when =0, P ik The management device calls the lens of the electronic device of the user u and processes the feedback of the user u in the background, and then identifies all well lids in the visual field range of the lens and displays the well lids on the screen of the device of the user u, so that the user u can be helped to more friendly view the information of all well lids distributed nearby the user u in real time.
Preferably, in this embodiment of the present application, the electronic device is a mobile phone.
When o is 1 If =1, user u is fed back by the acceptance o 2 Constrained augmented reality query operations will be subjected to 2 All well lids of the constraint are enhanced and displayed on the equipment screen of the user on site to assist the user to feed the problem well lids back to the background management personnel, the management personnel can assign the professional personnel to perform professional processing on the well lids according to the feedback problem well lids, and the short message is used for reminding to ask questionsResidents near the manhole cover realize efficient humanized management of the urban road manhole cover. Wherein o is 2 =0 indicates that the user is in feedback that the manhole cover needs maintenance, e.g. the user finds that the manhole cover is severely rusted at a certain position; o 2 =1 indicates that the user is feedback that the manhole cover needs to be checked, for example, the user finds that the manhole cover is loose at a certain position; o 2 =2 indicates that the user has feedback that the manhole cover needs to be repaired, for example, the user finds that there is a crack in the manhole cover at a certain position; o 2 =3 indicates that the user feedback manhole cover needs to be replaced, e.g. the user finds that the manhole cover is lost or has been seriously damaged at a certain location;
s320, shifting out the operation information in sequence according to the sequence in the operation queue OptioQue, and judging o 1 When o is a value of 1 If =0, then step S330 is executed, if o 1 If =1, execute step S340;
s330, executing augmented reality query operation for the user, and feeding back a result to an equipment screen;
further, the step S330 further includes:
s331, creating a first minimum heap structure heapQ1, when tree node elements exist in heapQ1, heapQ1 can automatically sort, and enable the distance to a user position (x) u ，y u ) The smallest tree node is at the top of heap for heapQ1, and the following steps continue to be performed to initialize heapQ 1.
S332, traversing the index table and calculating R i To the user location (x) u ，y u ) And calculates R i Relative to the user position (x) u ，y u ) Spatial coverage of angular range [ alpha, beta ]]Acquiring lens parameters of the electronic equipment and obtaining the parameters according to dist and [ alpha, beta ]]Judgment of R i Whether an intersection exists with the visual field range of the lens in space or not, and if the intersection exists, the root is determined i Stored in heapQ 1.
S333, moving out the heap top node of the heapQ1, judging the type of the heap top node, executing the step S334 when the heap top node is a non-leaf node, and executing the step S337 when the heap top node is a leaf node.
S334, sequentially acquiring a child c in the child set eleode of the heap top nodeAnd hild, acquiring the well lid information based on the child and the well lid information table, and acquiring child u ，y u ) Range and further compute child relative user position (x) u ，y u ) Range, when it intersects the lens field of view, pushes child into heapQ 1.
Further, the pushing of child to the heapQ1 refers to the storing of child into the first miniheap data structure heapQ1, heapQ1 being able to reach the user location (x) based on child u ，y u ) So that the heapQ1 heap top node is always a distance (x) from the user's location u ，y u ) The nearest node of (2).
S335, repeat step S334, and when child is the last child in the eleode.
S336, repeating S333-S335 until heapQ1 is empty.
S337, sequentially acquiring well lids P in a child set eleode ik 。
S338, calculating P ik Distance to user position and calculate p ik.position Angle theta relative to the user position, based on P ik Distance to user location and p ik.position Angle theta relative to user position determines P ik Whether it is within the visual field of the lens, when P ik If the lens is located within the field of view, step S339 is performed.
S339, adding P ik And P ik The attribute information of the electronic equipment is displayed in a screen of the electronic equipment, so that a user can view the information of well covers distributed around the user in real time.
S3310, repeating steps S338-S339, when P is ik The step S3311 is performed for the last well lid in the union set of the eleode.
S3311, repeat S337-S3310 until heapQ1 is empty.
S340, according to o 2 Is used for executing a constrained augmented reality query operation for the user, feeding back the result constrained by the user to the screen of the device, and proceeding toAnd performing professional processing according to the feedback result of the user.
Further, the step S340 further includes:
s341, creating a second minimum heap structure heapQ2, traversing the index table, and storing root nodes intersected with the user equipment lens visual field into heapQ2, wherein heapQ2 can automatically sort, so that the distance from the user position (x) is (x) u ，y u ) The nearest tree node is located at the heap top of heapQ 2.
S342, shifting out the heap top node of the heapQ2, and judging the type of the heap top node; when the heap top node is a non-leaf node, step S343 is performed, and when the heap top node is a leaf node, step S346 is performed.
And S343, judging whether the heap top node is intersected with the device lens visual field, executing S344 when the heap top node is intersected with the device lens visual field, otherwise executing S345.
S344, when there is a subset of available children or a reserved manhole cover in the heap top node, indicating that the flag or the ap point is 1, pushing all children of the heap top node into the heapQ2, otherwise, executing step S345.
And S345, when the heapQ2 is empty, executing the step S349, otherwise, executing the step S342.
S346, judging whether the heap top node is intersected with the view field of the device lens, if so, executing a step S347, otherwise, executing a step S345.
S347, when the first child set is empty or the top node does not have a reserved manhole cover, it indicates that the available child set eleode.chilset 1 or eleode.apoint is empty, execute step S345, otherwise, press all manhole covers in the set eleode.chilset 1. eleode.apoint into heapQ 2.
S348, when the pile top node is of a point type and is a well lid element and the pile top node is located in the visual field of the user equipment lens, determining whether the pile top node is of a point type or a well lid element 2 Will be the value of (1), type = o in eleode. flag = (0, type) or eleode. apoint = (ts, te, type) 2 The well lid visualization is shown on the user device screen and step S345 is performed.
S349, checking whether the position of the user exists in the well lid visually displayed on the screenAbnormal well cover P ik If the abnormal well lid P exists, the abnormal well lid P is finished, otherwise, the device background receives the abnormal well lid P ik The image information of (1).
S3410 based on abnormal well lid P ik Is judged and classified to perform processing, and the parameter P is updated according to the progress of the processing ik.appoint And P ik.flag And updating the background database table after the processing is finished.
S3411 based on P ik Obtaining P ik.road Based on P ik.road In the embodiment of the application, the prompt message is sent to a mobile phone of the user in a form of a short message, and the content of the short message is abnormal well lid P ik Will be processed.
S350, judging whether all the operations in the OptioQue are processed or not, finishing when all the operations in the OptioQue are processed, and otherwise, jumping to the step S320.
The embodiment of this application still provides an urban road well lid management device, includes: a memory for storing program instructions;
and the processor is used for calling the program instructions stored in the memory to realize the method provided by the embodiment.
A computer-readable storage medium having stored thereon program code means for implementing at least one instruction or at least one program related to one of the method embodiments.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is merely illustrative of particular embodiments of the invention that enable those skilled in the art to understand or practice the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (8)
1. A method for managing urban road well lids is characterized by comprising the following steps:
s100, acquiring a well lid and well lid information thereof in a target geographical area based on the target geographical area, and constructing a database well lid information table set, wherein the well lid information comprises position information and state information;
s200, constructing an index structure by taking the spatial position of the well lid as main information and other information of the well lid as auxiliary information;
s300, obtaining operation information of the well lid in a target geographic area range and classifying the operation information;
wherein, step S100 includes the steps of:
s110, constructing a plane rectangular coordinate system based on the target geographic area, dividing the target geographic area into M partitions and establishing a partition set R = { R = 1 ，R 2 ，……，R M }，R i Obtaining R for the ith subarea in the target geographical area, wherein i is more than or equal to 1 and less than or equal to M i Position information (x) in a planar rectangular coordinate system imin ，x imax ，y imin ，y imax ），x imin Is R i Smallest abscissa, x, in a coordinate system imax Is R i Maximum in a coordinate systemAbscissa of (a), y imin Is R i Smallest ordinate, y, in the coordinate system imax Is R i The largest ordinate in the coordinate system;
s120, obtaining R i All well lids in the well lid model set P are constructed i ={P i1 ，P i2 ，……，P iq In which P is ik Is R i K is more than or equal to 1 and less than or equal to q;
s130, based on R in database i Establishing an initial well cover information table T i ；
S140, based on P ik Acquiring well lid information, wherein the well lid information comprises position information P ik.position Current state information P ik.flag And future state information P ik.appoint ；
S150, storing the well lid information obtained in the step S140 into T i Internal;
s160, repeating the steps S140 to S150 when the set P is formed i All the well lid information of all the well lids is stored to T i If so, executing step S170;
s170, repeating the steps S120 to S160, obtaining the well lid information tables of all the partitions in the R, and obtaining a database well lid information table set T = { T = (the number of the partitions in the R is one) 1 ，T 2 ，……，T M }；
Wherein, step S200 includes the following steps:
s210, based on T i Middle P i Position information of all manhole covers in the well, P i All manhole covers are gathered to obtain a gathering grouping set G = { G = } 1 ，G 2 ，……，G w }；
S220, grouping G based on aggregation n Construction of leaf node G' n N is more than or equal to 1 and less than or equal to w, and G' n Leaf node attribute of (2);
the leaf node attributes include:
space range G' n.range For aggregating packet G n The two-dimensional space range covered by all the well covers is included;
available child subset G' n.chilset1 Is composed of G n The well lids in available state form a set;
unavailable child subset G' n.chilset2 Is composed of G n The set is composed of all the well lids in the processing state;
neighborhood set G' n.roadset Is G' n.chilset2 A set formed by blocks where each well cover is located;
reservation set G' n.appoint ，G' n.appoint =0 for G n All the well lids in (1) are not reserved, and the reserved set G' n.appoint The manhole cover is formed by a reserved manhole cover;
s230, repeating the step S220 until the operation on all the elements in the set G is completed, and obtaining a set G '= { G' 1 ，G' 2 ，……，G' w Executing step S240;
s240, when w is less than or equal to N, executing the step S270, otherwise executing the step S250;
wherein N is a numerical value preset by a user, and N is a positive integer;
s250, based on a set G '= { G' 1 ，G' 2 ，……，G' w Aggregating all nodes in the cluster according to the coverage range to obtain an aggregated packet set F = { F = } 1 ，F 2 ，……，F w }；
S260, grouping F based on aggregation n Construction of non-leaf node F' n To obtain a set of non-leaf nodes F '= { F' 1 ，F' 2 ，……，F' w And for non-leaf node F' n Setting node attributes, and executing step S240;
wherein the non-leaf node attribute comprises a spatial range of F' n.range For aggregating packet F n A two-dimensional space range covered by all the previous layer of aggregation nodes; child attribute F' n.chilset To be formed by aggregating packets F n A set of all previous level aggregation nodes included therein; available or unavailable of F' n.flag ，F' n.flag =0 denotes that it does not have available children, F' n.flag =1 indicates that there are children available; whether to reserve F' n.appoint ，F' n.appoint =0 for aggregated packet F n All of the well lids included in the above list were not reserved, F' n.appoint =1 denotes an aggregated packet F n Wherein the reserved well cover exists;
s270, G '= { G' 1 ，G' 2 ，……，G' w } or F '= { F' 1 ，……，F' w Constructing a root node root i Root node root of i The method comprises the following steps:
range attribute root i.range Is a partition R i A two-dimensional spatial range of (a);
child attribute root i.chilset Is a set G '= { G' 1 ，G' 2 ，……，G' w } or F '= { F' 1 ，F' 2 ，……，F' w }；
S280, judging T i Whether the information is the last well lid information table in T or not is judged, if yes, a set RootSet = { root) containing M root nodes is obtained 1 ，……，root M And continue to execute step S290, otherwise execute step S210;
s290, based on any partition R in the partition set R i And its corresponding root node root i Establishing an index table;
wherein, step S300 includes the following steps:
s310, establishing an operation queue, and acquiring a pair P in a target geographic area based on a user u ik Generating operation information, and storing the operation information into the operation queue based on the acquisition time, wherein the operation information comprises (o) 1 ，o 2 ，x u ，y u ) Wherein x is u And y u Is the abscissa and ordinate of user u, o 1 And o 2 Is the operation type;
wherein when o 1 If =0, it is the query operation of the augmented reality that represents the user u to feed back;
when o is 1 If =1, user u is fed back by 2 Constrained augmented reality query operation, where o 2 =0 tableThe user is informed that the well lid needs maintenance; o 2 =1 indicates that the user feedbacks the manhole cover to be checked; o 2 =2 indicates that the user feedbacks the manhole cover to be repaired; o 2 =3 indicates that the user feedback manhole cover needs to be replaced;
s320, shifting out the operation information in sequence according to the sequence in the operation queue, and judging o 1 When o is a value of 1 If =0, then step S330 is executed, if o 1 If =1, execute step S340;
s330, executing augmented reality query operation for the user, and feeding back a result to an equipment screen;
s340, according to o 2 The value of (a) is that a user executes a constrained augmented reality query operation, feeds back a query result constrained by the user to an equipment screen, and further performs professional processing according to the user feedback result;
and S350, judging whether all the operations in the operation queue are processed, finishing when all the operations in the operation queue are processed, otherwise, jumping to the step S320.
2. The method of claim 1, wherein in step S140, when P is greater than or equal to P, the method further comprises ik.flag If = (1, null), it represents P ik When P is available ik.flag If = (0, type), it represents P ik The status of (1) is unavailable, wherein, when type =0, the manhole cover is in the maintenance period, when type =1, the manhole cover is in the inspection period, when type =2, the manhole cover is in the maintenance period, and when type =3, the manhole cover is in the replacement period;
P ik.appoint =(t s ，t e type), represents P ik At a starting time t s To the end time t e Treatment based on type in, P ik.appoint = null denotes P ik Is not reserved for processing.
3. The method of claim 2, wherein in step S140, P is selected from the group consisting of ik The well lid information also includes P ik.id 、P ik.month 、P ik.info 、P ik.money And P ik.road ；
Wherein, P ik.id Is P ik The number information of (a);
P ik.month is P ik The applied time of (c);
P ik.info is P ik Processing performed before the current time point;
P ik.money is P ik Consumption generated before the current point in time;
P ik.road is P ik The street corresponding to the position.
4. The method as claimed in claim 1, wherein the index is created in step S290 by constructing a hash table List, which is expressed as R i →root i 。
5. The urban road manhole cover management method according to claim 3, wherein the step S330 comprises the steps of:
s331, creating a first minimum heap structure, and continuously executing the following steps to initialize the first minimum heap structure;
s332, traversing the index table and calculating R i To the user location (x) u ，y u ) And calculating R i Relative to the user position (x) u ，y u ) Spatial coverage of angular extent [ alpha, beta ]]Acquiring the lens parameters of the electronic equipment and judging R according to the minimum distance and the space coverage angle range i Whether intersection exists in space with the visual field range of the lens or not, and if intersection exists, root is determined i Storing into a first minimum stack structure;
s333, moving out a heap top node of the first minimum heap structure, judging the type of the heap top node, executing the step S334 when the heap top node is a non-leaf node, and executing the step S337 when the heap top node is a leaf node;
s334, sequentially obtaining the children in the child set of the heap top node, and calculating the range of the child setTo the user location (x) u ，y u ) And further calculates the child set range relative user position (x) u ，y u ) When the child set range intersects with the lens view range, pressing the child whose child set range intersects with the lens view range into the first minimum stack structure;
s335, repeating the step S334 until the last child in the child set completes the step S334, and executing the following step S336;
s336, repeating S333-S335 until the first minimum stack structure is empty;
s337, sequentially acquiring well lids P which are combined and concentrated by the first child set and the second child set of the heap top node ik The first set of children is a subset of available children, and the second set of children is a subset of unavailable children;
s338, calculating P ik Distance to user position and calculate P ik.position Angle theta relative to the user position, based on P ik Distance to user position and P ik.position Angle theta relative to the user position determines P ik Whether or not it is within the visual field of the lens, when P ik Executing step S339 when the lens is located within the field of view;
s339, adding P ik And P ik The attribute information of the well lid is displayed in a screen of the electronic equipment, so that a user can check the information of the well lids distributed around the user in real time;
s3310, repeating steps S338-S339, when P is ik When the manhole cover is the last manhole cover in the union of the first child set and the second child set, executing step S3311;
s3311, repeating S337-S3310 until the first minimum heap structure is empty.
6. The method for managing the urban road manhole cover according to claim 5, wherein the step S340 comprises the following steps:
s341, creating a second minimum heap structure, traversing the index table, and storing a root node which is intersected with the visual field of the user equipment lens into the second minimum heap structure, wherein the second minimum heap structure is automatically sequenced, so that a node closest to the user position is positioned at the top of a heap;
s342, moving out the heap top node of the second minimum heap structure, and judging the type of the heap top node; when the heap top node is a non-leaf node, executing step S343, and when the heap top node is a leaf node, executing step S346;
s343, judging whether the heap top node is intersected with the view field of the equipment lens, executing S344 when the heap top node is intersected with the view field of the equipment lens, otherwise executing the step S345;
s344, when the heap top node has an available child subset or a reserved manhole cover, pressing all children of the heap top node into a second minimum heap structure, otherwise, executing the step S345;
s345, when the second minimum stack structure is empty, executing the step S349, otherwise executing the step S342;
s346, judging whether the heap top node is intersected with the equipment lens visual field, if so, executing a step S347, otherwise, executing a step S345;
s347, when the first child set is empty or the top-piling node does not have a reserved manhole cover, executing the step S345, otherwise, pressing all manhole covers of the first child set and the reserved manhole cover in the top-piling node into a second minimum pile structure;
s348, when the pile top node is of a point type, namely the well lid element, and the pile top node is located in the visual field of the user equipment lens, the pile top node is according to o 2 Is equal to (0, type) or is equal to (t) s ，t e Type = o in type) 2 The well lid is visually displayed on the user equipment screen, and step S345 is executed;
wherein, the eleode.flag represents the state information of the well lid of the heap top node, and the eleode.apoint represents the future state information of the well lid of the heap top node;
s349, checking whether abnormal well lid P at the position of the user exists in the visually displayed well lids on the screen ik If yes, ending, otherwise, receiving abnormal well lid P in background ik The image information of (1);
s3410 based on abnormal well lid P ik Is judged and classified, thereby the image information is processedAnd updating the parameter P according to the progress of the processing ik.appoint And P ik.flag After the processing is finished, updating a background database table;
s3411 based on P ik Obtaining P ik Street P corresponding to the position ik.road Based on P ik.road And acquiring related users and sending prompt information.
7. The utility model provides an urban road well lid management device which characterized in that includes:
a memory for storing program instructions;
a processor for invoking the program instructions stored in the memory to implement a method of urban manhole cover management according to any of claims 1 to 6.
8. A computer-readable storage medium, characterized in that it stores program code for implementing a method for urban manhole cover management according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210559950.2A CN114648259B (en) | 2022-05-23 | 2022-05-23 | Urban road well lid management method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210559950.2A CN114648259B (en) | 2022-05-23 | 2022-05-23 | Urban road well lid management method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114648259A CN114648259A (en) | 2022-06-21 |
| CN114648259B true CN114648259B (en) | 2022-09-13 |
Family
ID=81996929
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210559950.2A Active CN114648259B (en) | 2022-05-23 | 2022-05-23 | Urban road well lid management method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114648259B (en) |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107833280B (en) * | 2017-11-09 | 2021-05-11 | 交通运输部天津水运工程科学研究所 | Outdoor mobile augmented reality method based on combination of geographic grids and image recognition |
| CN109246195B (en) * | 2018-08-13 | 2023-11-24 | 孙琤 | Intelligent management and control method and system for pipe network integrating augmented reality and virtual reality |
| CN109887242B (en) * | 2019-01-16 | 2020-11-03 | 珠海优特电力科技股份有限公司 | Method, device and system for sending alarm information to user terminal |
| CN112765405B (en) * | 2019-10-21 | 2022-11-25 | 千寻位置网络有限公司 | Method and system for clustering and inquiring spatial data search results |
| JP2023524351A (en) * | 2020-03-04 | 2023-06-12 | ドゥ，イジュン | Systems and methods for utilizing search trees and tagging data items for data collection management tasks |
| CN111639408B (en) * | 2020-05-27 | 2022-11-15 | 上海实迅网络科技有限公司 | AR technology-based urban pipe network pipeline 3D model display method and system |
| CN114115545A (en) * | 2021-11-30 | 2022-03-01 | 北京猫眼视觉科技有限公司 | AR well lid labeling method, system, equipment and storage medium |
| CN114254353A (en) * | 2021-12-22 | 2022-03-29 | 上海阵方科技有限公司 | Data processing method and device based on privacy protection and server |
| CN114241808B (en) * | 2022-02-22 | 2022-05-24 | 科大天工智能装备技术（天津）有限公司 | Method, equipment and storage medium for constructing and distributing tree indexes of shared parking spaces |
| CN114356939B (en) * | 2022-03-21 | 2022-05-24 | 科大天工智能装备技术（天津）有限公司 | Street lamp intelligent management method and device applied to urban space and storage medium |
-
2022
- 2022-05-23 CN CN202210559950.2A patent/CN114648259B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN114648259A (en) | 2022-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108764777B (en) | Electric logistics vehicle scheduling method and system with time window | |
| CN108981739B (en) | Path planning method, device, server and storage medium | |
| CN105160889B (en) | More source points collaboration leading method of road network traffic flow under a kind of urban waterlogging scene | |
| CN106225800B (en) | Environmentally friendly vehicle navigation path construction method based on real-time road condition information | |
| CN106372255B (en) | A kind of recognition methods of street view image and device | |
| CN112232330A (en) | Lane connecting line generation method and device, electronic equipment and storage medium | |
| CN111536987A (en) | Vehicle path planning method for cleaning large-area garbage | |
| CN113068224B (en) | Ant colony algorithm implementation method and device for constructing mesh transmission system | |
| CN114648259B (en) | Urban road well lid management method | |
| CN115271190B (en) | Method and device for arranging garbage centralized recovery points | |
| CN107908899B (en) | Line selection system and line selection method for construction road of wind power plant | |
| CN110784883A (en) | Base station construction evaluation method, device, equipment and storage medium | |
| CN113590706A (en) | Visualization platform based on CIM | |
| CN111815016A (en) | Power transmission line path optimization method and computer program product | |
| CN117516562B (en) | Road network processing method and related device | |
| JP5094904B2 (en) | Regional information retrieval server and regional information retrieval method | |
| CN113256029A (en) | In-building path finding method, device, equipment and storage medium | |
| CN113219994A (en) | Grid map optimal path planning method comprising traffic signal lamps | |
| CN110672100B (en) | Rapid terrain path planning parallelization method based on multiple resolutions | |
| CN115619900B (en) | Point cloud map topological structure extraction method based on distance map and probability road map | |
| CN111477006A (en) | Traffic network model construction method based on Goodpasture path planning interface | |
| CN114241808B (en) | Method, equipment and storage medium for constructing and distributing tree indexes of shared parking spaces | |
| CN108460178B (en) | Multi-imaging satellite coverage optimization method considering sensor side sway | |
| CN108268976B (en) | Multi-imaging satellite area coverage task maximum completion time minimization planning method | |
| CN114877901B (en) | Urban emergency path planning method based on map gridding fusion and A-star search |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |