WO2014199428A1 - Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat - Google Patents

Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat Download PDF

Info

Publication number
WO2014199428A1
WO2014199428A1 PCT/JP2013/065973 JP2013065973W WO2014199428A1 WO 2014199428 A1 WO2014199428 A1 WO 2014199428A1 JP 2013065973 W JP2013065973 W JP 2013065973W WO 2014199428 A1 WO2014199428 A1 WO 2014199428A1
Authority
WO
WIPO (PCT)
Prior art keywords
destination
feature
candidate
information
past
Prior art date
Application number
PCT/JP2013/065973
Other languages
English (en)
Japanese (ja)
Inventor
山崎　博司
Original Assignee
パイオニア株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by パイオニア株式会社 filed Critical パイオニア株式会社
Priority to PCT/JP2013/065973 priority Critical patent/WO2014199428A1/fr
Publication of WO2014199428A1 publication Critical patent/WO2014199428A1/fr

Links

Images

Classifications

    • 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/3679—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities
    • 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/3608—Destination input or retrieval using speech input, e.g. using speech recognition
    • 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
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Definitions

  • This application belongs to the technical field of a candidate notification device, a candidate notification method, and a candidate notification program. More specifically, it belongs to the technical field of a candidate notification device and a candidate notification method for notifying a candidate for a destination when moving, and a program for the candidate notification device.
  • the facility is set as the destination in the past, or the destination candidates are rearranged according to the frequency of arrival at the facility. ing. Moreover, the structure which further rearranges the facility rearranged by frequency according to distance is also disclosed.
  • Patent Document 2 in a system that searches for a destination by combining “prefecture” and “facility name”, a facility set as a destination in the past may be omitted. It can be searched.
  • the facilities set as destinations in the past are saved as a database (dynamic dictionary), and when searching without a prefecture, the dynamic dictionary is searched, and further, the dynamic dictionary is searched. Among the facilities, facilities far from the predetermined distance are not displayed in the search results.
  • the present application has been made in view of each of the above problems, and an example of the problem is to display the destination candidates while improving the convenience while reflecting the past movement history of the user. It is an object to provide a candidate notification device, a candidate notification method, and a program for the candidate notification device.
  • the invention according to claim 1 is characterized in that input means for inputting destination related information related to the destination, and feature information related to the feature as a candidate for the destination. And acquisition means for respectively acquiring past destination information related to the feature that has become the destination in the past, and extraction for extracting each of the destination candidates from the feature information and the past destination information A priority for notifying the destination candidate based on the calculated distance, and a calculation means for calculating the distance between the means, each of the destination candidates, and the starting point of the movement Determining means for determining the destination candidates in an order corresponding to the determined priority, wherein the determining means is associated with the past destination information. A feature associated with the feature information. Configured to determine the priority by relatively precedence over.
  • the invention according to claim 15 is an input step in which destination related information related to a destination is input in a candidate notification method executed in a candidate notification device including notification means.
  • the priority is determined by giving priority to the feature related to the past destination information relative to the feature related to the feature information. Composed.
  • the invention described in claim 16 is a computer included in a candidate notification device comprising input means for inputting destination-related information related to a destination, and notification means.
  • FIG. 1 is a block diagram illustrating a schematic configuration of the candidate notification device according to the embodiment.
  • the candidate notification device according to the embodiment may be mounted on a vehicle or carried by a user, for example, or may be fixedly installed at the user's home or the like.
  • the candidate notification device S according to the embodiment includes an input unit 1, an acquisition unit 2, an extraction unit 3, a calculation unit 4, a determination unit 5, and a notification unit 6. Configured.
  • destination related information related to the destination is input to the input means 1.
  • the acquisition unit 2 acquires feature information related to a feature that is a destination candidate and past destination information related to a feature that has been a destination in the past.
  • the feature corresponds to, for example, a facility that can be the destination or a point on the map that can be a destination other than the facility.
  • the extracting unit 3 extracts destination candidates from the feature information acquired through the acquiring unit 2 and the past destination information acquired through the acquiring unit 2.
  • the calculation means 4 calculates the distance between each destination candidate and the starting point of the movement.
  • the starting point corresponds to, for example, the current position or a position on the map arbitrarily set by the user.
  • the determination unit 5 determines the priority for notifying the destination candidate based on the distance calculated by the calculation unit 4.
  • the notification means 6 notifies the destination candidates in the order corresponding to the priority determined by the determination means 5.
  • the determination means 5 determines the priority by giving priority to the feature related to the past destination information relative to the feature related to the feature information.
  • the feature related to the past destination information is related to the feature information. Announces in the order of priority given to the feature in question. Therefore, by prioritizing the features related to the past destination information, the current destination candidates can be notified in the order in accordance with the past movement history.
  • Example demonstrated below is an Example at the time of applying embodiment with respect to the destination search process in the navigation apparatus which performs the guidance process which guides a vehicle to the destination, for example.
  • FIG. 2 is a block diagram showing a schematic configuration of the navigation device according to the embodiment
  • FIG. 3 is a diagram illustrating the contents of the database according to the embodiment.
  • FIG. 4 is a flowchart showing the destination search process according to the embodiment
  • FIG. 5 is a diagram illustrating the result of the destination search process according to the embodiment.
  • the navigation device S includes the microphone 1A and the recognition unit 1B as an example of the input unit according to the embodiment, the interface 2, and the extraction.
  • a processing unit 10 including a unit 3, a calculation unit 4 and a determination unit 5, a display 6 including a liquid crystal display or the like and corresponding to an example of the notification unit 6 according to the embodiment, and an operation unit 11 including an operation button or a remote controller ,
  • a recording unit 13 composed of a hard disk, etc., and a sensor unit composed of a self-supporting sensor such as an acceleration sensor, a GPS (Global Positioning System) sensor, a VICS (Vehicle Information and Communication System) (registered trademark) sensor for collecting traffic jam information, etc.
  • GPS Global Positioning System
  • VICS Vehicle Information and Communication System
  • the recording unit 13 searches for a route to a destination searched for by map data and voice data necessary for moving guidance of the vehicle on which the navigation device S is mounted, or a destination search process according to the embodiment.
  • Navigation data such as route search data is recorded in a nonvolatile manner.
  • the interface 2 corresponds to an example of the acquisition unit 2 according to the embodiment
  • the extraction unit 3 corresponds to an example of the extraction unit 3 according to the embodiment.
  • the calculation unit 4 corresponds to an example of the calculation unit 4 according to the embodiment
  • the determination unit 5 corresponds to an example of the determination unit 5 according to the embodiment.
  • the interface 2, the extraction unit 3, the calculation unit 4, and the determination unit 5 are configured by a so-called hardware logic circuit as the processing unit 10 including a CPU, a RAM (Random Access Memory), a ROM (Read Only Memory), and the like. Alternatively, it may be functionally realized by the CPU reading and executing a program corresponding to a flowchart showing a destination search process according to an embodiment to be described later.
  • the microphone 1A corresponds to an example of “speech input unit” according to the present application
  • the recognition unit 1B corresponds to an example of “analysis unit” according to the present application
  • the operation unit 11 includes an example of “operation input unit” according to the present application.
  • Each corresponds to an example of “selection means”.
  • a facility information database 130 and a destination setting history database 131 are recorded in the recording unit 13 in a nonvolatile manner. Data necessary for execution of a destination search process according to an embodiment described later can be exchanged with the processing unit 10 via the interface 2.
  • the facility information database 130 name data indicating names of facilities on the map that can be candidates for destinations or features other than facilities (hereinafter simply referred to as “facility”), Latitude data indicating the latitude of the position, longitude data indicating the longitude of the position, and address data indicating the address are stored in association with IDs identifiable for other facilities.
  • the destination setting history database 131 includes name data indicating the name of a facility that has been searched and set as a destination in the past, latitude data indicating the latitude of the position, and the position. Longitude data indicating the longitude and address data indicating the address are stored in association with IDs identifiable for other facilities.
  • the interface 2 controls data input / output with the recording unit 13.
  • the processing unit 10 displays the necessary information on the display 6 based on an operation by a user (driver or the like; hereinafter simply referred to as “user”) in the operation unit 11, and performs destination search processing according to the embodiment. Execute. At this time, various types of data recorded in the recording unit 13 are read out as necessary and provided to the destination search process by the processing unit 10.
  • the processing unit 10 also includes a navigation process including the above destination search process for guiding the movement of the vehicle on which the navigation device S is mounted based on the current position data and the traffic jam information output from the sensor unit 12. Execute.
  • the destination search processing according to the embodiment will be specifically described with reference to FIGS. Note that the destination search process is mainly performed with the processing unit 10 as the center.
  • Step S1 when the utterance voice indicating the destination is input by the user through the microphone 1A (step S1), the utterance content is recognized by the recognition unit 1B. (Step S2).
  • the destination search processing as a precondition, it is assumed that the user does not completely speak the name of the facility that the user wants to search as the destination. In addition, it is assumed that the user has already been to the facility and thus uttered only a part of the facility name recorded in the destination setting history database 131.
  • a process when the user wants to go to the “Yokohama International WORK” will be described.
  • the address of the user is Yokohama
  • “Yokohama International Gymnasium” is usually called “International Universities” for short. Therefore, in the voice input in step S1, “Yokohama” is omitted. Say “International WORK”.
  • “Yokohama International WORK” has experience that has been done before, and this is recorded in the destination setting history database 131. Under such conditions, it is assumed that the user speaks “I want to go to the international gymnasium” in order to go to “Yokohama International WORK” (see step S1 in FIG. 4). Thereby, the recognition unit 1B generates text data corresponding to the user's utterance content “I want to go to the international gymnasium” based on the voice signal corresponding to the sound (voice) detected by the microphone 1A, and the processing unit 10 to the extraction unit 3.
  • the extraction unit 3 extracts the desired destination name from the output text data (more precisely, a part of the original name “Yokohama International WORK”; the same applies hereinafter). Is extracted.
  • the extraction method in this case performs, for example, a so-called morpheme analysis process on the output text data, and the noun immediately preceding the particle “ni” (in the case of the example, “international gymnasium”) is searched for the destination to be searched. Extract as name.
  • the extraction unit 3 searches the facility information database 130 recorded in the recording unit 13 for items including “international gymnasium” (step S3), and the destination setting history database recorded in the recording unit 13 Also from 131, an item including “international gymnasium” is searched (step S4).
  • the facility information database 130 is searched for facility names including “international gymnasium”. As an example in this case, it is assumed that “Tokyo International Gymnasium”, “Yokohama International WORK”, and “Osaka International Gymnasium” are searched (see FIG. 3). Similarly, only “Yokohama International Gymnasium” is searched from the destination setting history database 131 (see FIG. 3).
  • the current position data is output from the sensor unit 12 to the processing unit 10, whereby the calculation unit 4 of the processing unit 10 performs the processing in step S 3 and the processing in step S 4, respectively.
  • the distance between the searched facility position and the current position indicated by the current position data is calculated for each searched facility (step S5).
  • the determination unit 5 selects the facilities retrieved from the facility information database 130 and the destination setting history database 131 as desired destination candidates, and sets the priority as the candidate for the facilities with a shorter distance to the facility.
  • the facilities that the user is likely to set as a destination are rearranged so that they are ranked higher as candidates (step S6).
  • the determination unit 5 calculates the facilities retrieved from the database having the same priority in display (either the facility information database 130 or the destination setting history database 131) by the process of step S5. The calculated distances are compared with each other, and priority is given to those that are close to each other (step S6).
  • step S4 for the facility retrieved from the destination setting history database 131.
  • the facility retrieved from the facility information database 130 is compared with the distance calculated by the process of step S4 (step S6).
  • the coefficient multiplied at this time is a positive number less than 1. More specifically, the determination unit 5 multiplies the distance calculated by the process of step S4 for the facility searched from the destination setting history database 131 by, for example, a coefficient “0.5” and then from the facility information database 130. The searched facility is compared with the distance calculated by the process of step S4.
  • the determination unit 5 weights the distance calculated by the process of step S4 for the facility searched from the destination setting history database 131 and sets it as a comparison target.
  • the weighting process related to the process of step S6 there is a facility where the distance calculated by the process of step S4 is the same between the facility searched from the facility information database 130 and the facility searched from the destination setting history database 131, for example.
  • the facility retrieved from the destination setting history database 131 is given priority and displayed as a candidate. This means that facilities that have been in the past are more likely to want to go again than facilities that have never been at the same distance (i.e., psychologically closer to the user).
  • the priority as a destination candidate is increased and displayed.
  • the processing unit 10 displays the facility retrieved from the facility information database 130 and the facility retrieved from the destination setting history database 131 as the desired destination candidates with the priority determined by the determination unit 5. 6 (step S7).
  • the priority as a candidate of “Yokohama International WORK” that should be searched from the destination setting history database 131 according to the embodiment is given higher than other gymnasiums. (See step S6 in FIG. 4), as a candidate for the purpose of actually being displayed on the display 6, as shown in FIG. 5B, from the top (that is, regardless of the actual distance, in descending order of priority). From), Yokohama International WORK ⁇ Tokyo International WORK ⁇ Osaka International Universities ⁇ ... (See step S7 in FIG. 4).
  • the processing unit 10 displays, for example, the highlighted candidates from the displayed candidates (as illustrated in FIG. 5B).
  • “Yokohama International WORK”, which is “Osaka International WORK” in the case of the example shown in FIG. 5D, is selected from the current position up to the selected destination when the operation unit 11 selects the desired destination.
  • the route is searched and displayed on the display 6, for example (step S8).
  • the route search in step S8 for example, a method similar to the conventional route search method is used.
  • step S9 determines whether or not to terminate the destination search process according to the embodiment, for example, for the reason that the guidance process has actually started (step S9), and if so (step S9; YES). Then, the destination search process is terminated as it is, and the process proceeds to the guidance process. On the other hand, when the destination search process is continuously executed in the determination of step S9 (step S9; NO), the processing unit 10 returns to the process of step S1 and continues the destination search process.
  • the facility that has been in the past that is, the facility recorded in the destination setting history database 131
  • the actual distance to the facility is multiplied by the above coefficient to make it shorter than the actual distance, and then compared with the distances of other facilities.
  • the coefficient is determined in advance, it is preferably determined experimentally or empirically so as not to be too small.
  • the facility searched from the destination setting history database 131 is searched from the facility information database 130 when displaying the destination candidates of the current vehicle. Are displayed in the order of priority in which priority is given to the designated facilities. Therefore, by prioritizing the facilities retrieved from the destination setting history database 131, the current destination candidates can be displayed in the order along the past movement history of the vehicle.
  • the destination candidate is searched using the user's utterance, the destination can be easily input using the utterance.
  • the coefficient is set based on the movement distance when moving to the facility searched from the destination setting history database 131 in the past, the current purpose is set in an order more suitable for the past movement history. Candidate candidates can be displayed.
  • the coefficient is set based on the moving distance when moving to the same facility as the destination corresponding to the facility input by the utterance. Candidates that are more suitable for this destination can be announced.
  • the abbreviation dictionary that stores the abbreviations of general names is used to convert the abbreviation (for example, the abbreviation “constitution” is converted to “international gymnasium”), and “international gymnasium” is extracted to search for facilities. It may be used.
  • the coefficient according to the embodiment is set so that the coefficient increases as the actual distance from the destination setting history database 131 to the facility searched is longer. May be. More specifically, for example, the coefficient when the distance is less than 100 kilometers is “0.5” as in the embodiment, whereas the coefficient when the distance is 100 kilometers or more and less than 200 kilometers is “0. 7 ”, and the coefficient when the distance is 200 km or more is“ 0.8 ”.
  • the longer the distance to the facility the lower the priority (in other words, even if the facility has been in the past, if it is far away, the priority is higher) It becomes difficult to display), and a destination candidate can be displayed by giving priority to a closer facility.
  • the destination A coefficient may be set based on, for example, an average value of movement distances when moving to all facilities searched from the setting history database 131 in the past. In this case, candidates for an average moving distance based on all past movement histories of the vehicle can be displayed.
  • the destination candidates can be displayed by lowering the priority of facilities farther than the threshold distance (that is, facilities that are not suitable as destinations).
  • the distance to the facility searched from the destination setting history database 131M using the average setting distance exemplified in FIG. 6 as the destination setting history database 131M is as follows. When the distance is equal to or less than the average set distance for the facility, a relatively small coefficient may be multiplied as compared with the case where the distance is longer than the average set distance. Even in this case, candidates closer to each other can be preferentially displayed.
  • the facility is searched for from the destination setting history database 131M and is multiplied by a coefficient corresponding to the variance (hereinafter simply referred to as “ ⁇ ”) from the average setting distance. Also good. More specifically, for example, the coefficient when the actual distance to the facility searched from the destination setting history database 131M is equal to or less than the average set distance corresponding to the facility is “0.5” as in the embodiment. On the other hand, the coefficient when the distance is equal to or less than the average set distance + ⁇ is “0.6”, and the coefficient when the distance is equal to or less than the average set distance + 2 ⁇ ⁇ is “0.7”.
  • the coefficient when the set distance is equal to or less than 3 ⁇ ⁇ is “0.8”, and the coefficient when the distance is longer than the average set distance + 3 ⁇ ⁇ is “1”. In this case, candidates corresponding to the past average travel distance history can be preferentially displayed.
  • the search may be performed using only the average set distance when moving after a time that is back by a predetermined period (for example, one year) from the current time.
  • candidates for the current destination can be displayed in the order according to the recent movement history of the vehicle.
  • the destination (“international gymnasium”) is input by the user's utterance. You may comprise so that the said destination may be input by input operation using the operation part 11 which concerns on an Example. In this case, since the destination is input by the operation, the necessary destination can be surely input.
  • the destination candidate is searched based on the distance starting from the current point of the vehicle.
  • a candidate for a destination may be searched based on a distance from a point other than the current point set by the operation in the operation unit 11 (hereinafter referred to as a set point). Good.
  • the facility that has moved from the set point in the past is searched from the destination setting history database 131 or the destination setting history database 131M.
  • the “distance” in the above-described embodiment and each modification may be a linear distance to the facility, or a distance on a predetermined route. There may be.
  • the configuration is such that the distance to the facility searched from the destination setting history database 131 or the destination setting history database 131M is multiplied by a coefficient having a value less than 1.
  • the distance to the facility searched from the facility information database 130 is multiplied by a coefficient having a value of 1 or more, and this is searched for from the destination setting history database 131 or the destination setting history database 131M. It is also possible to make a comparison with a distance up to (a distance not multiplied by a coefficient). Further, the coefficient having one or more values may be changed in accordance with the first to fifth modifications. Even in this case, the same effects as those of the above-described embodiments and modifications can be obtained as a result.
  • the destination candidate is displayed on the display 6, but in addition to this, the candidate may be notified by voice using a speaker (not shown). .
  • the facility information database 130, the destination setting history database 131, or the destination setting history database 131M is recorded in the navigation device S in the above-described embodiments and modifications, the facility information database is not limited thereto. 130, data corresponding to the destination setting history database 131 or the destination setting history database 131M may be acquired from an external server device or the like when necessary via a network such as the Internet.
  • the program corresponding to the flowchart shown in FIG. 4 is recorded on a recording medium such as a compact disk, or obtained and recorded from a network such as the Internet, and is read and executed by a general-purpose microcomputer. By doing so, it is possible to cause the microcomputer or the like to function as the processing unit 10 according to the embodiment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Remote Sensing (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Automation & Control Theory (AREA)
  • General Health & Medical Sciences (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Acoustics & Sound (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Human Computer Interaction (AREA)
  • Artificial Intelligence (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Social Psychology (AREA)
  • Navigation (AREA)

Abstract

L'invention concerne un dispositif d'annonce de candidat qui est capable d'afficher des candidats de destination tout en appliquant l'historique de mouvements passés d'un utilisateur et en améliorant la commodité de celui-ci. Le dispositif d'annonce de candidat comprend un microphone (1A) par lequel sont saisies des informations associées à la destination concernant une destination de mouvement de véhicule, une unité d'enregistrement (13) permettant d'acquérir des informations de caractéristiques concernant des caractéristiques qui sont des candidats de destination et des informations de destinations passées concernant des caractéristiques qui étaient des destinations dans le passé, une unité d'extraction (3) permettant d'extraire des candidats de destination à partir des informations de caractéristiques et des informations de destinations passées, une unité de calcul (4) permettant de calculer les distances entre chaque candidat de destination et un point de départ de mouvement, une unité de détermination (5) permettant de déterminer la priorité pour l'annonce de candidat de destination en fonction des distances calculées, et un affichage (6) permettant d'afficher des installations dans un ordre correspondant à la priorité déterminée. L'unité de détermination (5) détermine la priorité de façon que des caractéristiques associées aux informations de destinations passées aient la priorité par rapport à des caractéristiques associées aux informations de caractéristiques.
PCT/JP2013/065973 2013-06-10 2013-06-10 Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat WO2014199428A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2013/065973 WO2014199428A1 (fr) 2013-06-10 2013-06-10 Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2013/065973 WO2014199428A1 (fr) 2013-06-10 2013-06-10 Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat

Publications (1)

Publication Number Publication Date
WO2014199428A1 true WO2014199428A1 (fr) 2014-12-18

Family

ID=52021764

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2013/065973 WO2014199428A1 (fr) 2013-06-10 2013-06-10 Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat

Country Status (1)

Country Link
WO (1) WO2014199428A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016186461A (ja) * 2015-03-27 2016-10-27 アイシン・エィ・ダブリュ株式会社 施設案内システム、施設案内方法および施設案内プログラム
WO2017183220A1 (fr) * 2016-04-21 2017-10-26 クラリオン株式会社 Système, dispositif et procédé de fourniture d'informations
JP2019021274A (ja) * 2017-07-21 2019-02-07 クラリオン株式会社 情報処理装置、情報提供方法
CN110631602A (zh) * 2018-06-21 2019-12-31 丰田自动车株式会社 信息提供装置、系统、方法及非暂时性计算机可读介质

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003114134A (ja) * 2001-10-05 2003-04-18 Equos Research Co Ltd ナビゲーション装置
JP2004144712A (ja) * 2002-10-28 2004-05-20 Denso Corp カーナビゲーション装置
JP2008175773A (ja) * 2007-01-22 2008-07-31 Denso Corp 車両用ナビゲーション装置
JP2009265013A (ja) * 2008-04-28 2009-11-12 Aisin Aw Co Ltd 車載ナビゲーション装置
WO2010131445A1 (fr) * 2009-05-12 2010-11-18 日本電気株式会社 Système de réglage de destination et procédé de réglage de destination
WO2011096137A1 (fr) * 2010-02-08 2011-08-11 本田技研工業株式会社 Dispositif de navigation
JP2013097758A (ja) * 2011-11-07 2013-05-20 Fujitsu Ten Ltd 情報処理システム、サーバ装置、端末装置、プログラム及び情報処理方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003114134A (ja) * 2001-10-05 2003-04-18 Equos Research Co Ltd ナビゲーション装置
JP2004144712A (ja) * 2002-10-28 2004-05-20 Denso Corp カーナビゲーション装置
JP2008175773A (ja) * 2007-01-22 2008-07-31 Denso Corp 車両用ナビゲーション装置
JP2009265013A (ja) * 2008-04-28 2009-11-12 Aisin Aw Co Ltd 車載ナビゲーション装置
WO2010131445A1 (fr) * 2009-05-12 2010-11-18 日本電気株式会社 Système de réglage de destination et procédé de réglage de destination
WO2011096137A1 (fr) * 2010-02-08 2011-08-11 本田技研工業株式会社 Dispositif de navigation
JP2013097758A (ja) * 2011-11-07 2013-05-20 Fujitsu Ten Ltd 情報処理システム、サーバ装置、端末装置、プログラム及び情報処理方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016186461A (ja) * 2015-03-27 2016-10-27 アイシン・エィ・ダブリュ株式会社 施設案内システム、施設案内方法および施設案内プログラム
WO2017183220A1 (fr) * 2016-04-21 2017-10-26 クラリオン株式会社 Système, dispositif et procédé de fourniture d'informations
JP2017194850A (ja) * 2016-04-21 2017-10-26 クラリオン株式会社 情報提供システム、情報提供装置および情報提供方法
JP2019021274A (ja) * 2017-07-21 2019-02-07 クラリオン株式会社 情報処理装置、情報提供方法
CN110631602A (zh) * 2018-06-21 2019-12-31 丰田自动车株式会社 信息提供装置、系统、方法及非暂时性计算机可读介质

Similar Documents

Publication Publication Date Title
KR100819234B1 (ko) 네비게이션 단말의 목적지 설정 방법 및 장치
EP2560158B1 (fr) Système d'exploitation et procédé d'exploitation
US9105267B2 (en) Speech recognition apparatus
US20140100847A1 (en) Voice recognition device and navigation device
JP4715805B2 (ja) 車載情報検索装置
KR20200072907A (ko) 대화 시스템이 구비된 차량 및 그 제어 방법
CN110770819B (zh) 语音识别系统和方法
EP2863385B1 (fr) Système d'instruction d'exécution de fonction, procédé d'instruction d'exécution de fonction et programme d'instruction d'exécution de fonction
EP2660562A1 (fr) Appareil de guidage d'itinéraire et procédé avec reconnaissance vocale
CN111279296A (zh) 使用隐式路由来创建模块化对话
US10515634B2 (en) Method and apparatus for searching for geographic information using interactive voice recognition
WO2014199428A1 (fr) Dispositif d'annonce de candidat, méthode d'annonce de candidat, et programme d'annonce de candidat
KR20200098079A (ko) 대화 시스템 및 대화 처리 방법
WO2010131445A1 (fr) Système de réglage de destination et procédé de réglage de destination
JP2008234427A (ja) ユーザ間の対話を支援する装置、方法およびプログラム
JP2009230068A (ja) 音声認識装置及びナビゲーションシステム
JP5455355B2 (ja) 音声認識装置及びプログラム
JP2018141742A (ja) ナビゲーション装置、ナビゲーション方法、及びナビゲーション用プログラム
JP2017181631A (ja) 情報制御装置
WO2010073406A1 (fr) Dispositif de fourniture d'informations, terminal de communication, système de fourniture d'informations, procédé de fourniture d'informations, procédé de sortie d'informations, programme de fourniture d'informations, programme de sortie d'informations et support d'enregistrement
JP2017182251A (ja) 解析装置
US10401184B2 (en) Information processing device and information presentation system
EP3528136A1 (fr) Dispositif et procédé de fourniture de résultat de récupération
WO2006028171A1 (fr) Dispositif de présentation de données, méthode de présentation de données, programme de présentation de données et support d’enregistrement contenant le programme
KR20060098673A (ko) 음성 인식 방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13886813

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13886813

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP