JP6797168B2 - Information processing equipment, information processing methods and programs - Google Patents

Description

The present invention relates to information processing technology.

Conventionally, there is known a peripheral search technique for searching various facilities such as convenience stores, restaurants, bus stops, and stations existing in the vicinity and presenting them to users. The user can search for a facility that can be reached immediately from the facilities presented by the peripheral search. Patent Document 1 describes a technique relating to a navigation device having a peripheral search function for searching facilities around a current location or a destination.

Japanese Unexamined Patent Publication No. 2013-195244

However, in the peripheral search in the prior art as described above, the facilities existing in the periphery are searched according to the linear distance between the departure position and the facility. Therefore, if there are obstacles such as railroad tracks or buildings between the departure position and the facility identified by the search, and you cannot reach the facility without making a large detour around such obstacles, you can reach such a facility. It takes time to go. Therefore, such a peripheral search may not be suitable for a user who is looking for a facility that can be reached immediately. Further, in the peripheral search, if a route search to all facilities is performed to identify a facility that can be reached immediately, such a search requires a huge amount of processing, which is not realistic.

The present invention has been made in view of the above, and an object of the present invention is to provide a technique for performing a more appropriate peripheral search with a lightweight process.

The information processing apparatus according to the present invention refers to the map information and is based on an object existing on a straight line connecting a designated position and each of the positions of one or a plurality of facilities satisfying a predetermined condition. And a calculation means for calculating the movement cost between each of the positions of the one or more facilities, and a selection means for selecting a facility from the one or more facilities according to the calculated movement cost. Be prepared.

The information processing method according to the present invention is an information processing method implemented in an information processing apparatus including a control unit, wherein the control unit refers to map information and satisfies a designated position and a predetermined position 1 or A calculation step for calculating the movement cost between the designated position and each of the positions of the one or a plurality of facilities based on an object existing on a straight line connecting the positions of the plurality of facilities, and the control. The unit includes a selection step of selecting a facility from the one or more facilities according to the calculated travel cost.

The program according to the present invention refers to a computer with reference to map information, and based on an object existing on a straight line connecting a designated position and each of the positions of one or a plurality of facilities satisfying a predetermined condition. It functions as a calculation means for calculating the movement cost between the position and each of the positions of the one or more facilities, and a selection means for selecting a facility from the one or more facilities according to the calculated movement cost. Let me.

Further, the program of the present invention can be installed or loaded on a computer by downloading through various recording media such as an optical disk such as a CD-ROM, a magnetic disk, and a semiconductor memory, or via a communication network or the like. ..

According to the present invention, a more appropriate peripheral search can be performed with a lightweight process.

It is a conceptual diagram which shows the hardware structure of the information processing apparatus in one Embodiment. It is a block diagram which shows the functional structure of the information processing apparatus in one Embodiment. It is a figure which shows the relationship between the attribute of a facility and a score in one Embodiment. It is a figure for demonstrating the example of the peripheral search in one Embodiment. It is a flowchart which shows the process performed by the information processing apparatus in one Embodiment.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. However, the scope of the invention is not limited to these.

The hardware configuration of the peripheral search device according to the embodiment will be described with reference to FIG. The peripheral search device 10 is a device that searches and outputs various facilities (for example, convenience stores, restaurants, bus stops, stations, etc.) existing in the vicinity of a designated position. The peripheral search device 10 is composed of information processing devices such as a mobile phone, a smartphone, a PDA (Personal Digital Assistants), a navigation device, a personal computer, and a server computer. The peripheral search device 10 mainly includes a control unit 11, a communication unit 14, a storage unit 15, an operation unit 16, and a display unit 17. The control unit 11 mainly includes a CPU (Central Processing Unit) 12 and a memory 13. The peripheral search device 10 may be composed of a single information processing device or may be composed of a plurality of information processing devices distributed on a network.

In the control unit 11, the CPU 12 controls the operation of various configurations included in the peripheral search device 10 by expanding and executing the program stored in the storage unit 15 or the like in the memory 13, and also executes various processes. Control. Details of the processing executed by the control unit 11 will be described later.

The communication unit 14 is a communication interface for communicating with an external device. The communication unit 14 receives, for example, data or a command from an external device, or transmits the processing result of the peripheral search device 10 to the outside.

