JP2000205869A - Travel history memory - Google Patents

Abstract

PROBLEM TO BE SOLVED: To execute a suitable record enquiry coincident with actual feeling of driving by regarding two distances including a routing place stopped at in a special case between the continuous two travels as one distance, and updating the travel history data. SOLUTION: An own vehicle position detector 3 detects and outputs a present position of an own vehicle, for example, in a format of the latitude and the longitude or the like. A history acquiring unit 5 regards a distance from a start to a stop of the vehicle as one distance, and stores an own vehicle position, a starting time and an arriving time during its period as travel history data in a memory 7. A routing place judging unit 9 regards the two distances including the routing place stopped at as one distance in the case that a time difference between the arriving time at the first distance and the starting time at the second distance falls within a predetermined time, and instructs the unit 5 to update the history data. A history reading unit 11 retrieves the history data indicated by a user through an input unit 15, and generates history reading information of a format instructed by the user.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a driving history storage device for a vehicle driver to browse driving records stored in the past, and in particular, stores a temporarily passed point in a recognizable state. Running history storage device.

[0002]

2. Description of the Related Art Conventionally, as a travel history storage device, for example, a "navigation device" described in Japanese Patent Application No. 10-157841 has already been filed. In this method, the position of the vehicle at the time of starting and stopping the vehicle and the date and time at that time are stored in a storage medium as travel history data in conjunction with the ON / OFF operation of an ignition switch provided on the vehicle. When a well-known database search method is applied to such a navigation device, "starting from A and B
And how long it took on average to get to the destination, and "Where is the best destination if you departed from time A?" be able to.

[0003] In such a running history storage device,
At any time during driving or waiting, the time and place can be recorded as route information from departure to arrival according to a recording instruction from the user.

[0004]

However, in the conventional travel history storage device, "departure", "via",
The event judgment of "arrival" is used for starting / driving the vehicle (standby)
Since the vehicle is only stopped, for example, when the vehicle is stopped to stop at a convenience store on the way from home to the company, the travel history data includes “home-convenience store” and “convenience store-company”. The process is divided and stored.
As a result, the traveling history data is separated into two strokes when the user visits the convenience store.

However, when browsing the history, the travel history data is displayed separately for each journey, so that it does not match the actual driving feeling of the user at the convenience store.
There was a problem that a proper record inquiry could not be made.

[0006] The present invention has been made in view of the above,
It is an object of the present invention to provide a travel history storage device that can regard two journeys including a stopover at a stop as one journey and can perform an appropriate record inquiry matching driving feeling.

[0007]

According to the first aspect of the present invention,
In order to solve the above-mentioned problems, a vehicle position detecting means for detecting a position of the vehicle and a vehicle detecting means for detecting a position of the vehicle from start to stop.
History acquisition means for acquiring the position of the vehicle, departure time and arrival time during the journey as travel history data, storage means for storing the acquired travel history data, and instruction input means for inputting an instruction by a user And a travel history storage device comprising: a history browsing unit that reads travel history data from the storage unit in response to the instruction and generates history browse information; and a display unit that displays the generated history browse information.
Between two successive passes, the arrival time on the first pass and the second
If the condition that the time difference from the departure time in the journey is within a predetermined time is satisfied, the history acquisition is performed such that the two journeys including the stopped transit point are regarded as one journey and the travel history data is updated. The gist of the invention is to provide a transit point judging means for instructing the means.

According to a second aspect of the present invention, in order to solve the above-mentioned problem, the transit point judging means, when a plurality of continuous elementary journeys are regarded as one according to the condition, determines an arrival point of the elementary journey. When any one of them is the same as the departure point of the first elementary journey, the elementary journey from the first elementary journey to the elementary journey having the same point as the destination and the elementary journey after the elementary journey are regarded as different journeys. Is the gist.

