A beidou grid code space-time data phased pipeline track traceability monitoring method

Abstract

The application provides a Beidou grid code space-time data phased pipeline track tracing monitoring method, comprising the following steps: reading the alternate orientation and the interpenetration form of the intersection grid unit of the adjacent subdivision level, gradually disassembling the original planned illegal parking road section coverage unit and the alternative connection single target unit, and identifying the fixed disassembly trace formed by the staggered levels; along the fixed disassembly trace, the level artifact area is identified, the illegal parking road section coverage unit and the treatment single target unit are merged into the same road physical area, the common grid area is extracted, and the remaining units are divided into non-common grid areas; from the cross-border calling area, the direction of the single target unit which deviates from the original planned coverage edge is identified, the continuous crossing intersection grid units are connected, and the cross-border calling path is formed; along the cross-border calling path, the actual treatment area of the law enforcement terminal is tracked, the original planned grid unit occupied by the alternative illegal parking Skill is identified, the records of these grid event states are separated from the connection execution data, and the damaged residual trace data is formed.

Description

Technical Field

[0001] This invention relates to the field of information technology, and in particular to a method for tracing and monitoring the phased pipeline trajectory of BeiDou grid code spatiotemporal data. Background Technology

[0002] In urban governance scenarios involving illegal parking, roadside videos detect illegally parked vehicles and record them in the intersection's grid event. An agent responds to user commands to "process illegal parking on this section," matching the illegal parking skill, confirming the no-parking rules and responsible parties through a world model, and issuing a processing order with a BeiDou grid code to the enforcement terminal after manual confirmation. The processing result is then written back to the original intersection grid event. Therefore, trajectory tracking and monitoring of BeiDou grid code spatiotemporal data is a crucial step in ensuring the reliability of illegal parking processing records. Its determination directly affects whether the succession range of the alternative illegal parking skill can be considered consistent with the original processing plan, and also relates to the identification of processing responsibility and the inheritance of subsequent tasks. Ideally, by comparing the coverage units of the illegally parked road sections defined in the original processing plan with the target units of the processing orders issued by the alternative illegal parking skill, the degree of overlap can be used to determine whether the alternative processing is equivalently implemented, providing a basis for the identification of enforcement responsibility and the writing back of the illegal parking event status. However, in actual trajectory tracking processes, the conclusions obtained from grid-by-grid comparisons are unreliable. A high overlap rate may mask the actual transgression of a parking violation order beyond the target illegal parking section or the boundary of authority and responsibility. Conversely, a low overlap rate may misjudge faithful execution as a deviation from the intended scope. Furthermore, it is difficult to reliably conclude whether the processing results written with a downgraded grid level can be accurately traced back to the original intersection grid event. The reason for these problems is that after the original illegal parking skill is downgraded during the execution of the processing task, the agent needs to hand over the task to an alternative illegal parking skill running at a different segmentation level. The intersection grid events written by the roadside video, the illegal parking section coverage unit planned by the original skill, and the target unit of the processing order generated by the alternative skill may use different grid granularities. Adjacent segmentation levels are not simply nested; their grid orientations and unit boundaries intersect. To make the comparison process intuitive and computationally achievable, conventional methods typically treat the coverage units of different segmentation levels as units at the same scale and check them grid by grid. While this method can quickly generate overlap readings, the same illegally parked road segment, after being represented by different grid levels, can only form an overlap ratio limited by a fixed splitting pattern. This leads to a fixed mismatch in the comparison readings caused by the inherent layering. When this fixed mismatch is superimposed on the actual boundary crossing, the local handling range of the substitute illegal parking skill crossing into the adjacent road segment may be averaged by the coarse grid, thus exhibiting a high overlap rate; conversely, the handling range originally located within the target illegally parked road segment may be split by the interleaved boundary, thus exhibiting a low overlap rate. Consequently, layering artifacts and actual boundary crossings are mixed together, making it difficult to reliably distinguish between compliant handling and boundary crossing calls. It is also difficult to reconcile a unified comparison standard with ensuring the credibility of cross-layer judgments. Therefore, in the case of the substitute illegal parking skill continuing the handling task across different layers, how to remove the inevitable mismatch caused by layering, identify the substitute call that truly crosses the edge of the original planned road segment or the boundary of authority and responsibility, and make a reliable traceability judgment on the writing back of handling results damaged by grid layering, has become an urgent technical problem to be solved. Summary of the Invention

[0003] This invention provides a method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data, including: Obtain the planning trace data generated by the Agent calling the original illegal parking Skill and the execution data generated by the cross-layer continuation of the alternative illegal parking Skill; read the intersection grid event code and the single target unit code for handling; and identify the layering level of the original plan and the alternative continuation. Read the alternating orientation and interweaving pattern of adjacent hierarchical levels, disassemble the illegal parking section coverage unit and the single target unit for disposal level by level, and identify the fixed disassembly traces formed by the hierarchical intersection; Identify hierarchical artifact regions along fixed splitting marks and extract common and non-common regions; By excluding hierarchical artifact areas from the never-common-parking zone, and combining the no-parking rules and responsible parties confirmed by the world model, we examine the spatial form of the alternative illegal parking skill crossing the original planning coverage edge, and extract the over-boundary call area and the compliant call area. Identify the direction from which the outbound call order passes through the original planned coverage edge from the outbound call area, connect the continuously crossed intersection grid units, and form an outbound call path; The actual processing area of ​​the law enforcement terminal is traced along the over-boundary call path, the original planned grid cell occupied by the replaced illegal parking Skill is identified, the records of the event status of these grid cells are separated and written back, and the damaged trace data is formed. Based on the BeiDou grid code spatiotemporal stamp, and following the phased sequence of writing illegal parking events, matching illegal parking skills with world model verification and law enforcement write-back, the damaged trace data is spliced ​​with the continuous execution data in the compliant call area to generate the phased pipeline trajectory traceability monitoring results of BeiDou grid code spatiotemporal data.

[0004] Preferably, the step of reading the intersection grid event code and the single-target unit code for handling, and identifying the hierarchical levels of the original plan and alternative connections, includes: Read the coverage units of illegally parked road sections and their BeiDou grid codes from the original planning trace data, and read the intersection grid events written by roadside videos and their BeiDou grid codes from the grid event database; For the BeiDou grid codes of the illegal parking section coverage unit, the intersection grid event, and the single target unit, the length of the code bits and the prefix bit string are analyzed bit by bit to identify the differences in hierarchical granularity under the BeiDou grid code system and determine the hierarchical affiliation of the original plan and the replacement succession.

[0005] Preferably, the step of reading the alternating orientation and interweaving pattern of adjacent hierarchical levels, disassembling the illegal parking section coverage unit and the single-target unit for disposal level by level, and identifying the fixed disassembly marks formed by the hierarchical intersection includes: Based on the original plan and the replacement succession of the subdivision level, read the alternating orientation definition between adjacent subdivision levels in the grid coding extension rule table, extract the reference axis deflection direction and grid edge direction of each level of the illegal parking section coverage unit and the single target unit of the treatment relative to the parent grid of the previous level, and form a level alternating orientation sequence. The intersection grid cell outline written along the roadside video is read, the edge contact position of the adjacent segmented sub-grids inside the parent grid is read, the interlacing tooth-like interpenetration pattern formed by the sub-grid edges crossing the parent grid boundary is identified, and the cover unit sub-grid set and the target unit sub-grid set are obtained by disassembling them down level by level. Along the common boundary of the interlaced tooth-like pattern, compare the deviation difference between the alignment position of the Beidou grid coding bit string of adjacent levels and the direction of the grid edge, and mark the sub-grids that fall into the misalignment area of ​​the adjacent parent grid due to inconsistent level orientation as fixed split marks.

[0006] Preferably, the step of extracting common and non-common regions along the artifact region of the fixed splitting trace includes: Using the outermost terminal grid of each convex and concave tooth in the strip-shaped area formed by the fixed splitting marks along the interlaced tooth-like pattern as the boundary reference, the sub-grid covered by the boundary reference range is defined as the hierarchical artifact area. Based on the consistency of the Beidou grid code prefix bit string between the illegal parking section coverage unit and the single target unit, the two are merged into the continuous driving lane space anchored by the intersection grid event, and the physical grid positions of the coverage unit sub-grid set and the target unit sub-grid set are compared one by one. Adjacent subgrids pointing to the same road surface segment are assigned to the common grid area, while subgrids pointing to different road surface segments or appearing only on one side of the set are assigned to the non-common grid area.

