JP3496555B2 - Travel history storage device - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a traveling history storage device capable of referring to traveling history data stored in the past, and in particular, it is possible to discriminate whether or not the individually stored spots are the same spot. The present invention relates to a traveling history storage device that stores information on a vehicle.

[0002]

2. Description of the Related Art Conventionally, for example, a "navigation device" described in Japanese Patent Application No. 10-146047 has been filed as a traveling history storage device. This is to store the own vehicle position and the date and time in a storage medium as traveling history data, and in particular, the own vehicle position is an ID assigned to each point.
It refers to the content indicated by the number.

Generally, the individual vehicle position output from the vehicle position detecting means does not always accurately represent the actual position. Therefore, in the conventional travel history storage device, in order to handle the same point as the same ID number, the ID number of the point that is a reference candidate is displayed every time the storage process is performed, and the user can display the ID number. It is stored according to the confirmation operation.

As a result, for example, a plurality of facilities that are close to each other can be identified by different ID numbers, or in a facility having a large parking lot, the same ID number can be referred to regardless of the position where the facility is stored. It becomes possible to accurately leave the travel history data along the line.

[0005]

However, the conventional travel history storage device requires a confirmation operation by the user every time the storage process is executed, so that the environment is such that the travel history storage device is installed in a vehicle. Then, the confirmation operation may become troublesome. Further, since there is a time gap between the time when the travel history data is stored and the time when the travel history data is edited, the editing work may be difficult.

The present invention has been made in view of the above,
An object of the present invention is to provide a traveling history storage device capable of improving reliability of automatic storage processing of history recording points, reducing a user's operation load, and facilitating editing operation. .

[0007]

The invention according to claim 1 is
In order to solve the above problems, a travel history storage unit that stores a history recording point and a departure / arrival time as a travel history, an instruction input unit that inputs an instruction from a user, and a desired travel from the travel history storage unit based on the instruction. A travel history storage device for displaying a travel history stored in the past, which comprises a history search means for searching a history and a display means for displaying the searched travel history, and is a reference indicating the position of the facility. A reference point storage means for storing the point, and a history acquisition means for acquiring as a history recording point a reference point within a predetermined constraint distance closest to the own vehicle position among the reference points stored in the reference point storage means The gist of the present invention is to include a reference point management unit that updates the reference point stored in the reference point storage unit in advance according to the update of the traveling history.

In order to solve the above-mentioned problems, the reference point management means determines the position coordinates of a new reference point based on the average coordinates of the history record points within a predetermined distance. Is the gist.

In order to solve the above-mentioned problems, the history acquisition means sets a constraint distance as a criterion for selecting the closest reference point from the history recording points for each reference point. The reference point managing means changes the restriction distance of each reference point based on the distribution of the history record points that refer to the reference point.

In order to solve the above-mentioned problems, the invention according to claim 4 changes the reference point, which is the reference destination of the history recording point selected according to the instruction, to another or a new reference point to change the traveling history. The gist is that the history editing means for updating is provided.

In order to solve the above-mentioned problems, the invention according to claim 5 is such that, when the history editing means selects one history recording point in accordance with the instruction, it is in the vicinity of the selected history recording point. The point is to select other history record points that refer to the same reference point.

[0012]

According to the present invention as set forth in claim 1, a reference point representing the position of the facility is stored, and within the predetermined restriction distance closest to the vehicle position from the stored reference points. By acquiring the reference point of as a history recording point, storing the history recording point and the arrival / departure time as a traveling history, and further updating the reference point stored in advance according to the updating of the traveling history, the reference point can be determined. Can always be updated,
Since the most appropriate reference point can be selected for the given vehicle position, it is possible to improve the reliability of the automatic recording process of the history record points.

According to the second aspect of the present invention, the position coordinates of the new reference point are determined based on the average coordinates of the history recording points within the predetermined distance, so that the vehicle stop position is within a certain range. If there is a uniform variation within the position, the position with the highest accuracy can be set as the reference position.

Further, according to the present invention as set forth in claim 3, a constraint distance serving as a criterion for selecting the closest reference point from the history recording points is held for each reference point, and the reference point is stored. By changing the restriction distance of each reference point based on the distribution of history record points that refer to, the appropriate range of reference points is automatically set according to the palatability of the stop position by each user. You can

According to the present invention of claim 4, the reference history point to which the history record point selected in response to the instruction is changed to another reference point or a new reference point to update the traveling history. Then, the reference point can be appropriately changed according to the preference of the stop position by each user, and the convenience of editing can be improved.

