Abstract

Abstract
PurposeThis paper aims to propose an automated framework for agile development and simulation of robotic palletizing cells. An automatic offline programming tool, for a variety of robot brands, is also introduced.Design/methodology/approachThis framework, named AdaptPack Studio, offers a custom-built library to assemble virtual models of palletizing cells, quick connect these models by drag and drop, and perform offline programming of robots and factory equipment in short steps.FindingsSimulation and real tests performed showed an improvement in the design, development and operation of robotic palletizing systems. The AdaptPack Studio software was tested and evaluated in a pure simulation case and in a real-world scenario. Results have shown to be concise and accurate, with minor model displacement inaccuracies because of differences between the virtual and real models.Research limitations/implicationsAn intuitive drag and drop layout modeling accelerates the design and setup of robotic palletizing cells and automatic offline generation of robot programs. Furthermore, A* based algorithms generate collision-free trajectories, discretized both in the robot joints space and in the Cartesian space. As a consequence, industrial solutions are available for production in record time, increasing the competitiveness of companies using this tool.Originality/valueThe AdaptPack Studio framework includes, on a single package, the possibility to program, simulate and generate the robot code for four different brands of robots. Furthermore, the application is tailored for palletizing applications and specifically includes the components (Building Blocks) of a particular company, which allows a very fast development of new solutions. Furthermore, with the inclusion of the Trajectory Planner, it is possible to automatically develop robot trajectories without collisions.

Abstract
PurposeThis paper aims to propose a translation library capable of generating robots proprietary code after their offline programming has been performed in a software application, named AdaptPack Studio, running over a robot simulation and offline programming software package.Design/methodology/approachThe translation library, named AdaptPack Studio Translator, is capable to generate proprietary code for the Asea Brown Boveri, FANUC, Keller und Knappich Augsburg and Yaskawa Motoman robot brands, after their offline programming has been performed in the AdaptPack Studio application.FindingsSimulation and real tests were performed showing an improvement in the creation, operation, modularity and flexibility of new robotic palletizing systems. In particular, it was verified that the time needed to perform these tasks significantly decreased.Practical implicationsThe design and setup of robotics palletizing systems are facilitated by an intuitive offline programming system and by a simple export command to the real robot, independent of its brand. In this way, industrial solutions can be developed faster, in this way, making companies more competitive.Originality/valueThe effort to build a robotic palletizing system is reduced by an intuitive offline programming system (AdaptPack Studio) and the capability to export command to the real robot using the AdaptPack Studio Translator. As a result, companies have an increase in competitiveness with a fast design framework. Furthermore, and to the best of the author’s knowledge, there is also no scientific publication formalizing and describing how to build the translators for industrial robot simulation and offline programming software packages, being this a pioneer publication in this area.

Abstract
This paper focus on the classification, in real-time and under uncontrolled lighting, of fabric textures for the automotive industry. Many industrial processes have spatial constraints that limit the effective control of illumination of their vision based systems, hindering their effectiveness. The ability to overcome these problems using robust classification methods with suitable pre-processing techniques and choice of characteristics will increase the efficiency of this type of solutions with obvious production gains and thus economical. For this purpose, this paper studied and analyzed various pre-processing techniques, and selected the most appropriate fabric characteristics for the considered industrial case scenario. The methodology followed was based on the comparison of two different machine learning classifiers, ANN and SVM, using a large set of samples with a large variability of lightning conditions to faithfully simulate the industrial environment. The obtained solution shows the sensibility of ANN over SVM considering the number of features and the size of the training set, showing the better effectiveness and robustness of the last. The characteristics vector uses histogram equalization, Laws filter and Sobel filter, and multi-scale analysis. By using a correlation based method was possible to reduce the number of features used, achieving a better balanced between processing time and classification ratio. © 2016 Springer Science+Business Media New York

Abstract
The self-localization of mobile robots in the environment is one of the most fundamental problems in the robotics navigation field. It is a complex and challenging problem due to the high requirements of autonomous mobile vehicles, particularly with regard to the algorithms accuracy, robustness and computational efficiency. In this paper, we present a comparison of three of the most used map-matching algorithms applied in localization based on natural landmarks: our implementation of the Perfect Match (PM) and the Point Cloud Library (PCL) implementation of the Iterative Closest Point (ICP) and the Normal Distribution Transform (NDT). For the purpose of this comparison we have considered a set of representative metrics, such as pose estimation accuracy, computational efficiency, convergence speed, maximum admissible initialization error and robustness to the presence of outliers in the robots sensors data. The test results were retrieved using our ROS natural landmark public dataset, containing several tests with simulated and real sensor data. The performance and robustness of the Perfect Match is highlighted throughout this article and is of paramount importance for real-time embedded systems with limited computing power that require accurate pose estimation and fast reaction times for high speed navigation. Moreover, we added to PCL a new algorithm for performing correspondence estimation using lookup tables that was inspired by the PM approach to solve this problem. This new method for computing the closest map point to a given sensor reading proved to be 40 to 60 times faster than the existing k-d tree approach in PCL and allowed the Iterative Closest Point algorithm to perform point cloud registration 5 to 9 times faster. © 2018 Springer Science+Business Media B.V., part of Springer Nature