This research investigates a novel robot-programming approach that applies machine-vision techniques to generate a robot program automatically. The hand motions of a demonstrator are initially recorded as a long seque...
详细信息
作者:
J.C. LatombeImag
BP No 68 38402 Saint-Martin d’Heres Cedex France
Industrial robots require more and more advanced programming tools. After “teaching by showing” techniques, manipulator-level programming languages for describing tasks by sequences of robot operations have emerged,...
详细信息
Industrial robots require more and more advanced programming tools. After “teaching by showing” techniques, manipulator-level programming languages for describing tasks by sequences of robot operations have emerged, and they to-day become widespread in industry. However, writting manipulatorlevel programs is not easy. This difficulty arises the need for higher level languages, called task-level languages, for describing assembly tasks as sequences of goal spatial relationships between objects. Translating such a description into a manipulator-level program requires to solve three main problems: grasp planning, path planning, and fine notion planning. This paper surveys recent progress toward solving these problems. Task-level languages may deeply transform the way we will program robots in the future, and they contribute to better CAD/CAM integration.
The use of floating-gate elements on analog circuits has increased over the last few years. Floating-gate transistors are been used for analog multiplication, memory storage, on-chip bias, offset removals, etc. Comple...
详细信息
The use of floating-gate elements on analog circuits has increased over the last few years. Floating-gate transistors are been used for analog multiplication, memory storage, on-chip bias, offset removals, etc. Complex systems, such as imagers and filter arrays, use thousands to millions of programmable floating-gate elements. The programming speed and precision of these elements plays a major role on the performance of these systems. In this paper we present a system approach that allows for automatic rapid programming of large arrays of floating-gates. We achieve this by optimizing all the time consuming tasks involved in the programming, such as current measurements and drain pulsing among others.
Three feature-utility measures-detectability, reliability, and error rate-are defined and related to the execution time of a vision program. Using a realistic vision task as a scenario, the authors show how the utilit...
详细信息
Three feature-utility measures-detectability, reliability, and error rate-are defined and related to the execution time of a vision program. Using a realistic vision task as a scenario, the authors show how the utility measures can be used to automatically generate the most efficient vision programs. They also present the experimental result of estimating the feature-utility measures using synthetic images rendered from CAD models. The discrepancy between the estimated utility measures obtained from CAD-rendered images and from real training images suggests that one must be cautious in constructing CAD-based vision systems.< >
Three utility measures that can be used to judge the effectiveness of features in a model-based matching strategy are defined: detectability, reliability, and error rate. With the probability framework, it is shown ho...
详细信息
Three utility measures that can be used to judge the effectiveness of features in a model-based matching strategy are defined: detectability, reliability, and error rate. With the probability framework, it is shown how it is possible to analytically estimate the reliability of a hypothesis using the measures of the individual features. Based on these measures, the authors have formulated and experimentally verified the matching cost (expressed as execution time) of locating an instance of a model in an image. An algorithm is presented for the selection of optimal seed features of the model using the estimated cost of criterion.< >
automatic programming can be defined as developing software in a high abstraction level. The definition of automatic programming is not precise because what is meant by automatic programming is changing over time. The...
详细信息
ISBN:
(纸本)9781467386159
automatic programming can be defined as developing software in a high abstraction level. The definition of automatic programming is not precise because what is meant by automatic programming is changing over time. The goal of automatic programming has the programmer set the specifications of a program and the computer generate the source code of that program. There exists a group of specification languages that vary in their properties; the Descartes specification language is known to be comprehensible and easily constructible. Descartes represents the specifications by defining a system's inputs and outputs, as well as the relationship between these as functions. Descartes has been extended to support concurrent systems. These features made Descartes to be a good basis to build this research effort on. This research effort studied automatic programming approaches and created a shortcut between specifications and implementation with all its benefits. This research created a way to transform Descartes specifications into C source code automatically. automatic programming can apply to all fields of knowledge that can be automated; therefore, the scope of this research project was restricted to a few case studies that involve parallel programming.
The construction of plan libraries as a repository for automatic understanding systems is almost a mystery. So far, there have been no reports that describe a technique for accomplishing program analysis for the const...
详细信息
ISBN:
(纸本)0769510280
The construction of plan libraries as a repository for automatic understanding systems is almost a mystery. So far, there have been no reports that describe a technique for accomplishing program analysis for the construction of programming plan libraries. The paper presents a technique based on the automatic comparison of slices. It permits the analyst to focus his attention on a meaningful code for the design of program plans. The results obtained until now confirm the feasibility of the approach, and lead to strengthening of the practical application of the planning libraries in the maintenance and re-engineering process.
Despite much research in the field, the use of automatic robot programming systems is still a long term issue; it is the reason why we think that, right now, we have to use the methodology supplied by this research to...
详细信息
Despite much research in the field, the use of automatic robot programming systems is still a long term issue; it is the reason why we think that, right now, we have to use the methodology supplied by this research to develop object level on-line robot programming tools. Moreover, we think that some accessibility problems which automatic robot programming addresses might be solved a better way in a sensor based approach. In this paper, we focus on the problem of accessibility analysis for automatic grasping. The problem is to choose a goal configuration and a safe path for a 3D object moving bi-dimensionally among 3D obstacles. We propose an approach relying on a bidimensional geometric reasoning; our approach consists in discretizing the space swept by the gripper using a set of parallel planes. Then, an accessibility analysis using the Configuration Space approach is performed in each of these planes and local constraints are transformed in constraints on the motion of the whole gripper. In this paper, we describe this approach and the work in progress for using visual data in building a model of the empty space.
Currently, the landscape of computer hardware architecture presents the characteristics of heterogeneity and diversity, prompting widespread attention to cross-platform portable parallel programming techniques. Most e...
详细信息
暂无评论