According to the present invention of claim 5, when one history record point is selected in response to an instruction, another history record that refers to the same reference point near the selected history record point is selected. By selecting the recording point as well, even if the history recording points indicating the two nearby facilities are referred to the same reference point by the automatic storage process, the reference point is appropriately divided into two and two different reference points are set. An operation such as giving can be easily performed.

[0017]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. (First Embodiment) FIG. 1 is a diagram showing a system configuration of a traveling history storage device 1 according to a first embodiment of the present invention.

The own vehicle position detector 3 is connected to a GPS sensor, a vehicle speed sensor, a gyro sensor, etc., detects the current position of the own vehicle, and outputs it in a format such as latitude / longitude. The history acquisition unit 5 acquires the vehicle position, the departure time, and the arrival time detected by the vehicle position detection unit 3 as traveling history data and stores the traveling history data in the storage unit 7. The storage unit 7 has a storage medium capable of updating data, stores travel history data and reference point data, and reads out these data as necessary to provide to the computer 21.

The reference point management unit 9 determines the position coordinates of the reference point based on the position coordinates of all the history recording points that refer to the position coordinates of the reference point, and stores and edits new traveling history data. At this time, if the reference to the reference point is changed, the position coordinates of the reference point are recalculated as appropriate and the reference point data stored in the storage unit 7 is updated.

The history editing unit 11 edits the travel history data as needed in accordance with a user's instruction. Specifically, the history editing unit 11 selects a part or all of the history recording points that refer to a certain reference point according to a user's instruction, and refers to the selected history recording point as another reference point or a reference point. The travel history data stored in the storage unit 7 is updated by changing to a new reference point.

The history retrieval unit 13 retrieves the traveling history data from the storage unit 7 according to the condition designated by the user. The display unit 15 is composed of a liquid crystal monitor, a CRT and the like, and displays the progress of editing the travel history data and the search result. The input unit 17 is
The operation buttons, the keyboard, the touch panel integrated with the display unit 15, the voice input device, and the like are used to input an instruction operation by the user.

The computer 21 comprises a CPU, an internal memory, a timer, etc., and in accordance with a processing program stored in the internal memory, the history acquisition section 5, the reference point management section 9,
Software modules such as the history editing unit 11 and the history searching unit 13 are executed.

The in-vehicle navigation system is equipped with a function for automatically storing the travel history data so that the travel history data can be edited or searched interactively with the user on a personal computer installed at home or office. It is also conceivable that the embodiment is carried out and data is exchanged between them using a portable storage medium such as a flash memory card.

Next, the operation of the traveling history storage device 1 shown in FIG. 1 will be described. First, the storage form of the travel history data stored in the storage unit 7 will be described with reference to FIG.

In the example shown in FIG. 2, the history record point is defined as the departure and arrival point of the vehicle, and the time and place of each departure and arrival are stored as traveling history data. However, regarding the location, the reference ID number for one point in the separately stored reference point data list is recorded together with the vehicle position coordinates at each time point obtained by the vehicle position detection unit 3. To do.

It should be noted that each reference point is assigned without overlapping.
It holds the D number, the name, and the coordinate value indicating the position. Even when the same reference point is referred to, the position coordinates of the individual departure and arrival points are not necessarily equal, and the position coordinates of the individual departure and arrival points and the position coordinates of the reference point referred to generally do not match.

The reference point is provided by a system in advance for the convenience of users, such as a public facility such as a station or an affiliated store such as a convenience store, and a personal store such as a home or a work place. There are two types, such as those registered by users themselves such as places and small stores. In the present embodiment, ID numbers of 10,000 or more are added to the system providing points provided by the system in advance, and the user registration points registered by the user are restricted to ID numbers less than 10,000. did.

Next, the operation of automatically acquiring the travel history data by the history acquisition unit 5 will be described with reference to the flowchart shown in FIG. At a predetermined history recording point or vehicle departure point or arrival point, a history acquisition unit 5 issues a history acquisition instruction, and the following processing is executed.

First, in step S301, the coordinates (x, y) of the own vehicle position P at that time are detected by the own vehicle position detection unit 3.
To get As the coordinate value, the longitude / latitude may be directly used, or the normalized coordinate may be used. And step S
At 302, the reference point S having the position coordinates closest to the own vehicle position P is selected from the reference point data stored in the storage unit 7. Its position coordinates are (X, Y). In performing the process, if the distance is calculated for all of a huge number of reference points, the execution speed will be significantly reduced.Therefore, all reference points are classified according to their position coordinates, and the vehicle position You may make it check only the reference point of a corresponding division according to the position coordinate (x, y) of P.

