不十分な情報下での緊急度と効率的な網羅を考慮した経路探索システム  [in Japanese] A Route Search System Considering Urgency and Efficient Coverage under the Condition of Uncertain Information  [in Japanese]

Access this Article

Author(s)

Abstract

<p>本論文では,不十分な情報下での緊急度と効率的に網羅を考慮した経路探索システムを提案し,そのためのアルゴリズムをシミュレーションにより評価した.提案手法の特徴は,残余領域をできるだけひとかたまりになるように経路を決定することで,徐々に情報が明らかになるような状況においても極端な性能劣化を防ぐことにある.シミュレーション評価実験を行った結果,本手法は単純に緊急度の高いノードから回る手法と比べて,締切時間をどれだけ遵守できたかの評価に関して平均29.43%の効率化を確認した.加えて,どれだけ短い航空時間で網羅できたかの評価に関して,全経路の航空時間を平均36.52%削減することができた.</p>

<p>The covered route search problem for graphs with deadline time has applications such as aerial photographing route search problem at natural disaster. However, information on the deadline time of a node is not necessarily fully known in advance, and it is not realistic to calculate the optimum route in advance. In this paper, we propose a method to calculate a route as efficient as possible while giving priority to nodes with efficient covering under these conditions. The feature of this method is to prevent extreme deterioration of performance against dynamic change of information by using heuristics that makes the remaining nodes as one unit as possible. As a result of experiment using 100 patterns graph randomly allocated urgency, this method was able to reduce flight time of average 36.52% compared with simple method . And, in many graphs, the proposed method reduces the case that does not meet the deadline.</p>

Journal

  • Proceedings of the Annual Conference of JSAI

    Proceedings of the Annual Conference of JSAI JSAI2018(0), 1D104-1D104, 2018

    The Japanese Society for Artificial Intelligence

Codes

Page Top