New trends and challenges in the automatic generation of new tasks for humanoid robots

Proceeding of: RobCity16: Robots for citizens: Open Conference on Future Trends in Robotics, Madrid May 26-27 2016In this paper, the study and implementation of a task generation system that uses the information obtained from the user and already known cases is presented. One of the main objectives of the system is to introduce a new approach in robotics that takes into account the physical limitation of teaching and learning time, and thus the amount of knowledge that a robot can obtain of a given environment (tasks, objects, user preferences...), as a critical bottleneck of any robotic system. For this, the study of the Case Based Reasoning (CBR) problem is presented. Additionally, Base Trajec-tory Combination (BATC), a novel trajectory combination method based on a simplified CBR structure, using trajectories instead of high-level tasks, is proposed and explained. Finally, this system is tested with Move-it! as the simulation environment, using the humanoid robot TEO from Universidad Carlos III de Madrid as the robotic platform. The results of these experiments are also presented with the corresponding conclusions and future research lines.This research has received funding from the RoboCity2030-III-CM project (Robótica aplicada a la mejora de la calidad de vida de los ciudadanos. Fase III; S2013/MIT-2748), funded by Programas de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU

Improving CGDA execution through genetic algorithms incorporating spatial and velocity constraints

Proceedings of: 2017 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC), 26-28 April 2017, Coimbra, Portugal.In the Continuous Goal Directed Actions (CGDA) framework, actions are modelled as time series which contain the variations of object and environment features. As robot joint trajectories are not explicitly encoded in CGDA, Evolutionary Algorithms (EA) are used for the execution of these actions. These computations usually require a large number of evaluations. As a consequence of this, these evaluations are performed in a simulated environment, and the computed trajectory is then transferred to the physical robot. In this paper, constraints are introduced in the CGDA framework, as a way to reduce the number of evaluations needed by the system to converge to the optimal robot joint trajectory. Specifically, spatial and velocity constraints are introduced in the framework. Their effects in two different CGDA commonly studied use cases (the “wax” and “paint” actions) are analyzed and compared. The experimental results obtained using these constraints are compared with those obtained with the Steady State Tournament (SST) algorithm used in the original proposal of CGDA. Conclusions extracted from this study depict a high reduction in the required number of evaluations when incorporating spatial constraints. Velocity constraints provide however less promising results, which will be discussed within the context of previous CGDA works.The research leading to these results has received funding from the RoboCity2030-III-CM project (Robtica aplicada a la mejora de la calidad de vida de los ciudadanos. fase Ill; S2013IMIT-2748), funded by Program as de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU, and by a FPU grant funded by Miniesterio de Educacion, Cultura y deporte

Reducing the number of evaluations required for CGDA execution through Particle Swarm Optimization methods

Proceedings of: 2017 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC), 26-28 April 2017, Coimbra, Portugal.Continuous Goal Directed Actions (CGDA) is a robot learning framework that encodes actions as time series of object and environment scalar features. As the execution of actions is not encoded explicitly, robot joint trajectories are computed through Evolutionary Algorithms (EA), which require a large number of evaluations. The consequence is that evaluations are performed in a simulated environment, and the optimal robot trajectory computed is then transferred to the actual robot. This paper focuses on reducing the number of evaluations required for computing an optimal robot joint trajectory. Particle Swarm Optimization (PSO) methods have been adapted to the CGDA framework to be studied and compared: naíve PSO, Adaptive Fuzzy Fitness Granulation PSO (AFFG-PSO), and Fitness Inheritance PSO (FI-PSO). Experiments have been performed for two representative use cases within CGDA: the “wax” and the “painting” action. The experimental results of PSO methods are compared with those obtained with the Steady State Tournament used in the original proposal of CGDA. Conclusions extracted from these results depict a reduction of the number of required evaluations, with simultaneous tradeoff regarding the degree of fulfillment of the objective given by the optimization cost function.The research leading to these results has received funding from the RoboCity2030-III-CM project (Robtica aplicada a la mejora de la calidad de vida de los ciudadanos, fase Ill; S2013/MIT-2748), funded by Programas de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU, and by a FPU grant funded by Miniesterio de Educaci6n, Cultura y deporte

Enabling garment-agnostic laundry tasks for a Robot Household Companion