Here, in step S303, it is checked whether or not the distance | P-S | between the vehicle position P and the reference point S is less than or equal to a predetermined constraint distance Do. If the distance is equal to or less than the constraint distance Do, the reference point S is regarded as appropriate as the reference point referred to by the host vehicle position P, and in step S304, the coordinates (x, y) of the time T and the host vehicle position P obtained at the same time,
Further, the ID number of the reference point S is added to the travel history data and stored in the storage unit 7.

Further, since the own vehicle position P is newly added as a departure and arrival point which refers to the reference point S, step S3
At 05, the position coordinates (X, Y) of the reference point S are recalculated, the corresponding points of the reference point data are updated, and the processing is ended. Details of this recalculation processing will be described later.

On the other hand, in step S303 | P-S
If |> Do, the reference point S is the own vehicle position P.
Would not be a valid reference point. Therefore, in step S306, a new reference point Sn is created based on the position coordinates of the vehicle position P and registered in the reference point data. Since the reference point Sn is treated as a user registration point,
An empty number is found from the ID numbers less than 10000, and this is set as Sn. Further, the coordinates (x, y) of the vehicle position P are used as the position coordinates. The name cannot be determined, so leave it unset so that the user can edit it later. As a result, the reference point of the ID number 33 referred to at the last arrival point of the travel history data is
It is registered as shown in FIG.

Then, in step S307, as in step S304, the position coordinates of the time T and the vehicle position P,
And the ID number of the reference point Sn is additionally stored in the travel history data, and the process ends. At this point, the reference point S
Since there is only one departure / arrival point that refers to n, the own vehicle position P, it is not necessary to recalculate the position coordinates of the reference point Sn.

Next, the recalculation processing of the position coordinates of the reference point in step S305 will be described in detail with reference to the recalculation processing subroutine shown in FIG. Let S be the reference point to be recalculated. First, in step S401,
It is checked whether the reference point S is a user registration point, and if the reference point S is a system-provided point, the process ends without recalculation. In addition, in the case of a system-provided point, its position coordinates are also given by the system in advance, and since the value accurately represents the location of the corresponding facility, etc., it is fixed regardless of the reference of the departure and arrival points. You should keep it. Therefore,
In the present embodiment, the position coordinates are recalculated only when the position is the user registration point.

Then, in the case of the user registration point, the process proceeds to step S402, where all the departure and arrival points in the travel history data referring to the reference point S are identified and the departure and arrival point coordinate list Lp of the position coordinates is created. It should be noted that, as the traveling history data increases, this washing-out process becomes enormous, so for example, each reference point holds a list of departure and arrival points that refer to itself, and step S304 shown in FIG.
The list held by the corresponding reference point may be updated when the reference destination of the departure point is added or changed as in S307. In this case, step S402 need only call this held list.

Then, in step S403, the list L
The average value (xm, y) of all coordinates in p
m),

[Equation 1]   Lp = {(x1, y1), (x2, y2), ..., (xn, yn)} ... (1) As

[Equation 2]   (Xm, ym) = {(x1, y1)                   + (X2, y2) + ... + (xn, yn)} / n (2) Becomes

Here, the calculated average coordinate may be used as a new position coordinate of the reference point S, but in the present embodiment, the process further proceeds to step S404, and the calculated average value (xm, ym) is compared. The closest one coordinate (xi, yi) in the list Lp is selected, this is set again as the position coordinate of S, and the processing is ended.

As described above, by giving the actually obtained coordinate values instead of the calculated values, it is possible to avoid giving a position which is different from the actual state to the reference point. Note that FIG.
If it is necessary to classify each reference point according to its position coordinates as described in step S302 shown in FIG.
The division of the reference point S may be changed as necessary.

FIG. 5 shows how the position coordinates of the reference point are recalculated as the number of times of reference from the departure and arrival points increases. Initially, as shown in the left figure, it is assumed that, among the departure and arrival points stored in the travel history data, eight points P1 to P8 refer to the reference point S. The average coordinates of these eight points are at the positions shown in the figure, and among the eight points, P5 is the closest to the reference point S. Therefore, the position coordinate of the reference point S is set equal to P5.

Here, in order to select the reference point S as the reference point for reference when a certain departure point is to be stored as travel history data, the departure point is restricted from the position coordinates of the reference point S by a constraint distance. Must be within Do. Hereinafter, such an area will be referred to as a coverage area of the reference point. The coverage area of the reference point S is, as shown in FIG.
It becomes a circular area having a radius Do centered on P5.

