JP2002157688A - Business vehicle guiding device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable to execute efficient business activities without depending upon driver's experience by processing history data of a user. SOLUTION: This device is equipped with a position information calculation part 2 which calculates position information on a business vehicle by using positioning data, an input part 6 which inputs changes of the use state of customers and indications of the driver of the business vehicle, a memory 4 which stores use history data of the customers, a control part 3 which indicates a place where business is carried out according to the use history data of the customers, and a display part 5 which displays the indicated place. According to the use history data of the customers stored in the memory 4, the control part 3 indicates the place of the highest frequency of use under specific conditions as a business place and displays it at a display part 5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a guide device for improving the efficiency of business activities in a business vehicle such as a taxi.

[0002]

2. Description of the Related Art Conventionally, in a taxi dispatch system, a current position of each taxi is calculated from a GPS receiver mounted on the taxi, and the position of each taxi is collectively managed by a company, thereby receiving a request from a user. At the time, a taxi which was closest to the passenger and was empty was dispatched.

[0003]

However, in the conventional taxi dispatch system, sales activities are either passive, which is to wait for a request from a passenger, or are often based on the experience of a driver, and are inefficient.

[0004] It is an object of the present invention to provide a business vehicle guidance device capable of performing efficient business activities without relying on a driver's experience by processing the history data of a customer.

[0005]

According to the present invention, there is provided a business vehicle guidance apparatus, comprising: a position information calculation unit for calculating position information of a business vehicle using positioning data; An input unit for inputting an instruction of, a usage history case data storage unit for storing customer usage history data, and a control unit for guiding a place to perform business according to the usage history data, the control unit includes: It is characterized in that a place with the highest use frequency is guided as a business place under predetermined conditions. With this configuration, it is possible to perform efficient sales activities without relying on the driver's experience.

[0006]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a business vehicle guidance device according to an embodiment of the present invention. This business vehicle guidance device includes an antenna 1, a position information calculation unit 2, a control unit 3, a memory 4, a display unit 5,
And an input unit 6.

The antenna 1 receives position information and the like from a GPS satellite or the like, and outputs the position information to a position information calculation unit 6. The position information calculation unit 2 performs a positioning process based on the data received by the antenna 1, calculates the current position of the business vehicle equipped with the business vehicle guidance device, and sends it to the control unit 3. The control unit 3
It is composed of a microcomputer or the like, and controls the entire business vehicle guidance device. The memory 4 stores various tables such as a usage history table and an area table. The input unit 6 detects a change in the use situation (vacant → boarding, boarding → getting off, etc.) or a request from the driver by a switch, a sensor, or the like, and sends it to the control unit 3. When the usage status changes, the control unit 3 registers the status in the usage history table. Further, in response to the guidance request input from the input unit 6, the control unit 3 calculates a location having the highest use probability based on the use history stored in the memory 4. Display 5
Displays the location calculated by the control unit 3.

Next, the operation of the above embodiment will be described. FIG. 2 is a flowchart showing a main process of the control unit 3. This process is executed by a computer program stored in the memory 4. The main process first obtains the current position from the position information calculation unit 2 (step S
1). FIG. 10 shows an embodiment of the current position. This time, as in this example, month / day: 1/15, time: 20:30, longitude: 139 ゜ 41′1
It is assumed that 0 ″ and latitude: 35 ゜ 41′37 ″ are obtained.

Next, it is checked whether or not the use status has changed from vacant to on-board according to the information from the input unit 6 (step S2). If the usage status has changed from empty to boarding, a usage history registration process is executed (step S3). If there is no change, a check is made to see if the vehicle has changed from getting on to empty (step S4). If the usage status has changed, a usage history registration process is executed (step S4). Now, the operation of the use history registration process will be described assuming that the use status has changed from getting on to empty. FIG. 3 shows a usage history registration process. In the use history registration processing, first, the area search counter is set to 0 (step S15).

Next, it is determined whether or not the current position is within the area defined in the area table (step S1).
6). FIG. 14 shows an embodiment of the area table. here,
The area is a rectangle, and is specified by its lower left and upper right positions (latitude / longitude). Area number from the area table:
0, area name: Meiji Jingu Shrine, lower left latitude: 35 ゜ 39'52 ″, lower left longitude: 139 ゜ 41′28 ″, upper right latitude: 35 ゜ 40′40 ″, upper right longitude: 139 ゜ 42′37 ″ Suppose you got it. Since the current position is longitude: 139 41'10 "and latitude: 35 41'37", it is determined that the current position is out of the area.

If it is out of the area, the area search counter is incremented next (step S17). Next, returning to step S16, it is determined whether or not the current position is within the range of the area defined in the area table. From the area table, area number: 1, area name: Nakano, lower left latitude: 35 ゜
40′52 ″, lower left longitude: 139 ゜ 39′24 ″, upper right latitude: 35 ゜ 4
It is assumed that data of 2'22 "and upper right longitude: 139 ゜ 41'27" are obtained. The current position is longitude: 139 ゜ 41′10 ″, latitude: 35 ゜ 41′3
Since it is 7 ″, it is determined that it is within the area.

If it is within the range of the area, the area number and the area name in the area table are used as the area number and the area name for storage (step S18). This time the area number:
1. Area name: Nakano is the area number and area name for storage.

Next, the date, time, usage status, latitude / longitude, zone number, and zone name are stored in the usage history table (step S19). This time: January 15th, Time: 20:30, Usage: Getting off, Latitude / Longitude: 35 ゜ 41'37 ″ / 139 ゜ 41′1
0 ", area number: 1, area name: Nakano are stored in the usage history table, and the usage history registration processing ends.