[0007] Preferably, the process of excluding hierarchical artifact areas from the never-common-landing area, combining the no-parking rules and responsible parties confirmed by the world model, examines the spatial form of the alternative illegal parking skill crossing the original planned coverage edge, and extracts the out-of-bounds call area and the compliant call area, including: For each sub-grid in the non-common grid area, the BeiDou grid code is compared with the hierarchical artifact area sub-grid code. Sub-grids whose codes fall into the hierarchical artifact area are removed to form a candidate call area after removing hierarchical artifacts. Based on the no-parking rules recorded in the world model, the road edge lines on both sides of the illegal parking section coverage unit are read as the road edge lines. The road section jurisdiction boundary corresponding to the right and responsibility entity identifier is read. After superimposing the road edge lines and the road section jurisdiction boundary, a layer of grid width is extended outside the illegal parking section coverage unit to form a semantic extension zone of the original planned coverage edge.

[0008] Preferably, the step of identifying the direction from which the out-of-bounds call item extends beyond the original planned coverage edge from the out-of-bounds call area, and connecting the continuously crossed intersection grid cells to form an out-of-bounds call path, includes: For each out-of-bounds call subgrid in the out-of-bounds call area, the point where the normal perpendicular from its center to the road edge of the illegally parked section coverage unit is taken as the nearest intersection point, and the reverse orientation of the normal pointing from the center of the subgrid to the nearest intersection point is read as the outgoing direction vector. Mark the location of the road edge line where the outbound call subgrid breaks out as the edge exit. Search for adjacent outbound call subgrids whose azimuth deviation does not exceed the preset azimuth threshold along the outbound direction vector. Record the earliest outbound call subgrid in the direction of the processing order as the outbound start point and the latest outbound call as the outbound end point. The outbound call subgrids, which are continuously arranged from the outbound starting point to the outbound ending point, are connected sequentially along the direction of the disposal order. The outbound call path is formed according to the common prefix bit string of the outbound call subgrids and the intersection grid unit code.

[0009] Preferably, the step of tracing the actual processing area of ​​the law enforcement terminal along the boundary call path, identifying the original planned grid cells occupied by the replaced illegal parking Skill, separating and writing back the records of these grid event states, and forming damaged trace data includes: The outbound call subgrids are arranged continuously from the outbound start point to the outbound end point along the outbound call path. The timestamps of the handling actions and the handling result codes of each outbound call subgrid in the continuous execution data of the law enforcement terminal are read and mapped to obtain the actual handling area grid sequence. Compare the road segment numbers corresponding to each grid in the actual treatment area grid sequence with the sub-grid set of the coverage unit of the illegally parked road section, and mark the coverage unit sub-grid with the same road segment number as the original planned grid unit that was occupied. Records of the event states of these original planned grid units are separated and written back from the continuous execution data, and the timestamps of the corresponding out-of-bounds calls to sub-grids and the handling actions are marked to form damaged trace data.

[0010] Preferably, based on the BeiDou grid code spatiotemporal stamp, and following the phased sequence of writing the illegal parking event, matching the illegal parking skill with the world model verification and enforcement write-back, the damaged trace data is spliced ​​with the subsequent execution data in the compliant call area to generate the phased pipeline trajectory tracing and monitoring results of the BeiDou grid code spatiotemporal data, including: For the damaged trace data, the continuous execution data in the compliant call area, the no-parking rule matching record and the power and responsibility entity identification record in the intersection grid event record and the planning trace data, the time component and spatial grid component of the Beidou grid code time and space stamp are extracted one by one, and all records are arranged in chronological order according to the time component to obtain the sequence of handling events; Using the start and end timestamps of each stage as interval boundaries, each record in the sequence of events is categorized into three stages: illegal parking event writing, illegal parking skill matching and world model verification, and manual confirmation and law enforcement write-back, based on the interval to which the timestamp falls, thus obtaining a set of staged handling records.

[0011] Preferably, the semantic extension band forming the original planned coverage edge includes: For each subgrid in the candidate call area, determine whether it falls within the illegal parking section coverage unit or the semantic extension band; Subgrids that continuously extend beyond the semantic expansion zone along the direction of the processing order and have a number of consecutive subgrids not less than a preset threshold are marked as out-of-bounds call subgrids and connected in series to form an out-of-bounds call area. Subgrids that fall within the coverage unit of illegally parked road sections or within the semantic extension zone are marked as compliant call subgrids and connected in series to form a compliant call area.

[0012] Preferably, the process of obtaining the phased disposal record set includes: Each write-back record in the damaged trace data is inserted into the time sequence position of the manual confirmation and law enforcement write-back stage according to the corresponding out-of-bounds call subgrid identifier and the timestamp of the handling action; The continuous execution data in the compliant call area is sequentially spliced ​​to the time sequence position of the manual confirmation and law enforcement write-back stage according to the timestamp of the handling action. The three stages of illegal parking event writing, illegal parking skill matching and world model verification, and manual confirmation and law enforcement write-back are linked to form a phased pipeline trajectory traceability monitoring result.

[0013] The technical solutions provided by the embodiments of the present invention may include the following beneficial effects: This invention discloses a phased pipeline trajectory tracing and monitoring method for BeiDou grid code spatiotemporal data. Addressing the inconsistency in planning execution caused by cross-level calls by agents during urban management illegal parking handling, when the original illegal parking skill and the alternative illegal parking skill overlap and split at intersection grid units due to differences in hierarchical levels, the method identifies hierarchical artifact areas and merges the illegal parking section coverage unit and the single-target unit of the handling into the same physical area. This accurately locates the out-of-bounds call area formed by the alternative skill crossing the original planning edge. The method tracks the actual handling area of ​​the enforcement terminal along the out-of-bounds call path, separating the original planning grid units occupied by the alternative skill to form damaged trace data. Finally, based on the BeiDou grid code spatiotemporal stamp and following the phase sequence of illegal parking event writing, skill matching and world model verification, manual confirmation and enforcement write-back, the damaged trace data and the subsequent execution data in the compliant call area are spliced ​​together to reconstruct the complete handling trajectory. This achieves traceable monitoring of the entire process of urban management illegal parking handling in cross-level continuation scenarios, effectively solving the problems of data integrity damage and blurred responsibility boundaries caused by alternative calls. Attached Figure Description

[0014] Figure 1 This is a flowchart of a phased pipeline trajectory tracing and monitoring method for BeiDou grid code spatiotemporal data according to the present invention.

[0015] Figure 2 This is a schematic diagram of a phased pipeline trajectory tracing and monitoring method for BeiDou grid code spatiotemporal data according to the present invention.

[0016] Figure 3 This is another schematic diagram of a phased pipeline trajectory tracing and monitoring method for BeiDou grid code spatiotemporal data according to the present invention. Detailed Implementation

[0017] To enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this specification, and not all embodiments. Based on the embodiments in this specification, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of this specification.

[0018] like Figures 1-3 This embodiment of a method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data may specifically include: S101. Obtain the planning trace data formed by calling the original illegal parking skill when the Agent handles illegal parking on the road segment and the execution data formed by cross-layer continuation of the alternative illegal parking skill. Read the intersection grid event code written by the roadside video and the single target unit code in the execution data to identify the layering level of the original plan and the alternative continuation.

[0019] The system acquires planning trace data generated when the Agent calls the original illegal parking skill during the handling of illegal parking on a road segment, as well as execution data generated when the alternative illegal parking skill is connected across layers. It reads the original planned illegal parking segment coverage unit and its associated BeiDou grid code from the planning trace data, reads the intersection grid event written by roadside video and its associated BeiDou grid code from the grid event database, and reads the single-target unit for handling and its associated BeiDou grid code from the execution data. Based on the BeiDou grid codes carried by the illegal parking segment coverage unit, the intersection grid event, and the single-target unit for handling, it performs bit-by-bit parsing of the bit length and prefix bit string in the codes to determine the layer level to which the original planning trace data and the alternative execution data belong. It identifies the differences in layer granularity of the intersection grid event, the illegal parking segment coverage unit, and the single-target unit for handling under the BeiDou grid code system, thus determining the layer level affiliation of the original plan and the alternative connection.