Further, when a new departure / arrival point P9 is to be added to the traveling history data, P9 is within the (old) coverage area of the reference point S as shown in the right diagram of FIG. Is selected. Therefore, when the position coordinates of the reference point S are recalculated according to the procedure shown in FIG. 4, the average coordinates of the nine points P1 to P9 move to the P3 side as shown in the right diagram of FIG. Therefore, P3 closest to the average coordinate
The position coordinate of is newly updated as the position coordinate of the reference point S, and the coverage area also moves to the area centered on P3. It can be seen that by determining the position coordinates of the reference point in this way, the coverage area moves so as to more accurately cover the distribution of the departure and arrival points that is the reference source.

By thus always defining the coverage area of the reference point at an appropriate location, the reliability of automatic storage can be improved. In the case of automatic storage, step S shown in FIG.
As is clear from 306, if an appropriate reference point cannot be found for the given vehicle position coordinates, it is necessary to register a new reference point. At this time, to determine the position coordinate of the reference point There is no choice but to use the given coordinates (x, y).

If the position of the reference point is not recalculated, this value will continue to be used thereafter, but the position where the user first stops the vehicle for a certain destination is
There is no guarantee that it will always be the typical location of the destination. Therefore, if the first stop position is a biased place, it is not possible to leave appropriate travel history data.

On the other hand, if the above-mentioned method is adopted, even if the first stop position is biased, the stop positions for the same point thereafter are distributed in a certain range with a uniform variation. In this case, the position coordinates of the reference point become more accurate as the traveling history data is accumulated and the number of departure and arrival points of the reference source increases. Therefore, when storing the travel history data of the departure and arrival points, the reference point to be referred to can be automatically selected based on the coverage area centered on this position coordinate, and it is possible to always refer to the most appropriate reference point. .

However, the appropriate reference point here is just the validity within a range that can be mechanically determined, and for example, in a situation where a convenience store and a fast food restaurant are adjacent to each other, the user is If there is a chance to go to either of them at any given time, if the parking lots of the two stores are closer than the radius Do of the covered area, the two points cannot be distinguished by the method described above.

Further, when the vehicle is parked in one parking lot and the other store is used, it is difficult to accurately leave the traveling history data unless the user finally asks for the decision. Therefore, a function capable of easily editing which reference point each departure / arrival point corresponds to is required.

Next, the history editing unit 11 that implements this function
The operation of will be described. FIG. 6 shows a display example of a screen used for history editing. As shown in FIG. 6, the traveling history data is displayed in the history list list A in units of "journey" composed of a set of departure and arrival. The name of the reference point referred to by each departure / arrival point is displayed as the position. The user can select one of these steps.

In the example shown in FIG. 6, the processes from "Jitak" to "Untitled" are selected and highlighted. By depressing the departure point edit button B or the arrival point edit button C in this state, the departure point or the arrival point of the selected stroke is selected as the edit target departure / arrival point. Hereinafter, the selected departure and arrival point will be referred to as the own vehicle position P.

When the point P to be edited is selected, the point edit screen shown in FIG. 7 is continuously displayed. In the point name display portion D, the name of the reference point So referred to by P is displayed. The user can change the reference point that P refers to by changing the name of the selected departure and arrival point P.

That is, by changing the reference destination of the departure / arrival point P from the reference point So to Se by giving the name of another reference point Se already registered, or by giving a new name which has not been registered yet. First, create and register a new reference point Sn with this name,
Is changed from the reference point So to Sn. The name input section E displays a list of names of existing reference points at the bottom of the name input section E so that one of them can be selected and input. It should be noted that items within a predetermined distance from the original reference destination So of the origin / destination point P may be displayed in the order closer to So.

Unless the same point name is given to different reference points, it can be easily determined whether the name input in the name input section E is an existing name or a new name. If the name is allowed to be duplicated, the existing name that is duplicated at the time the name is input is found, and the surrounding map is used as a reference to determine whether the input name points to an existing point or not. You may ask. Further, even when a plurality of same names are already shown in the list, each peripheral map may be displayed if necessary.
In any case, by inputting in the name input section E, the departure point P
The new reference destination of can be specified as either an existing reference point or a new reference point.

Further, the edit mode decision button F shown in FIG. 7 designates whether or not the change of the reference destination of the departure / arrival point P is similarly applied to other departure / arrival points referring to the same reference point So. The user always selects one of the three buttons.

The button on the left side represents that the reference destinations of all the departure and arrival points that refer to the reference point So at the same time as the departure and arrival point P are changed all at once. Hereinafter, this will be referred to as a total change mode.

The center button indicates that only the initially designated departure / arrival point P is changed, and the reference destinations of other departure / arrival points are kept at the reference point So. This is called a simple change mode.