The storage unit 15 is composed of a storage device such as a hard disk. The storage unit 15 stores various programs and various information necessary for executing the processing in the control unit 11. Specific examples of the information stored in the storage unit 15 will be described later.

The operation unit 16 is a user interface for receiving the user's instruction of the peripheral search device 10 and outputting it to the control unit 11. The operation unit 16 includes a keyboard, a mouse, operation keys, a touch panel, and the like.

The display unit 17 is a user interface for displaying the processing result of the peripheral search device 10. The display unit 17 is composed of a display device using a liquid crystal, an LED (Light Emitting Diode), a CRT (Cathode Ray Tube), or the like.

The functional configuration of the peripheral search device 10 according to the embodiment will be described with reference to FIG. The peripheral search device 10 mainly includes a score setting unit 111, a movement cost calculation unit 112, a candidate site selection unit 113, and a database 120 as functional configurations. In addition, the peripheral search device 10 may also have a positioning function for identifying the current location of the own device. These functions are realized, for example, by the CPU 12 in the control unit 11 expanding the program stored in the storage unit 15 or the like into the memory 13 and executing the program. The details of each functional configuration included in the peripheral search device 10 will be described below.

First, the database 120 stores various information such as information necessary for the process executed by the peripheral search device 10 and information generated by the process. Database 120 stores, for example, map information and score information. Map information includes various information related to maps such as facility information, road information, railway line information, building information, topographical information, address information, and other geographic information. The score information will be described later.

The score setting unit 111 refers to the map information of the database 120 and sets a score for each area according to the objects existing in each area on the map. Here, the object corresponds to an object existing in the real world, and includes, for example, an intersection, a building, a railroad crossing, a railroad track, a mountain, a river, a bridge, and the like, and is represented on a map. The score is set according to how much obstacles the objects in the area are when passing through the area. For example, the greater the degree of obstacle, the larger the score is set. The set score information is stored in the database 120. Although the score is set for the area, the score is not limited to this and may be set for the object itself existing in the area. The same applies to the following description.

Further, in the present mobile phone, the area is an area obtained by dividing the map based on latitude and longitude, and the shape and size of the area can be appropriately set according to the specifications and design. For example, the shape of the area can be a polygon such as a quadrangle, a hexagon, or a rhombus, or a shape surrounded by a curve such as a circle. Further, the size can be, for example, 3 m square (or 3 m in diameter) or 10 m square (or 10 m in diameter). Also, the size of the area does not have to be constant. For example, urban areas may be made smaller (smaller). In addition, the area may be in the shape of an administrative division. The information of the set area is stored in the database 120 together with the map information.

The score setting unit 111 can also set the score based on the attributes of the object. As the attribute, the type of object (for example, intersection, building, railroad crossing, railroad track, river, etc.) can be considered.

An example of a score set based on an object attribute (object type) will be described with reference to FIG. In this example, the attributes of the objects are intersections, buildings, railroad crossings, railroad tracks, and rivers. Then, a score is associated with each of these attributes. The score is associated with a larger value as the degree to which the object existing in the area becomes an obstacle when passing through the area becomes larger. Therefore, in this example, the scores are associated on the premise that passing through the area where the building (score: 4) exists is more likely to be an obstacle to passing than passing through the area where the intersection (score: 3) exists. Has been done. The score setting unit 111 sets the score for the area by using the score associated with the attribute in this way. For example, when the score setting unit 111 determines that the attribute of an object is a building, the score setting unit 111 sets the score of the area in which the object exists to "4". When setting a score for an area, when a plurality of objects exist in one area, a value obtained by adding up the scores corresponding to the attributes of these objects is set as the score of the area.

Further, the score setting unit 111 can set the score based on the size of the object. For example, the larger the size of an object, the greater the degree of obstruction when passing around it, so a higher score is set. Even if the overall size of the object is not large, an object that is long in a certain direction (for example, long so that it extends from north to south) also hinders the passage around it, so it is assumed that the object is large in size. , High score is set.

As a specific example of setting the score based on the size of the object, the score can be set based on the number of areas included in the position where the object exists. For example, an object that straddles three areas (or an area where the object exists) is set to have a higher score than an object that straddles two areas (or an area where the object exists). You can also do it. This is because the objects that exist across many areas become obstacles to pass around them.

Further, the score setting based on the size of the object and the score setting based on the above-mentioned object attribute (object type) may be combined. For example, first, the score can be set based on the attributes of the object, and then the set score can be increased or decreased according to the size of the object.

