CN107610455A - Fence - Google Patents
Fence Download PDFInfo
- Publication number
- CN107610455A CN107610455A CN201710797576.9A CN201710797576A CN107610455A CN 107610455 A CN107610455 A CN 107610455A CN 201710797576 A CN201710797576 A CN 201710797576A CN 107610455 A CN107610455 A CN 107610455A
- Authority
- CN
- China
- Prior art keywords
- polygon
- fence
- ray
- point
- angle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Image Generation (AREA)
Abstract
A kind of fence of disclosure of the invention, including dotted line determining method；Dotted line determining method first regards each edge of polygon as end to end directed line segment as, if in the case of some the direction all identicals of point relative to each edge of polygon, so it is just in this polygonal internal, core procedure is to obtain this point (x, y) (the x1 of two point nearest from it, y1) and (x2, y2) value, it is applied to convex polygon；Fence provided by the invention, the optimized algorithm of fence is realized, improve and search the efficiency that fence motor bicycle comes in and goes out；Devise the software configuration of fence and database structure and realize fence, because fence design directly draws polygon on map, there is very big error with the geographical longitude and latitude of reality, when fence is drawn, so first determining the longitude and latitude at several angles as far as possible, then adjacent angular is connected, simultaneously, it is maximum multiple to ensure map, can so ensure error minimum.
Description
Technical field
The invention belongs to electric power overhaul field, especially a kind of fence.
Background technology
With flourishing for power system, the usage quantity and laying scope of various public power facilities increase therewith,
But corresponding power failure, also in the trend risen, in traditional power failure maintenance process, workmen needs
Signal lamp or instruction frame are put at the construction field (site) in time, or even part job site needs to set up fence to strengthen warning
Guard against.But due to electric power first-aid and daily construction during, often easily occur indicator lamp or instruction frame putting position do not wake up
Mesh, being strayed into for non-workmen is caused, so that work progress is affected, there is also potential safety hazard.To overcome existing skill
Art deficiency, the present invention provide the fence of a kind of discrimination height and simple installation.
The content of the invention
The present invention is to provide a kind of fence to solve the technical scheme that above-mentioned technical problem uses, wherein, specifically
Technical scheme is：
Judge whether motor bicycle is successfully parked in the region of defined by the following method；
Including dotted line determining method
Dotted line determining method first regards each edge of polygon as end to end directed line segment as, if some point phase
In the case of direction all identicals of each edge of polygon, then it just exists in this polygonal internal, core procedure
In (x1, y1) and (x2, the y2) value for obtaining this point (x, y) two points nearest from it, it is applied to convex polygon；
Operating procedure：
1. the coordinate of defining point is (x, y), two points nearest from it are (x1, y1) and (x2, y2)；
2. algorithmic formula one：
V=(x2-x1) * (y-y1)-(x-x1) * (y2-y1)
If V>In the case of=0, then this point in the case of 0, is located at positioned at the inside of the polygon
The outside of polygon；
3. algorithmic formula two：
V=(y-y1)/(x-x1)-(y2-y1)/(x2-x1)
If V>In the case of=0, then this point in the case of 0, is located at positioned at the inside of the polygon
The outside of polygon.
Above-mentioned fence, wherein：
Also include ray method；
A ray is done from a level, calculates the joining number on the side of the ray and polygon, when point is not more
When in shape either on summit, if odd number, then o'clock be scheduled on polygonal internal with regard to one, otherwise, in outside, wherein it
Algorithm complex is O (N), and N is the side number of polygon.
Above-mentioned fence, wherein：
Also include angle and method：
Angle and method are applied to convex triangle, have in or beyond polygon a bit, by this point and each angle of polygon
It is connected, forms angle, be ∠ 1, ∠ 2, ∠ 3, ∠ 4, ∠ 5, ∠ 6, these angles is added and just obtains angle and rises for convenience
See, remember this angle and be a；Positive regulation is the direction that turns clockwise, and negative sense is counterclockwise；Work as a！During=2 π, then it is judged to
Breakpoint is in the outside of polygon；As a=2 π, then it is judged to breakpoint in the inside of polygon；
If being judged to breakpoint is some summit of polygon, wherein there is an angle to be equal to 0；If it is judged to breakpoint more
On in certain of shape, then wherein there is an angle to be equal to 0 or 180 degree；It is general to solve two rays with point area method
Angle, comprise the following steps that shown in:
Assuming that P, p1 and p2 coordinate are respectively (x, y), (xl, yl) and (x2, y2), vector v l=pl-p, vector v 2=
p2-p；
It can be obtained by dot product formula：V1*v 2=| 1 | | 2 | cos ∠ 1
The value at other angles in the hope of ∠ 1 angle, can be equally obtained by formula, they be added obtain angle and.
Above-mentioned fence, wherein：
Also include improving ray method：
Improved ray method is embodied in the following aspects：
1) if ray continuously across two or more summits be obviously all located at ray side such case, according to upper
Face it is assumed that such case is regarded as does not pass through, the two summits on ray are not included；
2) situation that point and polygon vertex overlap, such case, which directly compares point coordinates and the coordinate of polygon vertex, is
It is no it is identical just.
Above-mentioned fence, wherein：
Also include tree indexing method：
Qualified a small amount of polygon is quickly found out by the method for scalping first, then the polygon after scalping made
Judged with ray method；
Method for one-dimensional data using index, finds some range intervals section, then to this model by b-tree indexed
Enclose segment and carry out traversal lookup, the method that spatial index is usually used for two-dimensional space data, for example model is found by R trees
The polygon in section is enclosed, then the polygon in the range of this is accurately judged；
The resolving ideas of most-often used spatial index R trees is described below.
1. outsourcing rectangle represents polygon
Because polygonal shape is different, it would be desirable to by it is a kind of it is unified in a manner of to carry out polygon it is approximate, most simply
Mode be exactly with minimum outsourcing rectangle to represent polygon；
2. R trees index is established to minimum outsourcing rectangle；
3. inquire about；
Judge whether user position is outsourced rectangle covering rapidly by R trees first；
Returned not in geography fence polygon if not covered by any outsourcing rectangle；
Also need to further determine whether the polygonal internal in this outsourcing rectangle if rectangle covering is outsourced, use
Ray method mentioned above judges；
Solution when 4. polygon edge number is more；
Minimum outsourcing rectangle is built to each edge of polygon；
R trees index is built on these minimum outsourcing rectangular foundations；
By R trees judge ray whether with outsourcing rectangle intersection；
Side after R tree scalpings carries out accurate ask and hands over judgement, and time complexity drops to O (Log (N)) from O (N), greatly improved
Computational efficiency.
The present invention has the advantages that relative to prior art：
This product have studied a little relation with polygon, describe ray method, dotted line determining method, angle and method, R trees index
Method is simultaneously improved ray method, realizes the optimized algorithm of fence, is improved and is searched the discrepancy of fence motor bicycle
Efficiency；Devise the software configuration of fence and database structure and realize fence, because fence designs
Polygon is directly drawn on map, has very big error with the geographical longitude and latitude of reality, when fence is drawn,
So first determining the longitude and latitude at several angles as far as possible, then adjacent angular is connected, simultaneously, it is ensured that map is maximum multiple, so
Error minimum can be ensured.
Brief description of the drawings
Fig. 1 is the detail flowchart that user returns the car.
Fig. 2-3 is the schematic diagram of ray method.
Fig. 4 is the excessively horizontal schematic diagram of ray.
Fig. 5 is the schematic diagram that ray crosses summit.
Fig. 6 is angle and the schematic diagram of method.
Fig. 7 is the schematic diagram of simple test.
Fig. 8-9 is the schematic diagram that outsourcing rectangle represents polygon.
Figure 10-11 is the schematic diagram that R trees index is established to minimum outsourcing rectangle.
Figure 12-13, which is that R trees are rapid, to be judged user position, is not returned then by the covering of any outsourcing rectangle and do not enclosed in geography
Schematic diagram in column polygon.
Figure 14-16 is the schematic diagram of solution when polygon edge number is more.
Embodiment
The invention will be further described with reference to the accompanying drawings and examples.
As shown above, it is detailed process that user returns the car.
The key problem of this product is whether calculating motor bicycle position in dashed rectangle and fence position match,
Range size of the motor bicycle in the region for specifying parking is namely calculated, the scope is related to the selection and optimization of many algorithms.
Method is analyzed
The key problem of this product is whether motor bicycle is successfully parked in the region of defined, such as convex polygon,
Concave polygon region.
Method choice
From the point of view of the mode of mathematics, be exactly a point whether in defined region, the algorithm of common point and polygon
There are dotted line determining method, angle and method, ray method, wherein ray method concave polygon, dotted line determining method, angle and method are used for convex more
Side shape.
Dotted line determining method
Dotted line determining method first regards each edge of polygon as end to end directed line segment as, if some point phase
In the case of direction (left side of directed line segment either right side) all identicals of each edge of polygon, then it just exists
This polygonal internal, core procedure are (x1, the y1) and (x2, y2) for obtaining this point (x, y) two points nearest from it
Value, it is applied to convex polygon.
Operating procedure：
1., the coordinate of defining point be (x, y), two points nearest from it are (x1, y1) and (x2, y2).
2., algorithmic formula one：
V=(x2-x1) * (y-y1)-(x-x1) * (y2-y1)
If V>In the case of=0, then this point in the case of 0, is located at positioned at the inside of the polygon
The outside of polygon.
3., algorithmic formula two：
V=(y-y1)/(x-x1)-(y2-y1)/(x2-x1)
If V>In the case of=0, then this point in the case of 0, is located at positioned at the inside of the polygon
The outside of polygon.
Ray method
Ray method is one of most popular method, for other algorithms that compare, it not only can with it is proper use of
In concave polygon, and without the concern for trueness error problem.The algorithm idea is to do a ray from a level, is calculated
The joining number on the side of the ray and polygon, when putting not in polygon edge either on summit, if odd number, then
O'clock polygonal internal is scheduled on regard to one, as shown in figure 1, otherwise, in outside, as shown in Figure 2.Wherein its algorithm complex is O
(N), N is the side number of polygon.
As shown in Fig. 2 the left and right number of hits of ray and polygon is respectively 5 and 3, it is odd number, then point p is in polygon
It is interior；As shown in figure 3, the point p of outside of polygon and polygon intersection number are 6, then point is outside polygon.Above-described is to penetrate
The basic thought of collimation method algorithm, be suitable for it is most of be judged to the position relationship of breakpoint and polygon, but also have some special
The judged result of position relationship is wrong.These special circumstances will be enumerated below：
Ray crosses horizontal line, such as Fig. 4；
Ray crosses summit, such as Fig. 5；
As shown in figure 4, the intersection point of ray and polygon is 2 and 1, the logical thinking not being accordant to the old routine.
As shown in figure 5, the intersection point of ray and polygon is 2 and 1, the logical thinking not being accordant to the old routine.
Obviously, according to ray algorithm basic thought can not decision-point and polygon position relationship, so needing to improve this
Algorithm.
Angle and method
It is applied to convex triangle for angle and method, as shown in fig. 6, have in or beyond polygon a bit, by this point with it is more
Each angle of side shape is connected, and forms angle, is ∠ 1, ∠ 2, ∠ 3, ∠ 4, ∠ 5, ∠ 6, these angles are added and just obtain angle
With for convenience, remember this angle and be a.Positive regulation is the direction that turns clockwise, and negative sense is counterclockwise.Work as a！=2
During π, then it is judged to breakpoint in the outside of polygon；As a=2 π, then it is judged to breakpoint in the inside of polygon.
Such as Fig. 6；
If being judged to breakpoint is some summit of polygon, wherein there is an angle to be equal to 0；If it is judged to breakpoint more
On in certain of shape, then wherein there is an angle to be equal to 0 or 180 degree.It is general to solve two rays with point area method
Angle, comprise the following steps that shown in:
Assuming that P, p1 and p2 coordinate are respectively (x, y), (xl, yl) and (x2, y2), vector v l=pl-p, vector v 2=
p2-p。
It can be obtained by dot product formula：V1*v 2=| 1 | | 2 | cos ∠ 1
The value at other angles in the hope of ∠ 1 angle, can be equally obtained by formula, they be added obtain angle and.
As known from the above, ray method algorithm is judging to be judged to breakpoint with limitation be present during Polygon position relation.And angle and
Method and dotted line determining method may be only used for convex polygon, but fence shape is changeable, it may be possible to which convex polygon is also likely to be
Concave polygon, from solve problem range on for, ray method is most suitable method.
Improve ray method
Improved ray method is mainly reflected in the following aspects：
1st, if ray continuously across two or more summits be obviously all located at ray side such case, according to upper
Face it is assumed that such case is considered as not passing through, the two summits on ray are not included
2nd, the situation that point and polygon vertex overlap, such case can directly compare the seat of point coordinates and polygon vertex
Whether mark is identical just.
The core code that algorithm is realized：
When geography fence polygon number is less, we can travel through each polygon (violence traversal) successively,
Then judged with ray method, such efficiency is also very high.And when polygon number is more, than if any 100,000 polygons,
Need this when to perform 100,000 ray methods, the response time reaches 3.9 seconds, and this can hardly be endured in fence application.
Following table is my simple test, and polygon edge number is 7, as shown in Figure 7.
Set indexing method
The reason for violence traversal efficiency is low is to have carried out ray method judgement with each polygon, if can reduce
The call number performance of ray method can just be lifted.Therefore our optimum ideals are very direct, quick by the method for scalping first
Qualified a small amount of polygon is found, then the polygon after scalping is judged using ray method, the execution of such ray method
Number substantially reduces, and efficiency can also greatly improve.How scalpingThe method that we usually use index for one-dimensional data,
For example some range intervals section is found by b-tree indexed, traversal lookup then is carried out to this range intervals section, for two-dimentional empty
Between data usually use the method for spatial index, for example the polygon in range intervals is found by R trees, then in the range of this
Polygon accurately judged, the resolving ideas of most-often used spatial index R trees is described below.
1., outsourcing rectangle represent polygon
Because polygonal shape is different, it would be desirable to by it is a kind of it is unified in a manner of to carry out polygon it is approximate, most simply
Mode be exactly with minimum outsourcing rectangle to represent polygon.As shown in Figure 8, Figure 9.
2., minimum outsourcing rectangle is established R trees index, as shown in Figure 10,11；
3., inquiry
Judge whether user position (thick point) is outsourced rectangle covering (Figure 12, round dot representative rapidly by R trees first
User position；R tree average lookups complexity is O (Log (N)), and N is polygon number)；
Returned if not covered by any outsourcing rectangle not in geography fence polygon, such as Figure 13；
Also need to further determine whether the polygonal internal in this outsourcing rectangle if rectangle covering is outsourced, use
Ray method mentioned above judges；
4., polygon edge number it is more when solution
Minimum outsourcing rectangle is built to each edge of polygon, as shown in figure 15；
R trees index is built on these minimum outsourcing rectangular foundations, as shown in figure 16；
By R trees judge ray whether with outsourcing rectangle intersection；
Side after R tree scalpings carries out accurate ask and hands over judgement, and time complexity drops to O (Log (N)) from O (N), greatly improved
Computational efficiency.
Claims (5)
- A kind of 1. fence, it is characterised in that：Judge whether motor bicycle is successfully parked in the area of defined by the following method In domain；Including dotted line determining methodDotted line determining method first regards each edge of polygon as end to end directed line segment as, if some point relative to In the case of all identicals of the direction of each edge of polygon, then, just in this polygonal internal, core procedure is to ask for it Go out (x1, y1) and (x2, y2) value of this point (x, y) two points nearest from it, it is applied to convex polygon；Operating procedure：1. the coordinate of defining point is (x, y), two points nearest from it are (x1, y1) and (x2, y2)；2. algorithmic formula one：V=(x2-x1) * (y-y1)-(x-x1) * (y2-y1)If V>In the case of=0, then this point is positioned at the inside of the polygon, in the case of 0, positioned at polygon The outside of shape；3. algorithmic formula two：V=(y-y1)/(x-x1)-(y2-y1)/(x2-x1)If V>In the case of=0, then this point is positioned at the inside of the polygon, in the case of 0, positioned at polygon The outside of shape.
- 2. fence as claimed in claim 1, it is characterised in that：Also include ray method；A ray is done from a level, calculates the joining number on the side of the ray and polygon, when point is not in polygon When side is either on summit, if odd number, then o'clock polygonal internal is scheduled on regard to one, otherwise, and in outside, wherein its algorithm Complexity is O (N), and N is the side number of polygon.
- 3. fence as claimed in claim 2, it is characterised in that：Also include angle and method：Angle and method are applied to convex triangle, have in or beyond polygon a bit, and this point is connected with each angle of polygon, Angle is formed, is ∠ 1, ∠ 2, ∠ 3, ∠ 4, ∠ 5, ∠ 6, these angles is added and just obtains angle and for convenience, remembers this Angle and be a；Positive regulation is the direction that turns clockwise, and negative sense is counterclockwise；Work as a！During=2 π, then it is judged to breakpoint more The outside of side shape；As a=2 π, then it is judged to breakpoint in the inside of polygon；If being judged to breakpoint is some summit of polygon, wherein there is an angle to be equal to 0；If it is judged to breakpoint in polygon Certain side on, then wherein there is an angle to be equal to 0 or 180 degree；It is general to solve the folder of two rays with point area method Angle, comprise the following steps that shown:Assuming that P, p1 and p2 coordinate are respectively (x, y), (xl, yl) and (x2, y2), vector v l=pl-p, vector v 2=p2-p；It can be obtained by dot product formula：V1*v2=| 1 | | 2 | cos ∠ 1The value at other angles in the hope of ∠ 1 angle, can be equally obtained by formula, they be added obtain angle and.
- 4. fence as claimed in claim 3, it is characterised in that：Also include improving ray method：Improved ray method is embodied in the following aspects：1) if ray continuously across two or more summits be obviously all located at ray side such case, according to above Do not passed through it is assumed that such case is regarded as, the two summits on ray are not included；2) situation that point and polygon vertex overlap, such case directly compare point coordinates and polygon vertex coordinate whether phase With just.
- 5. fence as claimed in claim 4, it is characterised in that：Also include tree indexing method：Qualified a small amount of polygon is quickly found out by the method for scalping first, then the polygon use after scalping penetrated Collimation method judges；Method for one-dimensional data using index, finds some range intervals section, then to this scope area by b-tree indexed Between section carry out traversal lookup, the method for spatial index is usually used for two-dimensional space data, for example scope area found by R trees Interior polygon, is then accurately judged the polygon in the range of this；The resolving ideas of most-often used spatial index R trees is described below.1. outsourcing rectangle represents polygonBecause polygonal shape is different, it would be desirable to by it is a kind of it is unified in a manner of to carry out approximate, simplest side to polygon Formula is exactly to represent polygon with minimum outsourcing rectangle；2. R trees index is established to minimum outsourcing rectangle；3. inquire about；Judge whether user position is outsourced rectangle covering rapidly by R trees first；Returned not in geography fence polygon if not covered by any outsourcing rectangle；Also need to further determine whether the polygonal internal in this outsourcing rectangle if rectangle covering is outsourced, using above The ray method mentioned judges；Solution when 4. polygon edge number is more；Minimum outsourcing rectangle is built to each edge of polygon；R trees index is built on these minimum outsourcing rectangular foundations；By R trees judge ray whether with outsourcing rectangle intersection；Side after R tree scalpings carries out accurate ask and hands over judgement, and time complexity drops to O (Log (N)) from O (N), improves calculating effect Rate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710797576.9A CN107610455A (en) | 2017-09-06 | 2017-09-06 | Fence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710797576.9A CN107610455A (en) | 2017-09-06 | 2017-09-06 | Fence |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107610455A true CN107610455A (en) | 2018-01-19 |
Family
ID=61062372
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710797576.9A Pending CN107610455A (en) | 2017-09-06 | 2017-09-06 | Fence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107610455A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108346282A (en) * | 2018-04-20 | 2018-07-31 | 杭州骑迹科技有限公司 | Parking monitoring method, computing device and the storage medium of shared bicycle |
| CN108846882A (en) * | 2018-06-25 | 2018-11-20 | 北京嘀嘀无限科技发展有限公司 | A kind of method, apparatus and electronic equipment of determining point and fence relationship |
| CN108972552A (en) * | 2018-07-26 | 2018-12-11 | 平安科技（深圳）有限公司 | A kind of position finding and detection method of robot, equipment and computer-readable medium |
| CN109506666A (en) * | 2018-09-18 | 2019-03-22 | 杭州的蓝科技有限公司 | Vehicle is returned the car region recommended method and device |
| CN110675636A (en) * | 2019-10-09 | 2020-01-10 | 上海图丽信息技术有限公司 | Electronic license plate running prohibition application system |
| CN112509031A (en) * | 2020-12-02 | 2021-03-16 | 湖北工业大学 | Position judging method |
| CN112907938A (en) * | 2021-02-24 | 2021-06-04 | 华录智达科技股份有限公司 | Urban intelligent bus management and control method and system based on electronic fence |
| CN114419188A (en) * | 2021-12-31 | 2022-04-29 | 广东电网有限责任公司 | Automatic construction method and device for electronic fence in field operation area and storage medium |
| CN115239905A (en) * | 2022-09-23 | 2022-10-25 | 山东新坐标智能装备有限公司 | Electronic fence and virtual wall generation method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982562A (en) * | 2012-10-19 | 2013-03-20 | 浙江中正智能科技有限公司 | Method for judging whether target point is positioned inside polygon area |
| CN104575081A (en) * | 2014-12-08 | 2015-04-29 | 深圳市广和通实业发展有限公司 | Method for detecting entrance of vehicle into polygonal electronic fence region |
| CN105225515A (en) * | 2015-10-26 | 2016-01-06 | 深圳市麦谷科技有限公司 | A kind of method for supervising based on fence and system |
| CN105828292A (en) * | 2016-05-09 | 2016-08-03 | 青岛海信移动通信技术股份有限公司 | Position detecting method and device based on geo-fencing |
| CN106600951A (en) * | 2017-01-19 | 2017-04-26 | 西安电子科技大学 | Vehicle monitoring system with vehicle monitoring terminal and method thereof |
-
2017
- 2017-09-06 CN CN201710797576.9A patent/CN107610455A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982562A (en) * | 2012-10-19 | 2013-03-20 | 浙江中正智能科技有限公司 | Method for judging whether target point is positioned inside polygon area |
| CN104575081A (en) * | 2014-12-08 | 2015-04-29 | 深圳市广和通实业发展有限公司 | Method for detecting entrance of vehicle into polygonal electronic fence region |
| CN105225515A (en) * | 2015-10-26 | 2016-01-06 | 深圳市麦谷科技有限公司 | A kind of method for supervising based on fence and system |
| CN105828292A (en) * | 2016-05-09 | 2016-08-03 | 青岛海信移动通信技术股份有限公司 | Position detecting method and device based on geo-fencing |
| CN106600951A (en) * | 2017-01-19 | 2017-04-26 | 西安电子科技大学 | Vehicle monitoring system with vehicle monitoring terminal and method thereof |
Non-Patent Citations (3)
| Title |
|---|
| EVENVI: "《围栏算法研究与实现》", 《WWW.EVENVI.COM/INDEX.PHP/ARCHIVES/45/》 * |
| ZHANLIJUN: "《地理围栏算法解析》", 《WWW.CNBLOGS.COM/LBSER/P/4471742.HTML》 * |
| 朱安里等: "《基于GPS的电子围栏设计》", 《中国科技论文在线》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108346282B (en) * | 2018-04-20 | 2020-11-06 | 杭州骑迹科技有限公司 | Shared bicycle parking monitoring method, computing device and storage medium |
| CN108346282A (en) * | 2018-04-20 | 2018-07-31 | 杭州骑迹科技有限公司 | Parking monitoring method, computing device and the storage medium of shared bicycle |
| CN108846882A (en) * | 2018-06-25 | 2018-11-20 | 北京嘀嘀无限科技发展有限公司 | A kind of method, apparatus and electronic equipment of determining point and fence relationship |
| CN108846882B (en) * | 2018-06-25 | 2019-09-03 | 北京嘀嘀无限科技发展有限公司 | A kind of method, apparatus and electronic equipment of determining point and fence relationship |
| CN108972552A (en) * | 2018-07-26 | 2018-12-11 | 平安科技（深圳）有限公司 | A kind of position finding and detection method of robot, equipment and computer-readable medium |
| CN109506666A (en) * | 2018-09-18 | 2019-03-22 | 杭州的蓝科技有限公司 | Vehicle is returned the car region recommended method and device |
| CN110675636A (en) * | 2019-10-09 | 2020-01-10 | 上海图丽信息技术有限公司 | Electronic license plate running prohibition application system |
| CN112509031A (en) * | 2020-12-02 | 2021-03-16 | 湖北工业大学 | Position judging method |
| CN112509031B (en) * | 2020-12-02 | 2022-08-16 | 湖北工业大学 | Position judging method |
| CN112907938A (en) * | 2021-02-24 | 2021-06-04 | 华录智达科技股份有限公司 | Urban intelligent bus management and control method and system based on electronic fence |
| CN112907938B (en) * | 2021-02-24 | 2022-07-08 | 华录智达科技股份有限公司 | Urban intelligent bus management and control method and system based on electronic fence |
| CN114419188A (en) * | 2021-12-31 | 2022-04-29 | 广东电网有限责任公司 | Automatic construction method and device for electronic fence in field operation area and storage medium |
| CN114419188B (en) * | 2021-12-31 | 2022-09-02 | 广东电网有限责任公司 | Automatic construction method and device for electronic fence in field operation area and storage medium |
| CN115239905A (en) * | 2022-09-23 | 2022-10-25 | 山东新坐标智能装备有限公司 | Electronic fence and virtual wall generation method |
| CN115239905B (en) * | 2022-09-23 | 2022-12-20 | 山东新坐标智能装备有限公司 | Electronic fence and virtual wall generation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107610455A (en) | Fence | |
| CN107562895A (en) | Geography fence | |
| CN106846926B (en) | A kind of no-fly zone unmanned plane method for early warning | |
| WO2018121448A1 (en) | Topology map creation method and navigation method for mobile robot, programmable device, and computer readable medium | |
| US10928208B2 (en) | Methods and systems for creating and using a location identification grid | |
| CN110633344B (en) | Method and device for determining point-to-fence relationship and electronic equipment | |
| JP2015524096A5 (en) | ||
| WO2019126950A1 (en) | Positioning method, cloud server, terminal, system, electronic device and computer program product | |
| KR20180100194A (en) | Method for recognizing path deviation, terminal and storage medium | |
| CN104200702B (en) | System and method for looking up parking space | |
| CN109656264A (en) | For being generated to the method implemented by computer and system in the path 3D in landing site for aircraft | |
| CN110501018A (en) | A kind of traffic mark board information collecting method for serving high-precision map producing | |
| WO2016000457A1 (en) | Navigation action generation method, navigation method and device | |
| WO2014012351A1 (en) | Positioning system of mobile robot and positioning method thereof | |
| CN108089024B (en) | Vehicle speed detection system and method | |
| CN114047487B (en) | Radar and vehicle body external parameter calibration method and device, electronic equipment and storage medium | |
| CN113570665A (en) | Road edge extraction method and device and electronic equipment | |
| CN111746525A (en) | Parking path planning method, device, equipment and storage medium | |
| WO2020114273A1 (en) | Business searching method and apparatus, electronic device, and storage medium | |
| CN109084749A (en) | The method and device of semantic positioning is carried out by object in environment | |
| CN112085843A (en) | Method and device for extracting and measuring tunnel type target features in real time | |
| CN104050869B (en) | GIS map covering is layouted response method and system | |
| CN102052925A (en) | Adaptive area scene matching method based on spatial relationship constraint | |
| CN116662473A (en) | Space database establishment method, device, equipment and storage medium | |
| Song et al. | Some sensing and perception techniques for an omnidirectional ground vehicle with a laser scanner |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180119 |
|
| RJ01 | Rejection of invention patent application after publication |