According to a third aspect of the present invention, in order to solve the above-mentioned problem, the stopover determining means is configured so that the departure point of the first strand and the arrival point of the last strand are the same according to the condition. When a plurality of elementary stroke groups are obtained, two consecutive elementary strokes in which the time difference between the arrival time of the first elementary stroke and the departure time of the second elementary stroke of the two consecutive elementary strokes is the longest From the first elementary stroke of the plurality of elementary stroke groups to the first elementary stroke of the selected two elementary strokes, and from the second elementary stroke of the selected two elementary strokes to the plurality of elementary strokes. The gist is that the processes up to the last elementary process of the process group are regarded as two different processes.

According to a fourth aspect of the present invention, in order to solve the above-mentioned problem, the transit point determining means is configured so that the departure point of the first strand and the arrival point of the last strand are the same according to the condition. When a plurality of elementary stroke groups are obtained, it is determined according to the instruction from the instruction input means whether the elementary stroke group is to be regarded as one stroke, or where between the elementary strokes and how many different strokes are to be regarded. The point is to make a decision.

[0011]

According to the first aspect of the present invention, the position of the own vehicle is detected, and the position of the own vehicle and the departure time during one stroke from when the vehicle starts to when the vehicle stops. And the arrival time are acquired and stored as travel history data. Here, if the condition that the time difference between the arrival time in the first process and the departure time in the second process is within a predetermined time period between two consecutive processes, the stopped transit point By updating the travel history data by regarding the two strokes including “1” as the one stroke, the two strokes including the stopped stopover can be regarded as the one stroke, and an appropriate record inquiry matching the driving feeling can be performed.

According to the second aspect of the present invention, when a plurality of continuous elementary journeys are regarded as one according to the above condition, any one of the arrival points of the elementary journey is the departure point of the first elementary journey. When it is the same as above, the route from the first elementary journey to the elementary journey having the same point as the arrival point and the elementary journey after the elementary journey are regarded as different routes, so that the route goes through a point where the stop time is relatively long. Even if the stop time at this transit point is exceptionally short, it can be used as a break in the journey, and the travel history data organized in the form of the journey with the transit point as the departure and arrival point is stored. can do.

According to the third aspect of the present invention, the transit point judging means includes a plurality of continuous elementary journeys in which the departure point of the first elementary journey and the arrival point of the last elementary journey are the same according to the conditions. When a group is obtained, a continuous two-element stroke is selected such that the time difference between the arrival time of the first elementary stroke of the consecutive two-element journey and the departure time of the second elementary stroke is the longest, From the first elementary process of the plurality of elementary processes to the first elementary process of the selected two elementary processes, and from the second elementary process of the selected two elementary processes to the last of the elementary process groups Is regarded as two different strokes, even if each stop time on the way is shorter than a predetermined time in a series of travel history data that returns from the stopover to this stopover point, It is divided into two processes, one that departs from the transit point and one that arrives. It can be.

According to the fourth aspect of the present invention, when a plurality of continuous stroke groups in which the departure point of the first stroke and the arrival point of the last stroke are the same are obtained according to the above conditions, A series of returning from the transit point to the transit point by deciding according to the user's instruction whether the elementary stroke group is regarded as one stroke, or how many different strokes are delimited between the individual strokes. In the traveling history data, when each stop time on the way is shorter than a predetermined time, it can be divided and stored in a process according to a user's instruction.

Further, since the traveling history data stored in this way matches the user's recognition of the waypoints and the action bases, the traveling history data is generated as history browsing information which is easily visible to the user, and is referred to and browsed. be able to.

[0016]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a diagram showing a system configuration of a travel history storage device 1 according to one embodiment of the present invention.

The own vehicle position detecting section 3 detects the current position of the own vehicle in the form of, for example, latitude and longitude by using a GPS sensor, a vehicle speed sensor, a gyro sensor and the like and outputs it. The history acquisition unit 5 regards the period from the start to the stop of the vehicle as one stroke,
The vehicle position, departure time, and arrival time during that time are stored in the storage unit 7 as travel history data. The storage unit 7 has a recording medium on which data can be updated, and stores travel history data.

The transit point judging section 9 judges a transit point from conditions such as departure time and arrival time in each process. History browsing unit 1
1 searches for travel history data designated by a user via the input unit 15 and uses the travel history data to search for the input unit 1.
5 to generate the history browsing information in the format instructed by the user.