Next, the guidance process will be described. According to the driver's request from the input unit 6, the business vehicle guidance device according to this embodiment [1] guides the vehicle from the current position, [2] guides the vehicle from the disembarkation location, and [3] uses the frequency of use. There are five types of guidance processing: guidance processing, [4] monthly guidance processing, and [5] calendar guidance processing. Hereinafter, description will be made in order.

[1] Guidance processing from current position When the use history registration processing is completed in step S4, it is checked whether guidance from the current position is requested from the input unit 2 (step S5). When guidance from the current position is requested, a guidance process from the current position is executed (step S6).

FIG. 4 shows a guidance process from the current position. In the guidance process from the current position, first, the value of the history search counter is set to 0 (step S20). Next, it is checked whether the history search counter is at the end of the history table (step S2).
1). If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22).

FIG. 11 shows an embodiment of the use history table. This time from the usage history table, date: 12/24, time: 2
1:00, Usage: Ride, latitude / longitude: 35 ： 39'15 ″ / 13
It is assumed that data of 9 ゜ 42'4 ″, area number: 4, area name: Shibuya Center Street is obtained.

The point-to-point distance from the current position obtained from the position information calculation unit 2 is 4590 [m]. Next, it is determined whether or not the point-to-point distance is within a predetermined range and is not equal to the current position (step S23).

Now, assuming that the predetermined range is 5000 [m], the point-to-point distance obtained earlier is 4590 [m], so it is determined that the distance is within the range. The current position is longitude: 139 ゜ 41′1
From 0 ″, latitude: 35 ゜ 41′37 ″, it is determined that the latitude / longitude in the usage history table is not equal.

If it is determined that the point-to-point distance is within the predetermined range and is not equal to the current position, the contents of the use history table are copied to the destination table (step S24). FIG. 12 shows an embodiment of the destination table. Next, the destination table is rearranged in ascending order by the distance between points (step S25),
Next, the value of the history search counter is incremented (step S26). If it is determined in step S23 that it is not within the range, step S26 is executed as it is.

Next, returning to step S21, it is checked whether the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time from the usage history table, date: 12/24, time: 21:30, usage status:
Getting off, latitude / longitude: 35 37'24 "/ 139 40'37", zone number: 7, zone name: It is assumed that data of Tokyo Metropolitan University has been obtained.
In this case, the point-to-point distance from the current position obtained from the position information calculation unit 2 is 7852 [m]. Next, it is determined whether or not the point-to-point distance is within a predetermined range and is not equal to the current position (step S23). Since the range is now 5000 [m], the distance between the points obtained earlier is determined to be out of the range from 7852 [m]. Next, the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is checked whether or not the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/1, time: 0:10, usage status: boarding, latitude / longitude: 35 / 40'24 "/ 139 / 42'27", area number: 0, area name: Suppose we have data for Meiji Jingu Shrine. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 2979
[M]. Next, it is checked whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S).
twenty three). Now, since the range is 5000 [m], the point-to-point distance obtained earlier is determined to be within the range from 2979 [m]. The current position is longitude: 139 経 度 41′10 ″, latitude: 35
From "41'37", it is determined that the latitude and longitude of the usage history table are not equal.Since it is determined that the location is within the range and not equal to the current position, the contents of the usage history table are then copied to the destination table. (Step S24).
Next, the destination table is rearranged in ascending order to the point-to-point distance (step S25), and then the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is checked whether the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/1, time: 1:40, usage status: getting off, latitude / longitude: 35 ゜ 51'13 "/ 139 ゜ 38'13", area number: 8, area name: Suppose we have data for Urawa. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 18331
[M]. Next, it is checked whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S).
twenty three). Now, since the range is 5000 [m], it is determined that the range is out of the range from the distance between points 18331 [m] obtained earlier. Next, the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is determined whether or not the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/7, time: 19:20, usage status: boarding,
Latitude / longitude: 35 @ 41'15 "/ 139 @ 42'29", area number: 2, area name: Shinjuku 3-chome data. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 2111
[M]. Next, it is determined whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S2).
3). Now, since the range is 5000 [m], the point-to-point distance obtained earlier is determined to be within the range from 2111 [m]. The current position is longitude: 139 ゜ 41′10 ″, latitude: 35 ゜ 4
From 1'37 ", it is determined that the latitude / longitude of the usage history table is not equal. Since it is determined that it is within the range and not equal to the current position, the contents of the usage history table are then copied to the destination table. (Step S24).
Next, the destination table is rearranged in ascending order to the point-to-point distance (step S25), and then the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is checked whether or not the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/7, time: 19:30, usage status: getting off, latitude / longitude: 35 ゜ 41'30 "/ 139 ゜ 42'27", area number: 2, area name: Suppose we have obtained data for Shinjuku 3-chome.
The point-to-point distance from the current position obtained from the position information calculation unit 2 is 19
61 [m]. Next, it is determined whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S2).
3). Now, since the range is 5000 [m], the distance between the points obtained earlier is determined to be within the range from 1961 [m]. The current position is longitude: 139 ゜ 41′10 ″, latitude: 35 ゜ 4
Since it is 1'37 ", it is determined that the latitude / longitude of the usage history table is not equal. Since it is determined that the value is within the range and not equal to the current position, the content of the usage history table is then changed to the destination. Copy to table (Step S2
Four). Then, the destination table is rearranged in ascending order to the point-to-point distance (step S25), and then the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is checked whether the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/9, time: 12:00, usage status: boarding, latitude / longitude: 35 / 39'41 "/ 139 / 42'5", area number: 3, area name: Suppose we have data for Shibuya Public Hall. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 3841
[M]. Next, it is determined whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S2).
3). Now, since the range is 5000 [m], it is determined that the range is within the range from the point distance 3841 [m] obtained earlier. The current position is longitude: 139 ゜ 41′10 ″, latitude: 35 ゜ 4
Since it is 1'37 ", it is determined that the latitude / longitude of the usage history table is not equal. Since it is determined that the value is within the range and not equal to the current position, the content of the usage history table is then changed to the destination. Copy to table (Step S2
Four). Then, the destination table is rearranged in ascending order to the point-to-point distance (step S25), and then the value of the history search counter is incremented (step S26).