The button on the right side indicates that the system automatically selects the departure point and arrival point P and those in the vicinity thereof from the departure and arrival points which refer to the reference point So, and changes the reference destination only for these points. This is called the neighborhood change mode.

After the input operation to the two editing screens shown in FIGS. 6 and 7, the point edit instruction button G is finally pressed to allow the user to give an instruction to edit the point to the system. . At that time, three pieces of information, that is, an edit target departure / arrival point P, a reference destination reference point Se (existing) or Sn (new) of P after editing, and an edit mode are delivered to the system as edit instruction content.

The editing process executed by the history editing unit 11 will be described below with reference to the flowchart shown in FIG. In step S801, the reference point currently referred to by the departure / arrival point P to be edited is So, and the list {Pi | i = 1, 2, ...} Of all the departure and arrival points referencing So is referred to as the list Lo. To do. The departure / arrival point P itself is also one element of the list Lo.

Next, in step S802, the previous editing mode is checked and the following different processing is performed. In the case of the total change mode, the process proceeds to step S803, and the designated departure / arrival point P
Se where the new reference reference point of is already registered
Or whether it is a point Sn to be newly registered.

If the point Se is designated, step S
Proceeding to 804, the reference destination reference point of all the departure and arrival points Pi in the list Lo including the departure and arrival point P is changed to the point Se. Point Se
Since the list Lo is further added to the departure and arrival points that originally referred to, the position coordinates of the point Se are recalculated in step S805 according to the procedure shown in FIG. At this stage, the point So, which is the initial reference destination of the departure / arrival point P, is not referenced by any of the departure / arrival points, so the point So may be deleted from the reference point data unless it is a system-provided point.

Then, in step S806, the point So
If is the user registration point, the point is deleted and the process ends.
Here, FIG. 9 shows how two reference points are merged. It is assumed that the unnamed reference points referred to from the three departure and arrival points P1 to P3 are given as the points So, and it is instructed to change all the reference destinations to the existing “bunkadouten”. The position coordinates of Bunka Shoten before merging were Q3, which was the closest to the average of 4 points of Q1 to Q4, but it was recalculated by adding 3 points of P1 to P3, and the average of 7 points. Is changed to P2 which is the closest to, and the covering area is also changed. After the merging, the original point-undesignated point So is deleted.

If it is determined in step S803 that the new reference point of the departure / arrival point P is not the existing reference point, a new reference point Sn must be created and registered. However, if it is determined in step S807 that the point So is the user registration point, step S807
At 808, the name of So is simply changed to the given new name, and the process ends.

On the other hand, only when the point So is the system-provided point, the process proceeds to step S809 to create a new reference point Sn with the given new name. And step S
At 810, the reference destinations of all the departure and arrival points Pi in the list Lo are changed to the new reference point Sn. Regarding the position coordinates, since the position coordinates of the point So are given by the system, it is not desirable to use them.

Therefore, in step S811, the position coordinates of the new reference point Sn are newly calculated based on the flow chart shown in FIG. 4, and the process ends. FIG. 10 shows a state in which the reference destinations of all departure and arrival points that refer to “Hodogaya Station” provided by the system are changed to “Bunka Doushoten” to be newly created. Hodogaya Station before the change and the new reference point are referenced by the exact same departure and arrival points, but the position coordinates of the former are fixedly given by the system, and the position coordinates of the latter are those calculated according to P1 to P4. Is given. Also, Hodogaya Station will remain without being deleted even after editing.

Next, a case where the edit mode is a single change and a case where the edit mode is a neighborhood change will be described. In the case of the single change mode, in step S812, the departure / arrival point list L that refers to the point So
It is confirmed whether or not there is a starting point other than the editing target starting point P in o. If only the departure / arrival point P is referred to at the point So, this is the same as the total change mode, and therefore the process proceeds to step S803 and the subsequent steps. If it is referred to by a plurality of departure and arrival points, the process advances to step S813, and the list Lo
Each of the elements is divided into two: a list L1 whose reference is changed and a list L2 whose original reference So is unchanged. In the case of a simple change, the element of the list L1 is the departure point P
Only one point is left, and the others are put on the list L2. After being divided into two lists L1 and L2 in this way,
The process moves to step S817 and subsequent steps.

Further, in the case of changing the neighborhood, it is necessary to divide each element Pi of the list Lo into the neighborhood of P and those not. However, if the position coordinates of all the elements Pi are the same, such division cannot be performed. Therefore, in step S814, first of all P i in the list Lo, P
Check if there is a departure and arrival point with a different position coordinate. When all position coordinates are equal to P, all Pi are P
Since it is regarded as the neighborhood of and processed in the same way as the total change mode,
The process proceeds to step S803 and thereafter.

