IP Library Granted Patent US 10,003,919
Granted Patent B2
US 10,003,919 · App. 14/966,970 · Granted Jun 19, 2018

Intelligent geo-fencing

Inventors: Kenneth L. Stanwood (Vista, CA); David Gell (San Diego, CA); Erik Colban (San Diego, CA)
Assignee: Taiwan Semiconductor Manufacturing Co., Ltd.
H04W4/021
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,003,919
App. No.
14/966,970
Granted
Jun 19, 2018
Kind
B2
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 (49)

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.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 5, 2017
From: WI-LAN LABS, INC.
To: TAIWAN SEMICONDUCTOR MANUFACTURING CO., LTD.
Reel/Frame 041627/0873 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2015
From: STANWOOD, KENNETH L; GELL, DAVID; COLBAN, ERIK
To: WI-LAN LABS, INC.
Reel/Frame 037290/0442 →
Continuity (3)
Provisional Application 62090578 · Dec 11, 2014
Provisional Application 62112568 · Feb 5, 2015
Related Publication 20160192132A1 · Jun 30, 2016