JP2012078368A5

JP2012078368A5 -

Info

Publication number: JP2012078368A5
Application number: JP2012003517A
Authority: JP
Filing date: 2012-01-11
Publication date: 2012-06-07
Anticipated expiration: 2029-03-31

Description

本発明の経路探索装置は、出発地及び目的地を設定する地点設定手段と、移動履歴の有る領域内のリンクのコストを相対的に高くするコスト設定手段と、設定された出発地と目的地とを結ぶコストが最低の経路を探索する経路探索手段とを有し、前記経路探索手段は、出発地から目的地に向けて順次リンクを選択するリンク選択手段を備え、前記コスト設定手段は、前記リンク選択手段により選択されたリンクの属する領域が移動履歴の無い領域である場合、当該領域内のリンクのコストを移動履歴の有る領域と同様に高くすることを特徴とする経路探索装置である。
本発明の経路探索プログラムは、コンピュータを本発明の経路探索装置として機能させるための経路探索プログラムである。 The route search device of the present invention includes a point setting means for setting a departure place and a destination, a cost setting means for relatively increasing the cost of a link in an area having a movement history, and the set departure place and destination. possess a route searching unit cost connecting bets to search the lowest path, the route search means comprises link selection means for selecting sequentially linked toward the destination from the departure point, the cost setting means, When the area to which the link selected by the link selection unit belongs is an area having no movement history, the cost of a link in the area is increased similarly to the area having the movement history. .
The route search program of the present invention is a route search program for causing a computer to function as the route search device of the present invention.

［作用］
本発明によれば、出発地と目的地とを結ぶコストが最低の経路を探索する際、移動履歴の有る領域内のリンクのコストを相対的に高くすることで、移動履歴の有る領域を出来るだけ避け、移動履歴の無い領域を優先的に選択するように経路探索を行う。また、選択したリンクの属する領域が移動履歴の無い領域である場合、当該領域内のリンクのコストを相対的に高くすることで、その領域から出来るだけ早く抜け出せるリンクを選択する。 [Action]
According to the present invention, when searching for a route with the lowest cost connecting the starting point and the destination, the area having the movement history can be formed by relatively increasing the cost of the link in the area having the movement history. The route search is performed so as to preferentially select an area having no movement history. If the area to which the selected link belongs is an area without a movement history, a link that can be removed from the area as soon as possible is selected by relatively increasing the cost of the link in the area.

本発明によれば、移動履歴の無い領域に効率良く行くことのできる経路探索が可能になる。 According to the present invention, the route search can be ing capable of going efficiently in the region without the movement history.

Claims

And the point setting means for setting a departure point and a destination, and cost setting means for relatively high cost of the links in a region of the movement history, the lowest cost connecting the starting point and the destination set path possess and route search means for searching for,
The route search means includes link selection means for sequentially selecting links from a departure place to a destination, and the cost setting means is an area to which the link selected by the link selection means belongs to an area having no movement history. In some cases, the route search apparatus is characterized in that the cost of the link in the area is increased in the same manner as the area having the movement history .

The route search device according to claim 1,
Route search device characterized in that it have a means for setting an upper limit ratio or the upper limit of the loss of the travel time or travel distance by passing through the area with no travel history preferentially.

In the route search device according to claim 1 or 2 ,
Route search device characterized in that it comprises a means for setting an upper limit passage number of the region having the movement history.

The route search device according to claim 1,
A route search device characterized in that the route is a railway line .

The route search program for functioning a computer as each means of the route search apparatus as described in any one of Claims 1-4.