| 摘要 |
PROBLEM TO BE SOLVED: To compute a route matched to a user's thinking by using data on the degree of learning which match the present conditions. SOLUTION: An acquisition part 101 acquires link costs of links to be computed and the degree of learning of the links. A learning degree setting part 102 sets new learning degree through the use of the learning degree, acquired by the acquisition part 101 and a prescribed leaned degree. A computation part 103 computes new link costs of the links which are to be computed through the use of the link cost acquired by the acquisition part 101 and the new learned degree, set by the leaning degree setting part 102. A route-setting part 104 sets a route, on the basis of the new link costs computed by the computation part 103. COPYRIGHT: (C)2006,JPO&NCIPI |