Next, returning to step S21, it is checked whether or not the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/10, time: 13:00, usage status:
Getting off, latitude / longitude: 35 / 38'17 "/ 139 / 42'0", zone number 6, zone name: Nakameguro Data is obtained. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 6300
[M]. Next, it is determined whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S2).
3). Since the range is now 5000 [m], it is determined that it is out of the range based on the previously obtained distance between points of 6300 [m], and the value of the history search counter is incremented next (step S26).

Next, returning to step S21, it is checked whether or not the history search counter is at the end of the history table. If the history search counter is not at the end of the history table, the point-to-point distance is calculated from the latitude / longitude of the current position and the latitude / longitude of the usage history table (step S22). This time, from the usage history table, date: 1/15, time: 20:30, usage status:
Getting off, latitude / longitude: 35 @ 41'10 "/ 139 @ 41'10", area number: 1, area name: Nakano data are obtained. The point-to-point distance from the current position obtained from the position information calculation unit 2 is 0
[M]. Next, it is determined whether or not the distance between the points is within a predetermined range and is not equal to the current position (step S2).
3). Now, since the range is 5000 [m], it is determined that the range is within the range from the distance between the points 0 [m] obtained earlier, and the current position is longitude: 139 ゜ 41′10 ″ and latitude: 35 ゜ 41. ′ 3
Since it is 7 ", the latitude / longitude of the usage history table is determined to be the current position. Therefore, the value of the history search counter is incremented next (step S26).

Next, returning to step S21, it is checked whether or not the history search counter is at the end of the history table. At present, since the history search counter is at the end of the history table, a destination table search process is executed (step S2).
7).

FIG. 5 shows a destination table search process. In this process, first, the destination search counter is set to 0 (step S29). Next, the values of the boarding counters are all set to 0 (step S30). FIG. 13 shows an embodiment of the boarding counter.
Next, it is determined whether or not the destination search counter is at the end of the destination table (step S31).

If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S32). An example of the destination table is as shown in FIG. Now, from the destination table:
1/7, Time: 19:30, Usage: Getting off, Latitude / Longitude: 35 ゜
41'30 "/ 139 @ 42'27", area number 2, area name: It is assumed that data of Shinjuku 3-chome has been obtained. Thus, area number 2
Is incremented by the ride counter value corresponding to. Next, the value of the destination search counter is incremented (step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S3).
2). Now, from the destination table, date: 1/7, time: 19: 2
0, Usage status: Ride, latitude / longitude: 35 ゜ 41'15 ″ / 139 ゜
42'29 ", area number 2, area name: It is assumed that data of Shinjuku 3-chome has been obtained, whereby the value of the boarding counter corresponding to area number 2 is incremented. Next, the value of the destination search counter is incremented. (Step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S3).
2). Now, from the destination table, date: 1/1, time: 0: 1
0, Usage: Ride, latitude / longitude: 35 ゜ 40'24 ″ / 139 ゜
42'27 ", area number 0, area name: It is assumed that data of the Meiji Shrine has been obtained, whereby the value of the boarding counter corresponding to the area number 0 is incremented. Next, the value of the destination search counter is incremented ( Step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S3).
2). Now, from the destination table, date: 1/9, time: 12: 0
0, Usage: Ride, latitude / longitude: 35 ゜ 39'41 ″ / 139 ゜
42'5 ", area number 3, area name: It is assumed that data of Shibuya Public Hall is obtained, whereby the value of the car counter corresponding to area number 3 is incremented. Next, the value of the destination search counter is incremented ( Step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S3).
2) Now, from the destination table, date: 12/24, time: 21: 0
0, Usage: Ride, latitude / longitude: 35 ゜ 39'15 ″ / 139 ゜
42'4 ", area number 4, area name: It is assumed that the data of the Shibuya center street is obtained, whereby the value of the boarding counter corresponding to the area number 4 is incremented, and then the value of the destination search counter is incremented. (Step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
At present, since the destination search counter is at the end of the destination table, the area number of the record written at the beginning of the destination table among the area numbers having the largest counter value in the boarding counter is set as the destination area number ( Step S3
Four). In the embodiment shown in FIG. 13, since the area number having the largest counter value is 2, the area number: 2 becomes the destination area number, and the destination table search process ends.

Next, the destination area number is converted into the area name using the area table, and the area name is displayed on the display unit 5 (step S28). An example of the area table is as shown in FIG. Now, since the destination area number is 2, the area name can obtain Shinjuku 3-chome, the display section 5 displays Shinjuku 3-chome, and the guidance process from the current position is completed.

[2] Guidance processing from the disembarkation place Next, it is checked whether or not guidance from the disembarkation place is requested from the input unit 2 (step S7). When the guidance from the getting off location is requested, the guidance process from the getting off location is executed (step S8).

