ARTÍCULO
TITULO

Parallel algorithm for approximating the work space of a robot

Andrei Gorchakov    
Andrei Ignatov    
Dmitry Malyshev    
Mikhail Posypkin    

Resumen

The workspace of a robot is the set of positions that can be taken by its working tool. The understanding of the workspace is necessary when designing robots, planning their location, assessing their functionality, the path planning of the robot. So far many methods have been developed to determine the workspace. It should be noted that deterministic methods have the greatest potential, allowing to obtain approximations with a given accuracy in the automatic mode. A known disadvantage of deterministic methods is their high computational complexity, which prevents the effective wide application of these methods in practice. The paper proposes a parallel algorithm for constructing the approximation of the working area with guaranteed accuracy. The OpenMP package is used to create a multithreaded application. An original technique has been developed that allows to evenly distribute the load across the threads without explicit balancing. The results of experiments showing high efficiency of parallelization for multicore systems are presented. Another important problem is to visualize the constructed approximations. The workspace often has a complex structure with internal cavities. In this paper, we propose approaches for effective visualization of the working area of the robot, based on augmented reality technology, allowing not only to study the structure of the object, but also to place it in the desired visual context.

 Artículos similares

       
 
Santiago Moreno-Carbonell and Eugenio F. Sánchez-Úbeda    
The Linear Hinges Model (LHM) is an efficient approach to flexible and robust one-dimensional curve fitting under stringent high-noise conditions. However, it was initially designed to run in a single-core processor, accessing the whole input dataset. Th... ver más
Revista: Algorithms

 
Shaahin Angizi, Naima Ahmed Fahmi, Deniz Najafi, Wei Zhang and Deliang Fan    
In this work, we present an efficient Processing in MRAM-Accelerated De Bruijn Graph-based DNA Assembly platform, named PANDA, based on an optimized and hardware-friendly genome assembly algorithm. PANDA is able to assemble large-scale DNA sequence datas... ver más

 
Lin Ma, Fuheng Ma, Wenhan Cao, Benxing Lou, Xiang Luo, Qiang Li and Xiaoniao Hao    
A original strategy for optimizing the inversion of concrete dam parameters based on the multi-strategy improved Sooty Tern Optimization algorithm (MSSTOA) is proposed to address the issues of low efficiency, low accuracy, and poor optimizing performance... ver más
Revista: Water

 
Xuyuan Zhang, Yingqing Guo, Haoran Luo, Tao Liu and Yijun Bao    
The rapid identification of the amount and characteristics of chemical oxygen demand (COD) in influent water is critical to the operation of wastewater treatment plants (WWTPs), especially for WWTPs in the face of influent water with a low carbon/nitroge... ver más
Revista: Water

 
Hai Nan, Yumeng Kong, Jie Zhan, Mingqiang Zhou and Ling Bai    
Membrane computing is a branch of natural computing, which is a new computational model abstracted from the study of the function and structure of living biological cells. The study of numerical computation based on membrane computation has received incr... ver más
Revista: Applied Sciences