The movement cost calculation unit 112 identifies all the facilities that satisfy the predetermined conditions (for example, the facilities exist within a predetermined distance from the designated position and are of the specified type), and are set by the score setting unit 111. Based on the score, the travel cost from the designated position (first position) to each of the specified one or more facility positions (second position) is calculated.

Specifically, first, the movement cost calculation unit 112 refers to the map information stored in the database 120, and refers to a predetermined distance (for example, the position designated via the operation unit 16) from the designated position (for example, the position designated via the operation unit 16). All facilities of the specified type (genre) (for example, the type specified via the operation unit 16) existing within 200 m) are specified. Then, the movement cost calculation unit 112 calculates the movement cost between the designated position and the specified facility based on the object existing between the designated position and the specified facility. The movement cost can be calculated, for example, by acquiring the score set by the score setting unit 111 for the area existing between the designated position and the specified facility and adding up the scores. it can. As mentioned above, if a score is set for an object, the travel cost is calculated by adding up the scores set for the object that exists between the specified location and the specified facility. .. In addition, when there are a plurality of specified facilities, the movement cost between the designated position and each facility is calculated for all the facilities.

Regarding the method of specifying the facility for calculating the movement cost, at least one of the conditions that the movement cost calculation unit 112 exists within a predetermined distance from the designated position and that it is of the designated type is satisfied. Facilities that meet (predetermined conditions) can be identified to calculate travel costs. In addition, the travel cost calculation unit 112 identifies a facility that satisfies other detailed conditions specified by the user (for example, matching a keyword, matching the service content of the facility matches a desire, etc.). You may.

In the calculation of the movement cost, the area existing between the designated position and the specified facility can be an area existing on a straight line connecting the designated position and the object.

An example of a method of calculating the movement cost by the movement cost calculation unit 112 will be described with reference to FIG. The figure shows a square area obtained by dividing the map into meshes. The area is set, for example, in a size of 3 m square. In this example, the area indicated by "A" indicates the designated area, and the areas indicated by "B1" and "B2" indicate the location of the specified facility. Further, in the other area, the score set by referring to the score associated with each attribute as shown in FIG. 3 is shown. In this example, if there is no object in the area that obstructs passage, a score of "1" is set in the area. At this time, the movement cost between the area "A" and the area "B1" is obtained by adding up the scores set for the areas existing between the areas, and the movement cost is 1 + 1 + 1 + 1 + 1 = It is 5. Similarly, the cost of moving between area "A" and area "B2" is 1 + 10 = 11. Therefore, in this example, on the map, the distance from the area "A" seems to be shorter than the distance to the area "B1", but the movement cost is toward "B2". Is higher than up to "B1".

As described above, the movement cost calculation unit 112 is an object existing between the designated position (first position) and the position of one or more facilities satisfying a predetermined condition (second position). The cost of moving between the first position and each of the one or more second positions is calculated based on.

Returning to the description of FIG. The candidate site selection unit 113 selects one or a plurality of facilities from one or a plurality of facilities specified by the movement cost calculation unit 112 according to the movement cost calculated by the movement cost calculation unit 112. For example, the candidate site selection unit 113 can select the facility when the movement cost from the designated position to the position of the facility is equal to or less than a predetermined value. Alternatively, the candidate site selection unit 113 can select the top predetermined number (for example, the top five) from the one or a plurality of facilities specified by the movement cost calculation unit 112 in ascending order of the movement cost.

Further, the candidate site selection unit 113 is concerned when a predetermined object (for example, a railroad track or a river) that significantly hinders passage exists between the designated position and the facility specified by the movement cost calculation unit 112. You can avoid choosing a facility.

As described above, according to the present embodiment, the candidate site selection unit 113 can select a facility having a low moving cost from the designated position. By presenting the facility selected in this way to the user (for example, displaying it on the display unit 17), the user identifies a facility that is easily accessible, not simply a facility that is close to the designated position (for example, the current location). Can be done. In addition, the movement cost is calculated using a score set according to the object existing on the straight line connecting the designated position to the facility, and the facility is selected based on the movement cost. Such a process has a smaller amount of processing than a process in which a movement route from a designated position to all candidate facilities is searched and then a movement cost is calculated. Therefore, according to the present embodiment, a more appropriate peripheral search can be performed with a lightweight process.