Domestic chores, such as laundry tasks, are dull and repetitive. These tasks consume a significant amount of daily time, and are however unavoidable. Additionally, a great portion of elder and disabled people require help to perform them due to lack of mobility. In this work we present advances towards a Robot Household Companion (RHC), focusing on the performance of two particular laundry tasks: unfolding and ironing garments. Unfolding is required to recognize the garment prior to any later folding operation. For unfolding, we apply an interactive algorithm based on the analysis of a colored 3D reconstruction of the garment. Regions are clustered based on height, and a bumpiness value is computed to determine the most suitable pick and place points to unfold the overlapping region. For ironing, a custom Wrinkleness Local Descriptor (WiLD) descriptor is applied to a 3D reconstruction to find the most significant wrinkles in the garment. These wrinkles are then ironed using an iterative path-following control algorithm that regulates the amount of pressure exerted on the garment. Both algorithms focus on the feasibility of a physical implementation in real unmodified environments. A set of experiments to validate the algorithms have been performed using a full-sized humanoid robot.This work was supported by RoboCity2030-III-CM project (S2013/MIT-2748), funded by Programas de Actividades I+D in Comunidad de Madrid, Spain and EU and by a FPU grant funded by Ministerio de Educación, Cultura y Deporte, Spain. It was also supported by the anonymous donor of a red hoodie used in our initial trials. We gratefully acknowledge the support of NVIDIA, United States Corporation with the donation of the NVIDIA Titan X GPU used for this research

Real Evaluations Tractability using Continuous Goal-Directed Actions in Smart City Applications

One of the most important challenges of Smart City Applications is to adapt the system to interact with non-expert users. Robot imitation frameworks aim to simplify and reduce times of robot programming by allowing users to program directly through action demonstrations. In classical robot imitation frameworks, actions are modelled using joint or Cartesian space trajectories. They accurately describe actions where geometrical characteristics are relevant, such as fixed trajectories from one pose to another. Other features, such as visual ones, are not always well represented with these pure geometrical approaches. Continuous Goal-Directed Actions (CGDA) is an alternative to these conventional methods, as it encodes actions as changes of any selected feature that can be extracted from the environment. As a consequence of this, the robot joint trajectories for execution must be fully computed to comply with this feature-agnostic encoding. This is achieved using Evolutionary Algorithms (EA), which usually requires too many evaluations to perform this evolution step in the actual robot. The current strategies involve performing evaluations in a simulated environment, transferring only the final joint trajectory to the actual robot. Smart City applications involve working in highly dynamic and complex environments, where having a precise model is not always achievable. Our goal is to study the tractability of performing these evaluations directly in a real-world scenario. Two different approaches to reduce the number of evaluations using EA, are proposed and compared. In the first approach, Particle Swarm Optimization (PSO)-based methods have been studied and compared within the CGDA framework: naïve PSO, Fitness Inheritance PSO (FI-PSO), and Adaptive Fuzzy Fitness Granulation with PSO (AFFG-PSO).The research leading to these results has received funding from the RoboCity2030-III-CM project (Robótica aplicada a la mejora de la calidad de vida de los ciudadanos. fase III; S2013/MIT-2748), funded by Programas de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU

Robot imitation through vision, kinesthetic and force features with online adaptation to changing environments

Proceedings of: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 1-5 October 2018, Madrid, Spain.Continuous Goal-Directed Actions (CGDA)is a robot imitation framework that encodes actions as the changes they produce on the environment. While it presents numerous advantages with respect to other robot imitation frameworks in terms of generalization and portability, final robot joint trajectories for the execution of actions are not necessarily encoded within the model. This is studied as an optimization problem, and the solution is computed through evolutionary algorithms in simulated environments. Evolutionary algorithms require a large number of evaluations, which had made the use of these algorithms in real world applications very challenging. This paper presents online evolutionary strategies, as a change of paradigm within CGDA execution. Online evolutionary strategies shift and merge motor execution into the planning loop. A concrete online evolutionary strategy, Online Evolved Trajectories (OET), is presented. OET drastically reduces computational times between motor executions, and enables working in real world dynamic environments and/or with human collaboration. Its performance has been measured against Full Trajectory Evolution (FTE)and Incrementally Evolved Trajectories (IET), obtaining the best overall results. Experimental evaluations are performed on the TEO full-sized humanoid robot with “paint” and “iron” actions that together involve vision, kinesthetic and force features.The research leading to these results has received funding from the RoboCity2030-III-CM project (Robotica aplicada a la mejora de la calidad de vida de los ciudadanos. Fase III; S2013/MIT-2748), funded by Programas de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU

Quick, Stat!: a statistical analysis of the Quick, Draw! Dataset

Proceeding of: 10th EUROSIM Congress (2019), Logroño, La Rioja, Spain, July 1-5, 2019The Quick, Draw! Dataset is a Google dataset with a collection of 50 million drawings, divided in 345 categories, collected from the users of the game Quick, Draw!1. In contrast with most of the existing image datasets, in the Quick, Draw! Dataset, drawings are stored as time series of pencil positions instead of a bitmap matrix composed by pixels. This aspect makes this dataset the largest doodle dataset available at the time. The Quick, Draw! Dataset is presented as a great opportunity to researchers for developing and studying machine learning techniques. Due to the size of this dataset and the nature of its source, there is a scarce of information about the quality of the drawings contained. In this paper a statistical analysis of three of the classes contained in the Quick, Draw! Dataset is depicted: mountain, book and whale. The goal is to give to the reader a first impression of the data collected in this dataset. For the analysis of the quality of the drawings a ClassificationNeuralNetworkwas trained to obtain a classification score. Using this classification score and the parameters provided by the dataset, a statistical analysis of the quality and nature of the drawings contained in this dataset is provided.The research leading to these results has received funding from RoboCity2030-DIH-CM, Madrid Robotics Digital Innovation Hub, S2018/NMT-4331, funded by Programas de Actividades I+D en la Comunidad de Madrid and cofunded by Structural Funds of the EU

