Airspace partitioning
First Claim
Patent Images
1. A tangible computer-readable medium encoded with a partitioning computer program, wherein execution of said “
- partitioning computer program”
by one or more processors causes said “
one or more processors”
to execute the steps of;
a) selecting an area of interest, said “
area of interest”
covered by a grid, said “
grid”
consisting of a multitude of grid cells;
b) determining a seed location for each of a predetermined quantity of sub-areas, each of said “
sub-areas”
located within said “
area of interest”
, each of said “
sub-areas”
initially assigned to an assigned grid cell, said “
assigned grid cell”
being one of said “
multitude of grid cells”
, said “
assigned grid cell”
containing a seed location;
c) selecting a predetermined metric;
d) calculating a grid cell value of said predetermined metric for each of said “
multitude of grid cells”
; and
e) until all of said “
multitude of grid cells”
have been assigned to one of said “
sub-areas”
, iteratively;
i) calculating a sub-area value using said “
grid cell value”
for each of said “
multitude of grid cells”
within each of said “
sub-areas”
;
ii) determining a lowest value sub-area, said “
lowest value sub-area”
being said “
sub-area”
with the lowest said “
sub-area value”
; and
iii) assigning at least one adjacent said “
grid cell”
to said “
lowest value sub-area”
.
0 Assignments
0 Petitions
Accused Products
Abstract
Disclosed is a mechanism for partitioning an area such as airspace. An area of interest may be overlaid with a grid such as a hexagonal grid. Data related to a metric may be collected in the area of interest. A cell location is then determined for each piece of data. A metric value is then calculated for cells in the grid using the data. Then sub-areas, consisting of one or more cells, may be grown by appending adjacent cells in an attempt to equalize the total metric value between sub-areas.
-
Citations
19 Claims
-
1. A tangible computer-readable medium encoded with a partitioning computer program, wherein execution of said “
- partitioning computer program”
by one or more processors causes said “
one or more processors”
to execute the steps of;
a) selecting an area of interest, said “
area of interest”
covered by a grid, said “
grid”
consisting of a multitude of grid cells;
b) determining a seed location for each of a predetermined quantity of sub-areas, each of said “
sub-areas”
located within said “
area of interest”
, each of said “
sub-areas”
initially assigned to an assigned grid cell, said “
assigned grid cell”
being one of said “
multitude of grid cells”
, said “
assigned grid cell”
containing a seed location;
c) selecting a predetermined metric;
d) calculating a grid cell value of said predetermined metric for each of said “
multitude of grid cells”
; and
e) until all of said “
multitude of grid cells”
have been assigned to one of said “
sub-areas”
, iteratively;
i) calculating a sub-area value using said “
grid cell value”
for each of said “
multitude of grid cells”
within each of said “
sub-areas”
;
ii) determining a lowest value sub-area, said “
lowest value sub-area”
being said “
sub-area”
with the lowest said “
sub-area value”
; and
iii) assigning at least one adjacent said “
grid cell”
to said “
lowest value sub-area”
. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
- partitioning computer program”
-
11. A tangible partitioning apparatus, comprising:
-
a) A computer containing one or more processors; and
b) a computer-readable medium encoded with a partitioning computer program, wherein execution of said “
partitioning computer program”
by said “
one or more processors”
causes said “
one or more processors”
to execute the steps of;
i) selecting an area of interest, said “
area of interest”
covered by a grid, said “
grid”
consisting of a multitude of grid cells;
ii) determining a seed location for each of a predetermined quantity of sub-areas, each of said “
sub-areas”
located within said “
area of interest”
, each of said “
sub-areas”
initially assigned to an assigned grid cell, said “
assigned grid cell”
being one of said “
multitude of grid cells”
, said “
assigned grid cell”
containing a seed location;
iii) selecting a predetermined metric;
iv) calculating a grid cell value of said predetermined metric for each of said “
multitude of grid cells”
; and
v) until all of said “
multitude of grid cells”
have been assigned to one of said “
sub-areas”
, iteratively;
(1) calculating a sub-area value using said “
grid cell value”
for each of said “
multitude of grid cells”
within each of said “
sub-areas”
;
(2) determining a lowest value sub-area, said “
lowest value sub-area”
being said “
sub-area”
with the lowest said “
sub-area value”
; and
(3) assigning at least one adjacent said “
grid cell”
to said “
lowest value sub-area”
. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeAlexander Klein
-
Original AssigneeAlexander Klein
-
InventorsKlein, Alexander
-
Application NumberUS11/165,251Publication NumberTime in Patent OfficeDaysField of SearchUS Class Current701/201CPC Class CodesG08G 5/0095 Aspects of air-traffic cont...