FIG. 6 shows a guidance process from the getting off place. In the guidance process from the disembarkation location, first, history data written at the end of the use history table and whose use status is "get off" is acquired and used as search source data (step S35).
This time: Date: 1/15, Time: 20:30, Usage: Get off, Latitude / Longitude: 35 ゜ 41'37 ”/ 139 ゜ 41'10”, Zone No. 1, Zone Name: Nakano It shall be assumed. Next, the value of the history search counter is set to 0 (step S36). Next, it is determined whether the history search counter is at the end of the usage history table (step S37). If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).

This time, the range of the time difference is set to 60 minutes, and from the usage history table, the date: 12/24, the time: 21:00, the usage status:
Ride, latitude / longitude: 35 / 39'15 "/ 139 / 42'4", area number 4, area name: It is assumed that data of Shibuya Center Street has been obtained. Since the time difference from the search source data is 30 minutes and the usage status is “ride”, it is determined that the time difference is within the predetermined range and the usage status is “ride”. If it is determined that the time difference is within the predetermined range and the usage status is “ride”, the contents of the usage history table are copied to the destination table (step S39). Next, the destination table is rearranged in ascending order by time difference (step S40), and then the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 12/24, time: 21:
30, Usage: getting off, latitude / longitude: 35 ゜ 37'24 ″ / 139
"40'37", zone number 7, zone name: It is assumed that data of Tokyo Metropolitan University has been obtained.The time difference from the search source data is 60 minutes, but the time difference is predetermined because the use status is "get off". It is not determined that the vehicle is within the range and the usage status is “riding”.
Next, the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/1, time: 0: 1
0, Usage: Ride, latitude / longitude: 35 ゜ 40'24 ″ / 139 ゜
42'27 ", zone number 0, zone name: It is assumed that data of Meiji Jingu has been obtained. The time difference from the search source data is 220 minutes, and the time difference is within a predetermined range because the use status is" ride ". And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/1, time: 1: 4
0, Usage status: getting off, latitude / longitude: 35 ゜ 51'13 ″ / 139 ゜
38′13 ″, zone number 8, zone name: Urawa data is obtained. The time difference from the search source data is 310 minutes, and since the use status is “get off”, the time difference is within a predetermined range. In addition, the usage status is not determined to be “riding”. Next, the value of the history search counter is incremented (step S
41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/7, time: 19: 2
0, Usage status: Ride, latitude / longitude: 35 ゜ 41'15 ″ / 139 ゜
42'29 ", area number 2, area name: It is assumed that the data of Shinjuku 3-chome has been obtained. The time difference from the search source data is 50 minutes, and the use status is" riding ", so the time difference is within a predetermined range. And the usage status is determined to be “riding”. If it is determined that the time difference is within the predetermined range and the usage status is “ride”, the contents of the usage history table are copied to the destination table (step S39). Next, the destination table is sorted in ascending order by the time difference (step S40), and then the value of the history search counter is incremented (step S4).
1).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/7, time: 19: 3
0, Usage: getting off, latitude / longitude: 35 ： 41'30 ″ / 139 ゜
42'27 ", area number 2, area name: It is assumed that the data of Shinjuku 3-chome has been obtained. The time difference from the search source data is 60 minutes, and the use status is" get off ", so the time difference is within a predetermined range. And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/9, time: 12: 0
0, Usage: Ride, latitude / longitude: 35 ゜ 39'41 ″ / 139 ゜
42'5 ", area number 3, area name: It is assumed that data of Shibuya Public Hall is obtained. The time difference from the search source data is 510 minutes, and the time difference is within a predetermined range because the use status is" riding ". And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38).
This time, from the usage history table, date: 1/9, time: 13: 0
0, Usage status: getting off, latitude / longitude: 35 ゜ 38'17 ″ / 139 ゜
42′0 ″, zone number 6, zone name: It is assumed that data of Nakameguro is obtained. The time difference from the search source data is 450 minutes,
Since the usage status is “get off”, it is not determined that the time difference is within the predetermined range and the usage status is “get on”. Next, the value of the history search counter is incremented (step S41).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the time of the usage history table and the time of the search source data is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S38). This time, from the usage history table, date: 1/15, time: 20: 3
0, Usage status: getting off, latitude / longitude: 35 ゜ 41'37 ″ / 139 ゜
41′10 ″, zone number 1, zone name: It is assumed that data of Nakano has been obtained. Since the time difference from the search source data is 0 minute and the use status is “get off”, the time difference is within a predetermined range. In addition, the usage status is not determined to be “riding”. Next, the value of the history search counter is incremented (step S4).
1).

Next, returning to step S37, it is determined whether or not the history search counter is at the end of the usage history table. Current,
Since the value of the history search counter is the last in the usage history table, it is determined whether or not the destination table has been created next (step S42). If the destination table has not been created, a message “Destination area could not be searched” is output from the display unit 5 and the guidance process from the getting off location is ended (step S45). If the destination table has been created, step S43 is executed. Since the destination table has been created this time, it is determined that the destination table has been created.

Next, a destination table search process is executed (step S43). The destination table search processing is as shown in FIG. First, the destination search counter is set to 0 (step S29). Next, the values of the boarding counters are all set to 0 (step S30). FIG. 17 shows an embodiment of the boarding counter. Next, it is determined whether or not the destination search counter is at the end of the destination table (step S31).