The input unit 15 includes an operation button, a keyboard,
It is composed of a touch panel, a voice input device, and the like integrated with the display unit 13, and inputs a user's instruction. The display unit 13
It consists of a liquid crystal monitor, CRT, etc., and displays history browsing information. Note that the history acquisition unit 5, the waypoint determination unit 9, and the history browsing unit 11 may be a computer 17 including a CPU, an internal memory, and the like, and execute various processes according to a control program stored in the internal memory.

Next, referring to FIG. 2, a storage form of the travel history data stored in the storage unit 7 will be described. In this example, the history acquisition unit 5 determines the time and place each time the vehicle starts / stops by departure time, departure place, arrival time,
Arrival locations are stored in the traveling history table of the storage unit 7 in one unit called "stroke".

However, regarding the location, the own vehicle position detecting unit 3
For the obtained vehicle position coordinates at each time point, the history acquisition unit 5 selects a point corresponding to the point data on the storage unit 7 determined separately, and uses the ID numbers as the departure place and the arrival place. It will be recorded in The location data holds the name and specific position coordinates in association with the ID numbers added without duplication for each location.

Further, in the present embodiment, when the history of the vehicle being once stopped and restarted is recorded as travel history data, it is determined that the predetermined condition is satisfied by the processing at the via point determination unit 9 described later. In this case, the event is recorded not as the arrival information of a certain trip and the departure information of the next trip but as one event called "via". Hereinafter, the number of transit events that have occurred between the time of departure and the time of arrival of each process is referred to as the number of transit. The number of vias is recorded on the travel history table, and when the number of vias is one or more, a pointer to a corresponding portion of the via information table which gives specific via information is also described. The transit information table stores, for each transit event, the transit point, arrival time, stop time, and destination.

The transit point is the place where the transit event occurs, and stores the ID number of the point data as well as the departure point and the arrival value. The arrival time is a time at which a transit event occurs, and the stop time indicates a time interval from the occurrence to the end. The destination is a place where the transit event has ended, and is usually the same as the place where the event occurred, so that specific position information is not described. However, there are also cases in which vehicles are carried and transported, such as when using a ferry,
Only in such a case, the end location of the transit event is stored with the ID number of the location data in the same manner as the occurrence location.

A plurality of transit events occurring during the same process are:
The order of occurrence is stored in a continuous area of the route information table. In this case, the via information reference pointer on the traveling history table points to the leading via information. Since the number of vias is also recorded at the same time, it is easy to determine from where to on the via-information table the via-information associated with each process is recorded.

The present invention is not limited only to such a case. The storage form of the travel history data may be a storage form of equivalent information in another expression format. In, the vehicle position information from moment to moment from departure to arrival may be stored together as a traveling locus, and other information may be added.

Next, with reference to a flow chart shown in FIG. 3, a process for acquiring travel history data including such route information will be described. Hereinafter, in order to simplify the description, the i-th process stored in the travel history table is referred to as Di, and its components, departure time, departure location, arrival time, destination, number of routes, and reference to route information The pointers are denoted by Tsi, Psi, Tgi, Ni, and Rfi, respectively.

First, in step S301, the history obtaining unit 5 obtains information on the position and time in accordance with events such as starting and stopping of the vehicle. In the history acquisition unit 5, for example, in conjunction with the ON / OFF operation of the ignition switch of the vehicle, the engine may be started when the engine is started and arrived when the engine is stopped, or after the engine is started. The departure may be when the vehicle first starts running.

In the present invention, the transit event is determined based on the elapsed time from the occurrence of the arrival event to the occurrence of the departure event. However, the present invention is not limited to such a case. The position and time of the vehicle at that time may be acquired as a given transit event based on opening / closing of a vehicle door, input of an instruction by a user, and the like. However, when viewed along the passage of time, once departure information is acquired, the departure event does not occur again until arrival information is acquired, and the event that occurs after arrival information acquisition always departs It is necessary to guarantee the condition of being an event. Therefore, the history acquisition unit 5 starts,
It is assumed that the time t and the place p at which the event occurred are acquired together with the event mode indicating either the route or the arrival.
However, it is assumed that the location p is not the position coordinates itself obtained by the vehicle position detection unit 3, but is converted into an ID number indicating one location in the location data.

