IP Library Granted Patent US 9,602,617
Granted Patent B1
US 9,602,617 · App. 14/971,306 · Granted Mar 21, 2017

High performance and scalable telematics message dispatching

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 9,602,617
App. No.
14/971,306
Granted
Mar 21, 2017
Kind
B1
Abstract

Dispatching messages in a moving object, in one aspect, may include receiving a description of a spatial area. A hierarchical tree representation of the spatial area may be generated. The hierarchical tree representation may comprise nodes, wherein a child node represents a sub-region of a region represented by a parent node of the child node. Moving features may be associated with each of the nodes, the moving features comprising whether the node is cacheable, whether the node covers an unpartitioned area, an active object list in an area covered by the node, and a latest position associated with an object in the active object list. Data from the moving object may be dispatched based on the hierarchical tree representation.

Claims (58)

1. A computer-implemented method of dispatching messages in a moving object, the method executed on one or more processors, comprising:

receiving a description of a spatial area;

generating a hierarchical tree representation of the spatial area, the hierarchical tree representation comprising nodes that represent sub-regions of the spatial area encoded hierarchically;

determining moving features associated with a node, the moving features comprising whether the node is cacheable wherein the node is defined to be cacheable if a sub-region of the spatial area represented by the node covers an area greater than a threshold size, whether the node covers more than one partition areas among multiple pre-partitioned areas, an active object list in an area covered by the node, and a latest position associated with an object in the active object list; and

dispatching data associated with the moving object based on the hierarchical tree representation, the dispatching comprising at least one of caching context information associated with the moving object and context switching the context information associated with the moving object from a current region server to another region server.

2. The method of claim 1 , wherein the spatial area is partitioned into a plurality of partitions.

3. The method of claim 1 , wherein the dispatching data from the moving object based on the hierarchical tree representation comprises:

receiving a GPS position of the moving object;

matching the GPS position to a node in the hierarchical tree representation;

determining the moving features of the node;

based on the moving features of the node, performing one or more of caching context information associated with the moving object and context switching the context information associated with the moving object from a current region server to another region server.

4. The method of claim 1 , wherein the dispatching data from the moving object based on the hierarchical tree representation comprises:

receiving a GPS position of the moving object;

determining whether the GPS position is cached with associated context information;

responsive to determining that the GPS position is cached, determining whether the cached context information has expired;

responsive to determining that the cached context information has not expired, waiting before performing another dispatching.

5. The method of claim 4 , wherein responsive to determining that the cached context information has expired, updating the cached context information based on the moving features.

6. The method of claim 1 , wherein the moving object comprises a vehicle.

7. The method of claim 1 , wherein the hierarchical tree representation is stored in a memory device.

8. A non-transitory computer readable storage medium storing a program of instructions executable by a machine to perform a method of dispatching messages in a moving object, the method comprising:

receiving a description of a spatial area;

generating a hierarchical tree representation of the spatial area, the hierarchical tree representation comprising nodes that represent sub-regions of the spatial area encoded hierarchically;

determining moving features associated with a node, the moving features comprising whether the node is cacheable wherein the node is defined to be cacheable if a sub-region of the spatial area represented by the node covers an area greater than a threshold size, whether the node covers more than one partition areas among multiple pre-partitioned areas, an active object list in an area covered by the node, and a latest position associated with an object in the active object list; and

dispatching data associated with the moving object based on the hierarchical tree representation, the dispatching comprising at least one of caching context information associated with the moving object and context switching the context information associated with the moving object from a current region server to another region server.

9. The non-transitory computer readable storage medium of claim 8 , wherein the spatial area is partitioned into a plurality of partitions.

10. The non-transitory computer readable storage medium of claim 8 , wherein the dispatching data from the moving object based on the hierarchical tree representation comprises:

receiving a GPS position of the moving object;

matching the GPS position to a node in the hierarchical tree representation;

determining the moving features of the node;

based on the moving features of the node, performing one or more of caching context information associated with the moving object and context switching the context information associated with the moving object from a current region server to another region server.

11. The non-transitory computer readable storage medium of claim 8 , wherein the dispatching data from the moving object based on the hierarchical tree representation comprises:

receiving a GPS position of the moving object;

determining whether the GPS position is cached with associated context information;

responsive to determining that the GPS position is cached, determining whether the cached context information has expired;

responsive to determining that the cached context information has not expired, waiting before performing another dispatching.

12. The non-transitory computer readable storage medium of claim 11 , wherein responsive to determining that the cached context information has expired, updating the cached context information based on the moving features.

13. The non-transitory computer readable storage medium of claim 8 , wherein the moving object comprises a vehicle.

14. The non-transitory computer readable storage medium of claim 8 , wherein the hierarchical tree representation is stored in a memory device.

15. A system for dispatching messages in a moving object, comprising:

one or more hardware processors operable to receive a description of a spatial area,

one or more of the hardware processors further operable to generate a hierarchical tree representation of the spatial area, the hierarchical tree representation comprising nodes that represent sub-regions of the spatial area encoded hierarchically;

a cache memory coupled to one or more of the hardware processors,

one or more of the hardware processors further operable to store the hierarchical tree representation in the cache memory;

one or more of the hardware processors further operable to determine moving features associated with a node, the moving features comprising whether the node is cacheable wherein the node is defined to be cacheable if a sub-region of the spatial area represented by the node covers an area greater than a threshold size, whether the node covers more than one partition areas among multiple pre-partitioned areas, an active object list in an area covered by the node, and a latest position associated with an object in the active object list,

one or more of the hardware processors further operable to dispatch data associated with the moving object based on the hierarchical tree representation, the dispatching comprising at one or more of caching context information associated with the moving object or context switching the context information associated with the moving object from a current region server to another region server.

16. The system of claim 15 , wherein the spatial area is partitioned into a plurality of partitions.

17. The system of claim 15 , wherein one or more of the hardware processors dispatch data from the moving object based on the hierarchical tree representation by:

receiving a GPS position of the moving object;

matching the GPS position to a node in the hierarchical tree representation;

determining the moving features of the node;

based on the moving features of the node, performing one or more of caching context information associated with the moving object and context switching the context information associated with the moving object from a current region server to another region server.

18. The system of claim 15 , wherein one or more of the hardware processors dispatch data from the moving object based on the hierarchical tree representation by:

receiving a GPS position of the moving object;

determining whether the GPS position is cached with associated context information;

responsive to determining that the GPS position is cached, determining whether the cached context information has expired;

responsive to determining that the cached context information has not expired, waiting before performing another dispatching.

19. The system of claim 18 , wherein responsive to determining that the cached context information has expired, updating the cached context information based on the moving features.

20. The system of claim 15 , wherein the moving object comprises a vehicle.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2021
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: AIRBNB, INC.
Reel/Frame 056427/0193 →
CORRECTIVE ASSIGNMENT TO CORRECT THE POSTAL CODE OF THE RECEIVING PARTY TO READ 10504 PREVIOUSLY RECORDED ON REEL 037307 FRAME 0485. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Feb 12, 2016
From: DUAN, NING; GAO, PENG; HU, GUOQIANG; WANG, ZHI HU; ZHANG, XIN; ZHU, JUN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 037809/0352 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2015
From: DUAN, NING; GAO, PENG; HU, GUOQIANG; WANG, ZHI HU; ZHANG, XIN; ZHU, JUN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 037307/0485 →