If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number of the destination table is incremented (step S32). FIG. 16 shows an embodiment of the destination table in the guidance process from the getting off place. Now, from the destination table, date: 12/24, time: 21:00, usage: boarding, latitude / longitude: 35 / 39'15 "/ 139 / 42'4", area number 4, area name: Shibuya Suppose we have data for the center street.
Thereby, the value of the boarding counter corresponding to the zone number 4 is incremented. Next, the value of the destination search counter is incremented (step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S3).
2). Now, from the destination table, date: 1/7, time: 19: 2
0, Usage status: Ride, latitude / longitude: 35 ゜ 41'15 ″ / 139 ゜
42'29 ", area number 2, area name: It is assumed that data of Shinjuku 3-chome has been obtained, whereby the value of the boarding counter corresponding to area number 2 is incremented. Next, the value of the destination search counter is incremented. (Step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
At present, since the destination search counter is at the end of the destination table, the area number of the record written at the beginning of the destination table among the area numbers having the largest counter value in the boarding counter is set as the destination area number ( Step S3
Four). In the embodiment of FIG. 17, the counter value is the largest and the area number written at the beginning of the destination table is 4
Therefore, the area number: 4 becomes the destination area number, and the destination table search processing ends.

Next, using the area table, the destination area number is converted into an area name, and the area name is displayed on the display unit 5 (step S44). Now, since the destination area number is 4, the area name can obtain the Shibuya center street, the display section 5 displays the Shibuya center street, and the guidance process from the getting off place ends.

[3] Guidance Processing Based on Usage Frequency Next, it is determined whether guidance based on usage frequency has been requested from the input unit 2 (step S9). When the guidance based on the use frequency is requested, the guidance process based on the use frequency is executed (step S10).

FIG. 7 shows a guidance process based on the use frequency. In the guidance process based on the use frequency, first, the value of the history search counter is set to 0 (step S46). Next, the values of the boarding counters are all set to 0 (step S47). FIG. 18 shows an embodiment of the boarding counter.

Next, it is determined whether or not the history search counter is at the end of the usage history table (step S48). If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49). Now, from the usage history table, date: 12/24, time: 21:00,
Usage: Ride, latitude / longitude: 35 ゜ 39'15 ″ / 139 ゜ 4
2'4 ", area number 4, area name: It is assumed that data of Shibuya center street is obtained, whereby the value of the boarding counter corresponding to area number 4 is incremented, and then the value of the history search counter is incremented ( Step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 12/24, time: 21: 3
0, Usage status: getting off, latitude / longitude: 35 ゜ 37'24 ″ / 139 ゜
40'37 ", zone number 7, zone name: It is assumed that the data of the Tokyo Metropolitan University has been obtained, whereby the value of the boarding counter corresponding to the zone number 7 is incremented. Next, the value of the history search counter is incremented (step). S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/1, time: 0:10,
Usage: Ride, latitude / longitude: 35 ゜ 40'24 ″ / 139 ゜ 4
2′27 ″, zone number 0, zone name: It is assumed that data of the Meiji Jingu Shrine has been obtained, whereby the value of the boarding counter corresponding to the zone number 0 is incremented. S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/1, time: 1:40,
Usage status: getting off, latitude and longitude: 35 ゜ 51′13 ″ / 139 ゜ 38′1
It is assumed that data of 3 ″, zone number 8, zone name: Urawa is obtained, whereby the value of the boarding counter corresponding to zone number 8 is incremented. Next, the value of the history search counter is incremented (step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/7, time: 19:20,
Usage: Ride, latitude / longitude: 35 ゜ 41'15 ″ / 139 ゜ 4
2'29 ", area number 2, area name: It is assumed that the data of Shinjuku 3-chome has been obtained, whereby the value of the boarding counter corresponding to area number 2 is incremented. Next, the value of the history search counter is incremented ( Step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/7, time: 19:30,
Usage status: getting off, latitude / longitude: 35 ゜ 41′30 ″ / 139 ゜ 4
2'27 ", area number 2, area name: It is assumed that data of Shinjuku 3-chome has been obtained, whereby the value of the boarding counter corresponding to area number 2 is incremented. Next, the value of the history search counter is incremented ( Step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/9, time: 12:00,
Usage status: Ride, latitude / longitude: 35 ゜ 39′41 ″ / 139 ゜ 42 ′
5 ", zone number 3, zone name: It is assumed that data of Shibuya Public Hall has been obtained, whereby the value of the boarding counter corresponding to zone number 3 is incremented. Next, the value of the history search counter is incremented (step S50). .

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/9, time: 13:00,
Usage status: getting off, latitude / longitude: 35 ゜ 38′17 ″ / 139 ゜ 42 ′
0, area number 6, area name: assume that data of Nakameguro is obtained. Thereby, the value of the boarding counter corresponding to the zone number 6 is incremented. Next, the value of the history search counter is incremented (step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, the value of the boarding counter corresponding to the area number in the usage history table is incremented (step S49).
Now, from the usage history table, date: 1/15, time: 20: 3
0, Usage status: getting off, latitude and longitude: 35 ゜ 41'37 ″ / 139 ／ 4
1'10, area number 1, area name: It is assumed that data of Nakano has been obtained. Thereby, the value of the boarding counter corresponding to the zone number 1 is incremented. Next, the value of the history search counter is incremented (step S50).

Next, returning to step S48, it is determined whether or not the history search counter is at the end of the usage history table. Current,
Since the history search counter is at the end of the use history table, the area number of the record written at the end of the use history table among the area numbers having the largest counter value in the boarding counter is set as the destination area number (step S5).
1). In the embodiment of FIG. 18, since the counter value is the largest and the area number written at the end of the use history table is 2, the area number: 2 is the destination area number.

Next, the destination area number is converted into the area name using the area table, and the display section 5 displays the area name (step S52). Now, since the destination area number is 2, the area name can obtain Shinjuku 3-chome, the display section 5 displays Shinjuku 3-chome, and the guidance process based on the use frequency ends.

[4] Guidance Processing by Date Next, it is determined whether or not guidance by date is requested from the input unit 2 (step S11). When guidance by date is requested, a guidance process by date is executed (step S1).
2).