Next, in step S302, the history acquisition unit 5 determines the distribution of the subsequent processing based on the event mode, and transfers the processing to the waypoint determination unit 9. First, when the event mode has arrived, the processing after step S303 is executed.

The running history table before the processing shown in step S303 is in a state as shown in the upper part of FIG. That is, in the latest process Di on the table, the arrival time Tgi and the destination Pgi are left blank, and the process pointer SpD indicating the current process to be focused on points to this imperfect process Di.

In this embodiment, when the arrival information is obtained, it is recorded unconditionally as the arrival information, and when the departure information is subsequently obtained, it is considered that a transit event has occurred. Update including By such processing, for example, even after the vehicle is stopped and the supply of the main power to the system is cut off, the execution load by the backup power supply can be minimized.

Therefore, in step S303, the obtained time t and place p are written in the arrival time Tgi and the destination Pgi to complete the process Di. Thereafter, step S304
Then, the process pointer SpD is set to the process Di + which is the next recording destination.
Proceed to 1 and finish the process. The state of the traveling history table at this stage is shown in the lower part of FIG.

Next, the case where the event mode is departure will be described. In this case, it is assumed that the stroke pointer SpD points to the stroke Di + 1, which is a new recording destination, as shown in the upper part of FIG.

First, in step S305, it is checked whether the departure place Psi and the arrival place Pgi are the same for the immediately preceding process Di. If they are the same, the next step S306
Irrespective of the determination in step (1), the travel history data that continues from the step Di must be different from the step Di. Further, since there is a possibility that the process Di itself may be divided into a plurality of processes, the process proceeds to step S310 and the subsequent processes. Departure place Psi
If the destination and the destination Pgi are not the same, step S30
Then, the process proceeds to step S6, where the time difference between the currently obtained departure time t and the immediately preceding arrival time Tgi is compared with the route determination index T0.

In this embodiment, if departure information is continuously obtained within a certain time after the arrival information is obtained,
These two pieces of information are recorded not as belonging to different processes but as passing information included in one process. Therefore, a reference time difference serving as the criterion is given in advance as T0 in accordance with the use form of the vehicle. For example, in a vehicle that transports cargo over a long distance while taking a nap break of about one hour, the nap break can be treated as a transit event by setting the reference time difference T0 to two hours. Also, 3
In the case of a business vehicle that repeatedly visits a customer for about 0 minutes, the reference time difference T0 can be set to 15 minutes to avoid recording each visit as route information.

If the time difference between the departure time t and the arrival time Tgi is equal to or greater than the given reference time difference T0, the departure information obtained this time is recorded as new itinerary information different from Di.

Then, the process proceeds to step S307, where the process D
Write t and p in the departure time Tsi + 1 of i + 1 and the departure place Psi + 1. In addition, since the arrival information of the process Di + 1 in which the process is ended after setting the initial value 0 to the number of vias Ni + 1 is left blank, it is assumed that the process pointer SpD remains unchanged while pointing to the process Di + 1. It looks like the bottom.

If it is determined in step S306 that the reference time difference T0 has not elapsed from the arrival time of the process Di to the time obtained this time, the process proceeds to step S308, where the arrival information of the process Di is changed to the route information and recorded. Do it again.

Here, this processing will be described with reference to the flowchart shown in FIG.

First, in steps S401 and S402,
The transit number Ni of the process Di of interest is checked, and the transit number Ni
Is 0, the transit information pointer SpV is written to the process information reference pointer Rfi of the process Di. SpV is a pointer for managing a free area of the route information table, and points to the head address of the free area as a write destination when writing new route information.

If the transit number Ni is not 0, the transit information reference pointer Rfi refers to the address where the transit information has already been written, and the transit information pointer SpV indicates a position advanced by the transit number Ni therefrom. Should be.