On the other hand, if there is at least one Pi whose position coordinate does not match P in step S814, the process proceeds to step S815, and the departure / arrival point Pf farthest from P in the element Pi is determined. Such a departure / arrival point Pf should be found by all means due to the judgment in the previous stage. Therefore, in step S816, all Pis in the list Lo are divided into two lists depending on whether they are close to the departure point P to be edited or the departure point Pf obtained in the previous stage. Items that are exactly equidistant from both can be placed in either
Here, the former is included. Two lists L1,
L2 includes at least the departure point P and the departure point Pf, respectively, and is not an empty list. Therefore, the one closer to the departure point P is set as the edit target list L1 and the one closer to Pf is set as the non-edit target list L2, and the process proceeds to S817 and subsequent steps.

Here, the state of neighborhood division is shown in FIG.
It is assumed that, out of the six departure and arrival points P1 to P6 that refer to the reference point So, P5 is set as the editing target P and an instruction to change the reference destination in the vicinity is given. In this case, first, P6 is selected as the departure point Pf farthest from the editing target P, and P1 is selected.
~ P6 is divided depending on whether it is close to P5 or close to P6. After all, the edit target list L1 becomes L1 = {P3, P4, P5}, and the non-edit target list L2 becomes L2 = {P1, P2, P6}.

After the two lists L1 and L2 have been settled in both the simple change mode and the neighborhood change mode, the process advances to step S817 to check whether the new reference destination is an existing point or a new point, as in step S803. In the case of the existing point Se, the process proceeds to step S818, and the reference destinations of all the departure and arrival points in the edit target list L1 are changed to Se. Then, in step S819, the position coordinates of the existing point Se are recalculated in consideration of the departure point and the arrival point of the newly added list L1. Further, since the reference to the non-editing target list L2 is left for the original reference point So, the position coordinates are recalculated in step S820, and the process ends.

FIG. 12 shows a state in which the reference destinations of P5 and its vicinity are changed to the existing reference point "Bunka Doushoten" for "Yamamura Yogashiten" which is referred to at the six departure and arrival points of P1 to P6. . P3 to P5 due to neighborhood division
The reference destinations of the three points are changed to Bunga Doshoten, and the position coordinates are recalculated. Although the average coordinates change when only Q1 to Q3 are calculated and when P3 to P5 are added to this, the closest departure and arrival point is Q2 in both cases. Therefore, as a result, there is no change in the position coordinates of Bunka Shoten or the coverage area.

Thus, instead of taking the calculated value as the position coordinate of the reference point, the position coordinate of any one of the departure and arrival points is selected, so that the position coordinate may be finely changed at each recalculation in some cases. Avoiding this, it can be expected that a stable reference point can be obtained to some extent when the traveling history data is accumulated.

In the case of Yamamura yogashiten, the position coordinates are recalculated by the remaining P1, P2 and P6,
The coverage area moves to a position where these three points are properly covered.
On the other hand, if it is determined in step S817 that the new reference destination is not an existing point, in step S821,
A new reference point Sn having the designated new name is created and registered in the reference point list. Next, step S82.
In 2, the reference destination of each departure and arrival point in the list L1 is updated to Sn. Then, in step S823, the position coordinates of Sn are obtained based on these position coordinates. Finally, in step S824, the position coordinates of So are recalculated based on the position coordinates of the respective departure and arrival points of the remaining list L2, and the process ends.

In FIG. 13, one reference source P5 of "Yamamura Yougashiten" referred to by six departure points and its vicinity are referred to by creating a new reference point "Bunkadushouten". Shows how to edit. The position coordinates of each of the reference points are calculated according to the list L1 or L2, respectively, and each of the coverage areas is moving in a direction in which it is properly covered.

As described above, by using the history editing unit 11, the user can first select the departure and arrival points to be edited by comparing with the time information, and by designating the edit mode, the same reference position can be selected. It is possible to collectively edit all the departure and arrival points referring to, or to individually edit each departure and arrival point. In particular, in the situation where two facilities are adjacent to each other, if you want to divide a group of departure and arrival points stored by referring to the same reference point by the automatic storage process to point to each facility, use neighborhood division. These can be distributed to some extent.

As a result, even if the user's memory becomes ambiguous or a large amount of unedited running history data remains with the passage of time from the time of automatic storage to the time of editing, the data is edited. It is possible to provide a history editing function that is easy and convenient.

