A study on the algorithms for searching a static or moving target in a polygonal region
| Project/Area Number |
17500011
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tokai University |
|---|
Principal Investigator |
TAN Xuehou Tokai University, School of High-technology for Human Welfare, Professor (50256179)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥2,350,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥150,000)
Fiscal Year 2007: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2006: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2005: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | algorithms / computational geometry / watchman route problem / polygon search problem / on-line algorithms / competitive factor / chain guards / complexity / 時間計算量 / 捜索アルゴリズム / 可視イベント / ツーガード問題 / 近似アルゴリズム / リンク距離 |
|---|
| Research Abstract |
We presented a new, on-line strategy for a mobile robot to explore an unknown polygon P. starting at a boundary point, which outputs a so-called watchman mute such that every interior point of P is visible from at least one point along the route. The length of the robot's route is guranteed to be at roost 6.7 times that of the shortest watchman route that cnuld be computed off-line. This gives a significant improvement-upon the previously known 26.5-competitive strategy.
For the polygon search problem, we also developed an efficient algorithm. Given a simple polygon P with two vertices u and v, the three-guard problem asks whether three guards can move from u to v such that the first and third guards are separately on two boundary chains of P from u to v, and the second guard is always kept to be visible from two other guards inside P. We can decide whether there exists a solution fir the three-guard problem in O(n log n) time, and ifso, generate a walk in O(n log n+in) time, where n denotes the number of vertices of P and m(≦(n^2)) the size of the optimal walk. This improves upon the previous time bounds O(n^2) and O(n^2 log n), respectively.
|
Report
(4 results)
Research Products
(15 results)
