JP2019101622A - Information processing device, control method, and program - Google Patents

Abstract

To provide a mechanism capable of discriminating similar routes from a plurality of different routes by taking time into consideration.SOLUTION: The information processing device includes storage means for storing positional information about a plurality of points for each route passing the points, and time information about arrivals at or departures from the points, whereby the point position similarity between the different routes is determined on the basis of the positional information about the points. A first point of one of routes between which point position similarity has been determined among the different routes is associated with a second point of the other route, and time information about arrivals at or departures from the points corresponding to the associated first point and second point is displayed.SELECTED DRAWING: Figure 3

Description

  The present invention relates to a technology for analyzing a route traveled by a vehicle or the like.

  Conventionally, detection of dangerous driving and improvement of fuel consumption are often targeted as utilization of telematics data such as travel data acquired regarding a mobile body such as a car. For example, in patent document 1, the method of performing dangerous driving | running | working determination from the data of the speed of a vehicle, and travel distance is devised.

  Another use of telematics data is to make travel routes more efficient. Moving paths can be streamlined by avoiding duplicate use of similar paths. Although various methods have been proposed for searching for similar routes, applications of Dynamic Time Warping (abbr. DTW) have recently been known. For example, Patent Document 2 and Patent Document 3 both search for similar sections using DTW.

JP, 2017-138769, A JP 2012-097603 A JP, 2011-069845, A

  When performing a similar route search for telematics data, it may be desirable not to be determined as a similar route if they are separated in time, even though they are via geographically identical points. For example, in the case where there is a task of regularly going around the same route, it is desirable that the routes are not determined to be similar from the viewpoint of the efficiency of movement. However, in the similar route search using the existing DTW, these routes are determined as similar.

  Therefore, an object of the present invention is to provide a mechanism capable of discriminating similar routes in consideration of time among a plurality of different routes.

  The present invention comprises storage means for storing position information of each point and time information on arrival or departure from the point for each route around a plurality of points, and based on the position information of each point, the different paths Information processing apparatus that determines the similarity in position between points, and between the different paths, the first point and another path of one path whose positions are determined to be similar Display control for displaying time information for arriving at or leaving the corresponding point corresponding to each of the first point and the second point associated with each other. And means.

  According to the present invention, it is possible to provide a mechanism capable of determining similar routes in consideration of time among a plurality of different routes.

