scholarly journals Optimal caching scheme in D2D networks with multiple robot helpers

2021 ◽  
Author(s):  
Yu Lin ◽  
Hui Song ◽  
Feng Ke ◽  
Weizhao Yan ◽  
Zhikai Liu ◽  
...  
Keyword(s):  
Caching Scheme ◽  
Multiple Robot

Adaptation and Cooperation in Control of Multiple Robot Manipulators

2000 ◽  
Vol 48 (2-3) ◽  
pp. 305-336
Author(s):  
Amit K. Sanyal ◽  
Ajay Verma ◽  
John L. Junkins
Keyword(s):  
Robot Manipulators ◽  
Multiple Robot

scholarly journals Cache-Aided General Linear Function Retrieval

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 25
Author(s):  
Kai Wan ◽  
Hua Sun ◽  
Mingyue Ji ◽  
Daniela Tuninetti ◽  
Giuseppe Caire
Keyword(s):  
Linear Function ◽  
Linear Functions ◽  
General Linear ◽  
Linear Combinations ◽  
Past Work ◽  
Single File ◽  
Caching Scheme ◽  
Retrieval Scheme ◽  
Data Points ◽  
Coded Caching

Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users’ local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times. This paper considers the linear function retrieval version of the original coded caching setting, where users are interested in retrieving a number of linear combinations of the data points stored at the server, as opposed to a single file. This extends the scope of the authors’ past work that only considered the class of linear functions that operate element-wise over the files. On observing that the existing cache-aided scalar linear function retrieval scheme does not work in the proposed setting, this paper designs a novel coded caching scheme that outperforms uncoded caching schemes that either use unicast transmissions or let each user recover all files in the library.

scholarly journals Multi AGV Coordination Tolerant to Communication Failures

Robotics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 55
Author(s):  
Diogo Matos ◽  
Pedro Costa ◽  
José Lima ◽  
Paulo Costa
Keyword(s):  
Communication Network ◽  
Simulation Software ◽  
Development Environment ◽  
Supervision System ◽  
Movement Dynamics ◽  
Robot Systems ◽  
Temporal Estimation ◽  
Temporal Efficiency ◽  
Multiple Robot ◽  
Multi Robot

Most path planning algorithms used presently in multi-robot systems are based on offline planning. The Timed Enhanced A* (TEA*) algorithm gives the possibility of planning in real time, rather than planning in advance, by using a temporal estimation of the robot’s positions at any given time. In this article, the implementation of a control system for multi-robot applications that operate in environments where communication faults can occur and where entire sections of the environment may not have any connection to the communication network will be presented. This system uses the TEA* to plan multiple robot paths and a supervision system to control communications. The supervision system supervises the communication with the robots and checks whether the robot’s movements are synchronized. The implemented system allowed the creation and execution of paths for the robots that were both safe and kept the temporal efficiency of the TEA* algorithm. Using the Simtwo2020 simulation software, capable of simulating movement dynamics and the Lazarus development environment, it was possible to simulate the execution of several different missions by the implemented system and analyze their results.

Sign in / Sign up

Export Citation Format

Share Document