Geographic space management

Patent metadata

Field	Value
Publication number	US-10215570-B2
Application number	US-201815977314-A
Country	US
Kind code	B2
Filing date	May 11, 2018
Priority date	Jun 19, 2015
Publication date	Feb 26, 2019
Grant date	Feb 26, 2019

Abstract

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.

First claim

What is claimed is:

1. A computer program product comprising one or more computer-readable storage devices and program instructions stored on at least one of the one or more computer-readable storage devices, the program instructions comprising program instructions to:
manage, 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;
manage, 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;
change the common boundary between the first region and the second region based on a data processing load of the first subsystem.

2. The computer program product according to claim 1 , wherein the program instructions to calculate manage 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 computer program product 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 computer program product 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 computer program product according to claim 1 , further comprising program instructions to change 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 computer program product according to claim 1 , further comprising program instructions to:
manage at least one event occurring in a management target region; and
change 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 computer program product according to claim 1 , further comprising program instructions to:
change the common boundary in a manner to decrease an amount of traffic crossing the boundary of the at least one region.

8. The computer program product according to claim 1 , further comprising program instructions to change 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 computer program product according to claim 1 , further comprising program instructions to calculate a complexity of a route network in each of the plurality of regions; and changing the common boundary according to the complexity.

10. The computer program product according to claim 9 , wherein the program instructions to calculate 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. A computer system, the computer system comprising one or more processors, one or more computer-readable memories, one or more computer-readable storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising program instructions to:
manage, 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;
manage, 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;
change the common boundary between the first region and the second region based on a data processing load of the first subsystem.

12. The computer system according to claim 11 , wherein the program instructions to calculate manage 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.

13. The computer system according to claim 12 , 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.

14. The computer system according to claim 12 , wherein the beginning of data processing includes changing the common boundary in a manner to decrease an amount of traffic crossing the common boundary.

15. The computer system according to claim 11 , further comprising program instructions to change 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.

16. The computer system according to claim 11 , further comprising program instructions to:
manage at least one event occurring in a management target region; and
change 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.

17. The computer system according to claim 11 , further comprising program instructions to:
change the common boundary in a manner to decrease an amount of traffic crossing the boundary of the at least one region.

18. The computer system according to claim 11 , further comprising program instructions to change 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.

19. The computer system according to claim 11 , further comprising program instructions to calculate a complexity of a route network in each of the plurality of regions; and
changing the common boundary according to the complexity.

20. The computer system according to claim 19 , wherein the program instructions to calculate 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.

Assignees

• IBM

Inventors

• Gotoh Yasuhisa
• Miyahira Tomohiro
• Sasaki Taku
• Tanibayashi Makoto

Classifications

• G01C21/20 Primary

  Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence) · CPC title

• H04L67/1008

  based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30) · CPC title

• G06F9/505

  considering the load · CPC title

• G06T7/74

  involving reference images or patches · CPC title

• G06F9/5083

  Techniques for rebalancing the load in a distributed system · CPC title