scholarly journals Robot learning of manipulation activities with overall planning through precedence graph

2019 ◽  
Vol 116 ◽  
pp. 126-135 ◽  
Author(s):  
Xin Ye ◽  
Zhe Lin ◽  
Yezhou Yang
2011 ◽  
Vol 2011 ◽  
pp. 1-20 ◽  
Author(s):  
M. Bouznif ◽  
R. Giroudeau

We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time -approximation algorithm for the makespan minimization on processor networks with diameter .


2021 ◽  
Vol 11 (3) ◽  
pp. 1013
Author(s):  
Zvezdan Lončarević ◽  
Rok Pahič ◽  
Aleš Ude ◽  
Andrej Gams

Autonomous robot learning in unstructured environments often faces the problem that the dimensionality of the search space is too large for practical applications. Dimensionality reduction techniques have been developed to address this problem and describe motor skills in low-dimensional latent spaces. Most of these techniques require the availability of a sufficiently large database of example task executions to compute the latent space. However, the generation of many example task executions on a real robot is tedious, and prone to errors and equipment failures. The main result of this paper is a new approach for efficient database gathering by performing a small number of task executions with a real robot and applying statistical generalization, e.g., Gaussian process regression, to generate more data. We have shown in our experiments that the data generated this way can be used for dimensionality reduction with autoencoder neural networks. The resulting latent spaces can be exploited to implement robot learning more efficiently. The proposed approach has been evaluated on the problem of robotic throwing at a target. Simulation and real-world results with a humanoid robot TALOS are provided. They confirm the effectiveness of generalization-based database acquisition and the efficiency of learning in a low-dimensional latent space.


2018 ◽  
Vol 11 (4) ◽  
pp. 269-284
Author(s):  
Hongxin Zhang ◽  
Xingyu Lv ◽  
Wancong Leng ◽  
Xuefeng Ma

2013 ◽  
Vol 47 (1) ◽  
pp. 73-87 ◽  
Author(s):  
Alix Munier Kordon ◽  
Fadi Kacem ◽  
Benoît Dupont de Dinechin ◽  
Lucian Finta

Sign in / Sign up

Export Citation Format

Share Document