[0020] In one implementation, the Agent responds to a user's "process illegal parking on this road segment" command, invoking the original illegal parking skill to generate planning trace data for the target illegal parking segment. This planning trace data includes the original planned coverage unit of the illegal parking segment and its associated BeiDou grid code, no-parking rule matching records, and the identifier of the responsible party. If the original illegal parking skill is downgraded during execution, the Agent transfers the task to an alternative illegal parking skill running at an adjacent layer level, forming cross-layer execution data. This execution data includes the single target unit for processing issued by the alternative illegal parking skill and its associated BeiDou grid code, the time of issuance by the enforcement terminal, and the time of write-back of the processing result. The BeiDou grid code corresponding to the event location is read from the intersection grid events written from the roadside video, serving as the original event anchor point for the intersection grid events.

[0021] Specifically, the BeiDou grid code adopts a hierarchical coding structure, with the number of bits increasing as the layering level deepens. The coarse level occupies only a small number of bits; for example, the coarse level has 10 bits, the intermediate level has 14 bits, and the fine level has 18 bits. The fine level adds sub-grid identifier bits to the prefix of the coarse level. For the BeiDou grid codes carried by the illegal parking section coverage unit, the original event anchor point, and the single-target handling unit, the code strings are parsed bit by bit according to the BeiDou grid code specification. The common starting segment of the three code strings is taken as the prefix bit string. The coarse level belonging to the prefix bit string is extracted, and the depth of the fine level is determined based on the remaining bits appended after the prefix bit string.

[0022] For example, when the intersection grid event written by the roadside video uses an 18-bit segmentation level, the original planned coverage unit uses a 14-bit segmentation level, and the replacement Skill handling single target unit uses a 10-bit segmentation level, the first 10 bits common to all three are taken as a common prefix bit string to determine that the three share the same coarse level affiliation. Then, the remaining tail part numbers of each encoding string are recorded as L1, L2, and L3, respectively, where L1 corresponds to the number of down-probing bits of the original event anchor point, L2 corresponds to the number of down-probing bits of the illegal parking section coverage unit, and L3 corresponds to the number of down-probing bits of the handling single target unit. By comparing the differences between L1, L2, and L3, the difference in the level granularity of the three under the Beidou grid code system is determined, and the segmentation level affiliation of the original plan and the replacement is determined.

[0023] S102. Read the alternating orientation of adjacent subdivision levels and the interweaving pattern of intersection grid units, disassemble the original planned illegal parking section coverage unit and the alternative continuous treatment single target unit step by step, and identify the fixed dismantling traces formed by the hierarchical intersection.

[0024] Based on the original and alternative hierarchical classifications, the alternating orientation definitions between adjacent hierarchical levels are read from the grid coding extension rule table. The alternating orientation refers to the periodic deflection of the reference axes of adjacent hierarchical levels in the latitude and longitude directions. For each hierarchical level of the illegally parked road segment coverage unit and the single-target unit, the reference axis deflection direction and grid edge orientation relative to the parent grid of that level are extracted to form a hierarchical alternating orientation sequence. Based on this hierarchical alternating orientation sequence, along the intersection grid unit outline written from the roadside video, the edge contact positions of the sub-grids of adjacent hierarchical levels within the parent grid are read. The interlacing tooth-like interpenetration pattern formed by the sub-grid edges crossing the parent grid boundary is identified. The illegally parked road segment coverage unit and the single-target unit are then disassembled level by level to obtain the coverage unit sub-grid set and the target unit sub-grid set. Based on the set of subgrids of the coverage unit and the set of subgrids of the target unit, along the common boundary of the interlaced toothed pattern, the deviation difference between the alignment position of the Beidou grid code bit string of the adjacent level and the direction of the grid edge is compared, and it is determined which subgrids will inevitably fall into the misalignment area of ​​the adjacent parent grid due to inconsistent level orientation. The subgrids covered by the misalignment area are marked as fixed split marks formed by the hierarchical interlacing between the illegal parking section coverage unit and the single target unit of the disposal.

[0025] In urban governance scenarios involving illegal parking, the agent has identified the hierarchical classification of the original planning data and the alternative execution data. Further characterization is needed to depict the inevitable splitting pattern resulting from the hierarchical overlap between the two, in order to eliminate the interference of hierarchical artifacts on subsequent trajectory tracing. In one implementation, the BeiDou two-dimensional grid code, in the extended subdivision system adopted in this scheme, follows an orientation rule of periodic deflection of the latitude and longitude reference axes between adjacent subdivision levels. Alternating orientation refers to the fixed-angle deflection of the longitude and latitudinal axes of the subgrid relative to the parent grid when dividing from the parent grid to the next level. For example, when the original planning uses a 14-bit subdivision level and the alternative execution uses a 10-bit subdivision level, the reference axis of the 14-bit subgrid exhibits a clockwise deflection of 15 degrees azimuth angle θ relative to the reference axis of the 10-bit parent grid. However, when dividing to the next level of 18 bits, its reference axis exhibits a counterclockwise rotation of 15 degrees azimuth angle θ relative to the 14-bit level. The alternating orientation definition is recorded in the extended subdivision rule table deployed along with the grid coding system, which can be read directly without on-site calculation; the azimuth angle θ at each level is the registered value in the rule table, and the registration basis is to ensure that the convex and concave teeth formed by the adjacent subgrids at the edge of the parent grid have a identifiable span of not less than one subgrid side length, and that the subgrid still falls completely within the subdivision range of the parent grid after deflection. In this embodiment, it is registered as 15 degrees.

[0026] Specifically, for each of the sub-levels where the illegally parked road segment coverage unit and the single-target disposal unit are located, the reference axis deflection azimuth and grid edge orientation of each level relative to the parent grid of the previous level are read one by one. The deflection azimuth is recorded as the azimuth angle θ, and the grid edge orientation is recorded as the clockwise endpoint position string of the four sides. The deflection azimuth angle θ and the endpoint position string of the four sides of each level are arranged in order from coarse to fine according to the sub-level, forming a level alternating orientation sequence. The level alternating orientation sequence describes the cumulative deflection path of the reference axis of each sub-grid during the process of descending from the coarse-level parent grid to the level where the illegally parked road segment coverage unit and the single-target disposal unit are located.

[0027] In one embodiment, the intersection grid cell outline is written along the roadside video. The intersection grid cell refers to the fine-level grid cell anchored by the intersection grid event. According to the deflection direction recorded by the alternating orientation sequence of the hierarchy, the contact position of the sub-grids of the adjacent sub-levels along the four sides inside the parent grid is read level by level. The deviation length and deviation direction of the sub-grid edge relative to the parent grid edge are recorded. The deviation length is expressed in the normalized unit of the sub-grid side length and the value range is 0 to 1.

[0028] It should be noted that, due to the deflection of the reference axes of adjacent subdivision levels, the edges of the sub-mesh are not parallel to the edges of the parent mesh, but rather form a jagged, interlaced pattern.

[0029] Specifically, when the eastern edge of the coarse-level parent grid runs north-south, and the eastern edge of the fine-level sub-grid is adjacent to the eastern edge of the parent grid by alternating short horizontal and short diagonal segments due to a 15-degree clockwise rotation of the reference axis, the horizontal segment is inside the parent grid, while the diagonal segment protrudes into the western interior of the adjacent parent grid, forming outward-protruding teeth. When the next level reference axis rotates back by 15 degrees, inward-recessed teeth are formed. By connecting all the protruding and concave teeth appearing along the four edges of the parent grid in a clockwise sequence, the staggered tooth-like interweaving pattern presented by the strata level where the illegal parking section coverage unit and the single-target unit are located are obtained. This staggered tooth-like interweaving pattern depicts the fixed splicing boundary determined by the difference in strata orientation itself, and is unrelated to actual handling or planning boundary violations. For the illegally parked road segment coverage unit and the single-target unit for handling, along the dividing line determined by the staggered serrated interlacing pattern, the illegally parked road segment coverage unit is expanded into a set of coverage unit sub-grids according to its own segmentation level, and the single-target unit for handling is expanded into a set of target unit sub-grids according to its own segmentation level. The sub-grids within both sets maintain their original segmentation level and are not uniformly disassembled to the same finest level, in order to preserve the difference in coarse and fine levels required for cross-level comparison. Further, for the sub-grids adjacent to each other along the common boundary of the staggered serrated interlacing pattern in the coverage unit sub-grid set and the target unit sub-grid set, the BeiDou grid code tail string of each pair of adjacent sub-grids is read, and the bit string alignment position is compared. The specific method involves padding the end of the coarse-level subgrid's encoding with zeros based on the difference in bit length between the fine-level and coarse-level encodings. This means appending a corresponding number of zeros to the end, ensuring the padded bit string length matches the fine-level subgrid's encoding bit length. Then, it's compared bit-by-bit with the corresponding bit string of the fine-level subgrid, while simultaneously reading the difference in deflection angle ΔΦ between the two grid edges. ΔΦ is obtained by subtracting the azimuth angle θ of two adjacent levels in the alternating orientation sequence. If the padded bit string segments of the two subgrids align at the same position, and the absolute value of ΔΦ does not exceed a preset tolerance threshold of 1 degree, then the pair of subgrids is determined to belong to the same physical grid area. If the padded bit string segments are misaligned, or the absolute value of ΔΦ exceeds the tolerance threshold, then the pair of subgrids is determined to fall into the misalignment area of ​​the adjacent parent grid due to inconsistent level orientation. The preset tolerance threshold of 1 degree is determined by the azimuth quantization interval of the grid edge direction bit string. Twice this interval is taken as the upper limit of the tolerance. The azimuth quantization interval is the smallest resolvable azimuth angle discretely registered by the endpoint bit string according to the edge direction. All sub-grids identified as misaligned areas are connected together along the common boundary of the interlaced tooth-like pattern to form a strip-shaped region. This strip is marked as a fixed splitting mark formed by hierarchical interlacing between the illegal parking section coverage unit and the single-target unit for handling. This fixed splitting mark is independent of the actual handling behavior of the alternative illegal parking Skill and is determined solely by the hierarchical deflection rules of the BeiDou grid code.