(Second Embodiment) Next, the second embodiment of the present invention will be described.
The travel history storage device according to the embodiment will be described. The configuration and operation of the travel history storage device according to the second embodiment are substantially the same as those shown in the first embodiment. In the second embodiment, the history acquisition unit 5
As for the reference point data stored in FIG. 14, in addition to the ID number, the name, and the position coordinate, each reference point individually stores the value of the constraint distance that is the radius of the coverage area. . The default value of the constraint distance is set to Do,
This value is given as an initial value to the point automatically stored by the history acquisition unit 5, such as the point with the ID number = 33 shown in the figure.

Further, in the second embodiment, it is assumed that the system providing points are also appropriately updated regarding the constraint distance. Further, the constraint distance may be fixed similarly to the position coordinates.

Next, the processing for updating the value of the constraint distance at each reference point will be described. This constraint distance is determined according to the variation in the distribution of departure and arrival points that refer to each reference point. Therefore, similarly to the position coordinates, when the reference point that is the reference destination of each departure / arrival point is changed and the position coordinates of the reference point are recalculated, the constraint distance is also updated.

The recalculation process will be described with reference to the flowchart shown in FIG. Step S
Steps 1501 to S1504 are almost the same as steps S401 to S404 in the first embodiment shown in FIG. However, this time, even if the target reference point S is the system-provided point, Lp = {P1, P2, ..., Pn} as the position coordinate list Lp of the reference origin / destination point, and M = (xm , Ym) in advance, omitting only the update of the position coordinates of the target reference point S, and proceeds to step S1505.

Then, in step S1505, the variance V and the deviation σ are obtained for Pi = (xi, yi) (i = 1, 2, ..., N) as the position coordinates Pi in the list Lp. Deviation σ is variance V
The variance V is obtained by the following equation.

[0080]

Equation 3] ^{V = {| P1 -M | 2} + | P2 -M | 2 + ... + | Pn -M | 2} / n ... (3) where

[Number 4] ^{| Pi -M | 2 = (xi} -xm) 2 + (yi -ym) is a ² ... (4).

Next, a value obtained by multiplying the obtained deviation σ by a constant k larger than 1 is compared with the default constraint distance Do, and the larger one is set as the constraint distance held individually at the reference point S.

Here, the reason why kσ is used instead of the deviation σ is that the travel history data is acquired by automatic processing.
Since the distances between the departure and arrival points that enter the default coverage area of the reference point S and the position coordinates of S are all less than or equal to the constraint distance Do, even if these deviations are taken, their values are extremely smaller than Do,
This is because it is expected that the constraint distance will not be updated forever.

Therefore, if it is assumed that the origin / destination coordinates for the same point follow a normal distribution, it is known how many times the deviation σ takes to obtain the percent origin / destination within the coverage area. Based on this, for example, k = 2 may be set.
It should be noted that the square root does not have to be calculated if the squares of the distances are compared in all the processes for comparing the distances and the constraint distance of each reference point also holds Do ² or k ² V.

FIG. 16 shows how the coverage area of the reference point changes depending on the distribution of the departure and arrival points of the reference source. When the distribution of departure and arrival points of the reference source becomes large, the coverage area also expands, and when acquiring travel history data automatically, the situation such as a facility with a large parking lot or a place with multiple parking places such as a station It is possible to refer to the same reference point for a wide distribution of departure and arrival points by widening the coverage area according to.

Next, the history acquisition process will be described with reference to the flowchart shown in FIG. First shown in FIG.
Parts that are substantially the same as those in the above embodiment will be omitted, and different parts will be described. Vehicle position coordinates P as a departure / arrival point
When (x, y) is obtained, in step S1702, the history acquisition unit 5 sets the distance | P-Si | between P and each reference point Si.
Is compared with the constraint distance Di that Si individually holds, and when it is less than or equal to Di, Si is stored in the list to create a list Ls of reference points including P in the coverage area.

Here, in step S1703, if the list Ls is empty, it is assumed that an appropriate reference reference point for P has not been obtained, and the procedure proceeds to the new registration procedure of the reference point after step S1707. In this case, the constraint distance of the new point Sn is the default value Do.

On the other hand, if an element point is obtained in the list Ls, the process proceeds to step S1704, and if two or more points are obtained, the one closest to P is the reference point S of P. To do. If only one spot is obtained, this is S. The subsequent storage processing is the same as that of the first embodiment. However, the recalculation processing in step S1706 follows the procedure shown in FIG.

The history editing procedure in the second embodiment is exactly the same as that in the first embodiment described with reference to FIGS. However, the processing of each stage that calculates or recalculates the position coordinates of the reference point follows the flowchart shown in FIG.

