Name
Abstract | ||
|---|---|---|
In this paper, we introduce an interesting "World Expo problem", which aims to identify and track multiple targets in a sensor network, and propose a solution to this problem based on the mixed integer programming. Compared with traditional tracking problem in the sensor network, the World Expo problem has following two features. Firstly, the target in the network is not limited to single individuals. It can also be a group composed of multiple individuals with same path in the network, which implies that multiple targets can share the same path and be detected by the same sensor at the same time. Moreover, both the size and the number of groups are unknown. Secondly, differing from traditional sensor networks, the sensor network in the World Expo problem usually is sparse. These two features increase the difficulty in identification and tracking. To solve the aforementioned problem, we analyze the solvability of this problem and come up with a mixed integer programming based algorithm. The simulation result shows that our method has good performances and is robust to errors in the data. © Springer International Publishing Switzerland 2013. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-04048-6_6 | BSI@PAKDD/BSIC@IJCAI |
Keywords | Field | DocType |
integer programming,path identification,sensor networks,social collective behavior | Mathematical optimization,Computer science,Integer programming,Cutting stock problem,Wireless sensor network | Conference |
Volume | Issue | ISSN |
8178 LNAI | null | 16113349 |
Citations | PageRank | References |
2 | 0.41 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongteng Xu | 1 | 282 | 27.10 |
| Dixin Luo | 2 | 37 | 6.98 |
| Xiaoming Huo | 3 | 157 | 24.83 |
| Xiaokang Yang | 4 | 3581 | 238.09 |