Towards clothes hanging via cloth simulation and deep convolutional networks

Proceeding of: 10th EUROSIM Congress on Modelling and Simulation (EUROSIM 2019), Logroño, La Rioja, Spain, July 1-5, 2019People spend several hours a week doing laundry, with hanging clothes being one of the laundry tasks to be performed. Nevertheless, deformable object manipulation still proves to be a challenge for most robotic systems, due to the extremely large number of internal degrees of freedom of a piece of clothing and its chaotic nature. This work presents a step towards automated robot clothes hanging by modeling the dynamics of the hanging task via deep convolutional models. Two models are developed to address two different problems: determining if the garment will hang or not (classification), and estimating the future garment location in space (regression). Both models have been trained with a synthetic dataset formed by 15k examples generated though a dynamic simulation of a deformable object. Experiments show that the deep convolutional models presented perform better than a human expert, and that future predictions are largely influenced by time, with uncertainty influencing directly the accuracy of the predictions.This work was supported by RoboCity2030-III-CM project (S2013/MIT-2748), funded by Programas de Actividades I+D in Comunidad de Madrid and EU and by a FPU grant funded by Ministerio de Educación, Cultura y Deporte. We gratefully acknowledge the support of NVIDIA Corporation with the donation of the NVIDIA Titan X GPU used for this research

A study on machine vision techniques for the inspection of health personnels' protective suits for the treatment of patients in extreme isolation

The examination of Personal Protective Equipment (PPE) to assure the complete integrity of health personnel in contact with infected patients is one of the most necessary tasks when treating patients affected by infectious diseases, such as Ebola. This work focuses on the study of machine vision techniques for the detection of possible defects on the PPE that could arise after contact with the aforementioned pathological patients. A preliminary study on the use of image classification algorithms to identify blood stains on PPE subsequent to the treatment of the infected patient is presented. To produce training data for these algorithms, a synthetic dataset was generated from a simulated model of a PPE suit with blood stains. Furthermore, the study proceeded with the utilization of images of the PPE with a physical emulation of blood stains, taken by a real prototype. The dataset reveals a great imbalance between positive and negative samples; therefore, all the selected classification algorithms are able to manage this kind of data. Classifiers range from Logistic Regression and Support Vector Machines, to bagging and boosting techniques such as Random Forest, Adaptive Boosting, Gradient Boosting and eXtreme Gradient Boosting. All these algorithms were evaluated on accuracy, precision, recall and F1 score; and additionally, execution times were considered. The obtained results report promising outcomes of all the classifiers, and, in particular Logistic Regression resulted to be the most suitable classification algorithm in terms of F1 score and execution time, considering both datasets.The research leading to these results received funding from: Inspección robotizada de los trajes de proteccion del personal sanitario de pacientes en aislamiento de alto nivel, incluido el ébola, Programa Explora Ciencia, Ministerio de Ciencia, Innovación y Universidades (DPI2015-72015-EXP); the RoboCity2030-DIH-CM Madrid Robotics Digital Innovation Hub (“Robótica aplicada a la mejora de la calidad de vida de los ciudadanos. fase IV”; S2018/NMT-4331), funded by “Programas de Actividades I+D en la Comunidad de Madrid” and cofunded by Structural Funds of the EU; and ROBOESPAS: Active rehabilitation of patients with upper limb spasticity using collaborative robots, Ministerio de Economía, Industria y Competitividad, Programa Estatal de I+D+i Orientada a los Retos de la Sociedad (DPI2017-87562-C2-1-R)

Crystalline Structure and Vacancy Ordering across a Surface Phase Transition in Sn/Cu(001)

We report a surface X-ray diffraction study of the crystalline structure changes and critical behavior across the (3√2 × √2)R45° → (√2 × √2)R45° surface phase transition at 360 K for 0.5 monolayers of Sn on Cu(100). The phase transition is of the order-disorder type and is due to the disordering of the Cu atomic vacancies present in the low temperature phase. Two different atomic sites for Sn atoms, characterized by two different heights, are maintained across the surface phase transition.This work was funded by the Spanish MINECO under Grants FIS2011-23230 and MAT2014-52477-C5-5-P. E.G.M. and P.S. acknowledge financial support from MINECO through the “Maria de Maeztu” Programme for Units of Excellence in R&D (MDM-2014-0377).Peer Reviewe