Next, in step S403, the transit information is written into the empty area indicated by the transit information pointer SpV based on the arrival information of the process Di and the information obtained this time. That is, the destination Pgi and the arrival time Tgi of the journey Di are recorded in the waypoint Pv and the arrival time Tv, and the stop time ΔTv
Records the difference between the current acquisition time t and the arrival time Tgi of the journey Di.

Further, in steps S404 and S405, the acquisition position p is written in the transfer destination Pv * of the route information only when the current acquisition position p is different from the destination Pgi of the journey Di. When the transit information is completed in this way, the transit number Ni of the process Di is incremented by 1 in step S406, and the transit information pointer SpV is advanced to the next empty area in step S407. Since the arrival information of the process Di has been changed to the passing information, the arrival place Pgi and the arrival time Tgi are deleted in step S408.

Returning again to FIG. 3, the process proceeds to the next step S309. Since the arrival information of the journey Di has been erased in the preceding process, the next travel history data must be written into the journey Di again. Therefore, in this step, the process pointer SpD indicating the process Di + 1 of the new recording destination is set to the process D
Return to i.

Before executing the processing shown in step S308 and after executing the processing shown in step S309, how the travel history data is rewritten is shown in FIG. 8 in the case where the travel Di has no transit information. FIG. 9 shows a case where the information has the route information.

Next, in step S305, it is determined whether the departure point Psi and the arrival point Pgi of the immediately preceding process Di are the same. Here, when the departure place Psi and the arrival place Pgi are the same, the process proceeds to step S310. Step S310
Then, the stroke Di is divided into k strokes. This subroutine processing will be described in detail with reference to the flowchart shown in FIG.

First, in step S501, the number of passes Ni of the process Di is checked, and if the number of passes Ni is 0, division is impossible, so the process proceeds to step S502, where the number of divisions k is set to 1, and the process is terminated. Otherwise, the process proceeds to step S503,
Further, processing is divided depending on whether or not automatic division is set.

In the present embodiment, the departure place and the arrival place are the same, and the stop times at the waypoints on the way are all the reference time difference T0.
If the driving history data that is less than the maximum is obtained, it can be automatically divided into two routes at the stopover where it has been stopped for the longest time, or divided according to the user's instruction. And Hereinafter, in order to simplify the description, for the Ni pieces of route information included in the process Di,
The j-th transit information is Vj, and the transit points, arrival times, stop times, and destinations of the components are Pvj and T, respectively.
vj, ΔTvj, Pv * j,

Vj = <Pvj, Tvj, ΔTvj, Pv * j>, etc.

First, the case of the automatic division mode will be described from the processing shown in step S504.

Here, Ni stop times ΔTvj (j
= 1,..., Nj), the largest value ΔTvd is selected, and

It is assumed that Vd = <Pvd, Tvd, ΔTvd, Pv * d>. Note that this d is referred to as a division position.

Next, in step S505, the arrival times Tgi + 1 and Pgi + 1 of the process Di + 1, which is the second process after the division of the arrival time Tgi and the destination Pgi of the process Di to be divided, are added to the arrival time Tgi + 1 and the destination Pgi + 1. make a copy.

In step S506, the arrival time Tvd of the route information Vd is used as the arrival information of the first process Di.
, The waypoint Pvd. The departure time Tsi + 1 and the departure place Psi + 1 of the second process are respectively Tvd + ΔTv.
d, Pv * d. However, since the destination Pv * d is not given when it is the same as the waypoint, the waypoint Pvd is given to the departure point Psi + 1 in this case.

Subsequently, in step S507, the process Di
, Di + 1 are updated. Since the route information Di + 1 is provided with the route information Vd + 1 to VNi behind the division position d, the number Ni + 1 is Ni-d. Further, since the route information Di is given the route information V1 to Vd-1 before the division position d, the number Ni is updated to d-1.

Further, in steps S508 to S511, the pass-through information reference pointer of each process is updated. The route information reference pointer Rfi points to V1 before division,
If the coefficient Ni of the process Di is 0, it is deleted.

