User Preference Aware Task Coordination and Proactive Bandwidth Allocation in a FiWi-Based Human–Agent–Robot Teamwork Ecosystem

2019 ◽  
Vol 16 (1) ◽  
pp. 84-97 ◽  
Author(s):  
Mahfuzulhoq Chowdhury ◽  
Martin Maier
Author(s):  
Mahfuzulhoq Chowdhury ◽  
Martin Maier

To facilitate making the human-machine co-activity-based human-agent-robot teamwork (HART) task execution process more efficient, this chapter first discusses related work and open challenges for latency-sensitive HART task. To speed up the HART task execution, this chapter next presents a latency sensitive HART task migration scheme for efficiently orchestrating tasks among human mobile users (MUs), central and decentralized computational agents (cloud/cloudlets), and robots across converged FiWi network infrastructures. Moreover, this chapter describes a bandwidth allocation scheme that allocates timeslots to MUs' broadband and task migration traffic at the same time. Furthermore, this chapter presents performance evaluation results of the proposed scheme. Importantly, this chapter compares the performance of the proposed task migration scheme with traditional schemes. This chapter is finally concluded by summarizing important findings and outlining open research issues for HART task coordination over FiWi-enhanced tactile internet infrastructures.


2020 ◽  
Vol 39 (4) ◽  
pp. 5905-5914
Author(s):  
Chen Gong

Most of the research on stressors is in the medical field, and there are few analysis of athletes’ stressors, so it can not provide reference for the analysis of athletes’ stressors. Based on this, this study combines machine learning algorithms to analyze the pressure source of athletes’ stadium. In terms of data collection, it is mainly obtained through questionnaire survey and interview form, and it is used as experimental data after passing the test. In order to improve the performance of the algorithm, this paper combines the known K-Means algorithm with the layering algorithm to form a new improved layered K-Means algorithm. At the same time, this paper analyzes the performance of the improved hierarchical K-Means algorithm through experimental comparison and compares the clustering results. In addition, the analysis system corresponding to the algorithm is constructed based on the actual situation, the algorithm is applied to practice, and the user preference model is constructed. Finally, this article helps athletes find stressors and find ways to reduce stressors through personalized recommendations. The research shows that the algorithm of this study is reliable and has certain practical effects and can provide theoretical reference for subsequent related research.


Author(s):  
A. Rethina Palin ◽  
I. Jeena Jacob

Wireless Mesh Network (MWN) could be divided into proactive routing, reactive routing and hybrid routing, which must satisfy the requirements related to scalability, reliability, flexibility, throughput, load balancing, congestion control and efficiency. DMN (Directional Mesh Network) become more adaptive to the local environments and robust to spectrum changes. The existing computing units in the mesh network systems are Fog nodes, the DMN architecture is more economic and efficient since it doesn’t require architecture- level changes from existing systems. The cluster head (CH) manages a group of nodes such that the network has the hierarchical structure for the channel access, routing and bandwidth allocation. The feature extraction and situational awareness is conducted, each Fog node sends the information regarding the current situation to the cluster head in the contextual format. A Markov logic network (MLN) based reasoning engine is utilized for the final routing table updating regarding the system uncertainty and complexity.


Sign in / Sign up

Export Citation Format

Share Document