FIG. 7 shows a guidance process based on a date. In the guidance process based on the date, first, a message "Enter a date desired for guidance" is displayed on the display unit 5 (step S53). Next, it is determined whether the date has been input from the input unit 6 (step S54). If the date has not been entered, step S54 is executed again. When the date is input, the value of the history search counter is set to 0 (step S55). In this case, it is assumed that the date is input from the input unit 6 on the 25th.

Next, it is determined whether or not the history search counter is at the end of the usage history table (step S56). If it is determined that the history search counter is not at the end of the usage history table, the time difference (the number of days) between the date of the next usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding”. Is determined (step S5).
7).

This time, the date range is set to two days, and from the use history table, the date and time is 12/24, the time is 21:00, the use status is: boarding, latitude / longitude: 35 / 39'15 "/ 139/42 ' 4 ", area number 4, area name: It is assumed that data of Shibuya Center Street has been obtained. Since the time difference from the input date is one day and the usage status is “get on”, it is determined that the date difference is within the predetermined range and the usage status is “get on”. If it is determined that the difference between the dates falls within the predetermined range and the usage status is “get on”, the contents of the usage history table are copied to the destination table (step S58). Next, the destination table is sorted in ascending order according to the date difference (step S59), and then the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 12/24, time: 21: 3
0, Usage status: getting off, latitude / longitude: 35 ゜ 37'24 ″ / 139 ゜
40'37 ", area number 7, area name: It is assumed that data of Tokyo Metropolitan University has been obtained. The time difference from the search source data is one day, but since the use status is" get off ", the time difference is within a predetermined range. And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/1, time: 0:10,
Usage: Ride, latitude / longitude: 35 / 40'24 "/ 139 / 42'2
7 ”, zone number 0, zone name: It is assumed that data of Meiji Jingu has been obtained. The time difference from the search source data is 24 days, and the usage status is“ ride ”, so the time difference is within the predetermined range and The usage status is not determined to be “ride”. Next, the value of the history search counter is incremented (step S6).
0).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/1, time: 1:40,
Usage status: getting off, latitude and longitude: 35 ゜ 51′13 ″ / 139 ゜ 38′1
3 ”, zone number 8, zone name: Urawa data is obtained. The time difference from the search source data is 24 days, and the usage status is“ get off ”. The situation is not determined to be "ride". Next, the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/7, time: 19:20,
Usage: Ride, latitude / longitude: 35 ゜ 41'15 ″ / 139 ゜ 4
2'29 ", zone number 2, zone name: Shinjuku 3-chome data is obtained. The time difference from the search source data is 18 days. And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/7, time: 19:30,
Usage status: getting off, latitude / longitude: 35 ゜ 41′30 ″ / 139 ゜ 4
2'27 ", area number 2, area name: It is assumed that the data of Shinjuku 3-chome has been obtained. The time difference from the search source data is 18 days, and the use status is" get off ", so the time difference is within a predetermined range. And the usage status is not determined to be “riding”.
Next, the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/9, time: 12:00,
Usage: Ride, latitude / longitude: 35 ゜ 39'41 ″ / 139 ゜ 4
2'5 ", area number 3, area name: It is assumed that data of Shibuya Public Hall was obtained. The time difference from the search source data is 16 days,
Since the usage status is “ride”, it is not determined that the time difference is within the predetermined range and the usage status is “ride”. Next, the value of the history search counter is incremented (step S60).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/9, time: 13:00,
Usage status: getting off, latitude and longitude: 35 ゜ 38'17 ″ / 139 ／ 4
2'0 ", zone number 6, zone name: It is assumed that data of Nakameguro is obtained. The time difference from the search source data is 16 days, and the use status is" get off ", so the time difference is within a predetermined range. And the usage status is not determined to be “riding”. Next, the value of the history search counter is incremented (step S6).
0).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. If it is determined that the history search counter is not at the end of the usage history table, then the time difference between the date of the usage history table and the input date is within a predetermined range, and the usage status of the usage history table is “boarding” or not. Is determined (step S57). This time, from the usage history table, date: 1/15, time: 20: 3
0, Usage status: getting off, latitude and longitude: 35 ゜ 41'37 ″ / 139 ／ 4
1'10 ", zone number 1, zone name: Nakano data is obtained. The time difference from the search source data is 10 days, and the usage status is" get off ", so the time difference is within a predetermined range. In addition, the usage status is not determined to be “riding”. Next, the value of the history search counter is incremented (step S6).
0).

Next, returning to step S56, it is determined whether or not the history search counter is at the end of the usage history table. Current,
Since the value of the history search counter is the last in the usage history table, it is determined whether or not the destination table has been created next (step S61). If the destination table has not been created, a message "Destination area could not be searched" is output from the display unit 5 and the guidance process based on the date is ended (step S64). If the destination table has been created, step S62 is executed. Since the destination table has been created this time, it is determined that the destination table has been created.

Next, a destination table search process is executed (step S62). The destination table search processing is as shown in FIG. First, the destination search counter is set to 0 (step S29). Next, the values of the boarding counters are all set to 0 (step S30). FIG. 20 shows an embodiment of the boarding counter. Next, it is determined whether or not the destination search counter is at the end of the destination table (step S31).

