A method and device for marking an electronic channel fence
Patent Information
- Application Number
- CN202511633110.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-10
- Publication Date
- 2026-08-18
- Estimated Expiration
- 2045-11-10
AI Technical Summary
然而,目前航道局定期发布的一二级水域、通航分道、推荐航路、横驶区、单向通航制水域等水域信息,多以文本形式呈现,例如,“2025年第三季度二级水域-黄草峡水域:长江上游航道里程573.9-574.5千米”,难以直观定位航道信息
本公开提供一种航道电子围栏标记方法,对航道里程数据进行高精度细分,并去除冗余点,在保证关键航道特征的同时,降低了数据处理量,同时减少了人工干预,提升了电子围栏标记的效率和准确性,能够快速响应航道信息变化,为船舶提供持续、精准、可靠的安全隔离带。
Smart Images

Figure CN121505925B_ABST
Abstract
Description
Technical Field
[0001] This disclosure belongs to the field of waterway information processing technology, and in particular relates to a method and device for marking electronic fences for waterways. Background Technology
[0002] Accurate access to waterway information is a prerequisite for ensuring safe navigation and improving shipping efficiency. However, the waterway information regularly released by the waterway bureau, such as Class I and II waterways, navigation lanes, recommended routes, crossing zones, and one-way navigation zones, is mostly presented in text form. For example, "Class II waterway - Huangcaoxia waterway in the third quarter of 2025: Yangtze River upper reaches waterway mileage 573.9-574.5 km," making it difficult to intuitively locate waterway information. Furthermore, the data annotation accuracy of waterway mileage points on electronic waterway charts is low. For instance, the accuracy of waterway mileage points on the Yangtze River electronic waterway chart is only 1 km in the upper reaches and only 5 km in the middle and lower reaches, which cannot support the precise delineation of electronic fences. Limited by data segmentation and optimization methods, in practical applications, electronic fence boundaries can only be set manually point by point, which is time-consuming, labor-intensive, and prone to errors in point marking. When facing dynamic adjustments to electronic fence boundaries due to seasonal water level changes or waterway dredging, it is even more difficult to respond quickly to meet the need for real-time updates. Summary of the Invention
[0003] This disclosure provides a method and apparatus for marking electronic fences along waterways, which can effectively solve the above-mentioned problems.
[0004] This disclosure is implemented as follows: In a first aspect, this disclosure provides a method for marking electronic fences along waterways, the method comprising: Obtain the starting mileage information and ending mileage information of the water area where the target channel is located, and determine the mileage interval on the left bank and the mileage interval on the right bank of the channel. The mileage interval on the left bank and the mileage interval on the right bank of the channel are determined based on the starting mileage information and the ending mileage information of the water area where the target channel is located. Obtain a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information. A left bank densification point is linearly inserted between each adjacent first range point to obtain a left bank reference point sequence, and a right bank densification point is linearly inserted between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank densification point and the right bank densification point both include corresponding mileage information, longitude information and latitude information. Based on the left bank mileage interval and the left bank reference point sequence, a left bank reference point sequence is obtained; and based on the right bank mileage interval and the right bank reference point sequence, a right bank reference point sequence is obtained. The left bank reference point sequence and the right bank reference point sequence of the channel are connected sequentially to obtain a channel reference point sequence, which forms a closed polygon. The Douglas-Peucker algorithm is used to simplify the waterway reference point sequence to obtain the electronic fence point sequence. The electronic fence point sequence is then connected in sequence to obtain a closed electronic fence polygon.
[0005] Secondly, this disclosure provides a waterway electronic fence marking device, the device comprising: The channel section acquisition module is used to acquire the starting mileage information and ending mileage information of the water area where the target channel is located, and to determine the left bank mileage section and the right bank mileage section of the channel. The left bank mileage section and the right bank mileage section of the channel are determined based on the starting mileage information and ending mileage information of the water area where the target channel is located. The range point acquisition module is used to acquire a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information; An interpolation module is used to linearly insert left bank encryption points between each adjacent first range point to obtain a left bank reference point sequence, and to linearly insert right bank encryption points between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank encryption points and the right bank encryption points each include corresponding mileage information, longitude information and latitude information. The channel sequence acquisition module is used to obtain a channel left bank reference point sequence based on the channel left bank mileage interval and the left bank reference point sequence, and to obtain a channel right bank reference point sequence based on the channel right bank mileage interval and the right bank reference point sequence. The polygon acquisition module is used to connect the left bank reference point sequence and the right bank reference point sequence of the channel in sequence to obtain a channel reference point sequence, which forms a closed polygon. The electronic fence acquisition module is used to simplify the waterway reference point sequence using the Douglas-Peucker algorithm to obtain the electronic fence point sequence, and connect the electronic fence point sequence in sequence to obtain a closed electronic fence polygon.
[0006] Thirdly, this disclosure provides an electronic device, including: Memory, the memory storing execution instructions; and A processor that executes execution instructions stored in the memory, causing the processor to perform the method described in the first aspect.
[0007] Fourthly, this disclosure provides a readable storage medium storing executable instructions, which, when executed by a processor, are used to implement the method described in the first aspect.
[0008] Compared with the prior art, the beneficial effects of this disclosure are: This disclosure provides a method for marking electronic fences in waterways, which performs high-precision subdivision of waterway mileage data and removes redundant points. While ensuring the key characteristics of waterways, it reduces the amount of data processing and human intervention, thereby improving the efficiency and accuracy of electronic fence marking. It can quickly respond to changes in waterway information and provide ships with a continuous, accurate, and reliable safety barrier. Attached Figure Description
[0009] Figure 1 This is a flowchart of the waterway electronic fence marking method S100 provided in the embodiments of this disclosure.
[0010] Figure 2 This is an example image of a Class I waterway announcement issued by the Yangtze River Maritime Safety Administration in the third quarter of 2025.
[0011] Figure 3 This is an example diagram of structured data of the waterway where the waterway is located, generated by calling a large language model.
[0012] Figure 4 This is a vector map of the waterway from 1031-1043km upstream of the Yangtze River.
[0013] Figure 5 This is an example diagram of structured waterway data.
[0014] Figure 6 This is an example diagram of a simplified coordinate point sequence using the Douglas-Peucker algorithm.
[0015] Figure 7 This is a schematic diagram of the structure of the waterway electronic fence marking device 1000 provided in the embodiments of this disclosure. Detailed Implementation
[0016] The present disclosure will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the disclosure. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present disclosure are shown in the accompanying drawings.
[0017] It should be noted that, where there is no conflict, the embodiments and features described in this disclosure can be combined with each other. The technical solutions of this disclosure will now be described in detail with reference to the accompanying drawings and embodiments.
[0018] Unless otherwise stated, the exemplary implementations / embodiments shown are to be understood as providing exemplary features of various details that provide ways in which the technical concepts of this disclosure can be implemented in practice. Therefore, unless otherwise stated, the features of various implementations / embodiments may be additionally combined, separated, interchanged and / or rearranged without departing from the technical concepts of this disclosure.
[0019] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of this disclosure. The singular forms “a,” “the,” and “the” used in the embodiments of this disclosure and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.
[0020] It should be understood that the term "and / or" used in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this article generally indicates that the preceding and following related objects have an "or" relationship.
[0021] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."
[0022] The terms "first" and "second" used herein are merely to distinguish similar objects and do not represent a specific ordering of the objects. Understandably, the specific order or sequence of "first" and "second" can be interchanged where permitted. It should be understood that the objects distinguished by "first" and "second" can be interchanged where appropriate so that the embodiments described herein can be implemented in orders other than those illustrated or described herein.
[0023] Example 1 Please refer to Figure 1 This disclosure provides a method S100 for marking electronic fences along waterways. Specifically, the method S100 includes: S102, obtain the starting mileage information and ending mileage information of the water area where the target channel is located, and determine the mileage interval on the left bank of the channel and the mileage interval on the right bank of the channel, wherein the mileage interval on the left bank of the channel and the mileage interval on the right bank of the channel are determined based on the starting mileage information and the ending mileage information of the water area where the target channel is located. S104, obtain a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information; S106, a left bank encryption point is linearly inserted between each adjacent first range point to obtain a left bank reference point sequence, and a right bank encryption point is linearly inserted between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank encryption point and the right bank encryption point both include corresponding mileage information, longitude information and latitude information. S108, Based on the left bank mileage interval of the channel and the left bank reference point sequence, obtain the left bank reference point sequence of the channel; and based on the right bank mileage interval of the channel and the right bank reference point sequence, obtain the right bank reference point sequence of the channel. S110, connect the left bank reference point sequence and the right bank reference point sequence of the channel in sequence to obtain a channel reference point sequence, which forms a closed polygon; S112, the Douglas-Peucker algorithm is used to simplify the waterway reference point sequence to obtain the electronic fence point sequence. The electronic fence point sequence is then connected in sequence to obtain a closed electronic fence polygon.
[0024] In step S102, in some embodiments, the target waterway is a waterway.
[0025] In some implementations, mileage information includes mileage values. Longitude information includes longitude coordinates. Latitude information includes latitude coordinates.
[0026] The range value is uniquely matched with the latitude and longitude coordinates of the corresponding point through the official waterway mileage system, thus ensuring that the same waterway mileage value points to the same point on the same waterway at any time.
[0027] The starting point of the waterway is designated as the starting point of the left and right banks of the channel, respectively. The ending point of the waterway is designated as the ending point of the left and right banks of the channel, respectively. The starting and ending distances of the waterway are designated as the starting and ending distances of the left and right banks of the channel, respectively. That is, the mileage intervals on the left and right banks of the channel are the intervals between the starting and ending distances of the waterway where the target channel is located.
[0028] In some implementations, obtaining the starting and ending mileage information of the waterway where the target channel is located includes: The textual information about waterways is transformed into structured data using a large language model. This structured data includes the starting and ending mileage information of the waterways.
[0029] Please refer to Figure 2 and 3 By leveraging the text processing capabilities of a large language model, the textual information about waterways in public announcements is transformed into structured data, clearly defining the starting and ending mileage of the waterway.
[0030] Please refer to Figure 3 The structured data of the waterway includes the waterway name, waterway classification, starting mileage, and ending mileage.
[0031] It should be noted that, taking the Yangtze River waterway as an example, the waterway is divided into three sections: upstream, downstream, and middle reaches, and the mileage of each section is counted independently. The model output includes a "waterway classification" field to ensure global uniqueness.
[0032] Accordingly, electronic navigation charts include those for the upper reaches of the Yangtze River, the middle reaches of the Yangtze River, and the lower reaches of the Yangtze River. Multiple charts within each category, as well as the three categories of charts, require a unified coordinate system and datum for seamless stitching. They also need to employ the same measurement system, i.e., global mileage measurement, to accommodate subsequent cross-segment continuous interpolation and retrieval. This is achieved through mileage datum offset, ensuring global continuity of mileage information.
[0033] In step S104, the first range point sequence and the second range point sequence correspond to the range point sequence on the left bank and the range point sequence on the right bank of the waterway, respectively.
[0034] The first range point is any range point in the first range point sequence. The second range point is any range point in the second range point sequence.
[0035] The mileage interval determined by two range points in the range point sequence is the difference between the mileage values of the two range points.
[0036] It should be noted that the term "adjacent" refers to adjacent areas on the same bank.
[0037] In some implementations, obtaining a first range point sequence and a second range point sequence covering the target waterway includes: Based on one or more electronic navigation charts, obtain the first range point sequence and the second range point sequence covering the target navigation channel, respectively.
[0038] Using electronic navigation charts, the machine readability of the mileage-latitude and longitude information of the range points is directly achieved, so as to directly support subsequent interpolation, projection, and algorithm processing.
[0039] In some implementations, the mileage information of the range point includes left bank / right bank. Therefore, the mileage information of the range point corresponds one-to-one with the combination of latitude and longitude information.
[0040] Please refer to Figure 4 The waterway vector diagram shown is composed of three waterway maps stitched together according to a continuous mileage rule. The dots represent mileage points, and the distance between adjacent dots is 1 km. The dots on the left and right banks of the waterway are connected in sequence to form the left and right bank reference lines.
[0041] Please refer to Figure 5 Structured data of waterway range points obtained from electronic waterway charts, including waterway classification, waterway mileage, left bank / right bank, longitude and latitude.
[0042] In step S106, the left bank reference line and the right bank reference line are encrypted using a linear interpolation algorithm to obtain the left bank and right bank reference point sequences.
[0043] The encryption can be either equidistant encryption or proportional encryption.
[0044] The left bank reference line and the right bank reference line are located on the same reference plane within the same plane coordinate system to ensure accurate linear interpolation under planar geometry. For example, the plane coordinate system used in electronic navigation charts. The left / right bank reference point sequence includes the first / second range point sequence and the inserted left / right bank densification point sequence.
[0045] The mileage interval between any two adjacent reference points in the left / right bank reference point sequence is smaller than the mileage interval between any two adjacent range points in the first / second range point sequence.
[0046] In some implementations, left-bank encryption points are linearly inserted between each adjacent first range point to obtain a left-bank reference point sequence, and right-bank encryption points are linearly inserted between each adjacent second range point to obtain a right-bank reference point sequence, including: At least one equally divided point of the line connecting each adjacent range point is obtained as a densification point. The longitude and latitude information of the densification point are obtained by linear interpolation of the longitude and latitude information of the adjacent range points according to the equally divided ratio, respectively. The mileage information of the densification point is obtained by linear interpolation of the mileage information of the adjacent range points according to the same equally divided ratio. The range point is the first range point or the second range point, and the densification point is the left bank densification point or the right bank densification point.
[0047] The latitude and longitude coordinates and mileage information of the encryption points are obtained by linear interpolation of the corresponding information of adjacent range points according to an equal division ratio. The mileage information of the reference points corresponds one-to-one with the latitude and longitude information.
[0048] The following are examples: On the right bank reference line, the adjacent second range point A: mileage value 1034 km, longitude and latitude coordinates (104.712036°, 28.77983445°), and point B: mileage value 1035 km, longitude and latitude coordinates (104.7045489°, 28.7789955°).
[0049] First, calculate the difference in longitude and latitude coordinates between the two points:
[0050] Linear interpolation was performed at mileage 1034.5 km on the right bank reference line to insert densification point C.
[0051] The scaling factor for linear interpolation:
[0052] Therefore, the latitude and longitude coordinates of the encryption point C are:
[0053] Specifically, since the accuracy of the waterway mileage corresponding to the range points in the upper and middle reaches of the Yangtze River is different, different linear interpolation scaling factors are used to achieve consistency in the accuracy of the waterway mileage corresponding to the reference points.
[0054] In some implementations, linear interpolation is performed between each adjacent range point with a fixed mileage interval step size to insert densification points, thus obtaining a reference point sequence. The longitude and latitude information of the densification points are obtained by linear interpolation of the longitude and latitude information of the adjacent range points at the same ratio.
[0055] Please refer to Figure 5 Structured data for waterway densification points includes waterway classification, waterway mileage, left / right bank, longitude, and latitude. Since the mileage accuracy of adjacent range points is 1 km, the waterway mileage field is 0.1, representing the scaling factor for the linear interpolation of that densification point. .
[0056] Please refer to Figure 5 In some embodiments, left-bank encryption points are linearly inserted between each adjacent first range point to obtain a left-bank reference point sequence, and right-bank encryption points are linearly inserted between each adjacent second range point to obtain a right-bank reference point sequence, including: The mileage interval between each adjacent left bank reference point is 0.1 km; The mileage interval between each adjacent right bank reference point is 0.1 km.
[0057] The mileage interval between adjacent reference points is the mileage accuracy.
[0058] Please refer to Figure 5 The mileage interval between adjacent left and right bank reference points is 0.1 km.
[0059] The mileage intervals between adjacent left bank reference points and between adjacent right bank reference points can be dynamically adjusted according to business needs.
[0060] In some implementations, the mileage interval between adjacent reference points is greater than 0.1 km or less than 0.1 km. For example, the accuracy can be adjusted according to the complexity of the waterway. A lower accuracy is used in sharp bends, and a higher accuracy is used in straight and / or well-regulated sections to ensure that the accuracy of the subsequently simplified fencing meets the requirements of technical specifications.
[0061] In step S108, based on the analyzed start and end mileages of the channel, the left bank reference point sequence is traversed along the left bank reference line, and the right bank reference point sequence is traversed along the right bank reference line, respectively, to obtain the left bank reference point sequence and the right bank reference point sequence of the channel. The mileage intervals determined by the start and end points of these two sequences correspond to the left bank mileage interval and the right bank mileage interval of the channel, respectively. The left bank reference point sequence is connected sequentially to form the left bank reference line of the channel. The right bank reference point sequence is connected sequentially to form the right bank reference line of the channel. The set of latitude and longitude coordinates of the reference points in each segment of these two sequences forms an ordered sequence.
[0062] In step S110, all reference points are closed in a clockwise / counterclockwise direction. For example, all reference points are closed in the order of left bank starting point → left bank ending point → right bank ending point → right bank starting point → left bank starting point. The set of latitude and longitude coordinates of all reference points in the route reference point sequence forms an ordered sequence along the boundary of the polygon.
[0063] The polygon is a polygon whose sides do not intersect.
[0064] In step S112, the latitude and longitude coordinates of the reference points correspond one-to-one with their mileage information. Based on the start and end mileage values of the target waterway, the latitude and longitude coordinates in the route reference point sequence are filtered and simplified, removing redundant coordinate points that have little impact on the overall waterway shape. This reduces the amount of data processing and improves the efficiency of electronic fence marking while ensuring the key waterway characteristics.
[0065] Please refer to Figure 6 The specific steps for simplifying coordinate points using the Douglas-Peucker algorithm are as follows: Step 1: Initial setup. Select the target waterway to be simplified. For example, input the name of the target waterway and set the distance threshold D.
[0066] Please refer to Figure 6 , and the distance threshold D is 0.0001.
[0067] At this time, the ordered sequence of longitude and latitude coordinate points corresponding to the target waterway, the mileage starting point, and the mileage ending point will be determined.
[0068] Based on the mileage starting point and the mileage ending point, the first original coordinate point sequence corresponding to the reference point sequence on the left bank of the waterway and the second original coordinate point sequence corresponding to the reference point sequence on the right bank of the waterway in the ordered sequence of longitude and latitude coordinate points can be respectively calibrated, and the first and last two points of each of these two segments of the original coordinate point sequence can be determined.
[0069] That is, the algorithm can achieve one-time simplification of the coordinate points on the polygon.
[0070] Step 2: Straight line connection and distance calculation. The algorithm simplifies the coordinate points in each segment of the original coordinate point sequence separately.
[0071] For each segment of the original coordinate point sequence, a straight line is virtually connected between its first and last points, and the distances from the remaining coordinate points to this straight line are calculated.
[0072] Step 3: Distance comparison and point retention. Find the maximum distance value among all the distances and its corresponding coordinate point, and compare it with the distance threshold D. If < D, it means that the sequence is relatively close to the straight line, then only the first and last points of the sequence are retained, and the remaining coordinate points are discarded. If ≥ D, then retain the coordinate point corresponding to the maximum distance value and divide the sequence into two parts of coordinate point sequences with it as the boundary. Step 4: Recursive processing. For the two parts of the coordinate point sequences after segmentation, repeat the operations in Step 2 and Step 3 respectively, and continuously recurse until the sequence cannot be segmented any further.
[0073] Arrange the coordinate point sequences of the two segments of the original coordinate point sequences after being simplified by the algorithm in the original order, and finally obtain the simplified set of coordinate points.
[0074] Please refer to Figure 6 , simplify the ordered sequence of longitude and latitude coordinate points composed of 143 reference points corresponding to an upstream Yangtze River waterway (mileage range 21 km - 28 km), and 22 electronic fence points are obtained after simplification.
[0075] Reclose all the electronic fence points in the original order, and the resulting electronic fence polygon will form the electronic fence boundary of the waterway, providing reliable safety boundary guidance for ships.
[0076] The method has the following advantages: 1. Precise labeling supported by high-precision data By subdividing the waterway mileage data into high-precision segments, the accuracy is improved from the original kilometer level to a smaller scale, allowing the waterway reference line to better match the actual waterway conditions. This provides detailed basic data for the accurate marking of electronic fence points on both sides of the waterway, effectively ensuring the safety of ship navigation.
[0077] 2. Automated Information Processing and Tagging Unlike the traditional method of manually drawing specific waterways, this invention uses algorithms to automatically parse waterway information in text form, simplify coordinate points, and integrate data to achieve automatic marking of electronic fence points for specific waterways. This reduces manual intervention, improves the efficiency and accuracy of electronic fence setting, and enables rapid response to changes in waterway information. 3. Strong dynamic adaptability The method can adapt to specific waterways, such as the complex and ever-changing Yangtze River waterway. Whether it is seasonal water level changes or waterway information updates caused by waterway improvement projects, it can update electronic fence markers in a timely and accurate manner through data processing and integration, providing reliable safety boundary guidance for ships. It has significant practicality and dynamic adaptability.
[0078] Example 2 This disclosure provides an embodiment of a waterway electronic fence marking device 1000.
[0079] The apparatus 1000 may include corresponding modules that perform one or more steps in the flowchart of the method S100 described above. Therefore, each or more steps in the flowchart can be performed by a corresponding module, and the apparatus 1000 may include one or more of these modules. A module may be one or more hardware modules specifically configured to perform a corresponding step, or implemented by a processor configured to perform a corresponding step, or stored in a computer-readable medium for implementation by a processor, or implemented through some combination thereof.
[0080] Specifically, such as Figure 7 As shown, the device 1000 includes: The channel section acquisition module 1002 is used to acquire the starting mileage information and ending mileage information of the water area where the target channel is located, and to determine the left bank mileage section and the right bank mileage section of the channel. The left bank mileage section and the right bank mileage section of the channel are both determined based on the starting mileage information and ending mileage information of the water area where the target channel is located. The range point acquisition module 1004 is used to acquire a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information; Interpolation module 1006 is used to linearly insert left bank encryption points between each adjacent first range point to obtain a left bank reference point sequence, and to linearly insert right bank encryption points between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank encryption points and the right bank encryption points each include corresponding mileage information, longitude information and latitude information. The channel sequence acquisition module 1008 is used to obtain a channel left bank reference point sequence based on the channel left bank mileage interval and the left bank reference point sequence, and to obtain a channel right bank reference point sequence based on the channel right bank mileage interval and the right bank reference point sequence. The polygon acquisition module 1010 is used to connect the left bank reference point sequence of the channel with the right bank reference point sequence of the channel in sequence to obtain a channel reference point sequence, which forms a closed polygon. The electronic fence acquisition module 1012 is used to simplify the waterway reference point sequence using the Douglas-Peucker algorithm to obtain the electronic fence point sequence, and connect the electronic fence point sequence in sequence to obtain a closed electronic fence polygon.
[0081] This disclosure also provides an electronic device, including: a memory storing execution instructions; and a processor or other hardware module executing the execution instructions stored in the memory, causing the processor or other hardware module to execute the above-described waterway electronic fence marking method.
[0082] This disclosure also provides a readable storage medium storing executable instructions, which, when executed by a processor, are used to implement the above-described waterway electronic fence marking method.
[0083] The hardware architecture of the device 1000, implemented using a processor-based hardware approach, can be implemented using a bus architecture. The bus architecture can include any number of interconnect buses and bridges, depending on the specific application and overall design constraints of the hardware. Bus 1100 connects various circuits including one or more processors 1200, memory 1300, and / or hardware modules. Bus 1100 can also connect various other circuits 1400 such as peripheral devices, voltage regulators, power management circuits, external antennas, etc.
[0084] Bus 1100 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of representation, this diagram uses only one connection line, but this does not imply that there is only one bus or one type of bus.
[0085] Any process or method description in the flowcharts or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing a particular logical function or process, and the scope of the preferred embodiments of this disclosure includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of this disclosure pertain. The processor performs the various methods and processes described above. For example, the method embodiments of this disclosure may be implemented as software programs tangibly contained in a machine-readable medium, such as memory. In some embodiments, part or all of the software program may be loaded and / or installed via memory and / or a communication interface. When the software program is loaded into memory and executed by the processor, one or more steps of the methods described above may be performed. Alternatively, in other embodiments, the processor may be configured to perform one of the methods described above by any other suitable means (e.g., by means of firmware).
[0086] The logic and / or steps represented in the flowchart or otherwise described herein may be specifically implemented in any readable storage medium for use by, or in conjunction with, an instruction execution system, apparatus or device (such as a computer-based system, a processor-included system or other system that can fetch and execute instructions from, an instruction execution system, apparatus or device).
[0087] For the purposes of this specification, a "readable storage medium" can be any means capable of containing, storing, communicating, propagating, or transmitting a program for use by or in conjunction with an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable read-only memory (CDROM). Furthermore, a readable storage medium can even be paper or other suitable media on which a program can be printed, since a program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in memory.
[0088] It should be understood that various parts of this disclosure can be implemented in hardware, software, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented in software stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.
[0089] Those skilled in the art will understand that all or part of the steps of the methods described above can be implemented by a program instructing related hardware. The program can be stored in a readable storage medium, and when executed, the program includes one or a combination of the steps of the method implementation.
[0090] Furthermore, the functional units in the various embodiments of this disclosure can be integrated into a single processing module, or each unit can exist physically separately, or two or more units can be integrated into a single module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a readable storage medium. The storage medium can be a read-only memory, a disk, or an optical disk, etc.
[0091] Those skilled in the art should understand that the above embodiments are merely for illustrating the present disclosure and are not intended to limit the scope of the disclosure. Those skilled in the art can make other changes or modifications based on the above disclosure, and these changes or modifications still fall within the scope of the present disclosure.
Claims
1. A method for marking electronic fences along waterways, characterized in that, The method includes: Obtain the starting mileage information and ending mileage information of the water area where the target channel is located, and determine the mileage interval on the left bank and the mileage interval on the right bank of the channel. The mileage interval on the left bank and the mileage interval on the right bank of the channel are determined based on the starting mileage information and the ending mileage information of the water area where the target channel is located. Obtain a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information. A left bank densification point is linearly inserted between each adjacent first range point to obtain a left bank reference point sequence, and a right bank densification point is linearly inserted between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank densification point and the right bank densification point both include corresponding mileage information, longitude information and latitude information. Based on the left bank mileage interval and the left bank reference point sequence, a left bank reference point sequence is obtained; and based on the right bank mileage interval and the right bank reference point sequence, a right bank reference point sequence is obtained. The left bank reference point sequence and the right bank reference point sequence of the channel are connected sequentially to obtain a channel reference point sequence, which forms a closed polygon. The Douglas-Peucker algorithm is used to simplify the waterway reference point sequence to obtain the electronic fence point sequence. The electronic fence point sequence is then connected in sequence to obtain a closed electronic fence polygon.
2. The method as described in claim 1, characterized in that, Obtain the first range point sequence and the second range point sequence covering the target channel, including: Based on one or more electronic navigation charts, obtain the first range point sequence and the second range point sequence covering the target navigation channel, respectively.
3. The method as described in claim 1, characterized in that, Obtain the starting and ending mileage information of the waterway where the target channel is located, including: The textual information about waterways is transformed into structured data using a large language model. This structured data includes the starting and ending mileage information of the waterways.
4. The method as described in claim 1, characterized in that, Linearly inserting left-bank encryption points between each adjacent first range point to obtain a left-bank reference point sequence, and linearly inserting right-bank encryption points between each adjacent second range point to obtain a right-bank reference point sequence, including: At least one equally divided point of the line connecting each adjacent range point is obtained as a densification point. The longitude and latitude information of the densification point are obtained by linear interpolation of the longitude and latitude information of the adjacent range points according to the equally divided ratio, respectively. The mileage information of the densification point is obtained by linear interpolation of the mileage information of the adjacent range points according to the same equally divided ratio. The range point is the first range point or the second range point, and the densification point is the left bank densification point or the right bank densification point.
5. The method as described in claim 1, characterized in that, Linearly inserting left-bank encryption points between each adjacent first range point to obtain a left-bank reference point sequence, and linearly inserting right-bank encryption points between each adjacent second range point to obtain a right-bank reference point sequence, including: The mileage interval between each adjacent left bank reference point is 0.1 km; The mileage interval between each adjacent right bank reference point is 0.1 km.
6. A waterway electronic fence marking device, characterized in that, The device includes: The channel section acquisition module is used to acquire the starting mileage information and ending mileage information of the water area where the target channel is located, and to determine the left bank mileage section and the right bank mileage section of the channel. The left bank mileage section and the right bank mileage section of the channel are determined based on the starting mileage information and ending mileage information of the water area where the target channel is located. The range point acquisition module is used to acquire a first range point sequence and a second range point sequence covering the target waterway, wherein the mileage interval determined by the start and end points in the first range point sequence includes the mileage interval on the left bank of the waterway, and the mileage interval determined by the start and end points in the second range point sequence includes the mileage interval on the right bank of the waterway, and both the first range point and the second range point include corresponding mileage information, longitude information and latitude information; An interpolation module is used to linearly insert left bank encryption points between each adjacent first range point to obtain a left bank reference point sequence, and to linearly insert right bank encryption points between each adjacent second range point to obtain a right bank reference point sequence, wherein the left bank encryption points and the right bank encryption points each include corresponding mileage information, longitude information and latitude information. The channel sequence acquisition module is used to obtain a channel left bank reference point sequence based on the channel left bank mileage interval and the left bank reference point sequence, and to obtain a channel right bank reference point sequence based on the channel right bank mileage interval and the right bank reference point sequence. The polygon acquisition module is used to connect the left bank reference point sequence and the right bank reference point sequence of the channel in sequence to obtain a channel reference point sequence, which forms a closed polygon. The electronic fence acquisition module is used to simplify the waterway reference point sequence using the Douglas-Peucker algorithm to obtain the electronic fence point sequence, and connect the electronic fence point sequence in sequence to obtain a closed electronic fence polygon.
7. An electronic device, characterized in that, include: The memory stores execution instructions; as well as A processor that executes execution instructions stored in the memory, causing the processor to perform the method according to any one of claims 1-5.
8. A readable storage medium, characterized in that, The readable storage medium stores execution instructions, which, when executed by a processor, are used to implement the method described in any one of claims 1-5.
Citation Information
Patent Citations
Grid-based control river reach ship position determination method
CN113689740A
Ship channel identification method and device, electronic equipment and storage medium
CN119091400A