Geographic space management
US-9578093-B1 · Feb 21, 2017 · US
US10001377B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10001377-B2 |
| Application number | US-201514750298-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 25, 2015 |
| Priority date | Jun 19, 2015 |
| Publication date | Jun 19, 2018 |
| Grant date | Jun 19, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A system is provided that manages a geographic space including a route on which a moving object moves, including a plurality of subsystems operable to respectively manage maps of a plurality of regions obtained by dividing the geographic space, and a region manager operable to adjust loads of the subsystems by dynamically changing a boundary of at least one region among the plurality of regions. Also provided is a method and computer program product.
Opening claim text (preview).
What is claimed is: 1. A method comprising: managing, using a first subsystem of a plurality of subsystems, a first region of a plurality of regions, wherein the plurality of regions divide geographic space, and wherein managing the first region comprises managing a first mobile object; managing, using a second subsystem of the plurality of subsystems, a second region of the plurality of regions, wherein managing the second region comprises managing a second mobile object, and wherein the first region and the second region share a common boundary; changing the common boundary between the first region and the second region based on a data processing load of the first subsystem. 2. The method according to claim 1 , wherein managing the first region of the plurality of regions includes: beginning data processing relating to a third moving object that has become a new management target based on changing the common boundary. 3. The method according to claim 2 , wherein the beginning of data processing includes changing the common boundary according to at least one of a number of moving objects positioned respectively in the plurality of regions and a data processing load relating to the moving objects positioned respectively in the plurality of regions. 4. The method according to claim 2 , wherein the beginning of data processing includes changing the common boundary in a manner to decrease an amount of traffic crossing the common boundary. 5. The method according to claim 1 , further comprising: changing the common boundary to reduce at least one of a number of moving objects positioned within a partial range from the boundary and a data processing load relating to the moving objects positioned within the partial range from the boundary. 6. The method according to claim 1 , further comprising: managing at least one event occurring in a management target region; and changing the common boundary according to at least one of a plurality of numbers of events occurring respectively in the plurality of regions and a data processing load relating to the events. 7. The method according to claim 1 , further comprising: changing the common boundary in a manner to decrease an amount of traffic crossing the boundary of the at least one region. 8. The method according to claim 1 , further comprising: changing the common boundary when the boundary of the at least one region is positioned within a route portion where the traffic amount exceeds a reference traffic amount, to include the entirety of the route portion. 9. The method according to claim 1 , further comprising: calculating a complexity of a route network in each of the plurality of regions; and changing the common boundary according to the complexity. 10. The method according to claim 9 , wherein calculating the complexity of the route network is based on a history of processing loads of route searches performed in each of the plurality of regions. 11. The method according to claim 1 , wherein the plurality of subsystems is realized respectively by a plurality of servers and a region manager is realized by at least one of the plurality of servers. 12. The method according to claim 1 , further comprising: transferring communication between the plurality of subsystems and a plurality of moving objects; determining the region in which each of the moving objects is positioned based on position information received from each of the moving objects in response to a request from a gateway apparatus; determining a subsystem that is to manage a map of each region from among the plurality of subsystems; and transferring information received from each of the moving objects to the corresponding determined subsystems.
considering the load · CPC title
involving reference images or patches · CPC title
Techniques for rebalancing the load in a distributed system · CPC title
Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence) · CPC title
Creating or editing images; Combining images with text · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.