CN110662168B - Method and device for acquiring fence area, electronic equipment and readable storage medium - Google Patents
Method and device for acquiring fence area, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN110662168B CN110662168B CN201810713509.9A CN201810713509A CN110662168B CN 110662168 B CN110662168 B CN 110662168B CN 201810713509 A CN201810713509 A CN 201810713509A CN 110662168 B CN110662168 B CN 110662168B
- Authority
- CN
- China
- Prior art keywords
- area
- fence area
- preset
- fence
- initial
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
Abstract
The disclosure relates to a method and a device for acquiring a fence area, an electronic device and a readable storage medium. The method comprises the following steps: acquiring a preset initial fence area; acquiring a position identifier reported by a terminal in at least one detection period; and adjusting the initial fence area based on the position identification in each detection period in the at least one detection period until the area variation of the initial fence area is smaller than a preset variation threshold value, so as to obtain a target fence area. In this embodiment, the initial fence area is continuously adjusted by the position identifier of the terminal, so that the target fence area is matched with the activity area of the user, and the purpose of accurately acquiring the fence area is achieved. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, and the experience of the user in using the electronic fence can be improved.
Description
Technical Field
The present disclosure relates to the field of control technologies, and in particular, to a method and an apparatus for acquiring a fence area, an electronic device, and a readable storage medium.
Background
According to the existing virtual electronic fence, a fence area, such as a circle or a rectangle, is manually defined on a map service called by application software by a user, and a server records characteristics of the fence area, such as the longitude and the latitude of the circle center, the radius and the longitude and latitude of four corners of the rectangle, as characteristic points of the virtual electronic fence.
And after receiving the position information sent by the terminal, the server compares the position information with the fence area, determines whether the position information is located in the fence area, and judges whether to send an alarm notification to the terminal according to a comparison result.
However, in many scenarios, the region to be monitored is not in a regular shape, and the regular shape increases the probability of false alarm. In many cases, the user cannot specify the fence shape, and cannot accurately define the fence area.
Disclosure of Invention
The present disclosure provides a method and an apparatus for acquiring a fence area, an electronic device, and a readable storage medium, to solve the deficiencies in the related art.
According to a first aspect of embodiments of the present disclosure, there is provided a method of acquiring a fence area, comprising:
acquiring a preset initial fence area;
acquiring a position identifier reported by a terminal in at least one detection period;
and adjusting the initial fence area based on the position identification in each detection period in the at least one detection period until the area variation of the initial fence area is smaller than a preset variation threshold and the adjustment times of the initial fence area are equal to preset set times, so as to obtain a target fence area.
Optionally, adjusting the initial fence area based on the location identity in each of the at least one detection cycle comprises:
dividing the initial fence area into a plurality of areas with the same area in each detection period;
selecting a dense area in which the position identification density exceeds a preset density threshold;
determining a polygon combination with the minimum area covering the dense region, wherein the polygon combination comprises a preset first number of polygons with similar shapes;
combining the polygons as temporary fence areas;
and updating the initial fence area to be a temporary fence area.
Optionally, dividing the initial fence area into a plurality of areas with the same area in each detection cycle includes:
counting the times of each position identification in each detection period;
removing the position mark with the frequency less than or equal to a preset frequency threshold value to obtain a reference position mark;
and determining a circular area by taking each reference position mark as a circle center and using the same preset radius to obtain a plurality of areas with the same area.
Optionally, before acquiring a plurality of regions with the same area, the method further includes:
and if the number of the remaining position identifications is larger than the preset second number after the position identifications with the times smaller than or equal to the preset time threshold are removed, randomly selecting the preset second number of position identifications from the remaining position identifications as the reference position identifications.
Optionally, the location identity density is determined according to the following steps:
acquiring the number of position identifiers in each of the plurality of regions with the same area;
determining the location indicator density based on the number of location indicators and the area of the region.
Optionally, if two adjacent polygons without an overlapping region exist in the polygon combination, taking the polygon combination as a temporary fence region includes:
respectively connecting two points on two adjacent polygons of the non-overlapping area, and forming a transition passage between the two polygons;
the transition passage and the polygon are combined to form the temporary fence area.
Optionally, the connecting two points on two adjacent polygons of the non-overlapping region respectively includes:
and selecting two vertexes with the minimum distance between the two polygons and the other two vertexes with the minimum distance outside the two vertexes, and making a non-crossed connecting line for connecting the two polygons between the four vertexes.
Optionally, the location identifier refers to a geographic location identifier located in the initial fence area, or a geographic location identifier corresponding to network information with the same name as the preset network information, or a geographic location identifier corresponding to network information adjacent to the preset network information.
According to a second aspect of the embodiments of the present disclosure, there is provided an apparatus for acquiring a fence area, comprising:
the initial area acquisition module is used for acquiring a preset initial fence area;
the position identification acquisition module is used for acquiring the position identification reported by the terminal in at least one detection period;
and the target area acquisition module is used for adjusting the initial fence area based on the position identification in each detection period in the at least one detection period until the area variation of the initial fence area is less than or equal to a preset variation threshold and the adjustment times of the initial fence area are equal to preset times, so as to obtain the target fence area.
Optionally, the target area obtaining module includes:
the fence area dividing submodule is used for dividing the initial fence area into a plurality of areas with the same area in each detection period;
the dense region selection submodule is used for selecting a dense region of which the position identification density exceeds a preset density threshold;
a polygon determination submodule, configured to determine a polygon combination with a smallest area that covers the dense region, where the polygon combination includes a preset first number of polygons with similar shapes;
the temporary fence acquisition sub-module is used for combining the polygons to form a temporary fence area;
and the initial fence updating submodule is used for updating the initial fence area into a temporary fence area.
Optionally, the fence area dividing sub-module includes:
an identification frequency counting unit, configured to count the frequency of each location identification in each detection period;
the reference mark acquisition unit is used for eliminating the position marks with the times less than or equal to a preset time threshold value to obtain reference position marks;
and the fence area determining unit is used for determining a circular area by taking each reference position mark as a circle center and using the same preset radius to obtain a plurality of areas with the same area.
Optionally, the fence area dividing sub-module further includes:
and the reference identifier selecting unit is used for randomly selecting a preset second number of position identifiers from the residual position identifiers to serve as reference position identifiers after the position identifiers with the rejection times smaller than or equal to the preset time threshold value and when the number of the residual position identifiers is larger than the preset second number.
Optionally, the dense region selection sub-module includes:
an identification number acquisition unit configured to acquire the number of position identifications in each of the plurality of regions having the same area;
a marker density determination unit for determining the location marker density based on the number of location markers and the area of the region.
Optionally, if there are two adjacent polygons without an overlapping region in the polygon combination, the temporary fence obtaining sub-module includes:
a temporary region acquisition unit, for respectively connecting two points on two adjacent polygons of the non-overlapping region, forming a transition path between the two polygons; the transition passage and the polygon are combined to form the temporary fence area.
Optionally, the temporary region acquisition unit includes:
a vertex selecting subunit, configured to select two vertices with a minimum distance between the two polygons and two other vertices with a minimum distance outside the two vertices;
and the straight line connecting subunit is used for making a non-crossed connecting line for connecting the two polygons between the four vertexes.
Optionally, the location identifier refers to a geographic location identifier located in the initial fence area, or a geographic location identifier corresponding to network information with the same name as the preset network information, or a geographic location identifier corresponding to network information adjacent to the preset network information.
According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
the processor is configured to execute executable instructions in the memory to implement the steps of the method of the first aspect.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method of the first aspect.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
in the embodiment of the disclosure, an initial fence area is adjusted through a position identifier of a terminal in each detection period in at least one detection period until an area variation of the initial fence area is smaller than a preset variation threshold and the adjustment times of the initial fence area are equal to preset times, so as to obtain a target fence area. Therefore, in this embodiment, the initial fence area can be continuously adjusted through the position identifier of the terminal, so that the target fence area is matched with the activity area of the user, and the purpose of accurately acquiring the fence area is achieved. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, so that the experience of the user in using the electronic fence and the accuracy of monitoring the electronic fence can be improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
FIG. 1 is a flow diagram illustrating a method of acquiring a fenced area in accordance with an exemplary embodiment;
FIG. 2 is a flow diagram illustrating a method of acquiring a fenced area in accordance with another exemplary embodiment;
FIG. 3 is a schematic diagram illustrating a process for obtaining an initial location identifier, according to an example embodiment;
FIG. 4 is a schematic flow diagram illustrating a method for obtaining an area having a location identity density exceeding a density threshold in accordance with one illustrative embodiment;
5(a) -5 (d) are schematic diagrams illustrating an acquisition transition path according to an exemplary embodiment;
6(a) -6 (d) are schematic diagrams illustrating an acquisition transition path according to another exemplary embodiment;
FIG. 7 is a flow chart diagram illustrating a method of acquiring a fenced area in accordance with yet another exemplary embodiment;
FIG. 8 is a diagram illustrating an application scenario of a method of acquiring a fenced area in accordance with an exemplary embodiment;
FIG. 9 is a diagram illustrating an application scenario in which a user sets an initial fencing area in accordance with an illustrative embodiment;
FIG. 10 is a schematic diagram illustrating interaction of a terminal and a server in accordance with an illustrative embodiment;
FIGS. 11-15 are block diagrams illustrating an apparatus for acquiring a fenced area in accordance with an exemplary embodiment;
FIG. 16 is a block diagram illustrating an electronic device in accordance with an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of devices consistent with certain aspects of the present disclosure as recited in the claims below.
The existing virtual electronic fence is not changed once being set, and due to the change of a monitoring area or the fact that a user cannot know the shape of the fence, the fence area cannot meet the requirements of an actual scene, and the false alarm rate is increased.
To solve the above problem, an embodiment of the present disclosure provides a method for acquiring a fence area, and fig. 1 is a flowchart illustrating a method for acquiring a fence area according to an exemplary embodiment. The method can be used for electronic equipment such as servers, terminals, PCs and the like. For convenience of description, the server is taken as an example for illustration. Referring to fig. 1, a method for acquiring a fence area includes steps 101 to 103, where:
101, acquiring a preset initial fence area.
In practical application, the terminal is provided with application software APP. After the APP is started, the user can preset an initial fence area in the APP. For example, the terminal may acquire a trigger operation of the user, call a map service after monitoring the trigger operation, and display a map to the user. The user performs selection operation on the map, for example, the selection operation comprises starting position information, ending position information and shape information, and the terminal can determine the initial fence area in the map based on the starting position information, the ending position information and the shape information. When the initial fence area is a polygon, the terminal can acquire longitude and latitude information and shape information of each vertex of the polygon as the initial fence area and upload the initial fence area to the server.
In this embodiment, the server may be connected to the terminal in a wired manner or a wireless manner, and obtain the initial fence area uploaded by the terminal.
102, acquiring a position identifier reported by the terminal in at least one detection period.
In this embodiment, after the initial fence area is set, the server may receive, in real time or periodically, the location identifier reported by the terminal. In order to obtain enough location identifiers, a detection period may be preset, for example, a day, a week, or a month, and the server may continuously receive the location identifiers reported by the terminal in at least one detection period.
In an embodiment, the location identifier may include a location identifier corresponding to geographic location information of the terminal, where the geographic location information may be latitude and longitude information acquired by a GPS module or the like of the terminal. In most cases, the accuracy of the geo-location information may meet the requirements for determining the fenced area.
If the terminal is located indoors, the accuracy of the geographic location information may be affected, thereby affecting the accuracy of the determined fence area. For this reason, in another embodiment, the location identifier may further include a geographic location identifier corresponding to a geographic location of the network information, where the network information may be base station information, WiFi information, or the like. Because the network information corresponds to the geographic position, the server can identify and position the terminal based on the geographic position corresponding to the network information.
It is understood that the user may preset network information, such as WiFi network information in a home, WiFi network information in an office area, base station information, etc., and then upload the preset network information (such as a network name and a corresponding geographical location) to the server. In this way, the server can also acquire the network information of the user pre-equipment in the process of receiving the initial fence area sent by the terminal.
103, adjusting the initial fence area based on the position identifier in each detection period in the at least one detection period until the area variation of the initial fence area is smaller than a preset variation threshold and the adjustment times of the initial fence area are equal to preset set times, so as to obtain a target fence area.
In an embodiment, the server may adjust the initial fence area by using the location identifier received in the detection period after the detection period arrives, may further continuously receive the location identifiers of at least two detection periods, and adjust the initial fence area by using the location identifiers in 2 or more than 2 detection periods. And adjusting for multiple times to enable the area variation of the adjusted initial fence area to be smaller than a preset variation threshold value, so as to obtain a final target fence area.
The embodiment may be an iterative process, that is, the server may adjust the initial fence area by using the position identifier of one detection cycle to obtain a temporary fence area; the server then updates the data of the initial fenced area to the data of the temporary fenced area. And then, the server continuously adjusts the initial fence area by using the position identifier of the next detection period until the area variation of the initial fence area obtained by two adjacent adjustments is smaller than a preset variation threshold value, so as to obtain a final target fence area.
It should be noted that the variation threshold may be a variation of the area of the initial fence region, or may also be a ratio of the areas of the two initial fence regions, and may be set according to a specific scenario, which is not limited herein.
In another embodiment, the server records the number of adjustments after each adjustment of the initial fence area. And then the server judges whether the adjusting times are equal to the preset times, if so, the server continues adjusting, and if so, the server stops adjusting to obtain the target fence area. In the embodiment, the number of times of adjusting the initial fence area can be reduced, and the calculation amount can be reduced.
Therefore, in this embodiment, the initial fence area is continuously adjusted through the position identifier of the terminal, so that the target fence area is matched with the activity area of the user, and the purpose of accurately acquiring the fence area is achieved. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, so that the experience of the user in using the electronic fence and the accuracy of monitoring the electronic fence can be improved.
The disclosed embodiment also provides a method for acquiring a fence area, and fig. 2 is a flow chart illustrating the method for acquiring the fence area according to another exemplary embodiment. Referring to fig. 2, a method for acquiring a fence area includes steps 201 to 208, wherein:
and 201, acquiring a preset initial fence area.
The specific method and principle of step 201 and step 101 are the same, please refer to fig. 1 and related contents of step 101 for detailed description, which is not repeated herein.
202, obtaining the position identifier reported by the terminal in at least one detection period.
The specific method and principle of step 202 and step 102 are the same, and please refer to fig. 1 and the related contents of step 102 for detailed description, which is not repeated herein.
And 203, dividing the initial fence area into a plurality of areas with the same area in each detection period.
Since the location markers in each detection cycle may be located outside the initial fence area, and these location markers may be regarded as invalid data, the server further needs to screen out the location markers located in the initial fence area from the location markers in each detection cycle, and the screening may include:
in a first manner, the server may obtain a position relationship between the geographic position identifier and the initial fence area, and determine that the position identifier is the reference position identifier if the position identifier is located in the initial fence area, otherwise, the position identifier is not the reference position identifier. In this embodiment, the location identifier refers to a geographic location identifier located in the initial fence area.
In the second mode, the server firstly determines whether the network information is preset network information. If so, the geographic position identifier corresponding to the network signal is the reference position identifier, otherwise, the geographic position identifier is not the reference position identifier. In this embodiment, the location identifier is a geographical location identifier corresponding to network information having the same name as that of the preset network information.
And in the third mode, the server firstly determines whether the network information is adjacent to the preset network information. If so, the geographic position corresponding to the network information adjacent to the preset network information is a reference position identifier, otherwise, the geographic position is not the reference position identifier. The location identifier is a geographical location identifier corresponding to the network information adjacent to the preset network information.
In this way, the server can assist in determining whether the location identifier is valid through at least one piece of adjacent network information. This is because:
when reporting the network information, the terminal also sends a plurality of network information which can be scanned to the server together, so that the network information received by the server not only can comprise the preset network information, but also can comprise other network information which appears along with the preset network information. Therefore, the server can determine whether the other network information is an adjacent network of the preset network information, that is, whether the two networks are neighbors in the geographic position according to the information such as the occurrence frequency and the signal strength of the other network information. When the other network information meets the set conditions, the server may determine that the other network information is a neighboring network of the preset network information.
The set condition may be that the frequency of the simultaneous occurrence reaches a frequency threshold, for example, the first network information occurs 10 times, and the second network information occurs at least 8 times. The setting condition may also be that the signal strength is strongly correlated with the signal strength of the network corresponding to the first network information, for example, a difference between RSSI values of two networks is smaller than a difference threshold. The setting conditions may be adjusted according to a specific scenario, and are not limited herein.
In a fourth mode, the server can determine the initial location identifier by utilizing the geographical location identifier and the network information which are mutually supplementary. For example, the server may first determine whether the geographic location identifier is located in the initial fence area and whether the geographic location identifier corresponding to the network information is located in the initial fence area; then, whether the position is the initial position mark is judged based on two comparison results:
in a first scenario, the geographic location identifier is located in the fence area, and the geographic location identifier corresponding to the network information is located in the initial fence area, so that the location identifier can be determined as a reference location identifier, and the reliability is 1.
In a second scenario, the geographic location identifier is located outside the fence area, and the geographic location identifier corresponding to the network information is located in the initial fence area, so that the location identifier can be determined as a reference location identifier, and the reliability is 0.6 (adjustable).
And in a third scenario, if the geographic position identifier is located in the fence area and the geographic position identifier corresponding to the network information is located outside the initial fence area, the position identifier can be determined as a reference position identifier, and the reliability is 0.8 (adjustable).
And in a third scenario, if the geographic position identifier is located outside the fence area and the geographic position identifier corresponding to the network information is located outside the initial fence area, it can be determined that the position identifier is not the reference position identifier, and the reliability is 1.
By analyzing the comparison results, a plurality of reference position identifiers can be obtained.
In a fifth mode, the user generally spends more time within the initial fence area and less time outside the initial fence area. Referring to fig. 3, based on the location identifiers in each detection period, the server counts the number of times of each location identifier (corresponding to step 301). Then, the server obtains a preset number threshold, compares the number of times of each position identifier with the number threshold, and eliminates the position identifiers with the number of times smaller than the number threshold, and finally obtains a plurality of reference position identifiers (corresponding to step 302). Therefore, by setting the time threshold, the position identification of the user appearing outside the initial fence area can be eliminated.
In practical applications, if the detection period is long, the number of the reference location identifiers obtained through the above methods may be large, in an embodiment, a second number (which may be set according to the detection period and the terminal reporting period, for example, 1000) may be preset in the server, and if the number of the remaining location identifiers after the removal of part of the location identifiers is greater than the second number, a preset second number of location identifiers are randomly selected from the remaining location identifiers as the reference location identifiers.
In practical applications, a plurality of location identifiers may be in close proximity (for example, 0.5 m), and the server may merge the location identifiers in close proximity and adjust the number of times of the merged location identifiers. For example, the server samples and selects a position identifier a, and the position identifiers in a circle with the center of the position identifier a and the radius of 0.5 meter are combined into the position identifier a, so that the number of the position identifiers can be greatly reduced.
To this end, in this embodiment, the server may determine a plurality of reference location identifiers located in the initial fence area according to the geographic location and/or the network information. Finally, the server determines a circular area with the same preset radius by taking each reference position mark as a circle center, so as to obtain a plurality of areas with the same area (corresponding to step 303).
And 204, selecting a dense area in which the position identification density exceeds a preset density threshold value.
In this embodiment, referring to fig. 4, the server may obtain the number of location identifiers in each of a plurality of regions with the same area (corresponding to step 401), and then the server may calculate the location identifier density corresponding to each region based on the number of location identifiers and the area of the region (corresponding to step 402).
The server may obtain the number of the location identifiers in the following manner:
when the position identification refers to a geographical position identification, namely is related to longitude and latitude, directly counting the number of the position identifications; when the position identification refers to the geographical position identification corresponding to the network information, namely is related to the network information, counting the occurrence frequency of each network name; and when the position identifications are related to longitude, latitude and network information at the same time, acquiring the number of the position identifications by combining the number of the position identifications and the number of times of the network names and the corresponding weights.
And finally, the server compares the density of the position identification with a preset density threshold, and if the density of the position identification is smaller than the density threshold, the reference position identification is removed. If the location identification density is greater than or equal to (i.e., exceeds) the density threshold, the server may reserve the area, i.e., the dense area. By repeating the above process, the server can obtain a plurality of dense areas.
Of course, when it is determined that the position mark density is greater than the density threshold, the server may further gradually increase the size of the preset radius according to a preset step length, so as to enlarge the circular area, then calculate the position mark density in the circular area, stop until the position mark density is less than the density threshold, record the initial position mark and the radius value, and similarly obtain an area in which the position mark density exceeds the density threshold. Therefore, the number of the obtained dense areas can be reduced, and the accuracy of the subsequent polygon combination acquisition is improved.
Determining a polygon combination with the smallest area covering the dense region, wherein the polygon combination comprises a preset first number of polygons with similar shapes; and combining the polygons to form a temporary fence area.
In this embodiment, on the basis that the initial fence area set by the user is not exceeded, the server selects a preset first number of polygons with similar shapes, adjusts the position and size of each polygon so that the combination of the first number of polygons can cover all dense areas, and obtains the smallest area of the polygon combination, so that the server can use the polygon combination with the smallest area as the temporary fence area.
Wherein the polygon can be a rectangle, a triangle, a pentagon, a hexagon, etc. The two polygons have the same number of sides and are similar. In one embodiment, the polygon is a rectangle.
When two adjacent polygons without overlapping areas exist in the polygon combination, the server can merge the two adjacent polygons, and a transition passage can be formed between the two polygons by respectively connecting two points on the two adjacent polygons, so that the transition passage and the polygon combination jointly form a temporary fence area. The manner of forming the transition passage may include:
first, referring to fig. 5(a) to 5(d), in fig. 5(a), there are several reference position identifiers 52 in the initial fence area 51, and the server obtains a polygon combination as shown in fig. 5(b) based on the reference position identifiers 52, where the polygon combination includes two polygons 53. Then, referring to fig. 5(c), the server first obtains two vertices 54 with the smallest distance and two other vertices 55 with the smallest distance except for the two vertices 54 in the two polygons 53 in the non-overlapping region, and then connects the two vertices 54 and the two vertices 55, respectively, there may be 4 links between the vertices 54 and the vertices 55, and there are 2 non-intersecting links in the 4 links to form a transition path between the two polygons 53. With continued reference to fig. 5(c), the connecting line 56 forms a transition path (triangle within the dashed box) with the two polygons. Finally, the transition path and the two polygons are combined into a graph 57 as shown in fig. 5(d), and the combined graph 57 can be used as a temporary fence area.
Referring to fig. 6(a) to 6(d), in fig. 6(a), there are several reference position identifiers 62 in the initial fence area 61, and the server obtains a polygon combination as shown in fig. 6(b) based on the reference position identifiers 62, where the polygon combination includes two polygons 63 and is adjacent and has no overlapping area. Then, referring to fig. 6(c), the server extends the two polygons 63 toward each other until the two polygons have the maximum stop of the overlapping area, resulting in the extended portions 64 and 65 shown in fig. 6(c), i.e. the transition paths, and finally, the two polygons without overlapping area (i.e. the combination of the polygons) and the transition paths can be merged into a graph 66 shown in fig. 6(d), and the graph 66 can be used as the temporary fence area.
The embodiments shown in fig. 5 and 6 only show a scheme of partially acquiring the temporary fence area, but of course, the skilled person may also set other schemes, for example, optionally selecting two areas in a plurality of areas with the same area, and traversing to each area, and then when there is no other area on one side of the two areas, the server determines the tangent lines of the two areas, so that the plurality of tangent lines may form a closed area, i.e. a circumscribed polygon of P areas, and the circumscribed polygon is taken as the temporary fence area.
In this embodiment, by merging the polygons, the server may obtain only one polygon combination covering the dense area, thereby avoiding the terminal from causing false alarm when switching between two polygons, and improving the accuracy of monitoring.
And 206, updating the initial fence area into a temporary fence area.
And 207, acquiring the area variation of the initial fence area before and after the current adjustment.
In this embodiment, before and after the adjustment, the server may obtain the area of the initial fence area, so that the area variation of the initial fence area after the adjustment and before the adjustment may be obtained. The area variation may be a ratio or an area difference, and may be set according to a scene, which is not limited herein.
And 208, if the area variation of the initial fence area is smaller than a preset variation threshold, obtaining a target fence area.
In this embodiment, when the area variation is greater than the preset variation threshold, the server may return to step 203 to continue to adjust the initial fence area. When the area variation is smaller than a preset variation threshold, the server can obtain the target fence area.
Therefore, in this embodiment, a reference position identifier can be obtained by screening the position identifier of the terminal, then the dense area in which the position identifier density exceeds the density threshold can be determined based on the reference initial position identifier, and then a combination covering the dense polygons can be obtained, that is, the adjusted initial fence area can be obtained. By continuously adjusting the initial fence area, a final target fence area can be obtained. Therefore, in the embodiment, the initial fence area can be dynamically adjusted, so that the target fence area is matched with the activity area of the user, and the purpose of accurately acquiring the fence area is achieved. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, so that the experience of the user in using the electronic fence and the accuracy of monitoring the electronic fence can be improved.
The disclosed embodiment further provides a method for acquiring a fence area, and fig. 7 is a flow chart illustrating the method for acquiring the fence area according to another exemplary embodiment. Referring to fig. 7, a method for acquiring a fence area includes steps 701 to 707, wherein:
and 701, acquiring a preset initial fence area.
The specific method and principle of step 701 are consistent with those of step 101, and please refer to fig. 1 and related contents of step 101 for detailed description, which are not repeated herein.
And 702, acquiring the position identifier reported by the terminal in at least one detection period.
The specific method and principle of step 702 and step 102 are the same, please refer to fig. 1 and the related contents of step 102 for detailed description, which is not repeated herein.
And 703, dividing the initial fence area into a plurality of areas with the same area in each detection period.
The specific method and principle of step 703 and step 203 are the same, and please refer to fig. 2 and related contents of step 203 for detailed description, which is not repeated herein.
A dense region is selected 704 in which the location identification density exceeds a preset density threshold.
The specific method and principle of step 704 and step 204 are the same, and please refer to fig. 2 and the related contents of step 204 for detailed description, which is not repeated herein.
705, determining a polygon combination with the smallest area covering the dense region, wherein the polygon combination comprises a preset first number of polygons with similar shapes; and combining the polygons to form a temporary fence area.
The specific method and principle of step 705 and step 205 are the same, please refer to fig. 2 and related contents of step 205 for detailed description, which is not repeated herein.
And 706, updating the initial fence area to be a temporary fence area.
In this embodiment, the server updates the adjustment times after adjusting the initial fence area each time.
707, if the number of times of adjustment is equal to a preset number of times, obtaining the target fence area.
In this embodiment, the server determines the adjustment times and the setting times, and if the adjustment times are smaller than the setting times, returns to 703 to continue adjusting the initial fence area. And if the number of times is equal to the set number of times, the server obtains the target fence area.
Therefore, in the embodiment, by presetting the adjustment times, the target fence area can be ensured to be obtained as soon as possible while the initial fence area is dynamically adjusted, so that the method can be applied to a monitoring scene as soon as possible, and the use experience of a user can be improved. In addition, in this embodiment, the target fence area may be matched with an activity area of a user, so as to achieve the purpose of accurately acquiring the fence area. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, so that the experience of the user in using the electronic fence and the accuracy of monitoring the electronic fence can be improved.
The following describes an interaction process between a server and a terminal in conjunction with the method for acquiring a fence area according to the embodiment shown in fig. 1 to 7, with reference to fig. 8 to 10, where:
referring to fig. 8, the terminal 10 is connected to the server 50 through the internet or a mobile network. The terminal 10 and the server 50 may exchange data through the internet or a mobile network.
Referring to fig. 9, the terminal 10 is installed with electronic fence software APP, and after the APP is turned on, the user 20 can call the map service 30. The user 20 may set an initial fence area, which may include start position information 40, end position information 41, and shape information 42, in a sliding manner, and transmit the initial fence area to the server 50. Finally, the terminal 10 may upload the location identity to the server 50 in real time or periodically.
Referring to fig. 10, the server 50 receives the initial fence area and receives the location identifier reported by the terminal in at least one detection period. The server 50 then derives the target fenced area from the initial fenced area and the location identification within at least one detection cycle. The step of acquiring the target fence area by the server may refer to the content of the method for acquiring the fence area shown in fig. 1 to 7, and is not described herein again.
With reference to fig. 10, after determining the target fence area, the server 50 may continue to obtain the location identifier reported by the terminal 10, and then the server 50 determines whether the location identifier is located in the target fence area. If the location identity is located within the target fence area, the server 50 may not push information to the terminal. If the location identifier is located outside the target fence area, the server 50 may push preset alarm information to the terminal 10, for example, the alarm information may be "you have exceeded the monitoring area and please return".
The disclosed embodiment further provides an apparatus for acquiring a fence area, and fig. 11 is a block diagram illustrating an apparatus for acquiring a fence area according to an exemplary embodiment. Referring to fig. 11, an apparatus for acquiring a fenced area includes:
an initial region acquiring module 1101, configured to acquire a preset initial fence region;
a location identifier obtaining module 1102, configured to obtain a location identifier reported by the terminal in at least one detection period;
a target area obtaining module 1103, configured to adjust the initial fence area based on the position identifier in each detection period of the at least one detection period until an area variation of the initial fence area is smaller than a preset variation threshold and an adjustment number of the initial fence area is equal to a preset number, so as to obtain a target fence area.
Therefore, in this embodiment, the initial fence area is continuously adjusted through the position identifier of the terminal, so that the target fence area is matched with the activity area of the user, and the purpose of accurately acquiring the fence area is achieved. In addition, in the embodiment, the user does not need to know the shape of the fence area in advance, so that the experience of the user in using the electronic fence and the accuracy of monitoring the electronic fence can be improved.
Fig. 12 is a block diagram illustrating an apparatus for acquiring a fenced area in accordance with an exemplary embodiment. Referring to fig. 12, on the basis of the apparatus 1100 for acquiring a fence area shown in fig. 11, the target area acquiring module 1103 includes:
a fence area dividing submodule 1201, configured to divide the initial fence area into a plurality of areas with the same area in each detection period;
a dense region selection sub-module 1202 for selecting a dense region in which the location identification density exceeds a preset density threshold;
a polygon determining submodule 1203, configured to determine a polygon combination with a smallest area and covering the dense region, where the polygon combination includes a preset first number of polygons with similar shapes;
a temporary fence acquisition sub-module 1204, configured to combine the polygons to form a temporary fence area;
an initial fence update submodule 1205 is configured to update the initial fence area to be a temporary fence area.
So far, in this embodiment, the reference location identifier may be screened out through the location identifier of the terminal, then the dense area whose location identifier density exceeds the density threshold may be determined based on the reference location identifier, then the polygon combination covering all the dense areas may be determined, and finally, the data of the polygon combination is updated with the data of the initial fence area. Therefore, the shape of the initial fence area can be adjusted only by using the position identification of the terminal without the need of making the user know the shape of the fence area clearly, so that the initial fence area is matched with the activity area of the user, and the aim of accurately acquiring the fence area is fulfilled.
Fig. 13 is a block diagram illustrating an apparatus for acquiring a fenced area in accordance with an exemplary embodiment. Referring to fig. 13, on the basis of the apparatus for acquiring a fence area shown in fig. 12, the fence area dividing sub-module 1201 includes:
an identification number counting unit 1301, configured to count the number of times of each position identification in each detection period;
a reference identifier obtaining unit 1302, configured to remove a position identifier whose number of times is less than or equal to a preset number threshold, to obtain a reference position identifier;
a fence area determining unit 1302, configured to determine a circular area with the same preset radius by using each reference position identifier as a circle center, so as to obtain multiple areas with the same area.
Therefore, the reference position marks can be screened out according to the frequency of occurrence of each position mark in the embodiment, and then a plurality of areas with the same area are obtained according to the reference position marks, so that the accuracy of the subsequent target fence area is improved.
In an embodiment, the location identifier refers to a geographic location identifier located in the initial fence area, or a geographic location identifier corresponding to network information with the same name as the preset network information, or a geographic location identifier corresponding to network information adjacent to the preset network information.
Fig. 14 is a block diagram illustrating an apparatus for acquiring a fenced area in accordance with an exemplary embodiment. Referring to fig. 14, on the basis of the apparatus for acquiring a fence area shown in fig. 13, the fence area dividing sub-module 1201 includes:
a reference identifier selecting unit 1401, configured to randomly select a preset second number of location identifiers from the remaining location identifiers as reference location identifiers after removing the location identifiers whose number of times is less than or equal to the preset number threshold and when the number of remaining location identifiers is greater than the preset second number.
Therefore, according to the number of the reference position marks, the number of the areas with the same area obtained subsequently can be reduced, and the calculation amount is reduced.
Fig. 15 is a block diagram illustrating an apparatus for acquiring a fenced area in accordance with an exemplary embodiment. Referring to fig. 15, on the basis of the apparatus for acquiring a fence area shown in fig. 12, if there are two adjacent polygons without an overlapping area in the polygon combination, the temporary fence acquisition sub-module 1204 includes:
a temporary region acquisition unit 1501 for respectively connecting two points on two adjacent polygons of the non-overlapping region, forming a transition path between the two polygons; the transition passage and the polygon are combined to form the temporary fence area.
So far, through merging two polygons in no overlapping area in this embodiment, the terminal can be avoided from causing false alarm when converting between the two polygons, and the accuracy of subsequent monitoring is improved.
FIG. 16 is a block diagram illustrating an electronic device in accordance with an example embodiment. For example, the electronic device 1600 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a gaming console, a tablet device, a medical device, an exercise device, a personal digital assistant, and so forth.
Referring to fig. 16, electronic device 1600 may include one or more of the following components: processing component 1602, memory 1604, power component 1606, multimedia component 1608, audio component 1610, input/output (I/O) interface 1612, sensor component 1614, and communications component 1616. The memory 1604 is used to store instructions executable by the processing component 1602. The processing component 1602 reads instructions from the memory 1604 to implement: the steps of the method of acquiring a fenced area of the embodiment example shown in fig. 1-7.
The processing component 1602 generally controls overall operation of the electronic device 1600, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing components 1602 may include one or more processors 1620 to execute instructions. Further, the processing component 1602 can include one or more modules that facilitate interaction between the processing component 1602 and other components. For example, the processing component 1602 can include a multimedia module to facilitate interaction between the multimedia component 1608 and the processing component 1602.
The memory 1604 is configured to store various types of data to support operation at the electronic device 1600. Examples of such data include instructions for any application or method operating on the electronic device 1600, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 1604 may be implemented by any type of volatile or non-volatile memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.
The power supply component 1606 provides power to the various components of the electronic device 1600. The power components 1606 may include a power management system, one or more power sources, and other components associated with generating, managing, and distributing power for the electronic device 1600.
The multimedia component 1608 comprises a screen that provides an output interface between the electronic device 1600 and a user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 1608 comprises a front-facing camera and/or a rear-facing camera. The front camera and/or the rear camera may receive external multimedia data when the electronic device 1600 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.
The audio component 1610 is configured to output and/or input an audio signal. For example, the audio component 1610 includes a Microphone (MIC) configured to receive external audio signals when the electronic device 1600 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal may further be stored in the memory 1604 or transmitted via the communications component 1616. In some embodiments, audio component 1610 further includes a speaker for outputting audio signals.
The I/O interface 1612 provides an interface between the processing component 1602 and peripheral interface modules, such as keyboards, click wheels, buttons, and the like. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.
The communications component 1616 is configured to facilitate communications between the electronic device 1600 and other devices in a wired or wireless manner. The electronic device 1600 may access a wireless network based on a communication standard, such as WiFi, 2G, or 3G, or a combination thereof. In an exemplary embodiment, the communication component 1616 receives broadcast signals or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communications component 1616 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
In an exemplary embodiment, the electronic device 1600 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors, or other electronic components.
In an exemplary embodiment, a non-transitory computer readable storage medium comprising instructions, such as the memory 1604 comprising instructions, executable by the processor 1620 of the electronic device 1600 to implement the steps of the method shown in fig. 1-7 is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (16)
1. A method of obtaining a fenced area, comprising:
acquiring a preset initial fence area;
acquiring a position identifier reported by a terminal in at least one detection period;
adjusting the initial fence area based on the position identification in each detection period in the at least one detection period until the area variation of the initial fence area is smaller than a preset variation threshold and the adjustment times of the initial fence area are equal to preset set times to obtain a target fence area;
adjusting the initial fence area based on the location identification within each of the at least one detection period comprises:
dividing the initial fence area into a plurality of areas with the same area in each detection period;
selecting a dense area in which the position identification density exceeds a preset density threshold;
determining a polygon combination with the minimum area covering the dense region, wherein the polygon combination comprises a preset first number of polygons with similar shapes; the polygon combination is used as a temporary fence area; wherein, the shape similarity means that the two polygons have the same number of sides;
and updating the initial fence area to be a temporary fence area.
2. The method of claim 1, wherein dividing the initial fence area into a plurality of areas of equal area during each detection cycle comprises:
counting the times of each position identification in each detection period;
removing the position mark with the frequency less than or equal to a preset frequency threshold value to obtain a reference position mark;
and determining a circular area by taking each reference position mark as a circle center and using the same preset radius to obtain a plurality of areas with the same area.
3. The method of claim 2, wherein prior to obtaining a plurality of regions of equal area, the method further comprises:
and if the number of the remaining position identifications is larger than the preset second number after the position identifications with the times smaller than or equal to the preset time threshold are removed, randomly selecting the preset second number of position identifications from the remaining position identifications as the reference position identifications.
4. The method of claim 1, wherein the location identity density is determined according to the following steps:
acquiring the number of position identifiers in each of the plurality of regions with the same area;
determining the location indicator density based on the number of location indicators and the area of the region.
5. The method of claim 1, wherein if there are two adjacent polygons in the polygon combination without an overlapping area, the step of regarding the polygon combination as a temporary fence area comprises:
respectively connecting two points on two adjacent polygons of the non-overlapping area, and forming a transition passage between the two polygons;
the transition passage and the polygon are combined to form the temporary fence area.
6. The method according to claim 5, wherein the connecting two points on two adjacent polygons of the non-overlapping region respectively comprises:
and selecting two vertexes with the minimum distance between the two polygons and the other two vertexes with the minimum distance outside the two vertexes, and making a non-crossed connecting line for connecting the two polygons between the four vertexes.
7. The method according to any one of claims 1 to 6, wherein the location identifier is a geographic location identifier located in the initial fence area, or a geographic location identifier corresponding to network information with the same name as that of the preset network information, or a geographic location identifier corresponding to network information adjacent to the preset network information.
8. An apparatus for obtaining a fenced area, comprising:
the initial area acquisition module is used for acquiring a preset initial fence area;
the position identification acquisition module is used for acquiring the position identification reported by the terminal in at least one detection period;
a target area obtaining module, configured to adjust the initial fence area based on the position identifier in each detection period in the at least one detection period until an area variation of the initial fence area is smaller than or equal to a preset variation threshold and an adjustment number of the initial fence area is equal to a preset number, so as to obtain a target fence area;
the target area acquisition module includes:
the fence area dividing submodule is used for dividing the initial fence area into a plurality of areas with the same area in each detection period;
the dense region selection submodule is used for selecting a dense region of which the position identification density exceeds a preset density threshold;
a polygon determination submodule, configured to determine a polygon combination with a smallest area that covers the dense region, where the polygon combination includes a preset first number of polygons with similar shapes; wherein, the shape similarity means that the two polygons have the same number of sides;
the temporary fence acquisition sub-module is used for combining the polygons to form a temporary fence area;
and the initial fence updating submodule is used for updating the initial fence area into a temporary fence area.
9. The apparatus of claim 8, wherein the fence area partitioning sub-module comprises:
an identification frequency counting unit, configured to count the frequency of each location identification in each detection period;
the reference mark acquisition unit is used for eliminating the position marks with the times less than or equal to a preset time threshold value to obtain reference position marks;
and the fence area determining unit is used for determining a circular area by taking each reference position mark as a circle center and using the same preset radius to obtain a plurality of areas with the same area.
10. The apparatus of claim 9, wherein the fence area partitioning sub-module further comprises:
and the reference identifier selecting unit is used for randomly selecting a preset second number of position identifiers from the residual position identifiers to serve as reference position identifiers after the position identifiers with the rejection times smaller than or equal to the preset time threshold value and when the number of the residual position identifiers is larger than the preset second number.
11. The apparatus of claim 8, wherein the dense region selection sub-module comprises:
an identification number acquisition unit configured to acquire the number of position identifications in each of the plurality of regions having the same area;
a marker density determination unit for determining the location marker density based on the number of location markers and the area of the region.
12. The apparatus of claim 11, wherein if there are two adjacent polygons in the polygon set without overlapping area, the temporary fence obtaining sub-module comprises:
a temporary region acquisition unit, for respectively connecting two points on two adjacent polygons of the non-overlapping region, forming a transition path between the two polygons; the transition passage and the polygon are combined to form the temporary fence area.
13. The apparatus of claim 12, wherein the temporary region acquisition unit comprises:
a vertex selecting subunit, configured to select two vertices with a minimum distance between the two polygons and two other vertices with a minimum distance outside the two vertices;
and the straight line connecting subunit is used for making a non-crossed connecting line for connecting the two polygons between the four vertexes.
14. The device according to any one of claims 8 to 13, wherein the location identifier is a geographic location identifier located in the initial fence area, or a geographic location identifier corresponding to network information with the same name as the preset network information, or a geographic location identifier corresponding to network information adjacent to the preset network information.
15. An electronic device, characterized in that the electronic device comprises:
a processor;
a memory for storing the processor-executable instructions;
the processor is configured to execute executable instructions in the memory to implement the steps of the method of any of claims 1 to 7.
16. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810713509.9A CN110662168B (en) | 2018-06-29 | 2018-06-29 | Method and device for acquiring fence area, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810713509.9A CN110662168B (en) | 2018-06-29 | 2018-06-29 | Method and device for acquiring fence area, electronic equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110662168A CN110662168A (en) | 2020-01-07 |
| CN110662168B true CN110662168B (en) | 2021-04-23 |
Family
ID=69027086
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810713509.9A Active CN110662168B (en) | 2018-06-29 | 2018-06-29 | Method and device for acquiring fence area, electronic equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110662168B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111785007B (en) * | 2020-04-27 | 2021-09-21 | 宁波小遛共享信息科技有限公司 | Returning indication method and device and electronic equipment |
| CN112308739B (en) * | 2020-11-20 | 2023-08-22 | 国网湖南省电力有限公司 | Classification, statistics and accounting method for regional sales power |
| CN113376671B (en) * | 2021-05-11 | 2024-05-31 | 武汉小安科技有限公司 | Vehicle positioning method and device based on electronic fence |
| CN116668951B (en) * | 2022-10-26 | 2024-04-23 | 荣耀终端有限公司 | Method for generating geofence, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105704667A (en) * | 2016-02-06 | 2016-06-22 | 北京佰才邦技术有限公司 | Parameter adjusting method and device |
| CN105701241A (en) * | 2015-11-27 | 2016-06-22 | 中华电信股份有限公司 | Automatic correction method for geographic fence |
| CN106375956A (en) * | 2016-09-14 | 2017-02-01 | 得豆科技（北京）有限公司 | Electronic fence method and device for mobile terminal |
| CN107529142A (en) * | 2017-09-18 | 2017-12-29 | 维沃移动通信有限公司 | A kind of service push method and mobile terminal |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7561063B2 (en) * | 2007-03-05 | 2009-07-14 | Sony Ericsson Mobile Communications Ab | Mobile terminals including location management systems and location management methods for mobile terminals |
| KR101570369B1 (en) * | 2008-10-14 | 2015-11-20 | 엘지전자 주식회사 | Telematics terminal and method for controlling vehicle by using thereof |
-
2018
- 2018-06-29 CN CN201810713509.9A patent/CN110662168B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105701241A (en) * | 2015-11-27 | 2016-06-22 | 中华电信股份有限公司 | Automatic correction method for geographic fence |
| CN105704667A (en) * | 2016-02-06 | 2016-06-22 | 北京佰才邦技术有限公司 | Parameter adjusting method and device |
| CN106375956A (en) * | 2016-09-14 | 2017-02-01 | 得豆科技（北京）有限公司 | Electronic fence method and device for mobile terminal |
| CN107529142A (en) * | 2017-09-18 | 2017-12-29 | 维沃移动通信有限公司 | A kind of service push method and mobile terminal |
Non-Patent Citations (1)
| Title |
|---|
| 基于动态电子围栏的GPS速度信息校验方法;杨敬锋;《测绘与空间地理信息》;20140430;第75-77页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110662168A (en) | 2020-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110662168B (en) | Method and device for acquiring fence area, electronic equipment and readable storage medium | |
| CN108700895B (en) | Method and device for reporting flight path information and method and device for determining information | |
| CN104333846B (en) | Position reminding method and device | |
| CN109496439B (en) | Method and device for establishing unicast connection based on object direct connection | |
| CN109145679B (en) | Method, device and system for sending out early warning information | |
| CN104023121A (en) | Mode switching method and device | |
| CN109029479B (en) | Navigation reminding method and device, electronic equipment and computer readable storage medium | |
| CN105094321B (en) | The control method and device of smart machine | |
| CN108307308B (en) | Positioning method, device and storage medium for wireless local area network equipment | |
| CN104917895A (en) | Positioning system selection method and device and terminal | |
| CN107480785A (en) | The training method and device of convolutional neural networks | |
| CN106533907B (en) | Information sending method and device | |
| CN113473574B (en) | Wireless local area network connection method and device, storage medium and electronic equipment | |
| CN112492521B (en) | WiFi roaming trigger condition determining method and device, mobile terminal and storage medium | |
| CN109451823B (en) | Drive test information reporting method and device and network performance detecting method and device | |
| CN108133181B (en) | Method for acquiring indication information, AR device and storage medium | |
| CN112996083A (en) | Cell access method and cell access device | |
| CN105101076B (en) | Information reminding method and device | |
| US11275627B2 (en) | Method and device for replacing insecticide component, and storage medium | |
| CN113366868B (en) | Cell measurement method, device and storage medium | |
| CN106790953B (en) | Information interception method and device | |
| CN116934823A (en) | Image processing method, device, electronic equipment and readable storage medium | |
| CN114710815A (en) | Cell residence method and device, terminal and computer readable storage medium | |
| CN108513722B (en) | Drive test method and device | |
| WO2024138437A1 (en) | Information transmission method and apparatus, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |