An ontology-based approach towards coupling task and path planning for the simulation of manipulation tasks

This work deals with the simulation and the validation of complex manipulation tasks under strong geometric constraints in virtual environments. The targeted applications relate to the industry 4.0 framework; as up-to-date products are more and more integrated and the economic competition increases, industrial companies express the need to validate, from design stage on, not only the static CAD models of their products but also the tasks (e.g., assembly or maintenance) related to their Product Lifecycle Management (PLM). The scientific community looked at this issue from two points of view: - Task planning decomposes a manipulation task to be realized into a sequence of primitive actions (i.e., a task plan) - Path planning computes collision-free trajectories, notably for the manipulated objects. It traditionally uses purely geometric data, which leads to classical limitations (possible high computational processing times, low relevance of the proposed trajectory concerning the task to be performed, or failure); recent works have shown the interest of using higher abstraction level data. Joint task and path planning approaches found in the literature usually perform a classical task planning step, and then check out the feasibility of path planning requests associated with the primitive actions of this task plan. The link between task and path planning has to be improved, notably because of the lack of loopback between the path planning level and the task planning level: - The path planning information used to question the task plan is usually limited to the motion feasibility where richer information such as the relevance or the complexity of the proposed path would be needed; - path planning queries traditionally use purely geometric data and/or “blind” path planning methods (e.g., RRT), and no task-related information is used at the path planning level Our work focuses on using task level information at the path planning level. The path planning algorithm considered is RRT; we chose such a probabilistic algorithm because we consider path planning for the simulation and the validation of complex tasks under strong geometric constraints. We propose an ontology-based approach to use task level information to specify path planning queries for the primitive actions of a task plan. First, we propose an ontology to conceptualize the knowledge about the 3D environment in which the simulated task takes place. The environment where the simulated task takes place is considered as a closed part of 3D Cartesian space cluttered with mobile/fixed obstacles (considered as rigid bodies). It is represented by a digital model relying on a multilayer architecture involving semantic, topologic and geometric data. The originality of the proposed ontology lies in the fact that it conceptualizes heterogeneous knowledge about both the obstacles and the free space models. Second, we exploit this ontology to automatically generate a path planning query associated to each given primitive action of a task plan. Through a reasoning process involving the primitive actions instantiated in the ontology, we are able to infer the start and the goal configurations, as well as task-related geometric constraints. Finally, a multi-level path planner is called to generate the corresponding trajectory. The contributions of this work have been validated by full simulation of several manipulation tasks under strong geometric constraints. The results obtained demonstrate that using task-related information allows better control on the RRT path planning algorithm involved to check the motion feasibility for the primitive actions of a task plan, leading to lower computational time and more relevant trajectories for primitive actions

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

Deformable meshes for shape recovery: models and applications

With the advance of scanning and imaging technology, more and more 3D objects become available. Among them, deformable objects have gained increasing interests. They include medical instances such as organs, a sequence of objects in motion, and objects of similar shapes where a meaningful correspondence can be established between each other. Thus, it requires tools to store, compare, and retrieve them. Many of these operations depend on successful shape recovery. Shape recovery is the task to retrieve an object from the environment where its geometry is hidden or implicitly known. As a simple and versatile tool, mesh is widely used in computer graphics for modelling and visualization. In particular, deformable meshes are meshes which can take the deformation of deformable objects. They extend the modelling ability of meshes. This dissertation focuses on using deformable meshes to approach the 3D shape recovery problem. Several models are presented to solve the challenges for shape recovery under different circumstances. When the object is hidden in an image, a PDE deformable model is designed to extract its surface shape. The algorithm uses a mesh representation so that it can model any non-smooth surface with an arbitrary precision compared to a parametric model. It is more computational efficient than a level-set approach. When the explicit geometry of the object is known but is hidden in a bank of shapes, we simplify the deformation of the model to a graph matching procedure through a hierarchical surface abstraction approach. The framework is used for shape matching and retrieval. This idea is further extended to retain the explicit geometry during the abstraction. A novel motion abstraction framework for deformable meshes is devised based on clustering of local transformations and is successfully applied to 3D motion compression