Patent US6016485A successfully refreshed from Google Patents.
US6016485A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for pathfinding
Assignee: TomTom North America Inc
•
Filing: 1998-02-13
•
Granted: 2000-01-18
•
Expires: 2018-02-13
Abstract
Abstract A system is disclosed for determining a path in a network that decreases the number of disk accesses needed during the pathfinding computation. The network is divided in to a set of tiles. Certain sub-paths are pre-computed. The pre-computed sub-paths are grouped into webs. When finding a path, the system will perform a pathfinding exploration within the tile for the origin and a pathfinding exploration within the tile for the destination. A number of the webs will be used with the two explorations to determine a path from the origin to the destination.
Inventors
- 👤 Koji Amakawa
- 👤 Edward Joseph Suranyi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 18:07
CPC Classifications
G; G01; G01C; G01C21/00; G01C21/26; G01C21/34; G01C21/3446; G06; G06Q; G06Q30/00; G06Q30/02; G06Q30/0283
Claims Analysis
Total Claims: 62
Claim 1
Independent Claim
184 words
A method for determining a path in a processor readable representation of a network from an origin to a destination, said processor readable representation of said network including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a first path exploration with a processor to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile; performing a second path exploration with said processor to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other; performing a third path exploration with said processor to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other; and reporting said path.
Claim 2
Independent Claim
184 words
A method for determining a path in a processor readable representation of a network from an origin to a destination, said processor readable representation of said network including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a first path exploration with a processor to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile; performing a second path exploration with said processor to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other; performing a third path exploration with said processor to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other; and reporting said path.
Claim 3
Dependent Claim
24 words
A method according to claim 1, further including the steps of: receiving an indication of said origin; and receiving an indication of said destination.
Claim 4
Dependent Claim
18 words
A method according to claim 1, wherein: said processor readable representation of a network is an electronic map.
Claim 5
Dependent Claim
27 words
A method according to claim 1, wherein: said first path exploration uses at least an origin tile and a first self web associated with said origin tile.
Claim 6
Dependent Claim
41 words
A method according to claim 4, wherein said step of performing a first path exploration includes the steps of: exploring from said origin inside said origin tile; and exploring from said destination within said origin tile and said first self web.
Claim 7
Dependent Claim
42 words
A method according to claim 1, wherein: said second path exploration uses at least an origin tile, a first self web associated with said origin tile, a destination tile, a second self web associated with said destination tile and a too-close web.
Claim 8
Dependent Claim
49 words
A method according to claim 6, wherein said step of performing a second path exploration includes the steps of: exploring from said origin using said origin tile and said first self web; and exploring from said destination using said destination tile, said second self web and said too-close web.
Claim 9
Dependent Claim
42 words
A method according to claim 1, wherein: said third path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web.
Claim 10
Dependent Claim
48 words
A method according to claim 8, wherein: said third path exploration additionally uses a first self web associated with said origin tile and a second self web associated with said destination tile; and data for said first self web and data for said first vicinity web are combined.
Claim 11
Dependent Claim
116 words
A method according to claim 1, wherein: said first path exploration uses at least an origin tile and a first self web associated with said origin tile; said second path exploration uses at least an origin tile, a first self web associated with said origin tile, a destination tile, a second self web associated with said destination tile and a too-close web; and said third path exploration uses at least an origin tile, a first self web associated with said origin tile, a first vicinity web associated with said origin tile, a destination tile, a second self web associated with said destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web.
Claim 12
Dependent Claim
24 words
A method according to claim 10, further including the steps of: receiving an indication of said origin; and receiving an indication of said destination.
Claim 13
Dependent Claim
58 words
A method according to claim 1, wherein: said third path exploration uses an origin tile, a first self web associated with said origin tile, a first vicinity web associated with said origin tile, a destination tile, a second self web associated with said destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web.
Claim 14
Dependent Claim
19 words
A method according to claim 12, wherein: said step of performing a third path exploration includes building said path.
Claim 15
Dependent Claim
57 words
A method according to claim 12, wherein said step of performing a third path exploration includes the steps of: exploring from said origin using said origin tile, said first vicinity web and said first self web; and exploring from said destination using said destination tile, said second vicinity web, said second self web and said exit-to-entrance web.
Claim 16
Dependent Claim
21 words
A method according to claim 14, wherein: said step of exploring from said destination proceeds until a priority queue is empty.
Claim 17
Independent Claim
229 words
A method for determining a path in an electronic map of roads from an origin to a destination, said electronic map including one or more tiles, data representing said origin being part of a first tile in said electronic map, the method comprising the steps of: reading data for at least said first tile; determining whether said destination is in said first tile; reading data for at least a second tile if said destination is not in said first tile; determining whether said first tile is within a proximity threshold of said second tile, if said destination is not in said first tile; reading data for at least an exit-to-entrance web, data for a first vicinity web and data for a second vicinity web, if said destination is not in said first tile and if said first tile is not within said proximity threshold of said second tile; reading data for at least a first self web if said destination is in said first tile; reading said data for at least said first self web, data for a second self web and data for a too-close web if said destination is not in said first tile and if said first tile is within said proximity threshold of said second tile; performing one or more path explorations using a processor and at least said data read; and reporting said path.
Claim 18
Independent Claim
229 words
A method for determining a path in an electronic map of roads from an origin to a destination, said electronic map including one or more tiles, data representing said origin being part of a first tile in said electronic map, the method comprising the steps of: reading data for at least said first tile; determining whether said destination is in said first tile; reading data for at least a second tile if said destination is not in said first tile; determining whether said first tile is within a proximity threshold of said second tile, if said destination is not in said first tile; reading data for at least an exit-to-entrance web, data for a first vicinity web and data for a second vicinity web, if said destination is not in said first tile and if said first tile is not within said proximity threshold of said second tile; reading data for at least a first self web if said destination is in said first tile; reading said data for at least said first self web, data for a second self web and data for a too-close web if said destination is not in said first tile and if said first tile is within said proximity threshold of said second tile; performing one or more path explorations using a processor and at least said data read; and reporting said path.
Claim 19
Independent Claim
133 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path, said step of performing a path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web if said origin and said destination are located in tiles not within said proximity threshold of each others, and reporting said path.
Claim 20
Independent Claim
133 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path, said step of performing a path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web if said origin and said destination are located in tiles not within said proximity threshold of each others, and reporting said path.
Claim 21
Dependent Claim
51 words
A method according to claim 17, wherein: said step of performing a path exploration includes: determining a path from said origin to said first vicinity web; determining a path from said second vicinity web to said destination; and determining a path from said first vicinity web to said second vicinity web.
Claim 22
Independent Claim
115 words
A method for determining a path in an electronic map from an origin to a destination, said electronic map including data divided into tiles, the method comprising: determining whether said origin and said destination are within a first tile; reading data for said first tile; reading data for a first self web, said first self web being associated with said first tile; exploring, using a processor, between said origin and said destination using said data for said first tile and said data for said self web if said origin and said destination are both within said first tile, said step of exploring determines said path from said origin to said destination; and reporting said path.
Claim 23
Independent Claim
115 words
A method for determining a path in an electronic map from an origin to a destination, said electronic map including data divided into tiles, the method comprising: determining whether said origin and said destination are within a first tile; reading data for said first tile; reading data for a first self web, said first self web being associated with said first tile; exploring, using a processor, between said origin and said destination using said data for said first tile and said data for said self web if said origin and said destination are both within said first tile, said step of exploring determines said path from said origin to said destination; and reporting said path.
Claim 24
Dependent Claim
32 words
A method according to claim 19, further including the steps of: receiving an indication of said origin in said electronic map; and receiving an indication of said destination in said electronic map.
Claim 25
Dependent Claim
25 words
A method according to claim 19, wherein: said step of exploring includes a first exploration from said origin and a second exploration from said destination.
Claim 26
Dependent Claim
36 words
A method according to claim 21, wherein: said first exploration uses said data for said first tile; and said second exploration uses said data for said first tile and said data for said first self web.
Claim 27
Dependent Claim
166 words
A processor readable storage medium having processor readable code embodied on said processor readable storage medium, said processor readable code for programming a processor to perform a method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile; performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other; and performing a third path exploration to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other.
Claim 28
Dependent Claim
166 words
A processor readable storage medium having processor readable code embodied on said processor readable storage medium, said processor readable code for programming a processor to perform a method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile; performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other; and performing a third path exploration to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other.
Claim 29
Dependent Claim
20 words
A processor readable storage medium according to claim 23, wherein said method further includes the step of: reporting said path.
Claim 30
Dependent Claim
45 words
A processor readable storage medium according to claim 23, wherein: said second path exploration uses at least an origin tile, a first self web associated with said origin tile, a destination tile, a second self web associated with said destination tile and a too-close web.
Claim 31
Dependent Claim
21 words
A processor readable storage medium according to claim 23, wherein: said processor readable representation of a network is an electronic map.
Claim 32
Dependent Claim
30 words
A processor readable storage medium according to claim 23, wherein: said first path exploration uses at least an origin tile and a first self web associated with said origin tile.
Claim 33
Dependent Claim
44 words
A processor readable storage medium according to claim 27, wherein said step of performing a first path exploration includes the steps of: exploring from said origin inside said origin tile; and exploring from said destination within said origin tile and said first self web.
Claim 34
Dependent Claim
45 words
A processor readable storage medium according to claim 23, wherein: said third path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web.
Claim 35
Dependent Claim
56 words
A processor readable storage medium according to claim 29, wherein said step of performing a third path exploration includes the steps of: exploring from said origin using at least said origin tile and said first vicinity web; and exploring from said destination using at least said destination tile, said second vicinity web and said exit-to-entrance web.
Claim 36
Dependent Claim
155 words
A processor readable storage medium having processor readable code embodied on said processor readable storage medium, said processor readable code for programming a processor to perform a method for determining a path in an electronic map from an origin to a destination, said electronic map including a plurality of tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path, said step of performing a path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web if said origin and said destination are located in tiles not within said proximity threshold of each other, and reporting said path.
Claim 37
Dependent Claim
155 words
A processor readable storage medium having processor readable code embodied on said processor readable storage medium, said processor readable code for programming a processor to perform a method for determining a path in an electronic map from an origin to a destination, said electronic map including a plurality of tiles, the method comprising the steps of: determining whether said origin and said destination are located in a single tile; determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path, said step of performing a path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web if said origin and said destination are located in tiles not within said proximity threshold of each other, and reporting said path.
Claim 38
Independent Claim
205 words
An apparatus for determining a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, comprising an output device; a processor, in communication with said output device; and a processor readable storage medium for storing code, said processor readable storage medium being in communication with said processor, said code capable of programming said processor to perform the steps of: determining whether said origin and said destination are located in a single tile, determining whether said origin and said destination are located in tiles within a proximity threshold of each other, performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile, performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other, performing a third path exploration to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other, and reporting said path.
Claim 39
Independent Claim
205 words
An apparatus for determining a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, comprising an output device; a processor, in communication with said output device; and a processor readable storage medium for storing code, said processor readable storage medium being in communication with said processor, said code capable of programming said processor to perform the steps of: determining whether said origin and said destination are located in a single tile, determining whether said origin and said destination are located in tiles within a proximity threshold of each other, performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located in a single tile, performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are located in tiles within said proximity threshold of each other, performing a third path exploration to determine said path using a third set of one or more webs, if said origin and said destination are located in separate tiles not within said proximity threshold of each other, and reporting said path.
Claim 40
Dependent Claim
27 words
An apparatus according to claim 32, wherein: said first path exploration uses at least an origin tile and a first self web associated with said origin tile.
Claim 41
Dependent Claim
42 words
An apparatus according to claim 32, wherein: said second path exploration uses at least an origin file, a first self web associated with said origin tile, a destination tile, a second self web associated with said destination tile and a too-close web.
Claim 42
Dependent Claim
42 words
An apparatus according to claim 32, wherein: said third path exploration uses at least an origin tile, a first vicinity web associated with said origin tile, a destination tile, a second vicinity web associated with said destination tile and an exit-to-entrance web.
Claim 43
Independent Claim
94 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path using at least an origin tile, a too-close web and a destination tile if said origin and said destination are located in tiles within said proximity threshold of each other; and reporting said path.
Claim 44
Independent Claim
94 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: determining whether said origin and said destination are located in tiles within a proximity threshold of each other; performing a path exploration to determine said path using at least an origin tile, a too-close web and a destination tile if said origin and said destination are located in tiles within said proximity threshold of each other; and reporting said path.
Claim 45
Dependent Claim
77 words
A method according to claim 36, wherein: said step of performing a path exploration additionally uses a first self web associated with said origin tile and a second self web associated with said destination tile; and said step of performing a path exploration includes the steps of: exploring from said origin using said origin tile and said first self web, and exploring from said destination using said destination tile, said second self web and said too-close web.
Claim 46
Independent Claim
94 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: reading data for at least a first tile, a first web of pre-computed paths and a second web of pre-computed paths, said origin being in said first tile; performing a pathfinding exploration to find said path from said origin to said destination, said path traverses in said first tile, said first web and said second web; and reporting said path.
Claim 47
Independent Claim
94 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including one or more tiles, the method comprising the steps of: reading data for at least a first tile, a first web of pre-computed paths and a second web of pre-computed paths, said origin being in said first tile; performing a pathfinding exploration to find said path from said origin to said destination, said path traverses in said first tile, said first web and said second web; and reporting said path.
Claim 48
Independent Claim
159 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: reading data for a first region of said electronic map, said first region including said origin; reading data for a second region of said electronic map, said second region including said destination; reading data for a first set of pre-computed paths, said first set of pre-computed paths comprises pre-computed paths within a vicinity of said first region; reading data for a second set of pre-computed paths, said second set of pre-computed paths comprises pre-computed paths between said first region and said second region; performing a pathfinding exploration to determine said path from said origin to said destination using said data for said first region, said data for said second region, said data for said first set of pre-computed paths and said data for said second set of pre-computed paths; and reporting said path.
Claim 49
Independent Claim
159 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: reading data for a first region of said electronic map, said first region including said origin; reading data for a second region of said electronic map, said second region including said destination; reading data for a first set of pre-computed paths, said first set of pre-computed paths comprises pre-computed paths within a vicinity of said first region; reading data for a second set of pre-computed paths, said second set of pre-computed paths comprises pre-computed paths between said first region and said second region; performing a pathfinding exploration to determine said path from said origin to said destination using said data for said first region, said data for said second region, said data for said first set of pre-computed paths and said data for said second set of pre-computed paths; and reporting said path.
Claim 50
Dependent Claim
53 words
A method according to claim 39, further including the step of: reading data for a third set of pre-computed paths, said second set of pre-computed paths comprises pre-computed paths within a vicinity of said second region, said step of performing a pathfinding exploration uses said data for said third set of pre-computed paths.
Claim 51
Dependent Claim
64 words
A method according to claim 40, wherein: said first region is a first tile; said second region is a second tile; said first set of pre-computed paths is a first vicinity web associated with said first tile; said second set of pre-computed paths is a second vicinity web associated with said second tile; and said third set of pre-computed paths is an exit-to-entrance web.
Claim 52
Independent Claim
159 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: reading data for a first region of said electronic map, said first region including said origin; reading data for a second region of said electronic map, said second region including said destination; reading data for a first set of pre-computed paths, said first set of pre-computed paths comprises pre-computed paths within a vicinity of said second region; reading data for a second set of pre-computed paths, said second set of pre-computed paths comprises pre-computed paths between said first region and said second region; performing a pathfinding exploration to determine said path from said origin to said destination using said data for said first region, said data for said second region, said data for said first set of pre-computed paths and said data for said second set of pre-computed paths; and reporting said path.
Claim 53
Independent Claim
159 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: reading data for a first region of said electronic map, said first region including said origin; reading data for a second region of said electronic map, said second region including said destination; reading data for a first set of pre-computed paths, said first set of pre-computed paths comprises pre-computed paths within a vicinity of said second region; reading data for a second set of pre-computed paths, said second set of pre-computed paths comprises pre-computed paths between said first region and said second region; performing a pathfinding exploration to determine said path from said origin to said destination using said data for said first region, said data for said second region, said data for said first set of pre-computed paths and said data for said second set of pre-computed paths; and reporting said path.
Claim 54
Independent Claim
110 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: determining whether said origin and said destination are located within a proximity of each other; performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located within said proximity of each other; performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are not located within said proximity of each other; and reporting said path.
Claim 55
Independent Claim
110 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, the method comprising the steps of: determining whether said origin and said destination are located within a proximity of each other; performing a first path exploration to determine said path using a first set of one or more webs, if said origin and said destination are located within said proximity of each other; performing a second path exploration to determine said path using a second set of one or more webs, if said origin and said destination are not located within said proximity of each other; and reporting said path.
Claim 56
Dependent Claim
30 words
A method according to claim 43, wherein: said first set of one or more webs includes a self web if said origin and said destination are in a single tile.
Claim 57
Dependent Claim
78 words
A method according to claim 43, wherein: said first path exploration is only performed if said origin and said destination are located within said proximity of each other and said origin and said destination are not in a single tile; and said method further includes the step of performing a third path exploration to determine said path using a third set of one or more webs, if said origin and said destination are located in a single tile.
Claim 58
Dependent Claim
26 words
A method according to claim 43, wherein: said first path exploration is only performed if said origin and said destination are located within a single tile.
Claim 59
Dependent Claim
31 words
A method according to claim 43, wherein: said first set of one or more webs includes a too-close web if said origin and said destination are not in a single tile.
Claim 60
Independent Claim
131 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including data divided into tiles, the method comprising the steps of: determining whether said origin and said destination are within a proximity threshold of each other; reading data for said first tile, said first tile includes said origin; reading data for said second tile, said second tile includes said destination; reading data for a too-close web associated with said first tile; determining said path between said origin and said destination using said data for said first tile, said data for said second tile and said data for said too-close web if said origin and said destination are within a proximity threshold of each other; and reporting said path.
Claim 61
Independent Claim
131 words
A method for using a processor to determine a path in an electronic map from an origin to a destination, said electronic map including data divided into tiles, the method comprising the steps of: determining whether said origin and said destination are within a proximity threshold of each other; reading data for said first tile, said first tile includes said origin; reading data for said second tile, said second tile includes said destination; reading data for a too-close web associated with said first tile; determining said path between said origin and said destination using said data for said first tile, said data for said second tile and said data for said too-close web if said origin and said destination are within a proximity threshold of each other; and reporting said path.
Claim 62
Dependent Claim
55 words
A method according to claim 48, further including the steps of: reading data for a first self web associated with said first tile; reading data for a second self web associated with said second tile, said step of determining uses said data for said first self web and said data for said second self web.
References Cited (Backward Citations)
US4796191A
Cited
US4914605A
Cited
US5031093A
Cited
US4984168A
Cited
US5168452A
Cited
US5170353A
Cited
US5486822A
Cited
US5502640A
Cited
US5285391A
Cited
US5369588A
Cited
US5311195A
Cited
US5557552A
Cited
US5475598A
Cited
US5513110A
Cited
US5495479A
Cited
US5600638A
Cited
US5521910A
Cited
US5706503A
Cited
US5890081A
Cited
US5729458A
Cited
US5845228A
Cited
US5893081A
Cited
US5916299A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-17 | 2003-07-19 | 2004-01-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-17 | 2007-07-19 | 2008-01-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-17 | 2011-07-19 | 2012-01-18 | $7700.00 | Window Closed / Lapsed |