On the other hand, the passing information reference pointer Rfi + 1 is not given before the division, but if the number Ni + 1 is not 0, the passing information Vd + 1 is given as a reference. When the information on the steps Di and Di + 1 is determined in this way, in step S512, the number of divisions k is set to 2 and the division processing ends.

Next, referring to FIG. 5, given process D
A process of dividing i into an arbitrary number according to a user's instruction will be described.

In the present embodiment, the current route information is shown to the user in a list format, the process is divided into two according to the division position specified by the user, and the first process is determined as a route through the second process. It is assumed that the processing of dividing into two, in which the division position is specified again from the information, is repeated. As another method, for example, a plurality of division positions may be designated at a time.

First, in step S513, an initial value for the repetitive processing is set. That is, the target process number x indicating the process to be divided is the identification number i of the process Di.
Is the initial value. The via information head h holds the identification number j of the head Vj of the via information that is a division candidate at each repetition time, and its initial value is 1. Also, since the number of passes Ni of the process Di before the division is rewritten in the course of the repetition, it is stored in a constant m.

After completing the initial setting, step S514
To prompt the user to input the division position d. The division position must be between the header h and the final route information m.

FIG. 10 shows an example of an input screen displayed on the display unit 13. In the via point list A, based on each via information,
The name of the point, the time of arrival and the time of restart are shown, and the user can select one of them. The selected waypoint is highlighted as shown in FIG.

When the division button B is pressed in this display state, the division position d is instructed to the system. On the other hand, when the end button C is pressed, the division position is not specified, and the system is instructed to terminate the division processing without dividing thereafter.

In the following step S515, it is determined whether or not the end button C has been pressed by the user to issue a division end instruction. If the division position has been designated, the flow proceeds to the repetitive processing (S516 to S522). This iterative process
The first processing is performed in steps S505 to S505 in the automatic division processing.
It is the same as S511.

After dividing the target process Dx into two processes Dx and Dx + 1, in step S523, each parameter is updated. That is, the target process number x is incremented by one to advance the target process by one, and the header h is updated to the identification number d + 1 of the route information Vd + 1 referenced by the process Dx + 1.

In this manner, the division process is repeated until the user instructs the end of the division, and if there is the instruction of the end of the division, the process proceeds to step S524. If m is specified for the division position d and the passing point of Dx + 1 becomes 0, further division is not possible. At this time, in step S523, the header h
Is given m + 1, so that at this time step S5
14. The process may directly proceed to step S524 without returning to step S515.

In step S524, the number of divisions k is set. In other words, the number of steps divided by each repetition increases by one, and the target step number x also increases in step S523, indicating the number of steps whose increments with respect to the initial value of the target step number x have increased. . Therefore, the original process is added to this, and the target process number xi + 1 is given to the division number k. If the user instructs termination without dividing even once, k = 1.

It should be noted that, in the above-mentioned division processing, whether the division is automatic or according to a user's instruction,
The contents of the route information Vd specified as the division position are recorded again as arrival and departure information of each of the divided steps. In addition, the route information Vd is not directly referred to by the reference pointer Rfi of any of the processes after the division, and does not fall within the range of the number of routes Ni from the reference pointer Rfi. Therefore, in order to save the storage area, after division, each Vd may be erased, and Vd + 1 and thereafter may be filled into the free area one by one. In the example shown in FIG. 2, unnecessary route information is thus deleted from the table.

After the division process shown in FIG. 5 is completed as described above, the process returns to FIG.
The process proceeds to the process shown in FIG. Initial process Di by division process
Should be divided into k pieces of Di to Di + k-1.

Therefore, the position of the travel history table where the travel history data is to be written next is the stroke Di + k, and in step S311, the stroke pointer SpD is advanced to the stroke Di + k. In step S312, the departure information t and p obtained this time are written in the departure time Tsi + k and the departure place Psi + k of the process Di + k, and the initial value 0 is set in the number of passes Ni + k. Finish the process. FIG. 11 shows how the travel history data changes before and after the process of dividing a stroke.

