Name
Abstract | ||
|---|---|---|
In this paper, we consider a set of mobile nodes, each of which moves with constant velocity. We present algorithms to determine which of these mobile nodes can be captured the soonest by a set of one or more pursuers. We use a time parameterized R-tree (TPR-tree) to index these moving points. We then develop algorithms that operate on the TPR-tree to answer three query variations: (1) a single pursuer that is faster than all of the mobile nodes, (2) a single pursuer that is slower than some of the mobile nodes and (3) multiple pursuers. Experimental results show that our algorithms are simpler and faster than other approaches to solve the problem. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1142/S012905410400273X | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
TPR tree, mobile, pursuit, branch and bound | Parameterized complexity,Branch and bound,Pursuer,Algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 5 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sahar Idwan | 1 | 18 | 5.05 |
| Dinesh P. Mehta | 2 | 89 | 13.21 |
| Mario A. Lopez | 3 | 819 | 110.78 |