[0030] S103. Identify the hierarchical artifact area along the fixed split traces, merge the illegal parking section coverage unit and the single target unit of the disposal into the same road physical area, extract the common grid area, and classify the remaining units as non-common grid areas.

[0031] Based on the fixed splitting marks forming a strip-shaped area along an interlaced, toothed pattern, using the outermost terminal grid of each convex and concave tooth within the strip-shaped area as the boundary reference, all sub-grids covered by the fixed splitting marks are delineated as a hierarchical artifact strip-shaped range, and the sub-grids within this range are marked as hierarchical artifact areas. Based on the consistency comparison results of the BeiDou grid encoding prefix bit strings carried by the illegally parked road segment coverage unit and the single-target unit, the two are merged into the same road physical area. The road physical area refers to the continuous lane space anchored by the intersection grid event written by the roadside video. For the coverage unit sub-grid set and the target unit sub-grid set within this area, the physical grid positions are compared one by one to determine whether they point to the same road surface segment within the road physical area. If the physical location of adjacent sub-grids in the coverage unit sub-grid set and the target unit sub-grid set points to the same road segment, then the pair of sub-grids is classified into the common location area; if they point to different road segments or only appear in one of the sets, then the sub-grid is classified into the non-common location area, thus obtaining the common location area and the non-common location area within the road physical area.

[0032] In urban governance scenarios involving illegal parking, the agent has delineated fixed splitting marks formed by hierarchical overlap between the illegal parking section coverage unit and the single-target unit for handling. Based on this, it is necessary to remove hierarchical artifacts that do not actually represent the boundary violations from the comparison scope, merging both into the same road physical area for grid-based comparison. In one implementation, the fixed splitting marks form a strip-shaped area connected along an interlacing, tooth-like pattern, with the outermost terminal grids of the convex and concave teeth on both sides constituting the outermost contour of this strip-shaped area. Using the outermost terminal grids of the convex and concave teeth as boundary references, all sub-grids covered by the fixed splitting marks are delineated as the hierarchical artifact strip-shaped range, and the sub-grids within this range are marked as hierarchical artifact areas.

[0033] Specifically, the process of delineating the hierarchical artifact band is carried out segment by segment along the toothed splicing direction of the interlaced toothed pattern. Any convex tooth on the fixed splitting mark is taken, and the BeiDou grid code of the top sub-grid of that convex tooth and the bottom terminal grid of the adjacent concave tooth along the toothed splicing direction is read. All sub-grids arranged between the two codes along the toothed splicing direction are included in the hierarchical artifact band. The process continues along the toothed splicing direction, reading the next pair of convex and concave teeth, and including the sub-grids arranged between them along the toothed splicing direction in the hierarchical artifact band, until all toothed splicing segments of the fixed splitting mark are covered.

[0034] It should be noted that the physical area of ​​the road refers to the continuous lane space anchored by the intersection grid event written by the roadside video. This continuous lane space starts from the original event anchor point of the intersection grid event and extends along the intersection direction marked by the Beidou grid coding prefix bit string to the end of the road segment circled by the no-parking rule.

[0035] In one embodiment, the BeiDou grid codes carried by the illegally parked road segment coverage unit and the single-target unit are read, and the prefix bits of the two are compared bit-by-bit in a coarse-level shared segment. The coarse-level shared segment consists of the first 10 bits of the two code strings. If the prefix bits are completely identical in the coarse-level shared segment, it is determined that the illegally parked road segment coverage unit and the single-target unit share the same intersection grid event anchor point, and the two are merged into the same road physical area. If there are inconsistent bits in the prefix bits in the coarse-level shared segment, it is determined that the illegally parked road segment coverage unit and the single-target unit belong to different intersection grid event anchor points. In this case, the comparison process of this embodiment is not entered. After being merged into the same road physical area, the illegal parking section coverage unit is expanded into a set of coverage unit sub-grids, and the single-target handling unit is expanded into a set of target unit sub-grids. Both are mapped onto the road segment sequence of the continuous driving lane space. The road segment sequence consists of the intersection entrance lane, the middle section of the road segment, and the exit lane arranged in the order of driving direction. Each road segment in the sequence is assigned a road segment number starting from 1 according to the order of driving direction. The entrance lane is the driving lane section between the intersection stop line and the starting mileage marker of the no-parking rule. The middle section of the road segment is the driving lane section between the starting mileage marker of the no-parking rule and the ending mileage marker of the no-parking rule. The exit lane is the driving lane section between the ending mileage marker of the no-parking rule and the exit edge line of the downstream intersection. The starting and ending mileage markers of the no-parking rule are read from the no-parking rule entry corresponding to the road segment number in the world model. For each sub-grid, its geometric center is projected onto the driving lane centerline in a direction perpendicular to the driving lane centerline, and the mileage marker of the projection point is read. The road segment number of the sub-grid is the segment section number into which the projection point mileage marker falls. Furthermore, for each sub-grid in the coverage unit sub-grid set and the target unit sub-grid set, the road segment number corresponding to it in the continuous driving lane space is read, and sub-grids with the same number are regarded as adjacent sub-grid pairs falling on the same road segment; sub-grids that fall into the hierarchical artifact area and appear only on one side are classified into the non-shared area. For each sub-grid in the two residual sets, the road segment number corresponding to it in the continuous driving lane space is read, and sub-grids with the same number are regarded as adjacent sub-grid pairs falling on the same road segment.

[0036] Preferably, if adjacent subgrid pairs have the same road segment number on the continuous driving lane space, the pair of subgrids is assigned to a common grid area; if the road segment numbers are inconsistent, or if a certain subgrid only appears in one side of the residual set and has no corresponding subgrid in the other side of the residual set, the subgrid is assigned to a non-common grid area, thus obtaining the common grid area and non-common grid area within the road physical area.

[0037] S104. Exclude hierarchical artifact areas from the never-common-landing area, combine the no-parking rules and responsible entities confirmed by the world model, examine the spatial form that crosses the original planned coverage edge when issuing disposal orders for alternative illegal parking skills, and extract the out-of-bounds call area and the compliant call area.

[0038] Based on the set of sub-grids in the non-common area, the BeiDou grid code of each sub-grid is compared with the sub-grid code of the hierarchical artifact area. Sub-grids whose codes fall into the hierarchical artifact area are removed from the non-common area, forming a candidate call area after removing hierarchical artifacts. The candidate call area includes non-common sub-grids actually generated when the disposal order is issued by the replacement illegal parking Skill. According to the no-parking rules recorded in the world model, the curb lines on both sides of the illegal parking section coverage unit are read as road edge lines. The road section jurisdiction boundary corresponding to the responsible entity identifier is read. The road edge lines and the road section jurisdiction boundary are superimposed and extended by one grid width outside the illegal parking section coverage unit to form a semantic extension band of the original planned coverage edge. For each sub-grid in the candidate call area, it is determined whether the sub-grid falls inside the illegal parking section coverage unit or the semantic extension band. If a sub-grid in the candidate call area continuously extends beyond the semantic expansion band along the direction of the disposal order and the number of consecutive sub-grids is not less than a preset threshold of 2, then the group of sub-grids is marked as an out-of-bounds call sub-grid and connected in series to form an out-of-bounds call area; if a sub-grid in the candidate call area falls inside the illegal parking section coverage unit or the semantic expansion band, then the sub-grid is marked as a compliant call sub-grid and connected in series to form a compliant call area, thus obtaining the out-of-bounds call area and the compliant call area within the physical area of ​​the road.

