Cloud-Based Networked Visual Servo Control
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The performance of vision-based control systems, in particular, of highly dynamic vision-based motion control systems, is often limited by the low sampling rate of the visual feedback caused by the long image processing time. In order to overcome this problem, the networked visual servo control (NVSC), which integrates networked computational resources for cloud image processing, is considered in this paper. The main contributions of this paper are the following: 1) a real-time transport protocol for transmitting large-volume image data on a cloud-computing platform, which enables high-sampling-rate visual feedback; 2) a stabilizing control law for the NVSC system with time-varying feedback time delay; and 3) a sending rate scheduling strategy aiming at reducing the communication network load. The performance of the NVSC system with sending rate scheduling is validated in an object-tracking scenario on a 14-DOF dual-arm robot. Experimental results show the superior performance of our approach. In particular, the communication network load is substantially reduced by means of the scheduling strategy without performance degradation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
SURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955 · cited 5×
“For example, it takes about 20ms to extract SURF (Speed Up Robust Features) [17] from an image (640 × 480pixels) on graphic card NVIDIA-GeForce 8800, while the sampling interval of the joint position control loop is typically in the range of 1ms.”
MethodInfluentialFAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640 · cited 1×
“After feature matching [68], RANSAC (RANdom Sample Consensus) [69] is selected for outliers rejection.”
MethodAllman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523 · cited 1×
“iii) Congestion control: Most packet loss in Internet is caused by congestion [56], which could lead to congestion collapse.”
BackgroundOptimal Sampled-Data Control Systems
Chen, T., & Francis, B. A. (1995) · doi:10.1007/978-1-4471-3037-6 · Cited by 2,217
Cited by
Data-based techniques focused on modern industry: An overview
Yin, S., Li, X., Gao, H., & Kaynak, O. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2308133 · Cited by 1,025
A Fog Robotic System for Dynamic Visual Servoing
Tian, N., Chen, J., Ma, M., Zhang, R., Huang, B., Goldberg, K., & Sojoudi, S. (2018) · arXiv · doi:10.48550/arxiv.1809.06716 · Cited by 49
MAKOMO, T. J., ERİN, K., & BORU, B. (2020) · Sakarya University Journal of Science · doi:10.16984/saufenbilder.655716 · Cited by 2
“[6 ], [7], [8].”
(2020) · eScholarship (California Digital Library) · Cited by 2
Metadata
- Authors
- Wu, H., Lou, L., Chen, C.-C., Hirche, S., & Kuhnlenz, K.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2013-02
- Volume
- 60
- Issue
- 2
- Pages
- 554-566
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W2000757515
- Cited by
- 92
- References
- 5
- FWCI
- 12.74
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.