Modeling planar assembly paths from observation
نویسندگان
چکیده
This report describes a system for obtaining the compliant motion plan for a planar assembly task, given a sequence of observations of a human performing it. The compliant motion plan in configuration space is a series of connected path segments lying on the configuration space obstacle. We use the observed configurations of the assembled objects to selectively compute the features of the c-space obstacle on which the path lies. We project the observed configurations onto these features and reconstruct the path segments. The connected path segments form the model of the observed task and can be used to program a robot to repeat the task. We demonstrate the system using the planar peg in hole task.
منابع مشابه
Paths : the Case of Multiple Translations Dan
We consider the following problem that arises in assembly planning: given an assembly, identify a sub-assembly that can be removed as a rigid object without disturbing the rest of the assembly. This is the assembly partitioning problem. Speciically, we consider planar assemblies of simple polygons and sub-assembly removal paths consisting of a single nite translation followed by a translation t...
متن کاملAssembly Partitioning along Simple Paths: the Case of Multiple Translations
We consider the following problem that arises in mechanical assembly planning: given an assembly, identify a subassembly that can be removed as a rigid object without disturbing the rest of the assembly. This is the assembly partitioning problem. Speciically, we consider planar assemblies of simple polygons and subassembly removal paths consisting of a single nite translation followed by a tran...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کامل1-String B_2-VPG Representation of Planar Graphs
In this paper, we prove that every planar graph has a 1-string B2-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
متن کاملAssembly Parti Distribution Category Uc{705 Sand94{1819 Unlimited Release Tioning with a Constant Number of Translations
We consider the following problem that arises in assembly planning: given an assembly, identify a subassembly that can be removed as a rigid object without disturbing the rest of the assembly. This is the assembly partitioning problem. Speci cally, we consider planar assemblies of simple polygons and subassembly removal paths consisting of a single nite translation followed by a translation to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996