Cognitive Task Planning for Smart Industrial Robots

This research work presents a novel Cognitive Task Planning framework for Smart Industrial Robots. The framework makes an industrial mobile manipulator robot Cognitive by applying Semantic Web Technologies. It also introduces a novel Navigation Among Movable Obstacles algorithm for robots navigating and manipulating inside a firm. The objective of Industrie 4.0 is the creation of Smart Factories: modular firms provided with cyber-physical systems able to strong customize products under the condition of highly flexible mass-production. Such systems should real-time communicate and cooperate with each other and with humans via the Internet of Things. They should intelligently adapt to the changing surroundings and autonomously navigate inside a firm while moving obstacles that occlude free paths, even if seen for the first time. At the end, in order to accomplish all these tasks while being efficient, they should learn from their actions and from that of other agents. Most of existing industrial mobile robots navigate along pre-generated trajectories. They follow ectrified wires embedded in the ground or lines painted on th efloor. When there is no expectation of environment changes and cycle times are critical, this planning is functional. When workspaces and tasks change frequently, it is better to plan dynamically: robots should autonomously navigate without relying on modifications of their environments. Consider the human behavior: humans reason about the environment and consider the possibility of moving obstacles if a certain goal cannot be reached or if moving objects may significantly shorten the path to it. This problem is named Navigation Among Movable Obstacles and is mostly known in rescue robotics. This work transposes the problem on an industrial scenario and tries to deal with its two challenges: the high dimensionality of the state space and the treatment of uncertainty. The proposed NAMO algorithm aims to focus exploration on less explored areas. For this reason it extends the Kinodynamic Motion Planning by Interior-Exterior Cell Exploration algorithm. The extension does not impose obstacles avoidance: it assigns an importance to each cell by combining the efforts necessary to reach it and that needed to free it from obstacles. The obtained algorithm is scalable because of its independence from the size of the map and from the number, shape, and pose of obstacles. It does not impose restrictions on actions to be performed: the robot can both push and grasp every object. Currently, the algorithm assumes full world knowledge but the environment is reconfigurable and the algorithm can be easily extended in order to solve NAMO problems in unknown environments. The algorithm handles sensor feedbacks and corrects uncertainties. Usually Robotics separates Motion Planning and Manipulation problems. NAMO forces their combined processing by introducing the need of manipulating multiple objects, often unknown, while navigating. Adopting standard precomputed grasps is not sufficient to deal with the big amount of existing different objects. A Semantic Knowledge Framework is proposed in support of the proposed algorithm by giving robots the ability to learn to manipulate objects and disseminate the information gained during the fulfillment of tasks. The Framework is composed by an Ontology and an Engine. The Ontology extends the IEEE Standard Ontologies for Robotics and Automation and contains descriptions of learned manipulation tasks and detected objects. It is accessible from any robot connected to the Cloud. It can be considered a data store for the efficient and reliable execution of repetitive tasks; and a Web-based repository for the exchange of information between robots and for the speed up of the learning phase. No other manipulation ontology exists respecting the IEEE Standard and, regardless the standard, the proposed ontology differs from the existing ones because of the type of features saved and the efficient way in which they can be accessed: through a super fast Cascade Hashing algorithm. The Engine lets compute and store the manipulation actions when not present in the Ontology. It is based on Reinforcement Learning techniques that avoid massive trainings on large-scale databases and favors human-robot interactions. The overall system is flexible and easily adaptable to different robots operating in different industrial environments. It is characterized by a modular structure where each software block is completely reusable. Every block is based on the open-source Robot Operating System. Not all industrial robot controllers are designed to be ROS-compliant. This thesis presents the method adopted during this research in order to Open Industrial Robot Controllers and create a ROS-Industrial interface for them

Robot motion planning with contact from global pseudo-inverse map

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.Cataloged from PDF version of thesis.Includes bibliographical references (pages 101-108).In the robot motion planning problems, environment and its objects are often treated as obstacles to be avoided. However, there are situations where contacting with the environment is not costly. Moreover, in many cases, making contact can actually help a robot to maneuver around to reach a goal state which would not have been possible otherwise. This thesis presents a framework for motion planner that utilizes multiple contacts with the environment and its objects. The planner is targeted to autonomously generate motion, where robot has to make multiple contact with different part of its body in order to achieve a task objective. It is motivated by and has significance in developing a robust humanoid planner that is capable of recovering from a fall down. The recent DRC has been marked with compilation of humanoid robots falling down, but only one robot managed to recover to a standing up position. In a real disaster scenario, the inability to stand up would mean end of the rescue mission for what is extremely expensive machinery. A robust planner capable of recovery is must and this work contributes towards it. The developed planner autonomously generates standing up motion from fall down in the presence of torque limits. The proposed multi-contact motion planner leverages upon following two key components. Existing multi-contact planners require good initial seeds to successfully generate a motion. These are hard to find and often manually encoded. Here, we utilize pre-computed global pseudo-inverse map (inverse kinematic map for each contact-state that has property of global resolution, connected by connectivity functions) to generate multi-contact motion from current configuration to the goal without need for an initial seed. Nevertheless, constructing the global pseudo-inverse map is computationally expensive. In an effort to facilitate the construction, we utilize singular configurations as a heuristic to reduce the search space and justify its use based on the physical analysis. Although computationally expensive, once pre-computed, the global map can be used to generate plans fast online in a multi-query manner.by Changrak Choi.Ph. D

Kinodynamic motion planning for quadrotor-like aerial robots

Motion planning is the field of computer science that aims at developing algorithmic techniques allowing the automatic computation of trajecto- ries for a mechanical system. The nature of such a system vary according to the fields of application. In computer animation it could be a humanoid avatar. In molecular biology it could be a protein. The field of application of this work being aerial robotics, the system is here a four-rotor UAV (Unmanned Aerial Vehicle) called quadrotor. The motion planning problem consists in computing a series of motions that brings the system from a given initial configuration to a desired final configuration without generating collisions with its environment, most of the time known in advance. Usual methods explore the system’s configuration space regardless of its dynamics. By construction the thrust force that allows a quadrotor to fly is tangential to its attitude which implies that not every motion can be performed. Furthermore, the magnitude of this thrust force and hence the linear acceleration of the center of mass are limited by the physical capabilities of the robot. For all these reasons, not only position and orientation must be planned, higher derivatives must be planned also if the motion is to be executed. When this is the case we talk of kinodynamic motion planning. A distinction is made between the local planner and the global planner. The former is in charge of producing a valid trajectory between two states of the system without necessarily taking collisions into account. The later is the overall algorithmic process that is in charge of solving the motion planning problem by exploring the state space of the system. It relies on multiple calls to the local planner. We present a local planner that interpolates two states consisting of an arbitrary number of degrees of freedom (dof) and their first and second derivatives. Given a set of bounds on the dof derivatives up to the fourth order (snap), it quickly produces a near-optimal minimum time trajectory that respects those bounds. In most of modern global motion planning algorithms, the exploration is guided by a distance function (or metric). The best choice is the cost-to-go, i.e. the cost associated to the local method. In the context of kinodynamic motion planning, it is the duration of the minimal-time trajectory. The problem in this case is that computing the cost-to-go is as hard (and thus as costly) as computing the optimal trajectory itself. We present a metric that is a good approximation of the cost-to-go but which computation is far less time consuming. The dominant paradigm nowadays is sampling-based motion planning. This class of algorithms relies on random sampling of the state space in order to quickly explore it. A common strategy is uniform sampling. It however appears that, in our context, it is a rather poor choice. Indeed, a great majority of uniformly sampled states cannot be interpolated. We present an incremental sampling strategy that significantly decreases the probability of this happening

Autonomous Navigation for Unmanned Aerial Systems - Visual Perception and Motion Planning

L'abstract è presente nell'allegato / the abstract is in the attachmen

Mobile Robots Navigation

Mobile robots navigation includes different interrelated activities: (i) perception, as obtaining and interpreting sensory information; (ii) exploration, as the strategy that guides the robot to select the next direction to go; (iii) mapping, involving the construction of a spatial representation by using the sensory information perceived; (iv) localization, as the strategy to estimate the robot position within the spatial map; (v) path planning, as the strategy to find a path towards a goal location being optimal or not; and (vi) path execution, where motor actions are determined and adapted to environmental changes. The book addresses those activities by integrating results from the research work of several authors all over the world. Research cases are documented in 32 chapters organized within 7 categories next described

Méthode interactive et par l'apprentissage pour la generation de trajectoire en conception du produit