[0039] In the scenario of handling illegal parking in urban governance, the agent has extracted common and non-common areas within the physical area of ​​the road. In the non-common areas, it is necessary to separate the artifacts inevitably generated by hierarchical deviation from the actual boundary-crossing behavior of the alternative skill. Combined with the no-parking rules and responsible parties confirmed by the world model, the spatial morphology of the alternative illegal parking skill crossing the original planned coverage edge when issuing a handling order is characterized. In one implementation, the BeiDou grid code of each sub-grid in the non-common area is read and compared one by one with the sub-grid codes in the hierarchical artifact area. If the code of a certain sub-grid falls into the hierarchical artifact area, the sub-grid is removed from the non-common area; the remaining sub-grids constitute a candidate call area, which includes the non-common sub-grids actually generated when the alternative illegal parking skill continues to issue handling orders.

[0040] It should be noted that the world model is a pre-built consistent knowledge base in the urban governance scenario. Internally, it stores no-parking rules, road geometric elements, and law enforcement authorities in a hierarchical manner according to administrative divisions and road elements. The no-parking rules are indexed by road segment numbers and record the no-parking time period, no-parking vehicle type, no-parking start and end mileage markers, and the coordinates of the curb lines on both sides of the road segment. The law enforcement authorities are indexed by their identifiers and record the road segment jurisdiction and law enforcement terminal number corresponding to that authority.

[0041] Specifically, for the illegal parking section coverage unit, the no-parking rule entry corresponding to the illegal parking section number in the world model is read. The coordinate strings of the curb lines on both sides of the section are extracted from the entry to obtain the left curb line and the right curb line. The starting points of the left curb line and the right curb line are connected laterally along the starting mileage marker of the no-parking rule, and the ending points of the two curb lines are connected laterally along the ending mileage marker of the no-parking rule, forming a closed road edge line along the driving direction. The road edge line defines the continuous closed outline of the illegal parking section coverage unit in physical space. Further, the authority identifier carried by the illegal parking section coverage unit is read. The coordinate string of the section jurisdiction boundary is extracted from the record corresponding to the authority identifier in the world model. The section jurisdiction boundary is formed by connecting several boundary markers arranged along the mileage markers, defining the closed range that the authority can enforce in physical space. If the same section involves the intersection of multiple authorities, the jurisdiction boundaries of each authority are sequentially spliced ​​in ascending order of their starting and ending mileage markers to form a complete section jurisdiction boundary.

[0042] In one embodiment, the semantic expansion band is constructed by pushing outward one layer of sub-grid width along the serrated boundary. The sub-grids attached to each segment of the road edge of the illegal parking section coverage unit are taken, and their four corners are used as grid vertices. The sub-grids adjacent to each grid vertex in the normal direction outside the road edge are read. Simultaneously, the four corners of the sub-grids attached to each segment of the road section jurisdiction boundary are taken as grid vertices, and the sub-grids adjacent to each grid vertex in the normal direction outside the road section jurisdiction boundary are read. The two sets of adjacent sub-grids are then combined and connected in a clockwise sequence along the outer contour of the illegal parking section coverage unit to form the semantic expansion band outside the illegal parking section coverage unit. The width of the semantic extension band is set to one sub-grid, determined by rounding up the ratio of the law enforcement terminal positioning error to the side length of the sub-grid at the coverage unit level. Typically, one layer is used, meaning that only one sub-grid side length is pushed outward from the road edge or road segment jurisdiction boundary. This is to absorb reasonable edge-fitting sub-grids that may appear when the illegal parking skill is actually issued, distinguishing the target unit of the disposal order that actually crosses the road edge and jurisdiction boundary from the target unit of the compliant disposal order that is close to the edge. For each sub-grid in the candidate call area, the spatial coordinates corresponding to its Beidou grid code are extracted to determine whether the sub-grid falls inside the illegal parking road segment coverage unit or the semantic extension band.

[0043] It should be noted that the direction of the disposal order is based on the sequence of disposal orders issued by the law enforcement terminal in place of the illegal parking Skill. The direction of travel formed by connecting the target units of each disposal order in the road physical area according to the timestamp sequence of the disposal orders is taken as the direction of the disposal order.

[0044] Preferably, if a sub-grid in the candidate call area continuously extends beyond the semantic expansion band along the direction of the disposal order, and the number of continuously extended sub-grids is no less than a preset threshold of 2, then the group of sub-grids is marked as an out-of-bounds call sub-grid; all out-of-bounds call sub-grids are connected in series along the direction of the disposal order to form an out-of-bounds call area, which represents the spatial form of the substitute illegal parking skill actually crossing the original planned coverage edge or responsibility boundary. If a sub-grid in the candidate call area falls inside the illegal parking section coverage unit or the semantic expansion band, or the number of sub-grids continuously extending beyond the semantic expansion band is less than the preset threshold, then the sub-grid is marked as a compliant call sub-grid, and the continuous compliant sub-grids are connected in series along the direction of the disposal order to form a compliant call area. Thus, the out-of-bounds call area and compliant call area actually generated by the substitute illegal parking skill within the road physical area are obtained. These two areas, along with the hierarchical artifact area and the common grid area, do not overlap with each other within the same road physical area and jointly cover all sub-grids occupied by the illegal parking section coverage unit and the disposal order target unit.

[0045] S105. Identify the direction from which the disposal order breaks through the original planned coverage edge in the outbound call area, connect the continuously crossed intersection grid units, and form an outbound call path.

[0046] Based on the BeiDou grid code of each out-of-bounds call sub-grid in the out-of-bounds call area, the point perpendicular from the center of the sub-grid to the road edge of the illegally parked section coverage unit is taken as the nearest intersection point. The azimuth orientation from the center of the sub-grid to the opposite direction of the nearest intersection point is read as the outgoing direction vector of the out-of-bounds call sub-grid, thus obtaining the set of outgoing direction vectors for each out-of-bounds call sub-grid in the out-of-bounds call area. Based on the set of outgoing direction vectors, the position where an out-of-bounds call sub-grid appears on the road edge of the illegally parked section coverage unit is marked as an edge exit. For each edge exit, adjacent out-of-bounds call sub-grids with azimuth orientation deviations not exceeding a preset azimuth threshold are searched in the out-of-bounds call area along their corresponding outgoing direction vectors. The out-of-bounds call sub-grid that crossed the line earliest in the direction of the handling order is recorded as the out-of-bounds starting point, and the out-of-bounds call sub-grid that crossed the line latest in the direction of the handling order is recorded as the out-of-bounds ending point. Based on the edge exit, the boundary crossing start point, and the boundary crossing end point, a continuous boundary crossing call sub-grid is sequentially connected along the direction of the disposal order, from the boundary crossing start point to the boundary crossing end point. The boundary crossing call sub-grid is mapped to the intersection grid unit within its coverage area according to the common prefix bit string of its Beidou grid code and the intersection grid event code, forming a boundary crossing call path that extends from the road edge line of the illegally parked section coverage unit to the boundary crossing end point.

[0047] In the scenario of handling illegal parking in urban governance, the agent has already extracted the out-of-bounds call area within the physical area of ​​the road. It is necessary to further characterize the direction and extension trend of the alternative illegal parking skill issuing the processing order across the road edge line of the illegal parking section coverage unit within this area, connecting the scattered out-of-bounds call sub-grids into a complete out-of-bounds call path. In one implementation, the extraction of the outgoing direction vector is based on the relative positional relationship between the geometric center of the sub-grid and the road edge line. The road edge line of the illegal parking section coverage unit is a closed polyline located on the physical area of ​​the road, formed by two curb lines enclosing the no-parking start and end mileage markers. For each out-of-bounds call sub-grid in the out-of-bounds call area, the spatial coordinates corresponding to its BeiDou grid code are taken as the geometric center of the sub-grid.