Next, the flow of processing executed in the peripheral search device 10 will be described with reference to FIG. Each processing step included in the processing flow described below can be arbitrarily changed in order or executed in parallel within a range that does not cause a contradiction in the processing contents, and other processing steps can be executed between the processing steps. You may add steps. Further, the steps described as one step for convenience can be executed by being divided into a plurality of steps, while those described as one step can be grasped as one step for convenience. The details of the processing of each processing step will be omitted because they have already been described with reference to FIG.

First, in step S11, the control unit 11 refers to the map information of the database 120 and sets a score for each area according to the objects existing in each area on the map.

In step S12, the control unit 11 refers to the map information stored in the database 120, exists within a predetermined distance (for example, 200 m) from the position designated by the user (via the operation unit 16), and A facility of the type (genre) specified by the user (that is, a facility that satisfies a predetermined condition) is specified.

In step S13, the control unit 11 calculates the movement cost between the designated position and the specified facility based on the object existing between the designated position and the specified facility. The movement cost can be calculated, for example, by acquiring the score set in step S11 for the area existing between the designated position and the specified facility and adding up the scores.

In step S14, the control unit 11 selects one or more facilities from one or more facilities specified by the movement cost calculation unit 112 according to the movement cost calculated in step S13.

As described above, according to the present embodiment, the peripheral search device 10 selects a facility based on the movement cost as described above, and by presenting the facility to the user, the user can use the designated position (for example, for example). It is possible to identify facilities that are easy to reach, not just facilities that are close to the current location. In addition, the movement cost is calculated using the score set according to the object existing between the designated position and the facility. Such a process has a smaller amount of processing than a process in which a movement route from a designated position to all candidate facilities is searched and then a movement cost is calculated. Therefore, according to the present embodiment, a more appropriate peripheral search can be performed with a lightweight process.

The present invention is not limited to the above-described embodiment, and can be implemented in various other forms without departing from the gist of the present invention. The above embodiments are merely exemplary in all respects and are not to be construed as limiting.

10 Peripheral search device, 11 Control unit, 12 CPU, 13 Memory, 14 Communication unit, 15 Storage unit, 16 Operation unit, 17 Display unit

Claims (5)

A storage unit that stores map information divided into a plurality of areas and a score related to the movement cost set for each area.
An operation unit that accepts specifications for the first position and the second position from the user, respectively.
Based on the score set for the area existing between the first position and the second position designated via the operation unit with reference to the storage unit and the map information. A calculation unit that calculates the movement cost between the first position and the second position,
With
In the storage unit, as the score related to the movement cost, the total of the scores corresponding to each object when a plurality of objects exist in the corresponding area, the size of the object existing in the corresponding area, and the object existing in the corresponding area. Memorizes the score set based on at least one of the number of straddling areas when is spanning multiple areas.
Information processing device. This method is implemented in an information processing device equipped with a control unit.
An operation step in which the control unit receives designations for the first position and the second position from the user, respectively.
The first control unit designated by the operation step refers to a storage unit that stores information on a map divided into a plurality of areas and a score related to a movement cost set for each area. And a calculation step of calculating the movement cost between the first position and the second position based on the score set for the area existing between the position and the second position. ,
With
The control unit, as the score related to the movement cost , totals the scores corresponding to each object when a plurality of objects exist in the corresponding area, the size of the object existing in the corresponding area, and the object existing in the corresponding area. Refers to a score set based on at least one of the number of straddling areas when is spanning multiple areas,
Information processing method. Computer,
An operation unit that accepts specifications for the first position and the second position from the user, respectively.
With reference to the storage unit that stores the map information divided into a plurality of areas and the score related to the movement cost set for each area, the first position designated via the operation unit and the first position. Based on the score set for the area existing between the second position
A calculation unit that calculates the movement cost between the first position and the second position,
It is a program to function as
The calculation unit, as the score related to the movement cost , totals the scores corresponding to each object when a plurality of objects exist in the corresponding area, the size of the object existing in the corresponding area, and the object existing in the corresponding area. Refers to a score set based on at least one of the number of straddling areas when is spanning multiple areas,
program. The information processing apparatus according to claim 1, further comprising a setting unit for setting the score in each area. The calculation unit refers to an area existing on a straight line connecting the first position and the second position without performing a route search between the first position and the second position. The information processing apparatus according to claim 1, wherein the movement cost between the first position and the second position is calculated based on the set score.