The disclosure of Japanese Patent Application No. 2007-255569, filed on Sep. 28, 2007, including the specification, drawings, and abstract thereof, is incorporated herein by reference in its entirety.
1. Related Technical Fields
Related technical fields include parking support systems, parking support methods, and parking support programs capable of obtaining information regarding a parking space.
2. Related Art
Japanese Unexamined Patent Application Publication No. 2007-131169 discloses a system that detects a parking space by using a positioning sensor. The system determines whether a vehicle can park the detected parking space and notifies a user whether the vehicle can park the detected parking space.
According to the system of Japanese Unexamined Patent Application Publication No. 2007-131169, the only parking spaces that can be selected are the parking space located within the range of the sensor. Therefore, information regarding a parking space on a road far from the vehicle cannot be obtained by the sensor.
Accordingly, various exemplary implementations of the broad principles described herein provide a parking support system, a parking support method, and a parking support program capable of obtaining and notifying information regarding parking spaces on roads far from the vehicle.
Various exemplary implementations provide parking support systems, methods, and programs that store road information and obtain information regarding a vacant space on a road. The systems, methods, and programs calculate parking availability in a predetermined area specified by the stored road information based on the obtained information; and provide notification of the calculated parking availability.
Exemplary implementations will now be described with reference to the accompanying drawings, wherein:
Note that, in the description below, the word “park” is intended to encompass both “parking” and “stopping” under the Japanese Road Traffic Law.
As shown in
Alternatively, a navigation apparatus mounted on vehicle may function only as the information transmitting unit and/or a navigation apparatus mounted on vehicle may function only as the information receiving unit. The probe information management server 100, the information transmitting unit, and the information receiving unit may transmit and receive information via a communication network. The communication network may be a radio communication network and the signal band used in the communication in the present embodiment need not be limited.
First, the probe information management server 100 will be explained. As shown in
The processor 11 may control the entire probe information management server 100. Various elements may be connected to the processor 11. The connected various elements may be controlled by the processor 11. In addition, the processor 11 may execute various programs for example stored in a ROM. Further, the processor 11 may calculate information indicating a parking availability in a predetermined section by using predetermined information. The examples of methods that may be implemented in the form of programs executed by the processor 11 to calculate the information indicating the parking availability will be described later.
The probe information storage unit 12 may store probe information transmitted by the information transmitting unit. The communicator 13 may be an interface for communicating with the information transmitting unit and the information receiving unit.
The map DB 14 may store various map data needed for route guidance, traffic information guidance, and map display. The map DB 14 may also store road information. The road information may include node data and link data. The node data may be the data indicating geographic points on the road and include coordinates as the positional information of the geographic points. The link data may be the data indicating roads connecting the above-described node data and include a link length, a road width, a road category of a link (an expressway, a general road, a parking prohibited road, or a narrow street, for example) and so forth. In addition, data for regulations on driving (one-way traffic and/or time zone regulation), data for road name, and so forth of the link itself may be included. Therefore, a road can be specified by the link data. Further, a node ID and a link ID may be respectively given to the node data and the link data. An ID of a fixed object on the road may be stored in association with the positional information. Furthermore, the information stored in the map DB 14 may be used when calculating information that indicates the parking availability per link data.
The space detecting unit 21 may detect information regarding a vacant parking space (a vacant parking space information) in an available parking section on the road. Known sensors such as a camera, ultrasound waves, and so forth may be used for detecting the vacant parking space. The vacant parking space information to be detected will be described in detail below.
The processor 22 may execute electronic controls of the entire vehicle. Various elements may be connected to the processor 22. The connected various elements may be controlled by the processor 22. In addition, the processor 22 may execute various programs, such as, for example, programs that implement one or more of the exemplary methods described below.
The communicator 23 may be an interface for communicating with the probe information management server 100.
The map DB 24 may store various map data needed for route guidance, traffic information guidance, and map display. The map DB 24 may also store road information. The road information may include node data and link data. The node data may be data indicating geographic points on the road (nodes) and include coordinates as the positional information of the geographic points. The link data may be data indicating roads connecting nodes and includes data for a link length, a road width, a road category of the link (an expressway, a general road, a parking prohibited road, or a narrow street, for example) and so forth. In addition, data for regulations on driving (one-way traffic, time zone regulation), data for road name, and so forth for the link itself may be included. Therefore, a road can be specified by the link data. Further, a node ID and a link ID may be respectively given to the node data and the link data. In addition, the data stored in the map DB 14 and the data stored in the map DB 24 may correspond. Note that the information stored in the map DB 24 may be used when calculating the information that indicates the parking availability in a predetermined section.
The own vehicle position detecting unit 25 may detect the position of the vehicle in which the navigation apparatus is mounted. A GPS, a distance sensor, a steering sensor, a gyro sensor as a bearing detector and so forth (Not shown in the diagram) may be used for detecting the own vehicle position. The display unit 26 may display the own vehicle position, a road, and so forth. The display unit 26 may also be used in the case of giving various warnings to a user. The display unit 26 may be structured with a liquid crystal display and/it may be touch panel compliant.
Next, an exemplary method of transmitting information will be described with reference to
The method may be executed at predetermined intervals (20 ms, for example) while the vehicle travels. It may also be possible to manually switch ON/OFF of this execution of the method.
As shown in
When a vacant parking space exists (S1: YES), the sequence may proceed to S2. At S2, vacant parking space information may be created. The vacant parking space information may include link data as the road information corresponding to the detected vacant parking space, information for specifying the absolute position of the vacant parking space, the length of each detected parking space, information identifying the right side or left side toward the traveling direction of the own vehicle, information of the date and time of the detection, and so forth.
At S3, the vacant parking space information may be transmitted to the probe information management server 100. Note that the transmission data may be transmitted only when a transmission request is made from the probe information management server 100. After that, the sequence may return to S1 and stand by at S1 until the next vacant parking space is detected.
The processing of transmitting information in a fixed object on the road may be basically same as the processing of transmitting information in a navigation apparatus mounted on the vehicle. However, the ID of the fixed object on the road may be transmitted in place of the own vehicle positional information. With this processing, the probe information management server 100 that has received the ID of the fixed object on the road may read out the positional information corresponding to the received ID of the fixed object on the road from the map DB 14 and may specify the position of the fixed object on the road.
Next, an exemplary method of collecting information will be described with reference to
The method may be executed at predetermined intervals (20 ms, for example). As shown in
When vacant parking space information has been received (S11: YES), the sequence may proceed to S12. At S12, the received vacant parking space information may be stored into the probe information storage unit 12. The vacant parking space information may include link data as the road information corresponding to the detected vacant parking space, information for specifying the absolute coordinates of the vacant parking space, the length of each parking space, information for identifying the right side or left side toward the traveling direction of the own vehicle, information of the date and time of the detection, and so forth. In addition, when the vacant parking space information with the same link data is already stored in the probe information storage unit 12, the date and time obtained by utilizing the above-described information of the date and time may be updated to new information of the vacant parking space.
Next, an exemplary method of delivery will be described with reference to
This method may be executed at predetermined intervals (20 ms, for example). In addition, the method of collecting information (
The information to be delivered from the probe information management server 100 to the vehicle may be the information regarding available vacant parking space as described hereinafter. The situation of the available parking space may constantly vary according to the parking situation by other vehicles; therefore, the above-described information regarding the available parking space to be delivered may have uncertainty. Thus, it may be preferred that the information regarding the available parking space is presented as an indicator indicating the availability. In the present example, vacant parking space ratio may be made to be an indicator indicating the availability regarding the available parking space on the road.
First, at S21, it is determined whether there has been a delivery request of the vacant parking space ratio as the information regarding available parking spaces from a navigation apparatus mounted on a vehicle. When there has been no delivery request (S21: NO), the method of delivery may end. Alternatively, the delivering process may stand by at S21 until there is the delivery request including the vehicle ID and its positional information.
When there has been the delivery request (S21: YES), the sequence may proceed to S22. At S22, the source of the delivery request (e.g., a navigation apparatus mounted on the vehicle) may be specified, and data regarding the available parking space for delivering to the identified source of the delivery request may be created. The delivery data may be created according to the method of
At S23, the delivery data created at S22 may be delivered to the requesting navigation apparatus.
An exemplary method of creating the delivery will be described with reference to
At S31, it is determined whether there is an available parking section for the requesting vehicle. Specifically, the position of the requesting vehicle may be specified, and the determination may be made on the basis of whether there is an available parking section on a road within a predetermined distance from the specified position of the requesting vehicle. At this time, the position of the requesting vehicle may be specified according to the positional information included in the delivery request. In addition, the determination of whether there is an available parking section may be made using the information stored in the probe information storage unit 12 and the map DB 14.
When the there is no available parking section (S31: NO), the sequence may proceed to S35, where information for presenting that there is no available parking section may be created. When there is an available parking section (S31: YES), the sequence may proceed to S32. At S32, the information needed for calculating the vacant parking space ratio may be extracted from the information stored in the probe information storage unit 12 and the map DB 14. The information needed for calculating the vacant parking space ratio will be described later.
The vacant parking space ratio may be calculated at S33. The method for calculating the vacant parking space ratio will be described hereinafter. After that, the sequence may proceed to S34. At S34, the vacant parking space ratio calculated at S33 may be corrected as necessary. The method for correcting the vacant parking space ratio will be described hereinafter.
The vacant parking space ratio may be calculated with the formula (1) below. In the following, n (1, 2, . . . , n) vacant parking space/spaces may correspond to the link length included in the link data.
where V is the vacant parking space ratio, A is the sum of the available number of vehicles to park in 1, 2, . . . , n vacant parking space, and B is the available number of vehicles to park for the link length.
The available number of vehicles to park in one vacant parking space is the length of one vacant parking space divided by the space necessary for parking per one vehicle. This number may be rounded to the next lowest whole number or truncated to a predetermined number of decimal places. In addition, the available number of vehicles to park on the road corresponding to link data is the link length divided by the space necessary for parking per vehicle.
A specific example of calculating the vacant parking space ratio will be described with reference to
In addition, in the situation shown in
Note that a space less than a predetermined length may be excluded from the vacant parking space. For example, a space less than 2 m may be excluded from the vacant parking space in the present example.
Further, in the situation shown in
Furthermore, in the above-described processing, the space necessary for parking per vehicle was defined with the constant overall length of the vehicle regardless the type of vehicle. However, the space necessary for parking per vehicle may be set depending on a vehicle by receiving and utilizing the information such as the type of vehicle including the overall length of the vehicle together with the delivery request. Note that the calculation formula for the vacant parking space ratio described above is an example and other formulas may also be used for calculating the vacant parking space ratio.
Next, processing of correcting the vacant parking space ratio at S34 in
Further, a road with heavy traffic volume within a predetermined time period may have great possibility for vacant parking spaces be filled. Therefore, the vacant parking space ratio may be decreased as well. Note that the information regarding the traffic volume may be obtained from VICS® (Vehicle Information Communication System) or determined on the basis of road width or traffic lanes included in the link data.
Next, an exemplary method of receiving will be described with reference to
This processing may be executed at predetermined intervals (20 ms, for example). First, at S41, it is determined whether information regarding available parking spaces has been received. When it has not been received (S41: NO), the method of receiving data may end. When information regarding available parking spaces has been received (S41: YES), the sequence may proceed to S42.
At S42, display data for displaying on the display unit 26 may be created on the basis of the information regarding the available parking space delivered from the probe information management server 100. The display data will be described below. After the display data is created, at S43, the created display data may be displayed on the display unit 26.
In addition, the value of the vacant parking space ratio may be directly displayed on the corresponded map coordinates as shown in
In addition, a specific area for displaying the vacant parking space ratio may be changed depending on the positional information or the date information. Specifically, when traveling downtown or the like during the daytime, for example, it may be assumed that there are many parked vehicles. Therefore, the vacant parking space may be displayed by extending the specific area.
Note that the above-described flowcharts are examples and need not be limited to the specific processing shown. In addition, change of the order, deletion, or placement of a part of the steps, and addition of other step/steps in the above-described flowcharts may be made as necessary without departing from the broad inventive principles described herein.
As described above, in the parking support system according to the present example, the information regarding available parking spaces on the road may be obtained by navigation apparatuses mounted on the vehicle and/or fixed objects on the road. The parking availability may be calculated on the basis of the road information and this obtained information and indicators indicating the calculated parking availability may be displayed. Therefore, a driver can understand parking availability on the road far from the own vehicle.
The above exemplary methods may be implemented as computer-executable programs executed by a controller.
While various features have been described in conjunction with the examples outlined above, various alternatives, modifications, variations, and/or improvements of those features and/or examples may be possible. Accordingly, the examples, as set forth above, are intended to be illustrative. Various changes may be made without departing from the broad spirit and scope of the underlying principles. For example, the processor 22 may calculate the vacant parking space ratio.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2007-255569 | Sep 2007 | JP | national |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4527155 | Yamaki et al. | Jul 1985 | A |
| 5123085 | Wells et al. | Jun 1992 | A |
| 5280577 | Trevett et al. | Jan 1994 | A |
| 5469514 | Kawamura | Nov 1995 | A |
| 5559938 | Van Roekel et al. | Sep 1996 | A |
| 5724072 | Freeman et al. | Mar 1998 | A |
| 5790714 | McNeil et al. | Aug 1998 | A |
| 6128573 | Nomura | Oct 2000 | A |
| 6281808 | Glier et al. | Aug 2001 | B1 |
| 6356836 | Adolph | Mar 2002 | B1 |
| 6396417 | Lee | May 2002 | B2 |
| 6453233 | Kato | Sep 2002 | B1 |
| 6516262 | Takenaga et al. | Feb 2003 | B2 |
| 6516273 | Pierowicz et al. | Feb 2003 | B1 |
| 6556917 | Wawra et al. | Apr 2003 | B1 |
| 6560529 | Janssen | May 2003 | B1 |
| 6615130 | Myr | Sep 2003 | B2 |
| 6724320 | Basson et al. | Apr 2004 | B2 |
| 6728623 | Takenaga et al. | Apr 2004 | B2 |
| 6803913 | Fushiki et al. | Oct 2004 | B1 |
| 6925378 | Tzamaloukas | Aug 2005 | B2 |
| 6927700 | Quinn | Aug 2005 | B1 |
| 6927774 | Yano | Aug 2005 | B2 |
| 6970101 | Squire et al. | Nov 2005 | B1 |
| 6972675 | Mills et al. | Dec 2005 | B2 |
| 6989766 | Mese et al. | Jan 2006 | B2 |
| 7133661 | Hatae et al. | Nov 2006 | B2 |
| 7194347 | Harumoto et al. | Mar 2007 | B2 |
| 7254482 | Kawasaki et al. | Aug 2007 | B2 |
| 7304653 | Ueno | Dec 2007 | B2 |
| 7466227 | Chen et al. | Dec 2008 | B2 |
| 20010034575 | Takenaga et al. | Oct 2001 | A1 |
| 20020115423 | Hatae et al. | Aug 2002 | A1 |
| 20020161520 | Dutta et al. | Oct 2002 | A1 |
| 20030078718 | Takenaga et al. | Apr 2003 | A1 |
| 20030162536 | Panico | Aug 2003 | A1 |
| 20030210173 | Schneider | Nov 2003 | A1 |
| 20040130552 | Duluk et al. | Jul 2004 | A1 |
| 20040143381 | Regensburger et al. | Jul 2004 | A1 |
| 20050243104 | Kinghorn | Nov 2005 | A1 |
| 20060114125 | Kubota et al. | Jun 2006 | A1 |
| 20060220911 | Jaupitre et al. | Oct 2006 | A1 |
| 20060250278 | Tillotson et al. | Nov 2006 | A1 |
| 20070177011 | Lewin et al. | Aug 2007 | A1 |
| 20080231469 | Knoll et al. | Sep 2008 | A1 |
| Number | Date | Country |
|---|---|---|
| 1737500 | Feb 2006 | CN |
| 1942335 | Apr 2007 | CN |
| 101031818 | Sep 2007 | CN |
| 196 16 447 | Oct 1997 | DE |
| 100 28 130 | Dec 2001 | DE |
| 10 2005 022171 | Apr 2006 | DE |
| 0 738 946 | Oct 1996 | EP |
| 0 782 118 | Jul 1997 | EP |
| 0 921 509 | Jun 1999 | EP |
| 1 127 727 | Aug 2001 | EP |
| 1 742 191 | Jan 2007 | EP |
| A-62-501650 | Jul 1987 | JP |
| A-62-187884 | Aug 1987 | JP |
| A-04-144479 | May 1992 | JP |
| A-05-094574 | Apr 1993 | JP |
| A-06-127318 | May 1994 | JP |
| A-08-194432 | Jul 1996 | JP |
| A-10-027294 | Jan 1998 | JP |
| A-10-187033 | Jul 1998 | JP |
| A-11-306498 | Nov 1999 | JP |
| A-2000-026894 | Jan 2000 | JP |
| A-2000-029450 | Jan 2000 | JP |
| A-2000-321081 | Nov 2000 | JP |
| A-2001-075967 | Mar 2001 | JP |
| A-2001-202544 | Jul 2001 | JP |
| A-2001-236600 | Aug 2001 | JP |
| A-2002-286459 | Oct 2002 | JP |
| A-2003-036500 | Feb 2003 | JP |
| A-2003-078654 | Mar 2003 | JP |
| A-2003-256257 | Sep 2003 | JP |
| A-2003-279363 | Oct 2003 | JP |
| A-2004-004240 | Jan 2004 | JP |
| A-2004-051006 | Feb 2004 | JP |
| A-2004-069549 | Mar 2004 | JP |
| A-2004-171289 | Jun 2004 | JP |
| A-2004-362287 | Dec 2004 | JP |
| A-2005-165639 | Jun 2005 | JP |
| A-2006-084257 | Mar 2006 | JP |
| A-2006-189326 | Jul 2006 | JP |
| A-2006-275690 | Oct 2006 | JP |
| A-2006-330908 | Dec 2006 | JP |
| A-2007-041916 | Feb 2007 | JP |
| A-2007-041961 | Feb 2007 | JP |
| A-2007-131169 | May 2007 | JP |
| A-2007-316025 | Dec 2007 | JP |
| A-2006-038558 | Feb 2009 | JP |
| WO 8602764 | May 1986 | WO |
| WO 2005044619 | May 2005 | WO |
| WO 2005101347 | Oct 2005 | WO |
| WO 2006080547 | Aug 2006 | WO |
| Entry |
|---|
| Feb. 2, 2011 European Search Report issued in EP 08 015 963.5. |
| Mar. 10, 2010 European Search Report issued in EP 08 01 5963. |
| Jul. 17, 2007 International Search Report issued in International Application No. PCT/JP2007/061626. |
| Jul. 9, 2009 Final Rejection issued in U.S. Appl. No. 11/397,601. |
| Aug. 6, 2009 Notification of Reasons for Rejection issued in Patent Application No. 2006-161603. |
| Aug. 20, 2009 Office Action (Decision of Rejection) issued in Japanese Patent Application No. 2005-111272. |
| Aug. 20, 2009 Notification of Reasons for Rejection issued in Patent Application No. 2007-171894. |
| Aug. 20, 2009 Notification of Reasons for Rejection issued in Patent Application No. 2007-091047. |
| Sep. 1, 2009 Notification of Reasons for Rejection issued in Patent Application No. 2007-255569. |
| Dec. 11, 2009 Rejection issued in U.S. Appl. No. 11/397,601. |
| Jan. 28, 2009 Rejection issued in U.S. Appl. No. 11/397,601. |
| Sep. 3, 2008 Rejection issued in U.S. Appl. No. 11/397,601. |
| Jun. 23, 2009 European Search Report issued in Application No. EP 08 00 4829. |
| Oct. 21, 2009 Notice of Allowanced issued in U.S. Appl. No. 12/155,642. |
| Apr. 29, 2009 Rejection issued in U.S. Appl. No. 12/155,642. |
| Oct. 16, 2007 Rejection issued in U.S. Appl. No. 11/176,212. |
| Mar. 7, 2008 Notice of Allowance issued in U.S. Appl. No. 11/176,212. |
| Kambic S. F.; “Rotated Matrix Characters/Graphics System” Apr. 1980, IBM Technical Disclosure Bulletin, IBM Corporation, New York, pp. 4988-4990. |
| Fernyhough, J. et al., “Building Qualitative Event Models Automatically from Visual Input”, Proceedings of IEEE 6th International Conference on Computer Vision, Jan. 4-7, 1998, Bombay, India, pp. 350-355. |
| Kubota et al., U.S. Appl. No. 12/155,642, filed Jun. 6, 2008. |
| Yamaguchi et al., U.S. Appl No. 11/397,601, filed Apr. 5, 2006. |
| Takahata et al., U.S. Appl. No. 12/227,492, filed Feb. 23, 2009. |
| Nakamura et al., U.S. Appl. No. 12/076,067, filed Mar. 13, 2008. |
| Nakmura et al., U.S. Appl. No. 12/073,876, filed Mar. 11, 2008. |
| Dec. 11, 2012 Search Report issued in Chinese Application No. 2008101495129 (with translation). |
| Number | Date | Country | |
|---|---|---|---|
| 20090088959 A1 | Apr 2009 | US |