[0048] Specifically, the construction of the perpendicular point is carried out segment by segment along the closed polyline. Two adjacent endpoints of the polyline on the roadside of the illegally parked section coverage unit are taken to form a sideline segment. A perpendicular line is drawn from the geometric center of the over-boundary call sub-grid to this sideline segment. If the perpendicular falls between the two endpoints of the segment, the perpendicular is taken as a candidate intersection point. This process of drawing perpendicular lines is repeated for each sideline segment of the closed polyline. If the perpendicular does not fall between the endpoints of any segment, the endpoint of the polyline closest to the geometric center of the sub-grid is added to the candidate intersection point set. The candidate intersection point with the shortest distance to the geometric center of the sub-grid is taken as the nearest intersection point of the over-boundary call sub-grid. A directed line segment is obtained by connecting the nearest intersection point to the geometric center of the sub-grid. The direction in which this directed line segment extends from the geometric center of the sub-grid outwards towards the roadside is taken as the outward direction vector of the over-boundary call sub-grid. This process is repeated for all over-boundary call sub-grids in the over-boundary call area to obtain a set of outward direction vectors.

[0049] It should be noted that the edge exit refers to the location where the over-boundary calling sub-grid actually crosses the road edge line of the illegally parked section coverage unit. The nearest intersection point of each over-boundary calling sub-grid is marked on the road edge line as the edge exit, and the edge line segment number and the mileage position along the closed broken line in a clockwise direction are recorded.

[0050] In one embodiment, for each edge exit, adjacent outbound call sub-grids are searched within the outbound call area along their corresponding outbound direction vector. The search process extends grid by grid from the edge exit outwards from the road edge line, following the orientation indicated by the outbound direction vector. The outbound direction vectors corresponding to adjacent outbound call sub-grids are read, and the orientation deviation between the outbound direction vector of the adjacent sub-grid and the outbound direction vector of the edge exit is compared. If the deviation does not exceed a preset orientation threshold of 15 degrees, the adjacent sub-grid is included in the same outbound direction search cluster; if the deviation exceeds the preset orientation threshold, the search in that direction is terminated. The preset orientation threshold is determined by twice the standard deviation of the statistical distribution of the orientation of the outbound call sub-grid's outbound direction vectors.

[0051] Preferably, for each sub-grid of the cross-boundary call in the same direction of exit, the timestamp of the corresponding processing order is read. The sub-grid of the cross-boundary call that crosses the road edge earliest in the direction of processing order issuance is recorded as the cross-boundary start point, and the sub-grid of the cross-boundary call that crosses the road edge latest in the direction of processing order issuance is recorded as the cross-boundary end point. Further, based on the edge exit, the cross-boundary start point, and the cross-boundary end point, a series of cross-boundary call sub-grids are sequentially connected along the direction of processing order issuance from the cross-boundary start point to the cross-boundary end point. The cross-boundary call sub-grids correspond to the intersection grid units written by the roadside video, forming a cross-boundary call path that crosses the road edge of the illegal parking section coverage unit and extends to the cross-boundary end point. The cross-boundary call path uses the edge exit as the cross-boundary start point and marks the beginning and end points of the cross-boundary time sequence with the cross-boundary start point and the cross-boundary end point respectively, completely depicting the spatial trend of the replacement illegal parking skill actually crossing the original planned coverage edge.

[0052] S106. Track the actual processing area of ​​the law enforcement terminal along the over-boundary call path, identify the original planned grid cell occupied by the replaced illegal parking Skill, separate the records of these grid event states from the continuous execution data, and form damaged trace data.

[0053] Based on the continuously arranged cross-boundary call sub-grids from the cross-boundary start point to the cross-boundary end point along the cross-boundary call path, the timestamps and result codes of the corresponding actions of each cross-boundary call sub-grid in the continuous execution data of the law enforcement terminal are read. The cross-boundary call path is mapped to the actual handling area of ​​the law enforcement terminal, resulting in a sequence of actual handling area grids distributed along the cross-boundary call path. Based on the actual handling area grid sequence, the road segment number corresponding to each grid in the continuous driving lane space is read one by one and compared with the road segment numbers corresponding to the original planned sub-grid sets of the illegal parking section coverage unit. If the road segment number of a certain grid is consistent with the road segment number of a certain sub-grid in the coverage unit sub-grid set, the coverage unit sub-grid is marked as the replaced illegal parking Skill and written into the occupied original planned grid unit, resulting in a set of occupied original planned grid units. Based on the set of occupied original planning grid units, the write-back records of the handling results issued by the law enforcement terminal for each occupied original planning grid unit in the continuous execution data are traversed one by one. The write-back records of the event status of these original planning grid units are separated from the continuous execution data, and the corresponding out-of-bounds call sub-grid and handling action timestamp are marked to obtain the damaged trace data.

[0054] In urban governance scenarios involving illegal parking, the agent has mapped the out-of-bounds call path of the substitute illegal parking skill that actually crosses the original planned coverage edge. It is necessary to trace the spatial landing point of the enforcement terminal's actual on-site enforcement actions along this path, further identify the grid cells occupied by the substitute illegal parking skill across layers within the original planned illegal parking road segment coverage unit, and extract the event status write-back records of these grid cells from the subsequent execution data. In one implementation, each enforcement action record in the subsequent execution data uses the enforcement action timestamp and enforcement result code as core fields. The enforcement action timestamp refers to the actual time when the enforcement terminal performs on-site enforcement for a specific enforcement target unit; the enforcement result code refers to the enforcement terminal's feedback enforcement status identifier, whose value set is closed into four categories: warning reminder, ticket notification, on-site towing, and non-illegal parking ticket cancellation.

[0055] Specifically, the out-of-bounds call sub-grids, arranged continuously from the out-of-bounds starting point to the out-of-bounds ending point along the out-of-bounds call path, are sequentially read from the execution data, including the timestamp of the handling action and the code of the handling result carried by each sub-grid. The actual landing point of the law enforcement terminal refers to the BeiDou grid code location recorded in the execution data where the law enforcement terminal received the handling order and completed the on-site handling action. This location corresponds one-to-one with the out-of-bounds call sub-grid. According to the order of the handling action timestamps, the actual landing points of the law enforcement terminals corresponding to each out-of-bounds call sub-grid are sequentially connected in the road physical area to obtain the actual handling area grid sequence distributed along the out-of-bounds call path. The actual handling area grid sequence not only records the spatial location trajectory of the law enforcement terminal after the handling order is issued through the replacement parking violation skill, but also carries the timestamp of the handling action and the code of the handling result on each grid, which is used to support the subsequent determination of the occupied original planned grid unit.

[0056] It should be noted that each grid in the actual disposal area grid sequence belongs to the subdivision level of the replacement illegal parking skill. Its grid granularity may be coarser or finer than the subdivision level of the original plan. If the grid code is directly compared bit by bit using Beidou, misjudgment may occur due to the difference in level.

[0057] In one embodiment, road segment numbers are used as a common benchmark for cross-level comparison. The road segment number corresponding to each grid in the actual handling area grid sequence on the continuous driving lane space is read one by one. Simultaneously, the road segment numbers corresponding to each of the sub-grid sets of the originally planned coverage units within the illegal parking section coverage unit are read. If the road segment number of a certain actual handling area grid matches the road segment number of a certain sub-grid in the coverage unit sub-grid set, it is determined that the actual handling area grid and the originally planned sub-grid point to the same physical road segment. Therefore, the coverage unit sub-grid is marked as the original planned grid unit occupied by the replaced illegal parking skill.

[0058] Preferably, the marking is performed only when the difference between the projected mileage of the actual treatment area grid geometric center and the projected mileage of the sub-grid geometric center of the coverage unit does not exceed a preset mileage deviation threshold, where the preset mileage deviation threshold is half the distance between piles of a road segment. All marked original planned grid units are aggregated in clockwise mileage order within the illegal parking section coverage unit to obtain a set of occupied original planned grid units. The set of occupied original planned grid units represents the list of specific sub-grids occupied by the replaced illegal parking Skill across layers within the original planned coverage area. Further, for each occupied original planned grid unit in the set of occupied original planned grid units, all records of the write-back event status from the law enforcement terminal to the intersection grid event in the continuous execution data are traversed, and the target road segment number anchored to each write-back record is read and matched with the road segment number corresponding to the occupied original planned grid unit; if the match is consistent, the write-back record is separated from the continuous execution data and an over-boundary call sub-grid identifier and treatment action timestamp corresponding to the occupied original planned grid unit are added. All write-back records separated from the subsequent execution data are collected in chronological order of the action timestamps and form a three-element correspondence with the set of occupied original planning grid cells and the identifier of the over-boundary called sub-grid, thus obtaining the damaged trace data. The damaged trace data consists of three parts, including the separated write-back record entries, the corresponding codes of the occupied original planning grid cells, and the corresponding identifiers of the over-boundary called sub-grids. Each entry is stored in the same data set in order of action timestamp.

