| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To enable parking with more certainty, without traveling overlapping routes as far as possible. <P>SOLUTION: On the occasion of guiding to a parking lot near a destination, a route search and guidance for traveling via a plurality of parking lots are performed so as to efficiently improve the probability that parking is possible. More specifically, a plurality of candidate parking lots are determined from a parking expected value (parking probability) based on fullness-vacancy information (statistics) about each parking lot, and a traveling route is determined from the total expected value of the possibility of parking at any parking lot to the last one to be guided which is obtained by consecutively traveling via the individual candidate parking lots, and from the total distance cost to the destination. Concretely, the parking lots around the destination to be the parking lot candidates on the traveling course are detected and the respective parking probabilities thereof are acquired from parking lot data. When the number of retrieved parking lots is N, combinations in the number of M are determined from N and the parking lots in each combination of which the parking probability in whole is a prescribed threshold Pt or above are searched for. <P>COPYRIGHT: (C)2011,JPO&INPIT</p> |
