WO2004034725A1 - 情報取得方法、情報提供方法、および情報取得装置 - Google Patents
情報取得方法、情報提供方法、および情報取得装置 Download PDFInfo
- Publication number
- WO2004034725A1 WO2004034725A1 PCT/JP2003/013092 JP0313092W WO2004034725A1 WO 2004034725 A1 WO2004034725 A1 WO 2004034725A1 JP 0313092 W JP0313092 W JP 0313092W WO 2004034725 A1 WO2004034725 A1 WO 2004034725A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- destination
- presentation
- predicted
- unit
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
- G08G1/096811—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3484—Personalized, e.g. from learned user behaviour or user-defined profiles
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3605—Destination input or retrieval
- G01C21/3617—Destination input or retrieval using user history, behaviour, conditions or preferences, e.g. predicted or inferred from previous use or current movement
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
- G08G1/096827—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed onboard
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096855—Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver
- G08G1/096872—Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver where instructions are given per voice
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096877—Systems involving transmission of navigation instructions to the vehicle where the input to the navigation device is provided by a suitable I/O arrangement
- G08G1/096888—Systems involving transmission of navigation instructions to the vehicle where the input to the navigation device is provided by a suitable I/O arrangement where input information is obtained using learning systems, e.g. history databases
Definitions
- Information acquisition method information provision method, and information acquisition device
- the present invention uses an information device capable of sensing position information, such as a car navigation system, a mobile phone, or a PDA, to accumulate a user's movement history, predict a movement destination from the movement history, and associate the movement destination with the predicted movement destination.
- position information such as a car navigation system, a mobile phone, or a PDA
- a method in which information that a user may need is obtained and presented in advance by predicting the behavior of the user. For example, in a vehicle-mounted terminal, the start position and the end position of the driving are stored as travel history together with conditions such as the date and time, and when the start of the engine of the user is detected, the travel history is stored using the current position and the date and time as keys.
- the in-vehicle information system automatically searches for the destination and the required time by referring to the destination that has been visited most frequently in the past and the time required to travel to the destination in the past. It has been proposed (see Patent Document 1).
- the behavior of the user possessing the information terminal is divided into units of movement behavior and stop (stay) behavior, and for a certain behavior, information such as the frequency of appearance and the content of the behavior immediately before and immediately after is collected as a movement history. It is stored in the server, and a user who satisfies the conditions specified by the service provider (for example, being around Kyoto Station between 9 and 14 o'clock on Sunday) is found by predicting the behavior from the history information, and the relevant user is found.
- An information presentation method for providing advertisement information to a user has been proposed (see Patent Document 2).
- Patent Document 1 Japanese Patent Application Laid-Open No. 11-1494956 (especially FIG. 1)
- Patent Document 2 Japanese Patent Application Laid-Open No. 2000-2903540 (particularly FIG. 1)
- the history database used for searching only stores the combination of the departure point and the destination in chronological order. Therefore, it takes computational cost to search the database. Once started, the problem is that it takes too long to get the predictions. In addition, in calculating the required time, accurate calculation may not be possible because only the past driving results are referred to and the current congestion degree is not referred to. Furthermore, since the history database does not store the travel route of the user, it is not possible to make predictions about the route that the user is supposed to travel, and even if the current congestion degree and road information can be referred to, To It is not possible to present useful information such as related road information to the user. Furthermore, it is rare that a destination can be specified if the departure point is known, and it is very likely that prediction will be valid only when the route information including the departure point is known as the vehicle travels.
- Patent Document 2 since the movement behavior connecting the same departure point and the same destination is stored as a unit regardless of the difference in the route, accurate prediction of the route when there are multiple routes is performed. Can't do it. Also, since only the relationship with the preceding and following actions is stored, the user's actions cannot be reproduced for four or more consecutive actions, resulting in incomplete prediction. In addition, the conditions for making predictions must be specified by the service provider or the user, but as described above, it is difficult to select appropriate conditions so that highly accurate predictions can be made.
- the present invention has an object to improve the accuracy of prediction of a destination in a technology for predicting a destination of a user from a movement history and acquiring information related to the prediction destination, as compared with the related art. I do. Disclosure of the invention
- the present invention provides, as an information acquisition method for acquiring information related to a destination of a moving object, a first step of accumulating a movement route obtained from a history of position information of the moving object as a movement history; A second step of determining a type and a category of a key as a search condition as a search condition; performing a search on the movement history in accordance with the search condition; And a third step of predicting one or more destinations or travel routes on which the vehicle travels, and acquiring information relating to the predicted destinations or travel routes.
- the type and the category of the key when searching the accumulated movement history are determined as search conditions, and based on the search result according to the search conditions. Therefore, a destination or a moving route where the moving body proceeds is predicted.
- the types of keys here include time, date, weather, driver, and passenger.
- the category here refers to a key division or a scale.For example, as for the time, regarding the time of "8:30", “morning", "6:00 to 10:00" There are various categories of measures, such as "8:00 to 9:30", in terms of the level of abstraction, and the date may be captured in the category of "Friday” or "Weekday". You can think of it as a category of J, or a category of various scales about how to summarize.
- the weather can be considered “sunny” or “the probability of precipitation is less than 40%”, and the drivers and passengers can be “Sato family users”, “over 25”, “dad”, etc.
- the prediction by performing the prediction after determining the search conditions for searching the movement history in advance, it is possible to perform the prediction with higher accuracy than before, and thus it is possible to obtain appropriate information. .
- the present invention provides, as an information presentation method for presenting information related to a destination of a moving object, a first step of acquiring relevant information about a predicted destination by the information acquisition method of the present invention; And a second step of determining presentation information on the destination based on the information acquired in the first step, and presenting the determined presentation information.
- ADVANTAGE OF THE INVENTION about the destination of a moving body, prediction with higher precision than before can be performed, and since appropriate information can be acquired, information can be presented more appropriately to a user.
- the present invention provides, as an information acquisition device, a history accumulation unit that accumulates, as a movement history, a travel route obtained from a history of position information of a moving object; A condition determining unit that determines a type and a category of a key as a search condition; performing a search on the movement history in accordance with the search condition; And a prediction unit for predicting one or more destinations. This is to acquire information related to the destination predicted by the prediction unit.
- the type and the category of the key when searching the accumulated movement history are determined as search conditions, and the moving object proceeds based on the search result according to the search conditions.
- a moving destination or a moving route to be performed is predicted. As a result, it is possible to perform prediction with higher accuracy than before, and thus it is possible to obtain appropriate information.
- the present invention is a program for causing a computer of at least one of an information device and a server to execute the information acquisition method according to the present invention.
- FIG. 1 is a configuration diagram of the information acquisition device according to the first embodiment of the present invention.
- FIG. 2 is a diagram showing node-related information stored in the map information database.
- 3 (a) and 3 (b) are diagrams showing an example of the movement history data stored in the history storage database.
- FIG. 4 is a flowchart showing a processing flow in the first embodiment of the present invention.
- FIG. 5 is a diagram illustrating an example of the transition state information.
- FIG. 6 is a flowchart showing an example of the operation of the condition determining unit.
- FIG. 7 is a diagram showing an example of a screen for presenting information to a user.
- FIG. 8 is a configuration diagram of the information acquisition device according to the second embodiment of the present invention.
- FIG. 9 is a diagram showing genre information stored in the map information database.
- FIG. 10 is a diagram showing an example of information stored in the reception information database.
- FIG. 11 is a flowchart showing the operation of the presentation information determining unit in the second embodiment.
- FIG. 12 is a diagram showing predicted destination nodes and their predicted probabilities.
- FIG. 13 is a diagram showing the items of the determined presentation information.
- FIGS. 14A to 14D are diagrams illustrating examples of presentation information.
- FIG. 15 is a diagram showing an example of a screen for presenting information to a user.
- FIG. 16 is a configuration diagram of the information acquisition device according to the third embodiment of the present invention.
- FIG. 17 is a flowchart showing the flow of processing in the third embodiment of the present invention.
- FIG. 18 shows an example of predicted route information.
- FIG. 19 is a diagram showing a specific example of road-to-traffic information stored in the reception information database.
- FIG. 20 is a diagram showing an example of a screen presented to the user.
- FIG. 21 is a configuration diagram of an information acquisition device in a development example of the third embodiment of the present invention.
- FIG. 22 is a configuration diagram of the information acquisition device according to the fourth embodiment of the present invention.
- FIG. 23 is a flowchart showing the operation of the presentation information determining unit according to the fourth embodiment of the present invention.
- FIG. 24 is a configuration diagram of the information acquisition device according to the fifth embodiment of the present invention.
- FIG. 25 is a configuration diagram of the information acquisition device according to the sixth embodiment of the present invention.
- FIG. 26 is a diagram showing an example of information stored in the reception information database.
- FIGS. 27 (A) and (B) are diagrams showing examples of information presentation in the sixth embodiment of the present invention.
- FIG. 28 is a diagram showing an example of one category of each key serving as a search condition.
- FIG. 29 is a diagram showing a hierarchical category structure of each key serving as a search condition.
- FIG. 30 is a diagram for explaining node area conversion.
- FIG. 31 is a flowchart showing another example of the operation of the condition determining unit.
- the type of key in the second step is the information acquisition method according to the first aspect, which includes at least one of a time, a statement, a weather, and a position and a movement route of a moving object. provide.
- the method further comprises generating transition state information indicating a past position transition of a moving object from the movement history, and performing the search for the transition state information in the third step.
- the second step provides the information acquisition method according to the first aspect, wherein the determination of the search condition is performed based on statistical processing.
- the second step includes a step of selecting a candidate for the search condition; and a step of selecting one or more destinations to which the mobile object may progress according to the selected condition candidate. And a step of calculating the entropy of the predicted probability value is repeatedly executed, and the search condition is specified from the selected condition candidates based on the calculated entropy value.
- a prediction probability is obtained for each of one or more destinations at which the moving object may travel, and prediction is performed based on the obtained prediction probabilities.
- the information acquisition method according to the first aspect, wherein the movement history is stored in the form of transition between nodes.
- the information acquiring method according to the seventh aspect wherein at least one of the nodes is a landmark, an area, or an intersection.
- the information acquisition method comprising a step of determining, as a node, an intersection at which a moving body has moved in two or more directions in the past in a moving route. provide.
- the first step provides the information acquisition method according to the first aspect, wherein the movement history is accumulated in segments of start and end of movement.
- the eleventh aspect of the present invention before the moving object starts moving from the movement destination or the movement route predicted in the third step, a new movement destination or movement route in which the moving body advances is determined.
- the information acquisition method wherein information relating to a predicted destination or travel route is acquired via a network.
- a first step of acquiring information related to a predicted destination by the information acquiring method of the first aspect And a second step of determining presentation information on the destination based on the information acquired in the first step, and providing a presentation of the determined presentation information.
- the second step refers to information indicating a correspondence relationship between a position, a name, and a genre name to which the position belongs, and, for the destination, a name and a genre name.
- an information presenting method in which at least one of them is determined as presentation information.
- the first step is to calculate a predicted probability for the predicted destination, and the second step is to determine a predicted probability of the destination when the predicted probability is equal to or more than a predetermined value.
- An information presentation method according to a fourteenth aspect is provided, in which the name is determined, and otherwise the genre name is determined as presentation information.
- the first step is to refer to a movement history and calculate an estimated required time from a current position of the moving object to a predicted destination as related information. Provide a presentation method.
- road traffic information to the destination is obtained via a network
- the estimated required time and the road traffic information are obtained.
- the information presenting method according to the sixteenth aspect wherein a route different from the predicted travel route is searched for provide.
- the present information provides the information presenting method according to the thirteenth aspect, wherein the presentation information includes advertisement information on the destination.
- the information presenting method includes road traffic information to the destination.
- the information presenting method according to the thirteenth aspect in which in the second step, when determining the presentation information, a cognitive load of a user who receives information presentation is considered.
- a history storage unit that stores a travel route obtained from a history of position information of a moving object as a travel history, and a key used to search for the travel history stored in the history storage unit
- a condition determining unit for determining the type and category of the search as search conditions; performing a search on the movement history in accordance with the search conditions;
- An information acquisition device comprising: a prediction unit that predicts one or more destinations; and obtains information related to a destination predicted by the prediction unit.
- the history accumulation unit includes a transition state information generation unit that generates transition state information indicating a past position transition of the moving object from the accumulated movement history
- the prediction unit includes: An information acquisition device according to a second aspect for performing a search on the transition state information provide.
- a program for causing a computer of at least one of an information device and a server to execute the information acquisition method of the first aspect.
- a car navigation system (car navigation system) will be described as an example, but the present invention is not limited to this.
- the present invention can be similarly realized by any information device such as a mobile phone, a PDA, and a personal computer that is normally carried by a user and has means for detecting position information.
- a configuration in which part of the functions of the car navigation system is provided in a server on the network is also conceivable.
- FIG. 1 shows a configuration of a car navigation as an information acquisition device according to a first embodiment of the present invention.
- reference numeral 101 denotes a position detection unit for detecting information on the current position of a car navigation system (current position of a car as a moving object equipped with a car navigation system), and reference numeral 102 denotes a position detection unit for detecting information.
- a node determination unit that determines whether or not the current position corresponds to a node described later.
- Reference numeral 103 denotes a map information database that stores map information used in car navigation.
- Reference numeral 104 denotes a history accumulation database (DB) for accumulating a movement route obtained from the history of the position information of the vehicle as a movement history.
- the node determination unit 102 determines that the current position is determined to be a node.
- the data structure stored in the history storage DB 104 will be described later.
- Reference numeral 105 denotes a threshold for calculating a threshold for the frequency of occurrence of a node, which is used to create transition state information to be described later, using information on the frequency of appearance of the node stored in the history storage 0810 104.
- a calculation unit 106 is a transition state information creation unit that generates transition state information indicating a past position transition of the vehicle from the movement history stored in the history storage 0 310 4. Transition between nodes for nodes that occur with a frequency equal to or higher than the threshold calculated in 105 Information about the frequency of occurrence and the date and time of travel.
- the node storage unit 102, the history storage DB 104, the threshold value calculation unit 105, and the transition state information creation unit 106 constitute a history storage unit.
- Reference numeral 107 denotes a condition determination unit that uses the transition state information to determine a search condition for obtaining an appropriate prediction result from information indicating the current state stored in the history storage DB 104.
- Reference numeral 08 denotes a prediction unit that predicts a future destination from the state transition information using the search condition determined by the condition determination unit 107.
- Reference numeral 109 denotes a node-to-node required time calculating unit for calculating a travel time between the node at the current position and the node predicted by the predicting unit 108 by referring to the movement history, and 110 denotes a map information DB.
- a presentation information determination unit that determines information to be presented to the user with respect to the node predicted by the prediction unit 108, and 111 is a presentation determined by the presentation information determination unit 110.
- An information presenting unit that presents information to a user.
- the presentation information determination unit 110 determines, for example, information for identifying a node such as a name, and an estimated required time to the node and an estimated arrival time as presentation information.
- FIG. 2 is a diagram showing information related to the nodes stored in the map information DB103.
- an intersection, a landmark, or an area name is represented by a concept of a node.
- a unique name such as “ ⁇ intersection” or “ ⁇ amusement park”, “workplace” or “ ⁇ Users can register a unique name such as “house”.
- the node numbers indicate the ID numbers uniquely assigned to these nodes, such as "C ⁇ J" for an intersection, "! _ ⁇ ” for a landmark, and "A ⁇ 0" for an area. "And so on.
- Each node is stored together with information representing the position of the representative point, such as latitude and longitude information.
- the latitude and longitude information only indicates the position information of the representative point, and in fact, there is information indicating the range (such as the radius around the representative point) according to each of the intersections, landmarks, and areas. For example, for intersections and landmarks, a radius of 1 Om around the representative point It is possible that the area may be within a radius of 1 km, or an area with a radius of 1 km around the representative point. Also, the range may be different for each individual area.
- the position information may be, for example, an address in addition to the latitude and longitude.
- intersections, landmarks, and areas may be described instead of the ID numbers, and in any case, any information may be used as long as it can uniquely identify those nodes. Then, information specifying nodes such as intersections, landmarks, and areas is stored in the history storage DB 104.
- nodes can be added or deleted according to the user's traveling.
- an intersection where the user's car has traveled in two or more directions may be defined as a node. That is, as shown in Fig. 30 (a), for the intersections a and c, the user's car is traveling in two or more directions, so the nodes are defined as nodes Na and Nc. It is not a node because it travels only in the direction.
- FIG. 30 (b) if the user travels in a new direction at intersection b, the user has traveled in more than one direction at intersection b, and is added as node Nb '. .
- FIG. 30 (c) when the user stops traveling in only one direction at the intersection a in the past predetermined period, the node Na is deleted (DNa).
- map data is not necessarily required for setting such nodes, and can be performed using only the travel history of the user.
- FIG. 3 is a diagram showing an example of data stored in the history storage DB 104. In the example of FIG. 3, node numbers and passage times are paired and stored in chronological order.
- node C12 was started, passed, or stopped. ing.
- the series of nodes is a segment unit based on the departure point and the destination, that is, "from starting the engine (starting movement) to stopping (ending the movement)". May be accumulated in units of ⁇ ⁇ ⁇ , or as shown in Fig. 3 (b), From the time it is issued until it returns to home ”.
- the data may be accumulated in segments such as “same date” or may be accumulated without a segment.
- the time is represented by month,, hour, and minute.Otherwise, year, second, day, etc. may be stored, or only any combination of these units may be stored. Is also good.
- the node series is accumulated for each run, the time when the engine was started and the time when the engine was stopped may be described, and only the node number may be described for nodes that have passed. .
- information relating to the time and date but also information relating to a key serving as a search condition determined by the condition determination unit 107, such as weather, or information relating to a driver or a passenger, is stored. It just needs to be.
- the toad determining unit 102 refers to the map information DB 103 to determine whether the current position is a node. Is determined (step a 2). When the node is determined to be a node by the node determination unit 102, an ID number indicating the node is stored in the history storage DB 104 (step a3). At this time, additional information such as time, date, and weather is also stored.
- the threshold value calculation unit 105 refers to the history accumulation unit 1081, and calculates a threshold value of the number of appearances for selecting nodes constituting the transition state information (step a4).
- a threshold value of the number of appearances for selecting nodes constituting the transition state information.
- There are various methods for calculating the threshold For example, it is calculated according to the amount of data stored in the history storage DB 104, calculated by calculating the distribution of the number of occurrences of all nodes, and calculated by calculating the average value of the number of occurrences of all nodes It should be calculated by multiplying by a certain number. It may be determined in any way.
- the transition state information creation unit 106 uses the data in the history accumulation DB 104 to select a node having the number of occurrences equal to or greater than the threshold value, and to transition. Create state information (step a5).
- FIG. 5 shows an example of the transition state information.
- the transition state information places nodes (departures) such as landmarks and areas where driving has started at the highest level immediately below the route, and uses these nodes as base points for past node transition histories (intersection points).
- nodes (Representing travel history) is represented by a tree structure, and nodes (destinations) such as landmarks and areas that have finished traveling are located at the lowest layer of each branch.
- Each node is provided with state information when it departs, passes, and arrives at the node (in Fig. 5, data represented by a rectangular box). For example, "from 9 am to 12 am on weekdays It is possible to search the tree structure using conditions such as “nodes that have traveled to” as search keys.
- the number of state information provided allows the frequency of departure, passage, and arrival at that node to be known.
- the transition state information includes information on the degree of transition, a more efficient search can be performed than a full search of the accumulated movement history.
- FIG. 5 is a flowchart showing an example of the operation of the condition determining unit 107.
- the condition determining unit 107 obtains information on the current state with reference to the history accumulation DB 104.
- the history storage DB 104 there is an area for storing information on current driving in addition to past history information, so that a route from departure to the current node can be extracted. It has become.
- I ’m going to leave node “C 9 J
- the driving history from "L6 ⁇ C9" and the date and time is June 3 at 14:00.
- conditions such as date and time (key type)
- conditions (categories) such as “weekday”, “day”, and “summer j” can be extracted with reference to a table as shown in FIG. .
- the condition determination unit 107 searches the transition state information for a node satisfying this condition (step b2). .
- this is node 501 “C9”.
- this node As a base point, one node that may transition in the future (the node located at the lowest layer) is selected as a transition candidate node (step b3), and the transition probability to that node is calculated. (Step b4), and store the value (Step b6).
- Equation (1) shows an example of a method for calculating entropy when the probability of traveling to one of the destinations Li that has traveled in the past under certain conditions is represented by Pi.
- step b10 the combination of the conditions having the smallest stored entropy value is determined as the optimum search condition. That is, the type and category of the key used in the search of the movement history performed to predict the destination are determined as search conditions.
- the prediction unit 108 searches the movement history in accordance with the search condition, and based on the search result, the vehicle travels. Predict ahead.
- the future transition destination node is determined with reference to the transition state information created from the movement history (step a7). Nodes are determined by, for example, selecting a node with the highest predicted probability, assigning a range to the node according to the predicted probability value, and selecting a node having a range to which the random value belongs. This can be done in a variety of ways, such as by selecting all nodes that have values, or by selecting a certain number of nodes from those with the highest probability values. When the transition destination node is predicted, it is naturally possible to predict the route to the predicted node by referring to the transition state information.
- the inter-node required time calculation unit 109 predicts the required time between the current node and the predicted destination node (step a8). For example, the transition state information is searched using the current node and the prediction destination node as keys, and the average value of the time required to travel between these two nodes in the past is set as the estimated required time. At this time, the required time may be obtained after further narrowing down the search target according to conditions such as date and time zone, or information not represented in the transition state information is stored in the history accumulation DB 104. In this case, the required time may be calculated by referring to the history accumulation DB 104.
- the presentation information determination unit 110 refers to the map information DB 103 and determines information to be presented to the user, such as the name of the predicted node and other information, information on the expected required time and the expected arrival time, and the like. Yes (step a9).
- the information is presented to the luza (driver and passenger) by the information presentation unit.
- Figure 7 shows an example of a screen that presents information to the user.
- the information to be presented can be obtained via a network.
- the car navigation system may select and present information related to the predicted destination or travel route from the received information, or may display information indicating the predicted destination or travel route from the first navigation system. It may be uploaded to a server on the network, the server may select relevant information, and the car navigation system may receive only the information selected by the server.
- the history information stored in the history DB 104 is uploaded to the server, and the server performs both the prediction of the destination and the selection of information based on the prediction result. Is also good.
- some users may have a psychological resistance to uploading their entire movement history to the server. For such users, it is more reasonable to provide only the minimum information of the predicted destination. That is, the movement history may be uploaded to the server only for the user who has been granted the permission.
- transition state information when transition state information is created from the movement history, only nodes that appear more than a predetermined frequency are selected. However, this is done by making the data size to be searched compact. This is to improve efficiency. That is, when there is no particular limitation on the search efficiency, it is not necessary to select nodes, and transition state information is created using all nodes stored in the history storage DB 104. You may.
- the transition state information is created so as to include all the state information that may be used in the prediction, and then, by referring to the transition state information, a combination of conditions that minimizes the entropy Was determined as a search condition, and prediction was performed.
- the condition determination unit 107 refers to the history accumulation DB 104 and performs the same processing as in the present embodiment to determine an appropriate condition in advance, and uses the condition to determine the transition state information.
- a method is also conceivable in which the creation unit 106 creates the transition state information.
- search condition is determined by calculating the entropy of the transition probability of the node (the predicted probability of the destination), but the present invention is not limited to this.
- search conditions may be determined based on other statistical processing.
- condition determining unit 107 Another example of the process in the condition determining unit 107 will be described with reference to a flowchart shown in FIG.
- a hierarchical category structure for each key type such as “date”, “time”, and “weather” as shown in Fig. 29 as a variation of the condition.
- Step f1 a search is made for a current node that satisfies the route information "'L6 ⁇ C9 (step f1).
- node 501 corresponds to this.
- the transition probability to each transition candidate node when the condition Gond is set to the path information “L6 ⁇ C9” is calculated, the entropy is calculated, and this is set as the reference entropy.
- step f4 "weekday” is selected from these condition candidates (step f4), and the entropy is calculated for the condition Gond that satisfies the route information "L6 ⁇ C9" and "weekday” (step f4). f 5) and memorize it (step f 7). It is determined whether or not any of the condition candidates determined in step f3 other than the "weekdays” selected already exists (step f6). Here, since the categories of “day” and “sunny” remain, next, “day” is selected (step f 4), and the same processing is performed.
- the first criterion is a case where the reference entropy is the smallest of the entropy for each candidate condition and the reference entropy calculated in step f2.
- the second criterion is that each of the condition candidates corresponds to the lowest category in the hierarchical structure of FIG. 29, and there is no further concrete category.
- the process ends, and the currently selected condition is determined as the optimum condition (step f9). If the termination condition is satisfied at this stage, the optimum condition in this case is only the route information “L6 ⁇ C9”, and the conditions such as date and time are not selected.
- the entropy when “noon” is selected is the smallest.
- the entropy value is set as the reference entropy (step f2), and one category "day” is embodied as "14:00 to 15:00", and "weekdays” ⁇ sunny "" "14:00 to 15:00” is determined as a new condition candidate (step f3). Then, similar processing is performed for these new condition candidates (steps f4 to f6).
- the optimal conditions are the route information “L6 ⁇ C9” and “day”.
- the end condition is not satisfied, for example, if the entropy of ⁇ weekday '' is the smallest, the entropy value is set as the reference entropy, and the processing of steps f 2 to f 8 is further performed. Repeat until done.
- the optimal conditions are categories such as “weekdays”, “14: 00-15: 00”, and “sunny”.
- the route "L6 ⁇ C9" was run in the past, and it was "Weekday”, “14: 00-15: 00", and "Sunny”.
- the transition probabilities may be calculated for only the cases, and the transition destination node may be determined.
- a current node that satisfies the route information “L6 ⁇ C9” is searched from the transition state information shown in FIG. 5 (step f 1).
- node 501 corresponds to this.
- the transition probability to each transition candidate node is calculated, its entropy is calculated, and this is used as the reference entropy. (Step f 2).
- step f3 When the reference entropy is calculated, in the condition category hierarchy in Fig. 29, “Category that is embodied one step from R OOTJ is determined as a condition candidate (step f3). Specifically, in the date condition,“ weekdays ”and“ holidays ” In the time condition, “morning”, “daytime”, “night” and in the weather condition, “sunny”, “cloudy”, and “rain” are the condition candidates.
- the categories “weekdays” and “absent J”, which embody the day of the week conditions, are selected (step f 4), and the route information “L 6 ⁇ C9” is selected from the transition state information in FIG.
- the transition probabilities and entropies are calculated for the categories that satisfy the conditions of “weekdays” and “holidays j” (step f5), and the entropy values are stored (step f7).
- step f 4 the categories “morning”, “daytime”, and “night”, which embody the time conditions, are selected (step f 4), and the transition state information in FIG. 5 that satisfies the route information “L 6—C9”
- step f5 the transition probabilities and entropy for the categories of “morning”, “day” and “night” are calculated (step f5), and the entropy value is stored (step f5).
- step f7 The entropy is similarly calculated for the weather condition.
- step f8 the termination condition is determined as described above.
- the former is based on the past running data shown in the transition state information in Fig. 5 only for those whose status information such as the day of the week and time satisfies the same conditions as the current status.
- To calculate entropy (for example, if the current day is Monday and “weekday” is given as a day of the week condition, only entropy of past cases that were on the same route and that were “weekday”) would be calculated.
- the latter is that entropy is calculated for all cases that were on the same route.
- condition categories shown in Fig. 29 may differ depending on the user (for example, one user's holiday is Saturday and Sunday, while another user's holiday is Monday and Tuesday). Means for acquiring such a condition category may be provided, and a different condition category may be used for each user.
- the information from the start of the current travel to the current position is used as a condition.
- the history information of the travel before the current travel (departure point, Route, date and time, etc.).
- a plurality of types of hierarchical structure of condition categories as shown in FIG. 29 may be provided for the same key (for example, time condition). In this case, entropy is calculated for each hierarchical structure, conditions are determined, and the condition in which the entrance peak is minimized among them is predicted as the final condition.
- the node determination unit 102 determines whether or not the node is a node, and stores only the node in the history storage DB 104.
- a configuration may be adopted in which the detected position information is stored as it is, and then the node determination unit 102 operates at an appropriate timing to extract only the node.
- the presentation information determining unit 110 initially determines only the name of the predicted destination as presentation information, and determines only the node selected by the user with respect to the presented information, such as the estimated required time. Information or other detailed information related to the node may be output. Alternatively, route setting, which is a function of power navigation, may be performed with the selected node as a destination.
- means for acquiring information specifying a user such as a driver or a fellow passenger may be provided, and the history accumulation data may be accumulated for each user.
- the history accumulation data may be accumulated for each user.
- node information indicating a node name other than a node name or a unique name registered by the user is stored in the map information DB 103 for each user, and the acquired user identification information is stored.
- the node information to be referred to may be changed according to the information.
- each user may insert a memory card on which individual node information is recorded into the car navigation system when using the information, and refer to the map information DB 103 and the memory card.
- the node information may be stored on a network.
- the history information stored in the history storage DB 104 is not limited to storing intersections as nodes and a series of nodes. The link may be used to store the information.
- FIG. 8 shows the configuration of a power navigation system as an information acquisition device according to the second embodiment of the present invention.
- the detailed description of the components having the same reference numerals as in FIG. 1 and performing the same operation as the first embodiment will be omitted.
- reference numeral 801 denotes an information receiving unit that receives information from the outside via a network or broadcast waves
- 802 denotes a reception information DB that stores information received by the information receiving unit 801.
- Reference numeral 803 denotes an input interpretation unit that receives an input from a user and interprets the input.
- the presentation information determination unit 110 refers to the map information DB 103 and the reception information DB 802 and the interpretation of the input interpretation unit 803 with respect to the destination predicted by the prediction unit 108, and provides information to be presented to the user. To determine.
- FIG. 9 shows an example of information stored in the map information DB 103.
- information on the genre to which each node belongs is stored in the map information DB 103. Have been.
- the node ID “L3J” is named “C-corp J” and belongs to the genre “super”.
- FIG. 10 shows an example of information received by the information receiving unit 801 and stored in the received information DB 802.
- information indicating the names of landmarks and areas having information information indicating positions such as latitude and longitude, related detailed information, and other information such as images and moving images are stored.
- information indicating the position an address or the like may be used in addition to the latitude and longitude.
- the prediction unit 108 predicts a plurality of destinations and calculates the prediction probability.
- one of the nodes predicted by the prediction unit 108 is selected as a prediction candidate (step cl), and the name of the selected node is searched from the map information DB 103 (step c2).
- the node “L 1 31 J” is selected from the nodes shown in FIG. 12, and “Kameya Golf” is obtained as the name of this node ⁇
- step c3 it is determined whether or not the predicted probability for the node selected in step c1 is equal to or more than a predetermined value.
- the predetermined value is “0.25”.
- the node name“ Kameya Golf ” is stored as a candidate for the presentation information (step c 4). .
- step c8 "Because there are still prediction candidate nodes other than L1 31 J (Yes in step c8), select the next candidate" L1 8J (step. 1) and search for the node name. Obtain the name “Bonjour” (step c2). "Since the predicted probability of 0.28J is 0.26, which is equal to or larger than the predetermined value, the node name" Ponjour j "is stored in the same manner as” L1J. " As the next candidate, "3” is selected (step cl), and the name "C-corp” is obtained (step c2).
- the node “L 3J genre name“ super ” is acquired by referring to the map information DB 103. Yes (step c5). Then, link information is created between the genre “super-one” and the name “C-corp” of the node “L 3” (step c 6), and the genre name and the node name are stored as candidates for presentation information (step c). 7).
- step c9 Similar processing is performed for the remaining node “L52”, and as a result of the processing, the items of the presentation information as shown in FIG. 13 are determined (step c9).
- the information corresponding to those items is searched by referring to the reception DB 802 to determine the content to be presented (step c10).
- FIG. 14 is an example of information determined by the presentation information determining unit 110 and presented by the information presenting unit 111.
- the presentation information is from the top page of Fig. 14 (A).
- (B) or (C) is configured to follow the link with (D), and when the input interpretation unit 803 interprets the user's instruction input, the information of the link destination is presented accordingly.
- information such as images and moving pictures in addition to text information is reproduced as information stored in the reception information CTB802.
- Figure 15 shows an example in which this information is presented to the user on the power navigation screen.
- the names “Kameya Golf” and “Bonjour j” and the destinations other than those "L3J” and “L52J for The genre name “Super” is determined and presented as presentation information.
- the destinations “L1 31" and “L1 8" for which the predicted probabilities are equal to or greater than the predetermined value, the names “Kameya Golf” and “Bonjour j", and the destinations other than those "L3J” and “L52J for The genre name “Super” is determined and presented as presentation information.
- the destinations “L1 31" and "L1 8" for which the predicted probabilities are equal to or greater than the predetermined value
- the names “Kameya Golf” and “Bon journey j” for the destinations "Kameya Golf” and “Bon journey j”
- the destinations other than those "L3J” and “L52J for The genre name “Super” is determined and presented as presentation information.
- other forms of information presentation include “Kameya Golf” and “Bonjour” For nodes whose predicted probabilities are equal to or greater than a predetermined value, not only the items but also related detailed information may be displayed on the top page, and only the items may be displayed for other nodes. Further, only the genre may be displayed on the top page regardless of the prediction probability. Further, not the genre but all node names (landmark names and area names) may be displayed.
- the display may be changed according to whether the landmark force to be presented is the user's destination or on the predicted movement route. For example, a node name may be displayed for a destination, and a genre name may be displayed for nodes on a route.
- the prediction unit 108 predicts the destination node, it is naturally possible to predict the route to that node, so the predicted node (landmark)
- the advertisement information may be presented for landmarks existing near the predicted route.
- presentation information information on the required time as described in the first embodiment may be presented, or information related to the prediction destination stored in the map information DB 103 may be presented. . '
- FIG. 16 shows a configuration of a car navigation as an information acquisition device according to the third embodiment of the present invention.
- a detailed description of components having the same reference numerals as those in FIGS. 1 and 8 that perform the same operation as the first and second embodiments will be omitted.
- the information receiving section 801 receives information on roads and traffic using a network or broadcast waves, and the reception information DB 802 stores the received road and traffic information.
- the prediction unit 108 predicts one or more transition sequences of the nodes from the current node to those nodes, that is, one or more movement routes.
- the internode required time calculation unit 109 calculates the required time between the current node and the prediction destination node (current travel destination). For example, as described in the first embodiment, by referring to the transition state information created by the transition state information creation unit 106, the average value of the past travel time between the current node and the prediction destination node is calculated. Is calculated as the estimated required time. At this time, the required time may be obtained after further narrowing down the search target by conditions such as date and time, or when information not represented in the transition state information is stored in the history accumulation DB 104, The required time may be calculated with reference to the history accumulation DB 104.
- the prediction unit 108 selects the two or more nodes selected by the presentation information determination unit 110 in response to the information of the reception information DB 802 and the map information DB 103. It is also possible to calculate the average travel time between any two nodes included in the predicted travel route.
- the presentation information determination unit 110 refers to the reception information DB 802 and the map information DB 103 and selects two or more nodes to be transmitted to the internode required time calculation unit 109. .
- the route information predicted by the prediction unit 108, the estimated required time between predetermined nodes calculated by the required time calculation unit between nodes 109, and the road-to-traffic stored in the reception information DB 802. Referring to the information, determine the information to be presented to the user.
- the prediction unit 108 predicts one or more pieces of route information (step d 1).
- FIG. 18 shows an example of predicted route information.
- the number of pieces of route information may be plural as shown in FIG. 18 or may be one.
- step d1 the presentation information determination unit 110 By comparing the road 'traffic information stored in B 802 with the predicted route information as shown in FIG. 18, it is determined whether there is road / traffic information related to the predicted route (step d). 2)
- Figure 19 shows a specific example of road traffic information.
- the road traffic information here includes items such as a road name, a section, and related information.
- the elements constituting the section information are stored in the map information DB 103 as illustrated in FIG.
- the presentation information determination unit 110 converts the section information of the road 'traffic information as shown in FIG. 19 into a node expression with reference to the map information DB 103. For example, section information such as "Suinomoto North-Sumoto South” is converted to node information such as "C13 ⁇ C20".
- section information such as "Suinomoto North-Sumoto South” is converted to node information such as "C13 ⁇ C20”.
- it is determined whether or not there is a section that matches the converted node information by comparing with the predicted route information in FIG. As a result of this judgment, it is found that “C 13 ⁇ C 20” is included in the route of priority number 1. That is, as a result of step d2, this section “C13 ⁇ C20J is selected (step d3).
- the inter-node required time calculation unit 109 refers to the transition state information, and presents an average required time (hereinafter referred to as “', average required time”) required to drive the route of priority number 1 in the past, and presents it.
- the average required time (hereinafter referred to as the section average required time) required for traveling in the past between “C 13 ⁇ C 20” between the nodes selected by the information determining unit 110 is calculated (step d 4). ).
- the route average required time and the section average required time are calculated as “80 minutes” and “20 minutes”, respectively.
- the presentation information determination unit 110 calculates the required time “30 minutes” of the section corresponding to “C13 ⁇ C20” stored as related information in the reception information DB 802, and calculates the required time between nodes.
- the average time required for the section “20 minutes” calculated by the part 109 is compared to calculate the difference time “10 minutes J” (step d5).
- the presentation information determination unit 110 further converts the node number into a name such as a landmark with reference to the map information DB 103, and determines information to be presented to the user (step d7). .
- FIG. 20 shows an example of a screen presented to the user by the information presenting unit 1 1 1.
- the expected destination name, the expected required time obtained by referring to the road and traffic information, and the received road / traffic information are presented.
- the form of the presentation information is not limited to the one shown here. For example, only the road / traffic information related to the predicted route may be presented. In this case, the internode required time calculation unit 109 is not required.
- FIG. 21 is different from FIG. 16 in that a route search unit 2101 is provided.
- the route search unit 2101 receives the information read from the predicted route information and the received information DB 802 as shown in FIG. 18 from the presentation information determining unit 110, and refers to the map information DB 103. Search for a route that requires less time than the predicted route. Regardless of the algorithm for the search, detailed description is omitted here.
- the information presenting unit 111 presents information on the route to the user.
- the route search unit 210 refers to the history accumulation DB 104, the transition state information, or the inter-node required time calculation unit 109 to determine whether the user has traveled in the past and It is also possible to preferentially search for another route with a shorter time. In addition, the search for another route does not satisfy the above-mentioned restrictions on the required time. This may be done not only when there is no information, but also when there is regulatory information, such as closed roads, on the predicted route.
- FIG. 22 shows a configuration of a car navigation as an information acquisition device according to the fourth embodiment of the present invention.
- a detailed description of components having the same reference numerals as those in FIG. 8 and performing the same operation as the second embodiment will be omitted.
- the reference numeral 2201 refers to the history storage DB 104, and a frequency calculation unit for calculating the frequency of appearance in the movement history for each node (landmark, area) to which the user has visited.
- Reference numeral 2 denotes a frequency storage DB for storing the frequency calculated by the frequency calculation unit 222.
- FIG. 23 is a flowchart showing an operation of determining the presentation information by the presentation information determining unit 110 in the present embodiment.
- the presentation information determination unit 110 selects one of the predicted destinations as a prediction candidate (step el).
- the prediction probability of the selected prediction candidate is referred to (step e 2). If this is equal to or larger than a predetermined value, the prediction candidate is stored as a candidate to be presented to the user (step e 6). On the other hand, when the probability value is equal to or less than the predetermined value, the frequency of this prediction candidate is obtained by referring to the frequency storage DB 220 (step e 3). Is stored as a candidate to be presented to the user (step e6). Then, it is searched whether or not there is another prediction candidate (step e5). If there is a prediction candidate, the same operation is repeated.
- the stored information on the prediction destination of the presentation candidates is determined as an item to be presented (step e7), and the information related to these items is stored in the map information DB 103 or the like.
- the presentation information is determined with reference to the reception information DB 802 (step e8).
- various methods for determining the presentation candidates can be considered in addition to the methods described here. For example, when using frequency, instead of using the condition that the frequency is equal to or higher than a predetermined value as a condition for information presentation, the frequency of the prediction candidate node in the total frequency of landmarks and areas that the user has performed in the past is considered. A criterion of whether the ratio is equal to or more than a predetermined value may be used.
- the frequency storage DB 220 stores the frequency in units of genre as shown in the second embodiment, and does not store the frequency of the prediction candidate node alone but the frequency of the entire genre to which the node belongs. Frequency may be used as a criterion for determination. Furthermore, for each prediction candidate node, the determination is made in consideration of both the scale of the prediction probability obtained by the prediction unit 108 and the frequency stored in the frequency storage DB 220. Is also good.
- FIG. 24 shows the configuration of a car navigation as an information acquisition device according to the fifth embodiment of the present invention.
- FIG. 24 among the components denoted by the same reference numerals as in FIG. 1, those that perform the same operations as those in the above-described embodiments will not be described in detail.
- the prediction destination is determined by the prediction unit 10 #. Based on the current transition state information and the prediction result, the travel when it is assumed that the user has traveled as predicted, as in the first embodiment.
- This is a pseudo transition state information creation unit that creates pseudo transition state information later.
- 2402 is a pseudo condition for determining a pseudo search condition from the pseudo transition state information created by the pseudo transition state information creation unit 2401, as in the first embodiment. The decision unit.
- the predicted movement destination in order for the pseudo-condition determining unit 2402 to perform the former operation, the predicted movement destination must be Information on departure status (day of the week, time, weather, etc.) is required.
- the pseudo condition determination unit 2402 performs the latter operation, such state information is not required, but is required in the prediction unit 108.
- the following methods can be considered as a method for acquiring such information.
- By searching the history storage DB 104 it is possible to calculate the average of the time required to depart from the destination (hereinafter referred to as stay time) when the vehicle arrives at the predicted destination (destination) from the current location. By adding this staying time to the predicted time of arrival at the predicted destination, it is possible to acquire the state regarding the day of the week and time when the predicted destination is departed.
- the staying time may be divided into several small variances, the average value of each unit may be calculated as a staying time candidate, and pseudo conditions may be determined or predicted for all of these candidates. .
- the normal prediction processing as described in the first embodiment may be performed again.
- transition state information creation unit 106 Normally, it takes time to complete the processing in the transition state information creation unit 106 and the condition determination unit 107. For this reason, a series of processes such as detecting the current position, updating the movement history, creating the latest transition state information and determining the optimum search conditions, for example, when the car engine is started Then, it takes too much time to present the information. In other words, it becomes difficult to present information about the expected destination as soon as the user starts the engine.
- the pseudo transition state information creating unit 2401 and the pseudo condition determining unit 2402 that is, when the engine is started at the destination currently predicted. Creation of pseudo transition state information and its The search conditions are determined in advance. As a result, when the engine is started the next time, the prediction can be completed in a short time, so that the required time information and other related information on the expected destination (new destination or travel route) can be obtained. Can be promptly presented to the user.
- the prediction using the pseudo transition state information and the pseudo condition is not performed only when the engine is started, but can be performed at any time when it is desired to predict in advance.
- a configuration in which the pseudo transition state information creation unit 2401 and the pseudo condition determination unit 2402 are not provided may be considered.
- the pseudo transition state information and the pseudo transition state information instead of the condition, the latest transition state information or search condition created at the time of the prediction performed by the prediction unit 108 may be used.
- the information to be presented and the prediction method may be any of those described in the above embodiments, and it is effective to present the information on the opening screen when the car navigation system is activated. Yes, but it may be the screen after the opening screen ends.
- presenting information on destinations predicted to travel next, information on required time, traffic information on a route, and the like on a screen at the time of completion of a certain traveling requires a user to reach a destination at a predetermined time. It is very useful because it is a guide for the next departure time to arrive at. Therefore, for example, when it is assumed that the vehicle departs at the expected departure time calculated by the above-described method, the destination candidate, the estimated arrival time, and the traffic information may be displayed. Or, if information about the average stay time at the node can be obtained, destination candidates for each departure time, estimated arrival time, and traffic at 30 minutes or 1 hour intervals based on that time Information may be displayed.
- the end of traveling can be detected by detecting an event such as a situation in which the position of the vehicle does not change at the destination for a while, a situation in which the gears are parked, a side brake is applied, and the like.
- FIG. 25 shows a configuration of a power navigation system as an information acquisition device according to the sixth embodiment of the present invention.
- FIG. 25 shows a configuration of a power navigation system as an information acquisition device according to the sixth embodiment of the present invention.
- FIG. 25 among the components denoted by the same reference numerals as those in FIG. 8, those that perform the same operations as those of the above-described embodiments will not be described in detail.
- the presentation information determination unit 110 receives the prediction result of the prediction unit 108 in the same manner as in the above-described embodiment, and performs the predicted movement of the information stored in the reception information DB 802. Information on the destination etc. is determined as the presentation information. Further, in the present embodiment, when determining the presentation information, the cognitive load of the user who receives the information presentation is considered. Further, reference numeral 2501 denotes a first information presenting section for presenting information to a user having a high cognitive load such as a driver, and reference numeral 2502 denotes a first information presenting section, for example, in comparison with a driver such as a passenger in a passenger seat or a rear seat.
- Reference numeral 2503 denotes a speech synthesizing unit for creating data for outputting the presentation information determined by the presentation information determining unit 110 as a voice
- the first information presenting unit 2501 is a presentation information determining unit 110.
- the voice information synthesized by the voice synthesis unit 2503 is also presented together with the information such as the text / image determined to be presented in.
- the second information presenting unit 2502 presents information such as a text image which is presented by the presented information determining unit 110.
- the prediction unit 108 predicts “F-mart” as a destination. Then, it is assumed that information as shown in FIG. 26 is stored in the reception information DB 802 for “F-mart”.
- the presentation information determination unit 110 determines the information to be presented to the first and second information presentation units 2501 and 2502, based on the information in FIG. 26, according to a predetermined rule. I do.
- a predetermined rule for example, ⁇ provision of index information by voice reading aloud to users with a high cognitive load, and provision of detailed information and images / videos to users with a low cognitive load '' can be considered.
- the presentation information determination unit 110 sends the information to read out the “sale information”, which is the index information of FIG. 26, as the output to the first information presentation unit 2501, It is decided to present the image information included in the detailed description of FIG. 26 and others as the output to the unit 2502.
- FIG. 27 (A) shows an example of information presentation by the first information presentation unit 2501
- FIG. 27 (B) shows an example of information presentation by the second information presentation unit 2502.
- Fig. 27 (A) after the user is notified of the index information by voice, and when the user requests to obtain detailed information by voice command or the like, Fig. 27 (B) Display of detailed information or reading out by voice may be performed as shown in FIG.
- the presentation information is determined according to the cognitive load of the information viewer. For example, users who can view with a low cognitive load can provide detailed information and media such as images and videos, and users with a high cognitive load can read aloud or summarize information. Or provide This allows the user to receive information according to the magnitude of his or her cognitive load.
- the information to be provided is not limited to the above, and information may be presented in consideration of the cognitive load of the user.
- a cognitive load determination means for determining the degree of the cognitive load is provided, and The information content presented from one information presentation unit may be changed according to the degree of the determined cognitive load. For example, the state of the car is detected, and when the vehicle is stopped, the cognitive load is determined to be small, and detailed information and images / videos are provided. While the vehicle is running, the cognitive load is determined to be large. Read aloud and summary information Information may be provided.
- a car navigation system has been described as a device that provides information to a user.
- a target information device is not limited to a power navigation system.
- an information terminal or the like that a user has on a daily basis such as a mobile phone or a PDA
- the vehicle equipped with the car navigation system is used as the moving object.
- a person carrying the information device moves on foot or by train. In this case, the present invention can be similarly realized.
- the present invention is not limited to this, and at least the position detecting unit 101 and the information presenting unit 111 (or It is sufficient that the first and second information presentation units 2501 and 2502) are provided in the information terminal of the user. All or some of the other functions may be provided in an external server connected to the network. Chi words, the position information by the position detecting unit 1 f O 1 detected is sent to the server, in being accumulated on the server, and transmits the like to the car navigation information about the predicted ground Once the prediction is made at the server, such as configuration is there. Such a configuration is particularly effective when the information device is a mobile phone or a PDA.
- the information acquisition method according to the present invention can be realized by causing a computer of at least one of the information device and the server to execute a program.
- VICS Vehicle Information and Communic ion System
- broadcast waves may be used for ij.
- information received by the information receiving unit 801 is stored in the reception information DB 802, and information related to the prediction destination is extracted from the information and presented to the user.
- the following configuration is also conceivable. That is, an information transmitting unit for transmitting information to the network is provided, and when the prediction unit 108 predicts a destination, the information transmitting unit transmits information indicating the predicted location to the server, and the server stores the information. Information related to the predicted location is extracted from the received information, transmitted to the car navigation system, and the information received by the information receiving unit 801 is presented.
- Such a configuration is effective when only necessary information is transmitted / received via the network, so that there is a sufficient time between the prediction and the presentation of the information.
- a wide range of information including the current location and the predicted destination is acquired in advance and stored in the reception information DB 802, and when the prediction destination is determined, necessary information is extracted and presented.
- a configuration is also possible.
- the transition state information creation unit 106 creates transition state information from the movement history, and the condition determination unit 107 and the prediction unit 108 operate using this transition state information.
- the condition determination unit 107 and the prediction unit 108 may determine the search condition and predict the destination directly from the information of the movement history as shown in FIG.
- the timing at which the threshold value calculation unit 105, the transition state information creation unit 106, the condition determination unit 107, and the prediction unit 108 operate can be variously considered. For example, all these elements may work each time you pass through a node.
- the traveling at the time T starts, when the traveling at the time T-11 ends, or as shown in the fifth embodiment, the traveling at the time T in the middle of the traveling at the time T-1.
- the operation may be performed at a timing such as when the prediction of the start position is completed.
- the threshold value calculation unit 105 and the transition state information creation unit 106 operate to create transition state information in advance, and when traveling starts at time T.
- the condition determining unit 107 and the predicting unit 108 may operate to determine the search conditions and predict the course based on the created transition state information. .
- the condition determining unit 107 operates to determine the transition state information and the search condition, and when the traveling starts at time ⁇ or every time the vehicle travels, only the prediction unit 108 operates. May be.
- the timing is not particularly limited.
- the timing for presenting information to the user may be at the time of starting traveling, or at each time when passing a node from the start of traveling, the prediction is performed, and the prediction probability value exceeds a predetermined threshold. Or when the user indicates the intention of acquiring information, but it does not matter.
- the segment of the movement history data from the departure place (engine start position) to the arrival place (engine stop position) is used, but the invention is not limited to this.
- the segment from power-on to power-off, the segment from leaving home to returning to home, the same date segment, the landmark from the registered landmark location It can be considered in various ways, such as a segment to the registered location.
- the transition state information does not need to reflect all past histories as shown in FIG. 5, but includes at least past route information in the past histories. As long as it expresses the subsequent transition state (subsequent route and destination) and frequency, etc.
- the transition state information may be a partial tree structure that includes at least this route in the tree structure shown in Fig. 5.
- the transition state information may be represented by a table or matrix.
- the present invention can be used for a technology for providing information to a user using information devices such as a navigation device, a mobile phone, a PDA, and the like. It is effective because you can get
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP03758722A EP1551195A4 (en) | 2002-10-10 | 2003-10-10 | INFORMATION PROCESSING, INFORMATION PROCESSING AND INFORMATION ACCOUNTING DEVICE |
US10/529,609 US7487918B2 (en) | 2002-10-10 | 2003-10-10 | Information acquisition method, information presenting method, and information acquisition system |
JP2005501029A JP3722229B2 (ja) | 2002-10-10 | 2003-10-10 | 情報取得方法、情報提示方法、および情報取得装置 |
AU2003275550A AU2003275550A1 (en) | 2002-10-10 | 2003-10-10 | Information acquisition method, information providing method, and information acquisition device |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2002297304 | 2002-10-10 | ||
JP2002-297304 | 2002-10-10 | ||
JP2003107595 | 2003-04-11 | ||
JP2003-107595 | 2003-04-11 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004034725A1 true WO2004034725A1 (ja) | 2004-04-22 |
Family
ID=32095426
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2003/013092 WO2004034725A1 (ja) | 2002-10-10 | 2003-10-10 | 情報取得方法、情報提供方法、および情報取得装置 |
Country Status (5)
Country | Link |
---|---|
US (1) | US7487918B2 (ja) |
EP (1) | EP1551195A4 (ja) |
JP (2) | JP3722229B2 (ja) |
AU (1) | AU2003275550A1 (ja) |
WO (1) | WO2004034725A1 (ja) |
Cited By (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006053132A (ja) * | 2004-07-13 | 2006-02-23 | Matsushita Electric Ind Co Ltd | 移動先表示装置および移動先表示方法 |
JP2007078366A (ja) * | 2005-09-09 | 2007-03-29 | Ibm Japan Ltd | 地図情報の付加情報を取得する方法およびコンピュータ |
JP2007256075A (ja) * | 2006-03-23 | 2007-10-04 | Denso It Laboratory Inc | ナビゲーション装置 |
WO2007119559A1 (ja) * | 2006-04-14 | 2007-10-25 | Panasonic Corporation | 移動先予測装置および移動先予測方法 |
JP2008070377A (ja) * | 2004-07-13 | 2008-03-27 | Matsushita Electric Ind Co Ltd | 移動先表示装置および移動先表示方法 |
JP2008082940A (ja) * | 2006-09-28 | 2008-04-10 | Denso It Laboratory Inc | ナビゲーション装置、方法およびプログラム |
JP2009008684A (ja) * | 2002-10-10 | 2009-01-15 | Panasonic Corp | 情報取得方法 |
WO2009028019A1 (ja) * | 2007-08-24 | 2009-03-05 | Pioneer Corporation | ナビゲーション装置、目的地設定方法及び目的地設定プログラム |
JP2011099747A (ja) * | 2009-11-05 | 2011-05-19 | Denso It Laboratory Inc | 情報提示システム及び情報提示方法 |
US8068977B2 (en) | 2006-09-28 | 2011-11-29 | Panasonic Corporation | Destination prediction apparatus and method thereof |
EP1635143A3 (en) * | 2004-09-14 | 2013-03-06 | Alpine Electronics, Inc. | Navigation apparatus, driving direction guidance method, and navigation system |
JP2013510300A (ja) * | 2009-11-04 | 2013-03-21 | トムトム インターナショナル ベスローテン フエンノートシャップ | ナビゲーション装置及び方法 |
JP2013134205A (ja) * | 2011-12-27 | 2013-07-08 | Fujitsu Ltd | 移動先予測方法,移動先予測プログラムおよび移動先予測装置 |
US9164175B2 (en) | 2009-02-27 | 2015-10-20 | Blackberry Limited | Wireless communications system providing notification-based mobile device navigation features and related methods |
US9351255B2 (en) | 2013-08-28 | 2016-05-24 | Fujitsu Limited | Portable information processing device and information processing method |
JP2017003400A (ja) * | 2015-06-09 | 2017-01-05 | 株式会社富士通アドバンストエンジニアリング | 情報処理プログラム、情報処理方法、および情報処理装置 |
JP2018194465A (ja) * | 2017-05-18 | 2018-12-06 | 楽天株式会社 | 位置情報取得装置、位置情報取得方法、及びそのプログラム |
DE112013006463B4 (de) | 2013-01-21 | 2021-10-21 | Mitsubishi Electric Corporation | Zielvorhersagevorrichtung |
Families Citing this family (71)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3907122B2 (ja) * | 2004-03-30 | 2007-04-18 | 本田技研工業株式会社 | 交通情報提供システム |
US20050228553A1 (en) * | 2004-03-30 | 2005-10-13 | Williams International Co., L.L.C. | Hybrid Electric Vehicle Energy Management System |
JP2005301904A (ja) * | 2004-04-15 | 2005-10-27 | Mitsubishi Electric Corp | 住所データベースおよびこれを用いた住所検索システム |
JP4566844B2 (ja) * | 2005-07-01 | 2010-10-20 | 株式会社デンソー | ナビゲーションシステム、および、そのナビゲーションシステムに用いる記憶装置 |
GB0518617D0 (en) * | 2005-09-13 | 2005-10-19 | Hopkins Mark | Network message and alert selection apparatus and method |
US7975263B2 (en) * | 2006-01-10 | 2011-07-05 | Intel Corporation | Method and apparatus for generating run time profiles for program compilation |
JP4783181B2 (ja) * | 2006-03-13 | 2011-09-28 | 株式会社東芝 | 行動予測装置 |
WO2007145625A1 (en) * | 2006-06-14 | 2007-12-21 | Lucent Technologies, Inc. | Dynamic route prediction based on travel patterns of mobile units |
EP1882901B1 (de) | 2006-07-27 | 2014-09-10 | Ford-Werke GmbH | Verfahren und Vorrichtung zur Verarbeitung von Fahrtinformationen in einem Fahrzeug |
EP2080984B1 (en) | 2007-05-02 | 2013-01-16 | Panasonic Corporation | Destination estimating device, destination estimating method and navigation device |
JP4985150B2 (ja) * | 2007-06-29 | 2012-07-25 | 日産自動車株式会社 | 車両用運転支援装置および車両用運転支援装置を備える車両 |
US9392074B2 (en) | 2007-07-07 | 2016-07-12 | Qualcomm Incorporated | User profile generation architecture for mobile content-message targeting |
US20090013051A1 (en) | 2007-07-07 | 2009-01-08 | Qualcomm Incorporated | Method for transfer of information related to targeted content messages through a proxy server |
WO2009011838A2 (en) * | 2007-07-13 | 2009-01-22 | Dash Navigation, Inc. | System and method for sharing user-identified routes |
US8660794B2 (en) * | 2007-07-13 | 2014-02-25 | Dash Navigation, Inc. | System and method for providing shared information about traveled road segments |
US7885764B2 (en) * | 2007-09-06 | 2011-02-08 | GM Global Technology Operations LLC | Method for adaptively constructing and revising road maps |
US20090124241A1 (en) | 2007-11-14 | 2009-05-14 | Qualcomm Incorporated | Method and system for user profile match indication in a mobile environment |
US20090157512A1 (en) | 2007-12-14 | 2009-06-18 | Qualcomm Incorporated | Near field communication transactions with user profile updates in a mobile environment |
US8022831B1 (en) * | 2008-01-03 | 2011-09-20 | Pamela Wood-Eyre | Interactive fatigue management system and method |
DE102008005796A1 (de) * | 2008-01-23 | 2009-07-30 | Navigon Ag | Verfahren zum Betrieb eines Navigationssystems und Verfahren zur Erstellung einer Datenbank mit potentiellen Zielpunkten und Navigationsgerät |
WO2009143876A1 (en) * | 2008-05-29 | 2009-12-03 | Tomtom International B.V. | Navigation system and method for providing travel information in a navigation system |
US8577599B2 (en) * | 2008-06-30 | 2013-11-05 | General Motors Llc | Method and system to calculate historical traffic data |
JP4733165B2 (ja) * | 2008-06-30 | 2011-07-27 | 株式会社デンソー | 車両ナビゲーションシステム |
WO2010048146A1 (en) * | 2008-10-20 | 2010-04-29 | Carnegie Mellon University | System, method and device for predicting navigational decision-making behavior |
US8271413B2 (en) | 2008-11-25 | 2012-09-18 | Google Inc. | Providing digital content based on expected user behavior |
GB0822602D0 (en) * | 2008-12-11 | 2009-01-21 | Tomtom Int Bv | Navigation device & Methods |
US8533726B2 (en) | 2009-02-24 | 2013-09-10 | Nec Corporation | Device, system, method, and program for computing resource allocation based on external environment and transition frequency |
JP5129187B2 (ja) * | 2009-03-30 | 2013-01-23 | 株式会社ゼンリンデータコム | 属性特定システムおよび属性特定方法 |
JP2010267105A (ja) * | 2009-05-15 | 2010-11-25 | Yahoo Japan Corp | 行動履歴を検索する装置、方法及びプログラム |
DE102009047119A1 (de) * | 2009-11-25 | 2011-05-26 | Robert Bosch Gmbh | Verfahren zum Betreiben eines Navigationssystems eines Kraftfahrzeugs und Navigationssystem |
JP5128620B2 (ja) * | 2010-02-15 | 2013-01-23 | 株式会社エヌ・ティ・ティ・ドコモ | 訪問地予測装置、及び、訪問地予測方法 |
US8392116B2 (en) * | 2010-03-24 | 2013-03-05 | Sap Ag | Navigation device and method for predicting the destination of a trip |
JP5163705B2 (ja) | 2010-07-07 | 2013-03-13 | 株式会社デンソー | 車両乗降履歴関連付け装置および車両乗降履歴関連付け装置用のプログラム |
US8754777B1 (en) | 2010-08-13 | 2014-06-17 | Google Inc. | System and method for predicting user route and destination |
KR101524886B1 (ko) * | 2010-10-07 | 2015-06-01 | 네이버 주식회사 | 이차 정보를 생성하는 위치 기반 서비스 시스템 및 방법 |
US9664527B2 (en) * | 2011-02-25 | 2017-05-30 | Nokia Technologies Oy | Method and apparatus for providing route information in image media |
JP2012251954A (ja) * | 2011-06-06 | 2012-12-20 | Denso It Laboratory Inc | 目的地推定装置及びそれを含むナビゲーションシステム、目的地推定方法、及び目的地推定プログラム |
JP2013065116A (ja) | 2011-09-15 | 2013-04-11 | Fujitsu Ltd | 情報管理方法及び情報管理装置 |
CN102568195A (zh) * | 2011-12-29 | 2012-07-11 | 上海顶竹通讯技术有限公司 | 预判车辆行驶轨迹的方法及系统 |
JP5925070B2 (ja) * | 2012-06-26 | 2016-05-25 | 株式会社デンソーアイティーラボラトリ | 地図更新システム、地図更新方法およびプログラム |
JP6169826B2 (ja) * | 2012-06-27 | 2017-07-26 | ソニー株式会社 | 情報処理装置、情報処理方法、プログラム及び情報処理システム |
CN104471350A (zh) | 2012-07-17 | 2015-03-25 | 三菱电机株式会社 | 车载用交通信息通知装置 |
AU2012216820B2 (en) * | 2012-09-13 | 2015-09-03 | Mail Call Couriers Pty Ltd | A system and method for allocating an item |
WO2014040133A1 (en) * | 2012-09-13 | 2014-03-20 | Mail Call Couriers Pty Ltd | A system and method for providing an indication of an anticipated time of arrival of a courier at a predetermined waypoint |
US9219668B2 (en) * | 2012-10-19 | 2015-12-22 | Facebook, Inc. | Predicting the future state of a mobile device user |
JP5462341B2 (ja) * | 2012-11-01 | 2014-04-02 | 株式会社ゼンリンデータコム | 属性特定システム、属性特定方法、および、コンピュータプログラム |
JP5460820B2 (ja) * | 2012-11-01 | 2014-04-02 | 株式会社ゼンリンデータコム | 属性特定システム、属性特定方法、および、コンピュータプログラム |
JP6028558B2 (ja) * | 2012-12-19 | 2016-11-16 | 富士通株式会社 | 情報処理方法、情報処理装置およびプログラム |
JP5486668B2 (ja) * | 2012-12-20 | 2014-05-07 | 株式会社ゼンリンデータコム | 属性特定システム、属性特定方法、および、コンピュータプログラム |
CN104995973B (zh) * | 2013-03-18 | 2020-08-11 | 英特尔公司 | 移动设备定位系统 |
US9803990B2 (en) * | 2013-05-30 | 2017-10-31 | Oath (Americas) Inc. | Systems and methods for providing mobile mapping services including trip prediction and route recommendation |
US9618343B2 (en) | 2013-12-12 | 2017-04-11 | Microsoft Technology Licensing, Llc | Predicted travel intent |
US10113879B2 (en) * | 2014-03-03 | 2018-10-30 | Apple Inc. | Hierarchy of tools for navigation |
US9347787B2 (en) | 2014-03-03 | 2016-05-24 | Apple Inc. | Map application with improved search tools |
US9648463B2 (en) * | 2014-12-19 | 2017-05-09 | Here Global B.V. | Method and apparatus for providing context-related point-of-interest recommendations |
JP6637054B2 (ja) | 2015-01-27 | 2020-01-29 | ベイジン ディディ インフィニティ テクノロジー アンド ディベロップメント カンパニー リミティッド | オン・デマンドサービスの情報を提供する方法及びシステム |
US10235817B2 (en) * | 2015-09-01 | 2019-03-19 | Ford Global Technologies, Llc | Motion compensation for on-board vehicle sensors |
JP6555049B2 (ja) * | 2015-09-24 | 2019-08-07 | 富士通株式会社 | 共通情報出力方法、装置、プログラム、及び経路グラフ生成方法 |
US9587955B1 (en) | 2015-10-12 | 2017-03-07 | International Business Machines Corporation | Adaptive audio guidance navigation |
GB2543269A (en) * | 2015-10-12 | 2017-04-19 | Information Edge Ltd | A navigation system |
JP6332287B2 (ja) | 2016-01-13 | 2018-05-30 | トヨタ自動車株式会社 | 経路予測装置および経路予測方法 |
EP3214406A1 (en) | 2016-03-04 | 2017-09-06 | Volvo Car Corporation | Method and system for utilizing a trip history |
CN107633680B (zh) * | 2016-07-12 | 2021-05-04 | 阿里巴巴集团控股有限公司 | 出行数据的获取方法、装置、设备和系统 |
KR102552013B1 (ko) * | 2016-12-20 | 2023-07-05 | 현대자동차 주식회사 | 목적지 예측 기반 차량 제어 방법 및 시스템 |
EP3811031A4 (en) * | 2018-06-20 | 2022-02-16 | Bayerische Motoren Werke Aktiengesellschaft | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR PREDICTING USER MOBILITY |
WO2020059118A1 (ja) * | 2018-09-21 | 2020-03-26 | 三菱電機株式会社 | 運転支援装置および運転支援方法 |
JP2020112917A (ja) * | 2019-01-09 | 2020-07-27 | 日本電信電話株式会社 | 目的地予測装置、方法、及びプログラム |
JP7235060B2 (ja) * | 2019-02-01 | 2023-03-08 | 日本電気株式会社 | 経路計画装置、経路計画方法、及びプログラム |
KR20220020965A (ko) * | 2019-06-27 | 2022-02-21 | 그랩택시 홀딩스 피티이. 엘티디. | 루트 정보 프로세싱 |
US11650071B2 (en) | 2020-02-26 | 2023-05-16 | Honda Motor Co., Ltd. | User preference based vehicle data communication and control |
CN113946757B (zh) * | 2021-12-21 | 2022-04-12 | 深圳市活力天汇科技股份有限公司 | 一种识别用户出行目的的方法、装置及可读存储介质 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001014297A (ja) * | 1999-06-28 | 2001-01-19 | Sony Corp | 行動予測方法、情報提供方法及びそれらの装置 |
JP2002213990A (ja) * | 2001-01-22 | 2002-07-31 | Mitsubishi Electric Corp | 携帯情報端末におけるナビゲーションシステム及び携帯情報端末における地図情報ダウンロード要求方法 |
JP2002267487A (ja) * | 2001-03-13 | 2002-09-18 | Sharp Corp | 帰宅時間予測システム、並びに遠隔制御システム |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ATE189056T1 (de) * | 1994-10-07 | 2000-02-15 | Mannesmann Ag | Zieleingabe für navigationssystem |
JP3719310B2 (ja) | 1997-06-17 | 2005-11-24 | 三菱電機株式会社 | ナビゲーション装置 |
JP2984651B2 (ja) | 1997-07-18 | 1999-11-29 | 株式会社東芝 | 無線通信システム、無線通信方法、無線端末の位置検出方法及び記録媒体 |
JP3449199B2 (ja) | 1997-11-14 | 2003-09-22 | 日産自動車株式会社 | 車載情報装置 |
JP3765666B2 (ja) | 1998-03-11 | 2006-04-12 | 富士通株式会社 | 通信制御システム |
US20010001848A1 (en) | 1998-06-25 | 2001-05-24 | Hidekazu Oshizawa | Vehicle navigation system providing traffic advisories based on traffic information and learned route |
JP3488104B2 (ja) | 1998-11-18 | 2004-01-19 | 富士通株式会社 | 移動体の特性抽出装置,特性抽出方法およびそのプログラム記録媒体 |
JP4431907B2 (ja) | 1999-04-09 | 2010-03-17 | ソニー株式会社 | 情報提供方法及びその装置 |
JP3703994B2 (ja) | 1999-05-10 | 2005-10-05 | シャープ株式会社 | サービス情報提供装置および情報端末 |
US6256579B1 (en) * | 1999-07-13 | 2001-07-03 | Alpine Electronics, Inc. | Vehicle navigation system with road link re-costing |
US6317686B1 (en) * | 2000-07-21 | 2001-11-13 | Bin Ran | Method of providing travel time |
US6615133B2 (en) | 2001-02-27 | 2003-09-02 | International Business Machines Corporation | Apparatus, system, method and computer program product for determining an optimum route based on historical information |
JP4497748B2 (ja) | 2001-04-27 | 2010-07-07 | パイオニア株式会社 | ナビゲーション装置、ナビゲーションシステム用のサーバ装置、目的地推定処理プログラムおよび目的地推定処理プログラムを記録した記録媒体 |
US20030225668A1 (en) * | 2002-03-01 | 2003-12-04 | Mitsubishi Denki Kabushiki Kaisha | System and method of acquiring traffic data |
EP1551195A4 (en) * | 2002-10-10 | 2007-04-18 | Matsushita Electric Ind Co Ltd | INFORMATION PROCESSING, INFORMATION PROCESSING AND INFORMATION ACCOUNTING DEVICE |
-
2003
- 2003-10-10 EP EP03758722A patent/EP1551195A4/en not_active Withdrawn
- 2003-10-10 JP JP2005501029A patent/JP3722229B2/ja not_active Expired - Lifetime
- 2003-10-10 US US10/529,609 patent/US7487918B2/en active Active
- 2003-10-10 AU AU2003275550A patent/AU2003275550A1/en not_active Abandoned
- 2003-10-10 WO PCT/JP2003/013092 patent/WO2004034725A1/ja not_active Application Discontinuation
-
2008
- 2008-07-14 JP JP2008182391A patent/JP2009008684A/ja active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001014297A (ja) * | 1999-06-28 | 2001-01-19 | Sony Corp | 行動予測方法、情報提供方法及びそれらの装置 |
JP2002213990A (ja) * | 2001-01-22 | 2002-07-31 | Mitsubishi Electric Corp | 携帯情報端末におけるナビゲーションシステム及び携帯情報端末における地図情報ダウンロード要求方法 |
JP2002267487A (ja) * | 2001-03-13 | 2002-09-18 | Sharp Corp | 帰宅時間予測システム、並びに遠隔制御システム |
Non-Patent Citations (1)
Title |
---|
See also references of EP1551195A4 * |
Cited By (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2009008684A (ja) * | 2002-10-10 | 2009-01-15 | Panasonic Corp | 情報取得方法 |
JP2008070377A (ja) * | 2004-07-13 | 2008-03-27 | Matsushita Electric Ind Co Ltd | 移動先表示装置および移動先表示方法 |
JP2006053132A (ja) * | 2004-07-13 | 2006-02-23 | Matsushita Electric Ind Co Ltd | 移動先表示装置および移動先表示方法 |
EP1635143A3 (en) * | 2004-09-14 | 2013-03-06 | Alpine Electronics, Inc. | Navigation apparatus, driving direction guidance method, and navigation system |
JP2007078366A (ja) * | 2005-09-09 | 2007-03-29 | Ibm Japan Ltd | 地図情報の付加情報を取得する方法およびコンピュータ |
JP2007256075A (ja) * | 2006-03-23 | 2007-10-04 | Denso It Laboratory Inc | ナビゲーション装置 |
WO2007119559A1 (ja) * | 2006-04-14 | 2007-10-25 | Panasonic Corporation | 移動先予測装置および移動先予測方法 |
US7630828B2 (en) | 2006-04-14 | 2009-12-08 | Panasonic Corporation | Destination prediction device and destination prediction method |
JP2008082940A (ja) * | 2006-09-28 | 2008-04-10 | Denso It Laboratory Inc | ナビゲーション装置、方法およびプログラム |
JP4637073B2 (ja) * | 2006-09-28 | 2011-02-23 | 株式会社デンソーアイティーラボラトリ | ナビゲーション装置、方法およびプログラム |
US8068977B2 (en) | 2006-09-28 | 2011-11-29 | Panasonic Corporation | Destination prediction apparatus and method thereof |
WO2009028019A1 (ja) * | 2007-08-24 | 2009-03-05 | Pioneer Corporation | ナビゲーション装置、目的地設定方法及び目的地設定プログラム |
US9164175B2 (en) | 2009-02-27 | 2015-10-20 | Blackberry Limited | Wireless communications system providing notification-based mobile device navigation features and related methods |
JP2013510300A (ja) * | 2009-11-04 | 2013-03-21 | トムトム インターナショナル ベスローテン フエンノートシャップ | ナビゲーション装置及び方法 |
US10060754B2 (en) | 2009-11-04 | 2018-08-28 | Tomtom Navigation B.V. | Navigation device and method |
JP2011099747A (ja) * | 2009-11-05 | 2011-05-19 | Denso It Laboratory Inc | 情報提示システム及び情報提示方法 |
JP2013134205A (ja) * | 2011-12-27 | 2013-07-08 | Fujitsu Ltd | 移動先予測方法,移動先予測プログラムおよび移動先予測装置 |
DE112013006463B4 (de) | 2013-01-21 | 2021-10-21 | Mitsubishi Electric Corporation | Zielvorhersagevorrichtung |
US9351255B2 (en) | 2013-08-28 | 2016-05-24 | Fujitsu Limited | Portable information processing device and information processing method |
JP2017003400A (ja) * | 2015-06-09 | 2017-01-05 | 株式会社富士通アドバンストエンジニアリング | 情報処理プログラム、情報処理方法、および情報処理装置 |
JP2018194465A (ja) * | 2017-05-18 | 2018-12-06 | 楽天株式会社 | 位置情報取得装置、位置情報取得方法、及びそのプログラム |
Also Published As
Publication number | Publication date |
---|---|
JP2009008684A (ja) | 2009-01-15 |
JPWO2004034725A1 (ja) | 2006-02-09 |
US20050251325A1 (en) | 2005-11-10 |
JP3722229B2 (ja) | 2005-11-30 |
US7487918B2 (en) | 2009-02-10 |
EP1551195A4 (en) | 2007-04-18 |
AU2003275550A1 (en) | 2004-05-04 |
EP1551195A1 (en) | 2005-07-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP3722229B2 (ja) | 情報取得方法、情報提示方法、および情報取得装置 | |
JP4248515B2 (ja) | 情報取得方法、情報提示方法、および情報取得装置 | |
JP2007263972A (ja) | 情報提示方法および情報提示装置 | |
JP4495620B2 (ja) | 移動先予測装置および移動先予測方法 | |
US7869942B2 (en) | Travel plan presenting apparatus and method thereof | |
JP4283338B2 (ja) | 移動先予測装置、移動先予測方法、ナビゲーション装置及びプログラム | |
US8718925B2 (en) | Collaborative route planning for generating personalized and context-sensitive routing recommendations | |
JP5051010B2 (ja) | 駐車場案内装置、駐車場案内方法及びプログラム | |
CN1330937C (zh) | 信息提供方法 | |
US8068977B2 (en) | Destination prediction apparatus and method thereof | |
CN101228566B (zh) | 提供关于在道路上的速度预测的交通信息的方法和装置 | |
US6356836B1 (en) | Method and device for generating, merging and updating of destination tracking data | |
CN100593801C (zh) | 提供关于交通拥塞趋势的信息的方法和使用该方法的装置 | |
TWI428249B (zh) | 車載裝置及其行車輔助系統與行車輔助資訊提供方法 | |
US20120161985A1 (en) | Providing guidance for locating street parking | |
US20070005235A1 (en) | Navigation system | |
WO2003040654A1 (fr) | Programme et appareil de navigation pour vehicule | |
CN100429953C (zh) | 信息取得方法、信息提供方法及信息取得装置 | |
JP5114254B2 (ja) | 地図表示システム、経路探索サーバおよび経路探索方法ならびに端末装置 | |
CN115691203A (zh) | 一种城市道路泊位诱导方法、装置、设备及可读存储介质 | |
JP4200747B2 (ja) | 移動情報分類装置、移動情報分類方法、及び移動情報分類プログラム | |
JP7264859B2 (ja) | ナビゲーションシステム、その検索ルートの推奨方法、およびプログラム | |
JP2021124336A (ja) | 経路探索装置、経路探索方法及びコンピュータプログラム | |
JP2008170291A (ja) | 情報配信装置 | |
JP2005032275A (ja) | 移動情報処理装置及び移動情報処理方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2005501029 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20038A06931 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10529609 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003758722 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2003758722 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2003758722 Country of ref document: EP |