A graph-based approach to the visibility-based pursuit-evasion problem
| Project/Area Number |
23500024
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tokai University |
|---|
Principal Investigator |
TAN Xuehou 東海大学, 情報理工学部, 教授 (50256179)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2011: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
|---|
| Keywords | アルゴリズム / 計算幾何 / 幾何学的捜索問題 / 可視性 / ツーガイド問題 / LR-可視的多角形 / グラフアルゴリズム / 単純経路 / 経路探索問題 / 幾何学的捜索 / グラフ的手法 |
|---|
| Research Abstract |
This work presents a new method for solving the visibility-based pursuit-evasion problems, mainly by transforming them into the shortest path problems in graphs. For the two-guards problem, we presented the O(n^2) time algorithms for computing the search schedules in which the sum of the distances traveled by the two guards is minimized, or the maximum distance between the two guards is minimized. For the problem of searching mobile intruders in a circular corridor by two 1-searchers, we gave an O(n*n) time solution. For the problem of finding a simple path that turns at the points from the given n points but avoids the boundary of the given polygon of m vertices, we presented an O((n*n+m) log m) time algorithm, which greatly improves upon the previous O((n m)*(n m)) time bound. Finally, we also gave a simple characterization of LR-visibility polygons and a linear-time algorithm for determining whether a given polygon is LR-visible.
|
Report
(4 results)
Research Products
(21 results)