If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number of the destination table is incremented (step S32). FIG. 19 shows an example of the destination table in the guidance process based on the date. Now, from the destination table, date: 12/24, time: 21:00, usage: boarding, latitude / longitude: 35 / 39'15 "/ 139 / 42'4", area number 4, area name: Shibuya Suppose we have data for the center street. Thereby, the value of the boarding counter corresponding to the zone number 4 is incremented. Next, the value of the destination search counter is incremented (step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
At present, since the destination search counter is at the end of the destination table, the area number of the record written at the beginning of the destination table among the area numbers having the largest counter value in the boarding counter is set as the destination area number ( Step S3
Four). In the embodiment of FIG. 20, since the area number written at the beginning of the destination table having the largest counter value is 4, the area number: 4 becomes the destination area number, and the destination table search processing ends.

Next, the destination area number is converted into the area name using the area table, and the area name is displayed on the display unit 5 (step S63). Now, since the destination area number is 4, the area name can obtain Shibuya Center Street, the display section 5 displays the Shibuya Center Street, and the date-based guidance processing ends.

[5] Calendar Guidance Processing Next, it is determined whether or not a calendar guidance has been requested from the input unit 2 (step S13). When the guidance by the calendar is requested, the guidance processing by the calendar is executed (step S14).

FIG. 9 shows a guidance process by a calendar. In the guidance process using the calendar, first, the value of the calendar search counter is set to 0 (step S65). Next, it is determined whether the calendar search counter is at the end of the calendar table (step S66).

If it is determined that the calendar search counter is not at the end of the calendar table, the date of the calendar table matches today's date, and the current time is within the range between the start time and the end time of the calendar table. It is determined whether or not it is (step S67). FIG. 15 shows an embodiment of the calendar table. Now, from the calendar table:
1/1, start time: 23:00, end time: 5:00, destination latitude
Longitude: 35 ゜ 39′57 ″ / 139 ゜ 42′19 ″, destination area candidate name: Meiji Jingu, area number 0, event: Hatsumode From today's date: 1/15 and current time: 20:30, it is determined that the month and day in the calendar table match today's date, and that the current time is not within the range of the start time and end time in the calendar table Is done. Next, the calendar search counter is incremented (step S71).

Next, returning to step S66, it is determined whether or not the calendar search counter is at the end of the calendar table. If it is determined that the calendar search counter is not at the end of the calendar table, it is determined whether the date in the calendar table matches today's date and whether the current time is within the range between the start time and the end time in the calendar table. A determination is made (step S67). Now, from the calendar table, date: 1/1, start time: 23:00, end time: 5:00, destination latitude / longitude: 35 ゜ 31'55 ″ / 139 ゜ 43′53 ″, destination area candidate name : Daishi Kawasaki, Area No. 10, Event: Suppose we got data of Hatsumode. Today's date: 1/15, current time: 20:30,
It is determined that the date in the calendar table matches today's date, and that the current time does not fall within the range of the start time and end time in the calendar table. Next, the calendar search counter is incremented (step S71).

Next, returning to step S66, it is determined whether or not the calendar search counter is at the end of the calendar table. If it is determined that the calendar search counter is not at the end of the calendar table, it is determined whether the date in the calendar table matches today's date and whether the current time is within the range between the start time and the end time of the calendar table. A determination is made (step S67). Now, from the calendar table, month / date: 1/15, start time: 12:00, end time: 17:00, destination latitude / longitude: 35 / 39'41 "/ 139 / 42'6", destination area candidate name : Shibuya Public Hall, Area No. 3, Event: It is assumed that data for the coming-of-age ceremony has been obtained. From today's date: 1/15 and current time: 20:30, it is determined that the month and day in the calendar table match today's date, and that the current time is not within the range of the start time and end time in the calendar table Is done. Next, the calendar search counter is incremented (step S71).

Next, returning to step S66, it is determined whether or not the calendar search counter is at the end of the calendar table. If it is determined that the calendar search counter is not at the end of the calendar table, it is determined whether the date in the calendar table matches today's date and whether the current time is within the start time and end time of the calendar table. (Step S67). Now, from the calendar table:
1/15, start time: 20:00, end time: 23:00, destination latitude / longitude: 35 ゜ 41′30 ″ / 139 ゜ 44′8 ″, destination area candidate name: Kitanomaru Park, area number 9, Event: Suppose we got concert data. Today's date: 1/15, current time: 20:30
Thus, the date in the calendar table matches today's date,
In addition, it is determined that the current time is within the range between the start time and the end time of the calendar table.

Next, from the contents of the calendar table,
The values of the start time, latitude and longitude, area number, and area name are stored in the destination table. The use status is "unknown" (step S68). Next, the point-to-point distance is obtained from the latitude / longitude of the current position and the latitude / longitude of the destination table (step S6).
9). Now, the longitude of the current position: 139 ゜ 41′10 ″, latitude: 35
"41'37" and latitude / longitude stored in the destination table: 35
The distance between the points is 6026 [m] from ゜ 41'30 ”/ 139 ゜ 44'8”
Becomes Next, the destination table is rearranged in ascending order to the point-to-point distance (step S70). Next, the calendar search counter is incremented (step S71).

Next, returning to step S66, it is determined whether or not the calendar search counter is at the end of the calendar table. Since the value of the calendar search counter is currently the last in the calendar table, it is determined whether or not the destination table has been created next (step S72). If the destination table has not been created, a message “Destination area could not be searched” is output from the display unit 5 and the calendar guidance process ends (step S75). If the destination table has been created, step S73 is executed. Since the destination table has been created this time, it is determined that the destination table has been created.

As described above, the processes of steps S66 to S71 are repeated, and thereafter, the destination table is rearranged in the order of proximity to the current location, so that even if a plurality of events are registered at the same date and time, the event closer to the current location is given priority. Can be calculated.