In step S302, when the event mode is set to the via mode, the travel pointer SpD indicates the travel time Di with the arrival time Tgi and the destination Pgi left blank, as in the case of the arrival. The processing in step S313 for creating the route information in this case is as shown in FIG.

That is, first, when the number of passes of the process Di is 0, the free space address SpV of the pass information table is set to the reference pointer Rfi. Then, the route information is written into the free area indicated by the free area address SpV. In this case, the transit point Pv and the arrival time Tv include the acquired information p,
i is written as it is. Further, assuming that the vehicle stops only for a short time in this transit event, the stop time ΔTv is set to 0, and the destination Pv * is not recorded. Thereafter, the number of passes Ni of the process Di is incremented by one, and the pass information pointer SpV indicating the empty area is advanced by one. The arrival time Tgi and the destination Pgi of the process Di are left blank, so that the process ends with the process pointer SpD also pointing to the process Di. FIG. 12 shows how the travel history data changes before and after this processing.

A specific example of the traveling history data stored according to the above processing will be described with reference to FIG. In this example, it is assumed that the reference time T0 for the route determination is set to 2 hours. The first step shown is September 4, 1998
It shows that he left home at 7:42 on the day and arrived at the company at 9:07. Next, when the employee leaves the company at 20:16, since sufficient time has passed since the arrival time of 9: 7 on the previous journey, this is regarded as another journey.

As the travel history data is followed over time, the next vehicle to stop is at the Bunkado Bookstore.
The time is 20:39. Here, once recorded as a journey from the company to this bookstore,
He left the bookstore four minutes later. Since this is shorter than the reference time difference T0, a stop at this bookstore is regarded as passing information,
Eventually, the time of arrival at home is recorded as a journey from the company to the home. In this process, it is possible to automatically record that only one location has passed through the Bunkado bookstore.

Next, on September 5th, he left his home at 7:44, arrived at convenience store α at 7:47, and returned to his home 5 minutes later. When this travel history data arrives at home, it is temporarily recorded as one journey from home to home via convenience store α, but since the departure place and the arrival place are the same, the automatic division mode is set. Is automatically split. In this case, it is divided at only one convenience point, a convenience store, and two processes of “home → convenience store α” and “convenience store α → home” are recorded.

[0074] Thereafter, only 46 minutes have passed until the user left his home again at 8:41, but the process up to arrival at 7:55 has been determined by the previous process division. Becomes Like your first home,
If several elementary journeys are continuous for a time shorter than the reference time difference T0, it departs at least a predetermined time from the arrival time of the previous journey. It is supposed to be one. When judging the waypoint that means continuation of the action based on the stop time, the action base estimated in this way is regarded as a break of the process regardless of the length of the stop time, and further, the process from the base to the base is also It can be understood that by appropriately dividing, a series of traveling history data can be collectively stored in the form of “a journey departing from the base” and “a journey reaching the base”.

Lastly, the inquiry and browsing of the compiled traveling history data will be described.

The travel history data holds all travel records together with time information, and it becomes possible to browse the travel history data from various viewpoints by applying a known database search technique.

For example, to check “the destination of freight transportation for the last month”, the departure time and the departure place are input to the condition input section D from the input screen as shown in FIG. When the graph display button E is pressed, the history browsing unit 5 selects a journey that satisfies the given condition from the traveling history table, totals the arrival locations for each point ID, and arrives as shown in FIG. Display a geo frequency graph. At this time, if the above-mentioned transit point determination processing is not performed, a resting place on the way is also displayed as a search result, as shown in FIG.

However, if the reference time difference T0, which is a criterion for a transit point, is appropriately set, a record organized in the form of a journey from the pickup / delivery base to the destination is left.
A desired result can be obtained as shown in FIG.

To check the “time required from home to work”, when the departure place and the arrival place are input on the input screen as shown in FIG. FIG. 16 shows a search of the travel history data from the storage unit 7.
The details of each process and the average required time can be displayed on a screen as shown in Fig. 1.