It is a system configuration figure showing an example of composition of a similar route search system which is an embodiment of the present invention. It is a block diagram which shows an example of the hardware constitutions applicable to the information processing apparatus which comprises a similar route search system. It is a block diagram showing an example of functional composition of a similar route search system. It is a flow chart which shows an example of similar route search and display processing. It is a flow chart which shows an example of course division processing. It is a flow chart which shows an example of route route search processing. It is a figure explaining the geographical premise used in an example. It is a data block diagram which shows an example of data groups used by a similar route search system. It is a data block diagram which shows an example of data groups used by a similar route search system. It is a figure explaining an outline of correspondence of points. It is a screen image which shows an example of a path | route display screen. It is a screen image which shows an example of a similar path | route display screen. It is a screen image which shows an example of a time consideration similarity path | route display screen. It is a screen image which shows an example of a time consideration similarity path | route display screen.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

  FIG. 1 is a diagram showing an example of a system configuration of a similar route search system according to the present invention.

  The similar route search system 100 is configured such that one or more client terminals 101 (PC, input / output device, etc.) and one or more data servers 102 are connected via the network 103.

  In the present embodiment, telematics data accumulated in the data server 102 is captured in the client terminal 101 and the client terminal 101 executes related processing. However, the data server 102 executes related processing and the client terminal 101 May be configured to receive an operation or input by the user and to display a screen.

  Hereinafter, an example of the hardware configuration of the information processing apparatus applicable to the client terminal 101 and the data server 102 illustrated in FIG. 1 will be described using FIG. 2.

  FIG. 2 is a block diagram showing an example of the hardware configuration of the information processing apparatus applicable to the client terminal 101 and the data server 102. As shown in FIG.

  In FIG. 2, reference numeral 201 denotes a CPU, which centrally controls devices and controllers connected to the system bus 204. Further, the ROM 202 or the external memory 211 is required to realize a BIOS (Basic Input / Output System) which is a control program of the CPU 201, an operating system program (hereinafter referred to as OS), and functions executed by each server or each PC. The various programs described later are stored.

  A RAM 203 functions as a main memory, a work area, and the like of the CPU 201. The CPU 201 loads a program and the like necessary for execution of processing from the ROM 202 or the external memory 211 to the RAM 203, and implements the various operations by executing the loaded program.

  An input controller 205 controls input from a keyboard (KB) 209 and a pointing device such as a mouse (not shown). A video controller 206 controls display on a display such as the display 210. There are various types of displays such as CRTs and liquid crystal displays.

  A memory controller 207 is an external storage device (hard disk (HD)) for storing a boot program, various applications, font data, user files, editing files, various data, etc., a flexible disk (FD), or a PCMCIA card slot. An access to an external memory 211 such as a CF card memory connected via an adapter is controlled.

  A communication I / F controller 208 connects and communicates with an external device via a network (for example, the Internet 104 shown in FIG. 1), and executes communication control processing in the network. For example, communication using TCP / IP is possible.

  Note that the CPU 201 enables display on the display 210 by executing, for example, outline font rasterization processing on a display information area in the RAM 203. In addition, the CPU 201 enables user instruction with a mouse cursor (not shown) or the like on the display 210.

  Various programs to be described later for realizing the present invention are stored in the external memory 211, and are executed by the CPU 201 by being loaded into the RAM 203 as necessary. Furthermore, definition files and various information tables used at the time of execution of the program are also stored in the external memory 211, and a detailed description of these will be described later.

  This is the end of the description of the hardware configuration diagram of FIG.

  Next, a functional block diagram of the similar route search system 100 according to the embodiment of the present invention will be described with reference to FIG.

  The data server 102 includes a telematics data storage unit 321.

  The telematics data storage unit 321 is a database for storing telematics data sequentially transmitted from a target mobile body, or telematics data temporarily stored in a memory or the like and uploaded.

  The client terminal 101 includes a telematics data acquisition unit 311, a similar route detection unit 312, a partially similar route detection unit 313, and a similar route display unit 314.

  The telematics data acquisition unit 311 acquires telematics data from the data server 102. The similar route detection unit 312 detects a similar route based on the route data. The partial similarity route detection unit 313 detects a partial similarity route based on the route data. The similar route display unit 314 displays information of the detected similar route.

  This is the end of the description of the functional block diagram of FIG.

  Here, with reference to FIG. 7, the geographical premise handled in the present embodiment will be described. FIG. 7 shows map information handled in the present embodiment, and black circles indicate points (sampling points) at which telematics data such as a visiting point can be obtained. Each point is represented by x coordinate and y coordinate, but may be represented by longitude and latitude.

  Hereinafter, the flow of processing of the similar route search system 100 in the present embodiment will be described.

  FIG. 4 is a flowchart showing an example of similar route search processing in the similar route search system 100. Each processing step is executed by the CPU 201 of the client terminal 101.

  The present process is started by the user pressing a “similar route search” button on a menu screen (not shown).

  In step S101, telematics data is acquired. Telematics data is acquired from the telematics data storage unit 321 of the data server 102.

  In step S102, telematics data is divided into routes. The route division processing will be described in detail with reference to FIG. Here, route data (FIG. 8 (c)) is output with telematics data (FIG. 8 (a)) and point data (FIG. 8 (b)) as inputs.

  In step S103, a similar route is searched. Similar route search processing will be described in detail with reference to FIG. Here, based on the route data (FIG. 8 (c)) and the point data (FIG. 8 (b)), the DTW value calculation result (FIG. 9 (d)) is output, and the DTW value calculation result is higher than the threshold value. A small route is held as a similar route, and at the same time a point number correspondence result (FIG. 9 (e)) and a time cost distance conversion result (FIG. 9 (f)) are output, and based on this, a time cost addition result (FIG. Output 9 (g).

  In step S104, a similar route is displayed. The output results will be described in detail with reference to FIG. 11, FIG. 12, FIG. 13, and FIG.

  This is the end of the description of the similar route search process of FIG.

  Here, data used in the present embodiment described above will be described with reference to FIG. 8 and FIG.

  FIG. 8 (a) shows an example of telematics data.

  The telematics data 800 is data acquired for each base or a point visited by a vehicle, and has a chassis number 801, a point number 802, an arrival time 803, a departure time 804, and an arrival order 805. The chassis number 801 is an alphanumeric string that identifies the used vehicle. The point number 802 represents a point visited or passed, and corresponds to the point number 811 of the point data 810. The arrival time 803 and the departure time 804 represent the time when the vehicle arrived and departed for that point. The arrival order 805 represents the order in which the vehicles arrived at that point.

  An example of point data is shown in Drawing 8 (b).

  The point data 810 stores data of a base or visited point included in telematics data, and has a point number 811, coordinates X812, and coordinates Y813. The point number 811 is an alphanumeric string that uniquely represents a point. Coordinates X 812 and Y 813 are two-dimensional coordinates of the position of a point, and may be longitude, latitude, or the like.

  An example of route data is shown in FIG.

  The route data 820 is data of a route divided based on the telematics data 800, and has a route number 826 in addition to the telematics data items (801 to 805 correspond to 821 to 825). The route number 826 is a character string identifying a route, and an arrival order 825 is newly assigned to each route number 826. Also, the point number 822 corresponds to the point number 811 of the point data 810.

  FIG. 9D shows an example of the result of the DTW value calculation.

  The DTW value calculation result 900 is calculation result data of a DTW value (similarity) between two paths, and has two path numbers 901 and 902 and a DTW value 903. The two path numbers 901 and 902 represent the combination of paths for which the DTW value is calculated, and the DTW value 903 represents the calculated DTW value.

  An example of a point number matching result is shown in FIG.

  The point number association result 910 is association result data of points held by two routes obtained at the time of calculation of the DTW value, and the association number 911 of each association, a pair of two route numbers and point numbers 912, It has 913 and 914, 915. Two route numbers and point number pairs 912, 913 and 914, 915 indicate the correspondence between points held by the route, and for one route number and point number pair, a plurality of corresponding route numbers and points There may be a set of numbers.

  An example of the time cost distance conversion result is shown in FIG.

  The time cost distance conversion result 920 is result data obtained by converting the time difference to the distance for each correspondence of the point number correspondence result, and in addition to the item of the point number correspondence result, each point number of each route number It has reference times 924 and 927 and a distance 928 of each correspondence. The reference times 924 and 927 are calculated from the telematics data 800 by, for example, taking an intermediate time between arrival time and departure time. The distance 928 represents the temporal distance between two points calculated from the reference time 924 and 927 of each point number.

  FIG. 9 (g) shows an example of the time cost addition result.

  The time cost addition result 930 is data obtained by adding the average value of the distances obtained at 920 to the DTW value obtained at 900, and has the same data items as the DTW value calculation results.

  This is the end of the description of the data used in the present embodiment.

  FIG. 10 shows an image of the point number correspondence result.

  An image 1000 is two route data, and white circles and black circles represent point sequences in each route data. An image 1001 is two route data after association by the DTW, and holds an association result in which each point is represented by a dotted line. In this association, one point may correspond to a plurality of points (1003, 1004) as in 1002.

  As shown in FIG. 10, in the correspondence by the DTW, the temporal difference between the points of the mutual paths is shifted and adjusted, and therefore, the temporal difference is not included in the DTW value calculated as a result. Therefore, the time difference can be taken into consideration by converting the time difference into a distance and adding it to the DTW value in step S103.

  In FIG. 5, the path division processing of telematics data described in step S102 of FIG. 4 will be described in detail. Telematics data holds one or more consecutive data of departure from a site, traveling around a visiting point, and arriving at a site. In this process, a number is given to recognize the route from the base, the visiting point, and the arrival at the base as one route.

  In step S201, loop processing is performed on each of steps S202, S203, S204, S205, S206, S207, and S208. Looping is done for each chassis number. For example, in the case of telematics data shown in FIG. 8A, a loop is performed for the chassis number A and the chassis number B.

  In step S202, an empty route is created.

  In step S203, loop processing is performed on each of steps S204, S205, S206, S207, and S208. A loop is performed for each record. For example, when the loop of the chassis number A is performed in step S201, the loop process from the first record to the eighth record of the telematics data shown in FIG. 8A is performed.

  In step S204, the arrival determination of the base is performed on the record being processed. The arrival judgment of the base is performed by the point. For example, in the first to eighth records of the telematics data in FIG. 8A, since the first record is the departure point, it is determined that the fourth and eighth records having the same point number are arrived.

  In step S205, conditional branching is performed based on the result determined in step S204. If it is determined that the base has arrived, S206 is performed, and if it is not determined that the base has arrived, S208 is performed. For example, in the first to ninth records of the telematics data in FIG. 8A, S206 is performed during processing of the fourth and ninth records, and otherwise S208 is performed. Hereinafter, the explanation will be described from S208 for convenience of the processing order.

  In step S208, the current record is added to the route created in step S202. For example, in the first record of telematics data in FIG. 8A, the empty route is the route of only the first record, and the second record is the route consisting of the first record and the second record.

  In step S206, the route created in the previous steps is saved as route data. At this time, the current record is added to the route data as an arrival record and stored. For example, in the fourth record of telematics data in FIG. 8A, in the route data consisting of the data from the first record to the third record created in the steps up to now, the four records with the departure time as empty and the arrival record Add an eye and save as path number A-1.

  In step S207, an empty route is created as the next route. In addition, in step S208 to be performed later, the current record is added as a departure record with an empty arrival time. For example, in the fourth record of FIG. 8A, a route consisting of only the records in which the arrival time is empty is created by steps S207 and S208.

  Step S209 is the end of the iterative process from step S203.

  Step S210 is the end of the iterative process from step S201.

  This is the end of the description of the route division processing in step S102.

  In FIG. 6, the similar route search process described in step S103 of FIG. 4 will be described in detail.

  In step S301, loop processing is performed for the processing in steps S302 and S303. Loop processing is performed on all combinations of path numbers. For example, in the case of the route data of FIG. 8C, loop processing is performed on route numbers A-1 and A-2, A-1 and B-1, and A-2 and B-1.

  In step S302, the DTW value is calculated using the DTW method. The DTW method is a method devised to adjust the difference between the time and period of two time-series waveforms and find the similarity between the waveforms (the smaller the value is, the higher the similarity). If applied, it is possible to calculate the degree of divergence between the routes by adjusting the difference between the departure time and the arrival time of the points of the two routes and the moving speed. For example, in the case of a loop for a set of path numbers A-1 and A-2, it is possible to obtain a DTW value (similarity) for the set of paths by implementing the standard DTW method. In addition to the DTW method, various methods for calculating the similarity between two-dimensional shapes may be applied to the route drawn on the map, and the similarity between the routes is calculated by correlating the points. Any method can be used.

  In step S301 and step S302, it is possible to obtain the DTW value for the combination of route numbers, and the result of associating the point numbers for the combination of route numbers. An example is shown to FIG.9 (d) and FIG.9 (e).

  In step S303, based on the association result of the point numbers obtained in step S302, the temporal distance for each association is calculated, and the average value thereof is added to the DTW value. For example, in FIG. 9F, when the distance corresponding to a difference of 1 minute of the reference time of the corresponding point number is set to 0.1, the distance at the corresponding number 1 is set to 19. The time cost addition result shown in FIG. 9G is obtained by adding the average value of the distances of the corresponding numbers calculated in this manner to the DTW value calculated in step S302.

  Step S304 is the end of the iterative process from step S301.

  In step S305, a set of path numbers for which the DTW value is less than or equal to the reference value is extracted. For example, in FIG. 9D, when the reference value is 25, only the pair of path numbers A-2 and B-1 is extracted as a similar path.

  In step S306, a set of path numbers for which the DTW value of the time cost addition result is less than or equal to the reference value is extracted. For example, in FIG. 9G, when the reference value is 60, a pair of path numbers A-1 and B-1 and a pair of A-2 and B-1 are extracted as similar paths.

This is the end of the description of the similar route search process of step S103.
The output method of the similar route described in step S104 of FIG. 4 will be described in detail with reference to FIGS. 11, 12, 13 and 14.

  FIG. 11 is a screen image showing an example of the route display screen.

  The route display screen 1100 displays a list of routes that have become targets for similar route search. For example, the routes of route numbers A-1, A-2, and B-1 are color-coded for each route number, or output by changing the shape of a line or the like. By pressing the similar route search result button 1103, a transition is made to the similar route search result screen of FIG.

  FIG. 12 is a screen image showing an example of the similar route search result screen.

  The similar route search result screen 1200 displays information on the similar route extracted in step S305.

  In the similar route search result screen 1200, a route display field 1201 and a route information display field 1202 are displayed. The route display column 1201 displays the route on the map for the similar route, and the route information display column 1202 displays various information on the similar route. If there are a plurality of extracted similar routes, information on another similar route is displayed by pressing the back and forth button 1203. Note that not only the similar route extracted in step S305, but by pressing the back and forth button 1203, information on all routes may be displayed in order of similarity. When the route display button 1204 is pressed, the screen changes to the route display screen of FIG. Further, by pressing the time consideration similar route display button 1205, the screen transits to the time consideration similar route search results screen of FIG. 13 and FIG.

  13 and 14 are screen images showing an example of the time-considered similar route search result screen.

The time consideration similar route search result screen 1300 displays the information of the time consideration similar route extracted in step S306.
The time-considered similar route search result screen 1300 displays a route display field 1301 and a route information display field 1302. In addition to the route on the map for the route including the time consideration similar route, the route display column 1301 displays the association result of each point of each route so that the time difference of the association result can be identified (1303). For example, in 1303, time is taken in the horizontal direction, and time differences between the routes are identified by arranging each point of the route based on the reference time. FIG. 13 shows an example in which two routes depart and arrive relatively close to each other. On the other hand, as shown in 1401 of FIG. 14, when two routes depart and arrive at a time when they are greatly separated, it becomes possible to identify them. Further, in addition to the time chart format, information on the time between corresponding points may be displayed in a tabular format.
The route information display column 1302 displays various information related to the time-considered similar route. What is initially displayed is the degree of deviation in consideration of the time cost calculated in step S305. When there are a plurality of extracted similar routes, information on another time-considered similar route is displayed by pressing the back and forth button 1303. Information on all routes may be displayed in order of similarity by pressing the back and forth button 1303. When the route display button 1304 is pressed, the screen changes to the route display screen of FIG. When the similar route display button 1305 is pressed, the screen changes to the similar route search result screen of FIG.

  According to the above, it becomes possible to determine similar routes taking time into consideration among a plurality of different routes.

  As mentioned above, although one Embodiment was shown, this invention can take the embodiment as a system, an apparatus, a method, a program, a recording medium etc., for example, and, specifically, it is comprised from a some apparatus The present invention may be applied to a single system or to an apparatus comprising a single device.

  Further, the program in the present invention is a program that enables a computer to execute the processing method of the flowchart shown in each drawing, and the storage medium of the present invention stores a program that can execute the processing method in each drawing. The program in the present invention may be a program for each processing method of each device in each drawing.

  As described above, the recording medium recording the program for realizing the functions of the above-described embodiments is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus stores the program stored in the recording medium. It goes without saying that the object of the present invention can be achieved also by reading and executing.

  In this case, the program itself read out from the recording medium realizes the novel function of the present invention, and the recording medium storing the program constitutes the present invention.

  As a recording medium for supplying the program, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, non-volatile memory card, ROM, EEPROM, silicon Disks, solid state drives, etc. can be used.

  Further, by executing the program read by the computer, not only the functions of the above-described embodiment are realized, but also an operating system (OS) or the like running on the computer is actually executed based on the instructions of the program. It goes without saying that the processing is partially or entirely performed, and the processing realizes the functions of the above-described embodiments.

  Furthermore, after the program read from the recording medium is written to the memory provided to the function expansion board inserted into the computer or the function expansion unit connected to the computer, the function expansion board is read based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiment are realized by the processing.

  Further, the present invention may be applied to a system constituted by a plurality of devices or to an apparatus comprising a single device. It goes without saying that the present invention can also be applied to the case where it is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program for achieving the present invention into the system or apparatus, the system or apparatus can receive the effects of the present invention.

  Further, by downloading and reading out a program for achieving the present invention from a server on a network, a database or the like by a communication program, the system or apparatus can receive the effects of the present invention.

  In addition, the structure which combined each embodiment mentioned above and its modification is also contained in this invention altogether.

100 Similar Route Search System 101a / b Client Terminal 102 Data Server 103 Network

Claims (7)

Storage means for storing location information of each location and time information of arrival or departure from the location for each route around a plurality of locations, and based on the location information of each location, between the different routes It is an information processing apparatus which determines the similarity of the position of points,
Matching means for matching the first point of one path whose position is determined to be similar between the different paths with the second point of another path;
An information processing apparatus comprising: display control means for displaying information on time when arrival or departure from the point corresponding to the first point and the second point associated with each other.   The information processing apparatus according to claim 1, wherein the display control means displays time information of the first point and the second point that are associated with each other on a time chart.   Among the different routes, a similarity value is calculated that indicates the similarity between the different routes from the difference in positional information of the first point and the second point associated with each other and the difference in time information. The information processing apparatus according to claim 1, further comprising a degree calculation unit.   The similarity calculation means is an evaluation value indicating the similarity between the different routes by a weighted sum of the difference between the position information of the first point and the second point and the difference of time information associated with each other. The information processing apparatus according to claim 3, wherein:   5. The information processing apparatus according to claim 3, further comprising extraction means for extracting a combination of different routes according to the calculated evaluation value. Storage means for storing location information of each location and time information of arrival or departure from the location for each route around a plurality of locations, and based on the location information of each location, between the different routes It is a control method of an information processing apparatus which determines the similarity of the position of points.
An associating step of associating the first point of one of the paths whose positions are determined to be similar between the different paths with the second point of the other path;
A display control step of displaying information on time when arrival or departure from the point corresponding to the first point and the second point respectively associated with the display control means. Control method of the information processing apparatus. Storage means for storing location information of each location and time information of arrival or departure from the location for each route around a plurality of locations, and based on the location information of each location, between the different routes It is a program that can be executed in an information processing apparatus that determines the similarity between positions of points,
The information processing apparatus
Matching means for matching the first point of one path whose position is determined to be similar between the different paths with the second point of another path;
A program characterized in that the program functions as display control means for displaying time information on arrival or departure from the corresponding points corresponding to the first point and the second point associated with each other.

Images