Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICARCV.2012.6485276
DC Field | Value | |
---|---|---|
dc.title | Vision-based multi-agent cooperative target search | |
dc.contributor.author | Hu, J. | |
dc.contributor.author | Xie, L. | |
dc.contributor.author | Xu, J. | |
dc.date.accessioned | 2014-12-12T07:54:18Z | |
dc.date.available | 2014-12-12T07:54:18Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Hu, J.,Xie, L.,Xu, J. (2012). Vision-based multi-agent cooperative target search. 2012 12th International Conference on Control, Automation, Robotics and Vision, ICARCV 2012 : 895-900. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICARCV.2012.6485276" target="_blank">https://doi.org/10.1109/ICARCV.2012.6485276</a> | |
dc.identifier.isbn | 9781467318716 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/116803 | |
dc.description.abstract | This paper addresses vision-based cooperative search for multiple mobile ground targets by a group of unmanned aerial vehicles (UAVs) with limited sensing and communication capabilities. The airborne camera on each UAV has a limited field of view and its target discriminability varies as a function of altitude. First, a general target detection probability model is built based on the physical imaging process of a camera. By dividing the whole surveillance region into cells, a probability map can be formed for each UAV indicating the probability of target existence within each cell. Then, we propose a distributed probability map updating model which includes the fusion of measurement information, information sharing among neighboring agents, information decaying and transmission due to environmental changes such as the target movement. Furthermore, we formulate the target search problem by multiple agents as a cooperative coverage control problem by optimizing the collective coverage area and the detection performance. The proposed map updating model and the cooperative control scheme are distributed, i.e., assuming that each agent only communicates with its neighbors within its communication range. Finally, the effectiveness of the proposed algorithms is illustrated by simulation. © 2012 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICARCV.2012.6485276 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | TEMASEK LABORATORIES | |
dc.description.doi | 10.1109/ICARCV.2012.6485276 | |
dc.description.sourcetitle | 2012 12th International Conference on Control, Automation, Robotics and Vision, ICARCV 2012 | |
dc.description.page | 895-900 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.