Intelligent geo-fencing

• US 10,003,919 B2
• Filed: 12/11/2015
• Issued: 06/19/2018
• Est. Priority Date: 12/11/2014
• Status: Active Grant

• Current Assignee: Taiwan Semiconductor Manufacturing Company Limited
• Original Assignee: Taiwan Semiconductor Manufacturing Company Limited
• Inventors: Stanwood, Kenneth L., Gell, David, Colban, Erik
• Primary Examiner(s): Addy, Anthony
• Assistant Examiner(s): Genack, Matthew
• Application Number:
  US14/966,970
• Publication Number:
  US 20160192132A1
• Time in Patent Office: 921 Days
• Field of Search: 4554561-4566, 455457
• CPC Class Codes: H04W 4/021 Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences

Abstract

A method and system of establishing a fence network is provided. The fence network comprises a plurality of fence nodes in communication with each other and a plurality of fence vertices defining a geographic fence. The method comprises configuring the plurality of fence nodes, setting up a coordinate system to determine a position of each fence node of the plurality of fence nodes, and, for each fence vertex, setting a location marker at a position of the fence vertex and using the location marker to register the position of the fence vertex. At least one fence vertex may be located at a position other than a position of a fence node. The plurality of fence vertices may be registered in sequential order and connected in order of registration.

Claims

1. A method of establishing a fence network, the fence network comprising a plurality of fence nodes in communication with each other, a plurality of fence vertices defining a geographic fence, the method comprising:

configuring the plurality of fence nodes;

setting up a coordinate system to determine a position of each fence node of the plurality of fence nodes;

for each fence vertex

setting a location marker at a position of the fence vertex;

using the location marker to register the position of the fence vertex at least by;

computing a convex hull from the position of each fence vertex; and

determining whether any fence vertex is located inside the convex hull, wherein when a fence vertex is located inside the convex hull;

calculating all possible orderings of fence vertices consistent with an ordering of the position of fence vertices located on an exterior of the convex hull; and

defining sides of the geographic fence by selecting an order having a greatest minimum acute angle which is less than a predetermined threshold.

2. The method of claim 1, wherein at least one fence vertex is located at a position other than a position of a fence node.

3. The method of claim 1, wherein the plurality of fence vertices are registered in sequential order.

4. The method of claim 3, wherein using the location marker to register the position of the fence vertex comprises connecting the fence vertices in order of registration.

5. The fence network of claim 1, wherein using the location marker to register the position of the fence vertex further comprises:

joining a neighboring fence vertex by a straight line segment to form a side of the geographic fence.

6. A fence network comprising:

a plurality of fence nodes in communication with each other;

a plurality of fence vertices defining a geographic fence;

a plurality of sides of the geographic fence determined by;

configuring the plurality of fence nodes;

setting up a coordinate system to determine a position of each fence node of the plurality of fence nodes; and

for each fence vertex

setting a location marker at a position of the fence vertex;

using the location marker to register the position of the fence vertex at least by;

computing a convex hull from the position of each fence vertex; and

determining whether any fence vertex is located inside the convex hull, wherein when a fence vertex is located inside the convex hull;

calculating all possible orderings of fence vertices consistent with an ordering of the position of fence vertices located on an exterior of the convex hull; and

defining sides of the geographic fence by selecting an order having a greatest minimum acute angle which is less than a predetermined threshold.

7. The fence network of claim 6, wherein at least one fence vertex is located at a position other than a position of a fence node.

8. The fence network of claim 6, wherein the plurality of fence vertices are registered in sequential order.

9. The fence network of claim 8, wherein using the location marker to register the position of the fence vertex comprises connecting the fence vertices in order of registration.

10. The fence network of claim 6, wherein using the location marker to register the position of the fence vertex further comprises:

joining a neighboring fence vertex by a straight line segment to form one side of the plurality of sides of the geographic fence.

11. A computer program product for establishing a fence network, the fence network comprising a plurality of fence nodes in communication with each other, a plurality of fence vertices defining a geographic fence, the computer program product comprising:

a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

configuring the plurality of fence nodes;

setting up a coordinate system to determine a position of each fence node of the plurality of fence nodes; and

for each fence vertex

setting a location marker at a position of the fence vertex;

using the location marker to register the position of the fence vertex at least by;

computing a convex hull from the position of each fence vertex; and

determining whether any fence vertex is located inside the convex hull, wherein when a fence vertex is located inside the convex hull;

calculating all possible orderings of fence vertices consistent with an ordering of the position of fence vertices located on an exterior of the convex hull; and

defining sides of the geographic fence by selecting an order having a greatest minimum acute angle which is less than a predetermined threshold.

12. The computer program product of claim 11, wherein at least one fence vertex is located at a position other than a position of a fence node.

13. The computer program product of claim 11, wherein the plurality of fence vertices are registered in sequential order.

14. The computer program product of claim 12, wherein using the location marker to register the position of the fence vertex comprises connecting the fence vertices in order of registration.

15. The computer program product of claim 11, wherein using the location marker to register the position of the fence vertex further comprises:

joining a neighboring fence vertex by a straight line segment to form a side of the geographic fence.