[0059] S107. Based on the Beidou grid code spatiotemporal stamp, and following the phased sequence of writing illegal parking events, matching illegal parking skills with world model verification, manual confirmation and law enforcement write-back, the damaged trace data and the continuous execution data in the compliant call area are spliced ​​together to generate the phased pipeline trajectory traceability monitoring results of the Beidou grid code spatiotemporal data for urban management illegal parking handling.

[0060] Based on the damaged trace data, the follow-up execution data in the compliant call area, the intersection grid event records written by the roadside video in the grid event library, and the no-parking rule matching records and the rights and responsibilities entity identification records in the planning trace data, the Beidou grid code spatiotemporal stamp carried by each record is read one by one, the time component and spatial grid component in the spatiotemporal stamp are extracted, and all records are arranged in chronological order according to the order of the time components in the spatiotemporal stamps of each record to obtain a unified chronologically arranged sequence of handling events. Based on the sequence of events handled, the start and end timestamps of each stage are used as the boundaries between stage intervals. Following the order of three stages—illegal parking event writing, illegal parking skill matching and world model verification, and manual confirmation and enforcement write-back—each record is assigned to the corresponding stage according to the stage interval its timestamp falls into: records of roadside video writing to intersection grid events are assigned to the illegal parking event writing stage; records of the original illegal parking skill matching no-parking rules and responsible parties are assigned to the illegal parking skill matching and world model verification stage; and records of manual confirmation and enforcement terminal write-back of handling results are assigned to the manual confirmation and enforcement write-back stage, resulting in a set of staged handling records divided by stage. Based on the set of phased handling records, each write-back record in the damaged trace data is inserted into the temporal position of the manual confirmation and law enforcement write-back stage according to its corresponding out-of-bounds call sub-grid identifier and handling action timestamp. The subsequent execution data in the compliant call area is sequentially spliced ​​to the temporal position of the manual confirmation and law enforcement write-back stage according to the handling action timestamp. The three stages are connected to obtain the phased pipeline trajectory traceability monitoring results of the Beidou grid code spatiotemporal data for urban management illegal parking handling.

[0061] In the scenario of handling illegal parking in urban governance, the agent has identified the damaged trace data and the subsequent execution data in the compliant call area. It is necessary to stitch these two parts of data together into a replayable and traceable trajectory chain according to the stage sequence of the entire urban management illegal parking handling process, forming a phased pipeline trajectory tracing and monitoring result. In one implementation, the BeiDou grid code spatiotemporal stamp consists of two parts: a time component and a spatial grid component. The time component records the actual time when the corresponding action occurs. The no-parking rule matching record and the responsible entity identification record are each registered with the time and the relevant grid code as their spatiotemporal stamp field, with millisecond-level accuracy. The spatial grid component records the spatial location of the action in the form of BeiDou grid code. For each record in the damaged trace data and the subsequent execution data in the compliant call area, the BeiDou grid code spatiotemporal stamp it carries is read, and the time component and spatial grid component are extracted.

[0062] Specifically, based on the chronological order of the timestamps of the actions, all records are sorted in ascending order using the time component as the primary key. If two records have the same time component at the millisecond level, they are further sorted using the spatial grid component in ascending order according to the lexicographical order of the BeiDou grid encoding bit string as the secondary key, resulting in a unified temporal sequence of action events. This action event sequence covers all action nodes from the initial writing of the illegal parking event to the final write-back of the action result. Each record retains both the time component and the spatial grid component for subsequent stage division and splicing.

[0063] It should be noted that the entire process of handling illegal parking by urban management is divided into three stages according to business nodes. The starting spatiotemporal stamp of the illegal parking event writing stage is set to the spatiotemporal stamp of the first record written from the roadside video to the intersection grid event, and the ending boundary time is set to the spatiotemporal stamp when the Agent receives the intersection grid event record. The starting boundary time of the illegal parking skill matching and world model verification stage is the same as the ending boundary time of the illegal parking event writing stage, and its ending boundary time is set to the spatiotemporal stamp of the manual confirmation initiation of the record. The record of the no-parking rule and the verification result of the responsible party returned by the world model is included in the illegal parking skill matching and world model verification stage. The starting boundary time of the manual confirmation and enforcement write-back stage is the same as the ending boundary time of the illegal parking skill matching and world model verification stage, and the ending spatiotemporal stamp is taken from the spatiotemporal stamp of the enforcement terminal's completed write-back record. Each stage interval is assigned according to the time component, with left-closed and right-open. The original illegal parking skill downgrade and task transfer records are included in the illegal parking skill matching and world model verification stage. In the Skill matching and world model verification phase, records whose time components do not fall within any phase interval are assigned to the nearest phase end whose time component is earlier than that record. Further, the start and end spatiotemporal stamps of each phase are read. The start spatiotemporal stamp of the illegal parking event writing phase is set to the spatiotemporal stamp of the first record written by the roadside video to the intersection grid event, and the end spatiotemporal stamp is set to the spatiotemporal stamp of the Agent receiving the intersection grid event. The start spatiotemporal stamp of the illegal parking Skill matching and world model verification phase is taken from the spatiotemporal stamp field carried by the Skill scheduling record in the subsequent execution data, and the end spatiotemporal stamp is taken from the spatiotemporal stamp field carried by the record of the no-parking rule and the verification result of the responsible party returned by the world model. The start spatiotemporal stamp of the manual confirmation and enforcement write-back phase is taken from the spatiotemporal stamp field carried by the manual confirmation initiation record, and the end spatiotemporal stamp is taken from the spatiotemporal stamp field carried by the enforcement terminal write-back completion record.

[0064] In one embodiment, for each record in the sequence of events to be handled, its time component is compared with the start and end timestamps of the three stages mentioned above. Records whose time components fall within the start and end timestamp interval of a certain stage are assigned to the corresponding stage: records falling within the illegal parking event writing stage interval are assigned to the illegal parking event writing stage; records falling within the illegal parking skill matching and world model verification stage interval are assigned to the illegal parking skill matching and world model verification stage; and records falling within the manual confirmation and law enforcement write-back stage interval are assigned to the manual confirmation and law enforcement write-back stage, thus obtaining a set of staged handling records divided by stage.

[0065] Preferably, for each write-back record in the damaged trace data, its corresponding out-of-bounds call sub-grid identifier and handling action timestamp are read, and inserted into the temporal position of the manual confirmation and enforcement write-back stage according to the handling action timestamp; for each record in the follow-up execution data in the compliant call area, it is sequentially spliced ​​to the temporal position of the manual confirmation and enforcement write-back stage according to the handling action timestamp. Thus, by connecting the set of phased handling records corresponding to the three stages, the phased pipeline trajectory tracing monitoring results of the Beidou grid code spatiotemporal data for urban management illegal parking handling are obtained. The monitoring results, with spatiotemporal stamps as the main line, stages as segments, and the spliced ​​product of damaged trace data and follow-up execution data in the compliant call area as nodes, fully present the spatial location, temporal rhythm, and stage affixing of the entire process of cross-layer follow-up handling of the replacement illegal parking Skill.

[0066] Specific embodiments of the present invention have been described above. It should be understood that the present invention is not limited to the specific embodiments described above, and those skilled in the art can make various changes or modifications within the scope of the claims, which do not affect the essence of the present invention. Unless otherwise specified, the embodiments and features described in this application can be arbitrarily combined with each other.

Claims

1. A method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data, characterized in that, include: Obtain the planning trace data generated by the Agent calling the original illegal parking Skill and the execution data generated by the cross-layer continuation of the alternative illegal parking Skill; read the intersection grid event code and the single target unit code for handling; and identify the layering level of the original plan and the alternative continuation. Read the alternating orientation and interweaving pattern of adjacent hierarchical levels, disassemble the illegal parking section coverage unit and the single target unit for disposal level by level, and identify the fixed disassembly traces formed by the hierarchical intersection; Identify hierarchical artifact regions along fixed splitting marks and extract common and non-common regions; By excluding hierarchical artifact areas from the never-common-parking zone, and combining the no-parking rules and responsible parties confirmed by the world model, we examine the spatial form of the alternative illegal parking skill crossing the original planning coverage edge, and extract the over-boundary call area and the compliant call area. Identify the direction from which the outbound call order extends beyond the original planned coverage edge within the outbound call area, connect the continuously crossing intersection grid units, and form an outbound call path; The actual processing area of ​​the law enforcement terminal is traced along the over-boundary call path, the original planned grid cell occupied by the replaced illegal parking Skill is identified, the records of the event status of these grid cells are separated and written back, and the damaged trace data is formed. Based on the BeiDou grid code spatiotemporal stamp, and following the phased sequence of writing illegal parking events, matching illegal parking skills with world model verification and law enforcement write-back, the damaged trace data is spliced ​​with the continuous execution data in the compliant call area to generate the phased pipeline trajectory traceability monitoring results of BeiDou grid code spatiotemporal data.

2. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The process of reading the intersection grid event code and handling single-target unit code to identify the original plan and alternative continuity layer hierarchy includes: Read the coverage units of illegally parked road sections and their BeiDou grid codes from the original planning trace data, and read the intersection grid events written by roadside videos and their BeiDou grid codes from the grid event database; For the BeiDou grid codes of the illegal parking section coverage unit, the intersection grid event, and the single target unit, the length of the code bits and the prefix bit string are analyzed bit by bit to identify the differences in hierarchical granularity under the BeiDou grid code system and determine the hierarchical affiliation of the original plan and the replacement succession.

3. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The process of reading the alternating orientation and interweaving pattern of adjacent hierarchical levels, disassembling the illegal parking section coverage unit and the single-target unit for handling level by level, and identifying the fixed disassembly traces formed by the interlacing of levels includes: Based on the original plan and the replacement succession of the subdivision level, read the alternating orientation definition between adjacent subdivision levels in the grid coding extension rule table, extract the reference axis deflection direction and grid edge direction of each level of the illegal parking section coverage unit and the single target unit of the treatment relative to the parent grid of the previous level, and form a level alternating orientation sequence. The intersection grid cell outline written along the roadside video is read, the edge contact position of the adjacent segmented sub-grids inside the parent grid is read, the interlacing tooth-like interpenetration pattern formed by the sub-grid edges crossing the parent grid boundary is identified, and the cover unit sub-grid set and the target unit sub-grid set are obtained by disassembling them down level by level. Along the common boundary of the interlaced tooth-like pattern, compare the deviation difference between the alignment position of the Beidou grid coding bit string of adjacent levels and the direction of the grid edge, and mark the sub-grids that fall into the misalignment area of ​​the adjacent parent grid due to inconsistent level orientation as fixed split marks.

4. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The step of extracting common and non-common regions along the fixed splitting marks to identify hierarchical artifact regions includes: Using the outermost terminal grid of each convex and concave tooth in the strip-shaped area formed by the fixed splitting marks along the interlaced tooth-like pattern as the boundary reference, the sub-grid covered by the boundary reference range is defined as the hierarchical artifact area. Based on the consistency of the Beidou grid code prefix bit string between the illegal parking section coverage unit and the single target unit, the two are merged into the continuous driving lane space anchored by the intersection grid event, and the physical grid positions of the coverage unit sub-grid set and the target unit sub-grid set are compared one by one. Adjacent subgrids pointing to the same road surface segment are assigned to the common grid area, while subgrids pointing to different road surface segments or appearing only on one side of the set are assigned to the non-common grid area.

5. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The process of excluding hierarchical artifact areas from the non-common parking area, combined with the no-parking rules and responsible parties confirmed by the world model, examines the spatial form of the alternative illegal parking skill crossing the original planned coverage edge, and extracts the out-of-bounds call area and the compliant call area, including: For each sub-grid in the non-common grid area, the BeiDou grid code is compared with the hierarchical artifact area sub-grid code. Sub-grids whose codes fall into the hierarchical artifact area are removed to form a candidate call area after removing hierarchical artifacts. Based on the no-parking rules recorded in the world model, the road edge lines on both sides of the illegal parking section coverage unit are read as the road edge lines. The road section jurisdiction boundary corresponding to the right and responsibility entity identifier is read. After superimposing the road edge lines and the road section jurisdiction boundary, a layer of grid width is extended outside the illegal parking section coverage unit to form a semantic extension zone of the original planned coverage edge.

6. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The process of identifying the direction from which a call to the out-of-bounds area extends beyond the original planned coverage edge, connecting the continuously crossed intersection grid cells, and forming an out-of-bounds call path includes: For each out-of-bounds call subgrid in the out-of-bounds call area, the point where the normal perpendicular from its center to the road edge of the illegally parked section coverage unit is taken as the nearest intersection point, and the reverse orientation of the normal pointing from the center of the subgrid to the nearest intersection point is read as the outgoing direction vector. Mark the location of the road edge line where the outbound call subgrid breaks out as the edge exit. Search for adjacent outbound call subgrids whose azimuth deviation does not exceed the preset azimuth threshold along the outbound direction vector. Record the earliest outbound call subgrid in the direction of the processing order as the outbound start point and the latest outbound call as the outbound end point. Connect the continuously arranged out-of-bounds call subgrids from the out-of-bounds starting point to the out-of-bounds ending point along the direction of the disposal order, and form an out-of-bounds call path according to their common prefix bit string corresponding to the intersection grid unit code.

7. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, The method of tracing the actual processing area of ​​the law enforcement terminal along the over-boundary call path, identifying the original planned grid cells occupied by the replaced illegal parking Skill, separating and writing back the records of the event status of these grid cells, forming damaged trace data, including: The outbound call subgrids are arranged continuously from the outbound start point to the outbound end point along the outbound call path. The timestamps of the handling actions and the handling result codes of each outbound call subgrid in the continuous execution data of the law enforcement terminal are read and mapped to obtain the actual handling area grid sequence. Compare the road segment numbers corresponding to each grid in the actual treatment area grid sequence with the sub-grid sets of the covered units of the illegally parked road sections, and mark the covered unit sub-grids with the same road segment numbers as the original planned grid units that were occupied. Records of the event states of these original planned grid units are separated and written back from the continuous execution data, and the timestamps of the corresponding out-of-bounds calls to sub-grids and the handling actions are marked to form damaged trace data.

8. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 1, characterized in that, Based on the BeiDou grid code spatiotemporal stamp, and following the phased sequence of writing illegal parking events, matching illegal parking skills with world model verification, and writing back to enforcement, the damaged trace data is spliced ​​with the subsequent execution data in the compliant call area to generate the phased pipeline trajectory tracing and monitoring results of BeiDou grid code spatiotemporal data, including: For the damaged trace data, the continuous execution data in the compliant call area, the no-parking rule matching record and the power and responsibility entity identification record in the intersection grid event record and the planning trace data, the time component and spatial grid component of the Beidou grid code time and space stamp are extracted one by one, and all records are arranged in chronological order according to the time component to obtain the sequence of handling events; Using the start and end timestamps of each stage as interval boundaries, each record in the sequence of events is categorized into three stages: illegal parking event writing, illegal parking skill matching and world model verification, and manual confirmation and law enforcement write-back, based on the interval into which the timestamp falls, thus obtaining a set of staged handling records.

9. The method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 5, characterized in that, The semantic extension band that forms the original planned coverage edge includes: For each subgrid in the candidate call area, determine whether it falls within the illegal parking section coverage unit or the semantic extension band; Subgrids that continuously extend beyond the semantic expansion zone along the direction of the processing order and have a number of consecutive subgrids not less than a preset threshold are marked as out-of-bounds call subgrids and connected in series to form an out-of-bounds call area. Subgrids that fall within the coverage unit of illegally parked road sections or within the semantic extension zone are marked as compliant call subgrids and connected in series to form a compliant call area.

10. A method for phased pipeline trajectory tracing and monitoring of BeiDou grid code spatiotemporal data according to claim 8, characterized in that, The obtained set of phased processing records includes: Each write-back record in the damaged trace data is inserted into the time sequence position of the manual confirmation and law enforcement write-back stage according to the corresponding out-of-bounds call subgrid identifier and the timestamp of the handling action; The continuous execution data in the compliant call area is sequentially spliced ​​to the time sequence position of the manual confirmation and law enforcement write-back stage according to the timestamp of the handling action. The three stages of illegal parking event writing, illegal parking skill matching and world model verification, and manual confirmation and law enforcement write-back are linked to form a phased pipeline trajectory traceability monitoring result.

Images