Next, a destination table search process is executed (step S73). The destination table search processing is as shown in FIG. First, the destination search counter is set to 0 (step S29). Next, the values of the boarding counters are all set to 0 (step S30). FIG. 22 shows an embodiment of the boarding counter. Next, it is determined whether or not the destination search counter is at the end of the destination table (step S31).

If it is determined that the destination search counter is not at the end of the destination table, the value of the boarding counter corresponding to the area number in the destination table is incremented (step S32). FIG. 21 shows an embodiment of the destination table in the guidance processing by the calendar. Now, from the destination table, date: 1/15, time: 20:00, usage status: unknown,
Latitude / longitude: 35 41'30 "/ 139 45'8", area number 9, area name: Kitanomaru Park data is assumed. Thus, the value of the boarding counter corresponding to the zone number 9 is incremented. Next, the value of the destination search counter is incremented (step S33).

Next, returning to step S31, it is determined whether or not the destination search counter is at the end of the destination table.
At present, since the destination search counter is at the end of the destination table, the area number of the record written at the beginning of the destination table among the area numbers having the largest counter value in the boarding counter is set as the destination area number ( Step S3
Four). In the embodiment of FIG. 22, since the area number written at the beginning of the destination table having the largest counter value is 9, the area number: 9 becomes the destination area number, and the destination table search processing ends.

Next, using the area table, the destination area number is converted to an area name, and the area name is displayed on the display unit 5 (step S74). Now, since the destination zone number is 9, the zone name: Kitanomaru Park can be obtained, and the display unit 5 displays the Kitanomaru Park, ends the date guidance process, and returns to the main process.

In the main process, the position information is acquired again from the position information calculation section 2 (step S1). Subsequent processing repeats what has been described so far.

As described above, according to the sales guidance apparatus of the present invention, the position information calculation unit for calculating the position information of the business vehicle using the positioning data, the change in the use situation of the customer and the change of the business vehicle An input unit for inputting an instruction of a driving car, a usage history data storage unit for storing customer usage history data, and a control unit for guiding a place of business based on the usage history data, wherein the control unit By guiding a location most frequently used as a business location under a predetermined condition, efficient business activities can be performed without relying on the driver's experience.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention;

FIG. 2 is a flowchart of a main process according to the embodiment of the present invention;

FIG. 3 is a flowchart of a usage history registration process according to the embodiment of the present invention;

FIG. 4 is a flowchart of a guidance process from a current position according to the embodiment of the present invention;

FIG. 5 is a flowchart of a destination table search process according to the embodiment of the present invention;

FIG. 6 is a flowchart of a guidance process from a getting-off location according to the embodiment of the present invention;

FIG. 7 is a flowchart of a guidance process based on use frequency according to the embodiment of the present invention;

FIG. 8 is a flowchart of a guidance process based on a date input according to the embodiment of the present invention;

FIG. 9 is a flowchart of guidance processing by a calendar according to the embodiment of the present invention;

FIG. 10 is a diagram showing an example of a current position according to the embodiment of the present invention;

FIG. 11 is a diagram showing an example of a use history table according to the embodiment of the present invention;

FIG. 12 is a diagram showing an example of a destination table used for guidance processing from a current position according to the embodiment of the present invention;

FIG. 13 is a diagram showing an example of a boarding counter used for guidance processing from a current position according to the embodiment of the present invention;

FIG. 14 is a diagram showing an example of an area table according to the embodiment of the present invention;

FIG. 15 is a diagram showing an example of a calendar table according to the embodiment of the present invention;

FIG. 16 is a diagram showing an example of a destination table used for a guidance process from a getting-off location in the embodiment of the present invention;

FIG. 17 is a diagram showing an example of a boarding counter used for a guidance process from a getting-off location according to the embodiment of the present invention;

FIG. 18 is a diagram showing an example of a boarding counter used for guidance processing based on use frequency according to the embodiment of the present invention;

FIG. 19 is a diagram showing an example of a destination table used for date-based guidance processing according to the embodiment of the present invention;

FIG. 20 is a diagram showing an example of a boarding counter used for date-based guidance processing according to the embodiment of the present invention;

FIG. 21 is a diagram showing an example of a destination table used for guidance processing by a calendar according to the embodiment of the present invention;

FIG. 22 is a diagram showing an example of a boarding counter used for guidance processing by a calendar according to an embodiment of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Antenna 2 Position information calculation part 3 Memory 4 Control part 5 Display part 6 Input part

Claims (6)

[Claims] 1. A position information calculation unit for calculating position information of a business vehicle using positioning data, an input unit for inputting a change in the use status of a customer and an instruction of a driving vehicle of the business vehicle, and a usage history of the customer A usage history data storage unit that stores data; and a control unit that guides a business location based on the usage history data, wherein the control unit operates a location with the highest usage frequency under a predetermined condition. A business vehicle guidance device that provides guidance as a place. 2. The business vehicle guidance device according to claim 1, wherein the guidance is provided as a business location by taking into account information on a location that is closest to the current location and that is used most frequently. 3. The business vehicle guidance device according to claim 1, wherein the guidance is provided as a business location by taking into account information on a location with the highest use frequency within a predetermined time range from the time when the customer gets off. 4. The business vehicle guidance device according to claim 1, wherein the guidance is provided as a business location by taking into account information on a location which is closest to the current date and time and has the highest use frequency. 5. The business vehicle guidance device according to claim 1, wherein a location closest to the input date and a location with the highest use frequency is guided as a business location. 6. The business according to claim 1, wherein a location closest to the current date and time and having the highest frequency of use is guided as a business location based on the contents of the predetermined storage in which the date and time are stored. Car guidance device.