By applying a conventionally known database search method to the travel history data acquired or edited in this way, the travel history data can be browsed and used from various viewpoints. It is possible. The travel history data is mainly composed of four elements, that is, departure time, departure location, arrival time, and arrival location. By giving a constraint condition to one or more of these elements, the corresponding travel history data can be obtained. Can be narrowed down and the result can be presented to the user.

For example, by giving conditions for the departure time and the departure place, selecting the corresponding traveling history data, and summing up and arranging the arrival places, the "destination when departing from XX, XX" is sorted by frequency. Can be put together.

FIG. 18 shows a search condition input screen for checking the "delivery destination of the cargo sent from the collection and delivery center in Tokyo in the last month for one month" with respect to the traveling history data acquired for the long-distance transportation vehicle for the cargo. FIG. 19 shows a display example of the search result. Such an analysis of the arrival place frequency can be realized by associating an appropriate point with the detected own vehicle position as in the present embodiment.

[Brief description of drawings]

FIG. 1 is a diagram showing a system configuration of a traveling history storage device 1 according to a first embodiment of the present invention.

FIG. 2 is a diagram showing an example of a storage form of travel history data stored in a storage unit 7.

FIG. 3 is a flowchart showing a history acquisition procedure according to the first embodiment.

FIG. 4 is a flowchart showing a procedure for recalculating position coordinates of a reference point according to the first embodiment.

FIG. 5 is a diagram for explaining changes in position coordinates of a reference point due to addition of history recording points.

FIG. 6 is a display example of an interface screen for designating a history recording point to be edited.

FIG. 7 is a display example of an interface screen for instructing details of edit contents.

FIG. 8 is a flowchart showing a procedure of history edit processing.

FIG. 9 is a diagram for explaining merging of two reference points by a history editing operation.

FIG. 10 is a diagram for explaining replacement with a user registration point by a history editing operation.

FIG. 11 is a diagram for explaining how to selectively divide a point near a designated history recording point.

FIG. 12 is a diagram for explaining partial division / merging of a reference point by a history editing operation.

FIG. 13 is a diagram for explaining division of one reference point by a history editing operation.

FIG. 14 is a diagram showing an example of a storage form of reference point data according to the second embodiment.

FIG. 15 is a flowchart showing a procedure for recalculating the position coordinates of a reference point in the second embodiment.

FIG. 16 is a diagram for explaining a change in the coverage area of a reference point due to the distribution of history recording points.

FIG. 17 is a flowchart showing a history acquisition procedure according to the second embodiment.

FIG. 18 is a display example of an interface screen for inputting search conditions for history search.

FIG. 19 is a diagram showing a display example of a detection result of traveling history data.

[Explanation of symbols]

3 Own vehicle position detector 5 History acquisition section 7 memory 9 reference point management department 11 History editor 13 History search section 15 Display 17 Input section 21 computer

─────────────────────────────────────────────────── ─── Continuation of front page (51) Int.Cl. ⁷ identification code FI G09B 29/00 G09B 29/00 A 29/10 29/10 A (58) Fields investigated (Int.Cl. ⁷ , DB name) G01C 21/00-21/36 G01D 9/00 G07C 5/00 G08G 1/00-1/137 G09B 29/00-29/10

Claims (5)

(57) [Claims] 1. A travel history storage means for storing history record points and departure / arrival times as a travel history, an instruction input means for inputting an instruction from a user, and a desired travel history from the travel history storage means based on the instruction. A travel history storage device for displaying a travel history stored in the past, comprising a history search means for searching and a display means for displaying the searched travel history, wherein a reference point representing the position of the facility is displayed. A reference point storage means for storing, a history acquisition means for acquiring, as a history recording point, a reference point within a predetermined constrained distance closest to the own vehicle position among the reference points stored in the reference point storage means; A travel history storage device comprising: a reference point management unit that updates the reference point stored in the reference point storage unit in advance in response to the update of the history. 2. The traveling history storage device according to claim 1, wherein the reference point management means determines the position coordinates of a new reference point based on the average coordinates of the history recording points within a predetermined distance. . 3. The history acquisition means holds, for each of the reference points, a constraint distance serving as a criterion for selecting a reference point closest to the history recording point, and the reference point management means includes the reference point. Based on the distribution of historical record points that refer to points,
The travel history storage device according to claim 1 or 2, wherein the constraint distance of each reference point is changed. 4. A history edit means for updating a travel history by changing a reference point, which is a reference destination of a history recording point selected according to the instruction, to another reference point or a new reference point. The traveling history storage device according to claim 1. 5. The history editing means, when one history recording point is selected according to the instruction,
5. The traveling history storage device according to claim 4, wherein another history recording point that refers to the same reference point near the selected history recording point is also selected.