If the transit point has not been determined, the process to be searched will be only those performed directly from the home to the company, and the number of cases of the process will be limited. It is possible to check the required time from various viewpoints.

[Brief description of the drawings]

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

FIG. 2 is a diagram illustrating an example of a storage form of travel history data.

FIG. 3 is a flowchart illustrating a procedure for acquiring travel history data including a transit point determination process.

FIG. 4 is a flowchart showing a procedure for changing an arrival record to a via record.

FIG. 5 is a flowchart showing a procedure for dividing travel history data recorded as one trip.

FIG. 6 is a diagram illustrating a state in which arrival information is recorded in travel history data.

FIG. 7 is a diagram illustrating a state in which departure information is recorded in travel history data.

FIG. 8 is a diagram illustrating a state in which arrival information of a journey having no route information is changed to route information.

FIG. 9 is a diagram illustrating a state in which arrival information of a journey having route information is changed to route information.

FIG. 10 is a display example of an interface screen for instructing a division position of a process.

FIG. 11 is a diagram illustrating a state in which departure information is recorded after dividing the immediately preceding process into two.

FIG. 12 is a diagram illustrating a state in which transit information is recorded in travel history data.

FIG. 13 is a display example of an interface screen for instructing analysis of a destination frequency of travel history data.

FIG. 14 is a display example of the result of the destination frequency analysis.

FIG. 15 is a display example of an interface screen for instructing analysis of required time of travel history data.

FIG. 16 is a display example of a result of a required time analysis.

[Explanation of symbols]

 3 own vehicle position detection unit 5 history acquisition unit 7 storage unit 9 stopover judgment unit 11 history browsing unit 13 display unit 15 input unit

Continued on the front page F-term (reference) 2C032 HB11 HD16 HD26 2F029 AA02 AB01 AB07 AB09 AC01 AC02 AC04 AC18 3E038 AA07 BA09 BB05 CA02 CA07 CB02 CB05 CB06 DB06 GA03 5H180 AA01 FF04 FF05 FF10 FF22 FF25 FF27 FF27 FF27 FF27 FF27 JJ

Claims (4)

[Claims] 1. self-vehicle position detecting means for detecting the position of a self-vehicle; and acquiring the self-vehicle position, departure time and arrival time during one stroke from the start to the stop of the vehicle as travel history data. History acquisition means for performing the operation, storage means for storing the acquired travel history data, instruction input means for inputting a user's instruction, driving history data read from the storage means in response to the instruction, and history browsing information. In a travel history storage device comprising: a history browsing means for generating; and a display means for displaying the generated history browsing information, the arrival time in the first travel and the second
If the condition that the time difference from the departure time in the journey is within a predetermined time is satisfied, the history acquisition is performed such that the two journeys including the stopped transit point are regarded as one journey and the travel history data is updated. A travel history storage device comprising a transit point determining means for instructing the means. 2. The method according to claim 1, wherein, when a plurality of continuous routes are regarded as one according to the condition, one of the arrival points of the raw route is the same as the departure point of the first raw route. 2. The travel history storage device according to claim 1, wherein when the first travel is performed, a process from the first travel to the bare travel having the same point as the arrival point is regarded as a different travel from the subsequent travel after the raw travel. . 3. A method according to claim 1, wherein said plurality of continuous route groups in which the departure point of the first route and the arrival point of the last route are the same according to the condition are obtained. Selecting a continuous two-stroke in which the time difference between the arrival time of the first strand of the successive two-stroke and the departure time of the second strand is the longest; 2 selected from the elementary process
Up to the first elementary stroke of the elementary journey and from the second elementary stroke of the selected two elementary steps to the last elementary stroke of the plurality of elementary stroke groups are regarded as two different steps. The travel history storage device according to claim 2. 4. A method according to claim 1, wherein: if a plurality of continuous journey groups in which the departure point of the first journey and the arrival point of the last journey are the same according to the condition, 3. The traveling according to claim 2, wherein whether the group of elementary strokes is regarded as one stroke, or how many different steps are regarded as being divided between the elementary strokes is determined according to an instruction from the instruction input means. History storage device.