File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/wcm.1145
- Scopus: eid_2-s2.0-84878683050
- WOS: WOS:000320040100004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Connectivity and bandwidth-aware real-time exploration in mobile robot networks
Title | Connectivity and bandwidth-aware real-time exploration in mobile robot networks |
---|---|
Authors | |
Keywords | bottleneck assignment Steiner minimum tree relay node placement real-time exploration mobile robot networks bandwidth |
Issue Date | 2013 |
Citation | Wireless Communications and Mobile Computing, 2013, v. 13, n. 9, p. 847-863 How to Cite? |
Abstract | Although there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in time-sensitive and bandwidth-consuming tasks such as search and surveillance. In such tasks, video/audio streams of a newly explored area should be sent back to the base station in a timely manner. To address this issue, we propose connectivity and bandwidth-aware exploration (CBAX), which is an efficient iteration based real-time exploration. CBAX divides the problem into frontier node placement, relay node placement with routing path selection, and matching of each robot with its target position. Moreover, we model bandwidth-constrained relay node placement into a new variant of the Steiner minimum tree problem and present our solution. While reducing the exploration time, CBAX maintains the network's connectivity and ensures the aggregated data flows are under the link capacity in transmission. Simulation shows that CBAX outperforms two recent exploration schemes qualitatively by demonstrating major improvement in terms of non-overflow transmission time and fully connected transmission time. With enhanced communication quality, CBAX still reduces the exploration time, on average, by 40% and 15%, respectively. In moderately dense scenarios, CBAX even decreases time by 50% and 25%. Copyright © 2011 John Wiley & Sons, Ltd. |
Persistent Identifier | http://hdl.handle.net/10722/213313 |
ISSN | 2021 Impact Factor: 2.146 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pei, Yuanteng | - |
dc.contributor.author | Mutka, Matt W. | - |
dc.contributor.author | Xi, Ning | - |
dc.date.accessioned | 2015-07-28T04:06:51Z | - |
dc.date.available | 2015-07-28T04:06:51Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Wireless Communications and Mobile Computing, 2013, v. 13, n. 9, p. 847-863 | - |
dc.identifier.issn | 1530-8669 | - |
dc.identifier.uri | http://hdl.handle.net/10722/213313 | - |
dc.description.abstract | Although there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in time-sensitive and bandwidth-consuming tasks such as search and surveillance. In such tasks, video/audio streams of a newly explored area should be sent back to the base station in a timely manner. To address this issue, we propose connectivity and bandwidth-aware exploration (CBAX), which is an efficient iteration based real-time exploration. CBAX divides the problem into frontier node placement, relay node placement with routing path selection, and matching of each robot with its target position. Moreover, we model bandwidth-constrained relay node placement into a new variant of the Steiner minimum tree problem and present our solution. While reducing the exploration time, CBAX maintains the network's connectivity and ensures the aggregated data flows are under the link capacity in transmission. Simulation shows that CBAX outperforms two recent exploration schemes qualitatively by demonstrating major improvement in terms of non-overflow transmission time and fully connected transmission time. With enhanced communication quality, CBAX still reduces the exploration time, on average, by 40% and 15%, respectively. In moderately dense scenarios, CBAX even decreases time by 50% and 25%. Copyright © 2011 John Wiley & Sons, Ltd. | - |
dc.language | eng | - |
dc.relation.ispartof | Wireless Communications and Mobile Computing | - |
dc.subject | bottleneck assignment | - |
dc.subject | Steiner minimum tree | - |
dc.subject | relay node placement | - |
dc.subject | real-time exploration | - |
dc.subject | mobile robot networks | - |
dc.subject | bandwidth | - |
dc.title | Connectivity and bandwidth-aware real-time exploration in mobile robot networks | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1002/wcm.1145 | - |
dc.identifier.scopus | eid_2-s2.0-84878683050 | - |
dc.identifier.volume | 13 | - |
dc.identifier.issue | 9 | - |
dc.identifier.spage | 847 | - |
dc.identifier.epage | 863 | - |
dc.identifier.eissn | 1530-8677 | - |
dc.identifier.isi | WOS:000320040100004 | - |
dc.identifier.issnl | 1530-8669 | - |