The accessibility is an important factor considered in the validation and verification phase of the product design and usually dominates the time and costs in this phase. Defining the accessibility verification as the motion planning problem, the sampling based motion planners gained success in the past fifteen years. However, the performances of them are usually shackled by the narrow passage problem arising when complex assemblies are composed of large number of parts, which often leads to scenes with high obstacle densities. Unfortunately, humans’ manual manipulations in the narrow passage always show much more difficulties due to the limitations of the interactive devices or the cognitive ability. Meanwhile, the challenges of analyzing the end users’ response in the design process promote the integration with the direct participation of designers.In order to accelerate the path planning in the narrow passage and find the path complying with user’s preferences, a novel interactive motion planning method is proposed. In this method, the integration with a random retraction process helps reduce the difficulty of manual manipulations in the complex assembly/disassembly tasks and provide local guidance to the sampling based planners. Then a hypothesis is proposed about the correlation between the topological structure of the scenario and the motion path in the narrow passage. The topological structure refers to the medial axis (2D) and curve skeleton (3D) with branches pruned. The correlation runs in an opposite manner to the sampling based method and provide a new perspective to solve the narrow passage problem. The curve matching method is used to explore this correlation and an interactive motion planning framework that can learn from experience is constructed in this thesis. We highlight the performance of our framework on a challenging problem in 2D, in which a non-convex object passes through a cluttered environment filled with randomly shaped and located non-convex obstacles.L'accessibilitéest un facteur important pris en compte dans la validation et la vérification en phase de conception du produit et augmente généralement le temps et les coûts de cette phase. Ce domaine de recherche a eu un regain d’intérêt ces quinze dernières années avec notamment de nouveaux planificateurs de mouvement. Cependant, les performances de ces méthodes sont généralement très faibles lorsque le problème se caractérise par des passages étroits des assemblages complexes composées d'un grand nombre de pièces. Cela conduit souvent àdes scènes àforte densitéd'obstacles. Malheureusement, les manipulations manuelles des humains dans le passage étroit montrent toujours beaucoup de difficultés en raison des limitations des dispositifs interactifs ou la capacitécognitive. Pendant ce temps, les défis de l'analyse de la réponse finale des utilisateurs dans le processus de conception promeut l'intégration avec la participation directe des concepteurs.Afin d'accélérer la planification dans le passage étroit et trouver le chemin le plus conforme aux préférences de l'utilisateur, une nouvelle méthode de planification de mouvement interactif est proposée. Nous avons soulignéla performance de notre algorithme dans certains scénarios difficiles en 2D et 3D environnement.Ensuite, une hypothèse est proposésur la corrélation entre la structure topologique du scénario et la trajectoire dans le passage étroit. La méthode basée sur les courbures est utilisée pour explorer cette corrélation et un cadre de planification de mouvement interactif qui peut apprendre de l'expérience est construit dans cette thèse. Nous soulignons la performance de notre cadre sur un problème difficile en 2D, dans lequel un objet non-convexe passe à travers un environnement encombrérempli d'obstacles non-convexes de forme aléatoire et situés

DESIGNING A MULTI-AGENT FRAMEWORK FOR UNMANNED AERIAL/GROUND VEHICLES

Ph.DDOCTOR OF PHILOSOPH

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Planning Algorithms for Multi-Robot Active Perception

A fundamental task of robotic systems is to use on-board sensors and perception algorithms to understand high-level semantic properties of an environment. These semantic properties may include a map of the environment, the presence of objects, or the parameters of a dynamic field. Observations are highly viewpoint dependent and, thus, the performance of perception algorithms can be improved by planning the motion of the robots to obtain high-value observations. This motivates the problem of active perception, where the goal is to plan the motion of robots to improve perception performance. This fundamental problem is central to many robotics applications, including environmental monitoring, planetary exploration, and precision agriculture. The core contribution of this thesis is a suite of planning algorithms for multi-robot active perception. These algorithms are designed to improve system-level performance on many fronts: online and anytime planning, addressing uncertainty, optimising over a long time horizon, decentralised coordination, robustness to unreliable communication, predicting plans of other agents, and exploiting characteristics of perception models. We first propose the decentralised Monte Carlo tree search algorithm as a generally-applicable, decentralised algorithm for multi-robot planning. We then present a self-organising map algorithm designed to find paths that maximally observe points of interest. Finally, we consider the problem of mission monitoring, where a team of robots monitor the progress of a robotic mission. A spatiotemporal optimal stopping algorithm is proposed and a generalisation for decentralised monitoring. Experimental results are presented for a range of scenarios, such as marine operations and object recognition. Our analytical and empirical results demonstrate theoretically-interesting and practically-relevant properties that support the use of the approaches in practice