A geometric trajectory ensuring the success of an assembly task cannot be determined when the geometric uncertainty is significant. Several solutions like, for instance, passive compliance devices have been applied in...
详细信息
A geometric trajectory ensuring the success of an assembly task cannot be determined when the geometric uncertainty is significant. Several solutions like, for instance, passive compliance devices have been applied in order to decrease the influence of geometric uncertainty. However, the general solution appears to be the use of active compliance which implies reaction force/torque feedback, but this use gives rise to some particular problems in the task planning and execution. Sensorial configuration and force information becomes a key point in this field. This paper describes how this sensor information can be used in an assembly fine-motion planner and also during the task execution. The basic concepts have already been implemented and the peg-into-hole assembly task serves as an example to illustrate the results.
The automatic programming of robots to assemble products must cope with assembly planning and task planning problems. These problems are not independent, since an assembly operation may be performed by a different rob...
详细信息
The automatic programming of robots to assemble products must cope with assembly planning and task planning problems. These problems are not independent, since an assembly operation may be performed by a different robot task depending on the previous assembly operations performed. Therefore, the cost of assembly operations vary depending on the assembly sequence. This paper deals with the problem of finding the optimum sequence of robot tasks taking into account this variable cost of assembly operations. The proposed approach can cope with products with AND/OR/XOR relations and uses Petri nets as a modelling methodology. The search of a near-optimum sequence of robot tasks is done with an heuristic search of the reachability tree of the Petri net.
"Teaching by demonstration" is a method of generating a robot program that makes a robot do the same task as the task that a human operator demonstrates. We have developed a "teaching by demonstration i...
详细信息
"Teaching by demonstration" is a method of generating a robot program that makes a robot do the same task as the task that a human operator demonstrates. We have developed a "teaching by demonstration in VR" system that automatically generates a robot program to work in the real world after a task is demonstrated by an operator in the virtual world. This system generates a program that detects each contact state extracted from demonstration in VR and produces it by skillful motion primitives. In this paper, based on our observation that a human has the skill wherein contact state transitions are made nondeterministically, we propose a method of dealing with one of the important nondeterministic motions, "nondeterministic search type motion." Experimental results show the feasibility of the method.
An important issue for the success of a database application is the effectiveness of its interface and frequently a relevant part of programming effort is devoted to the generation of interfaces. The visual programmin...
详细信息
An important issue for the success of a database application is the effectiveness of its interface and frequently a relevant part of programming effort is devoted to the generation of interfaces. The visual programming environments reduce only partly this effort and in particular things become more complicated when data coming from different sources (different views in the same database or even views from different databases or systems) are to be related and must cooperate in the data access task. Our proposal is to define a new database access paradigm, called "service", including in itself the bare aspects of data access, such as browsing and selecting a tuple, and a compositional algebra for services, to automatically generate a comprehensive interface when separate services which were not designed for the cooperation, are combined. In addition, the architecture we adopt for the implementation of services is based on Java and JDBC. Services and combination of services expressed with the service algebra are automatically compiled into Java objects, allowing the rapid development of platform independent data access services. The paper formally introduces the notion of "service" with its semantics for data access; shows the compositional algebra for services and discusses a set of properties for this algebra which can be used when combining the components for simplification and optimization purposes, and describes the architecture for the implementation.
For processor cores, software-based self-test (SBST) is a promising complement to scan-based testing, especially for applications that demand high reliability. However, most prior SBST techniques only target stuck-at ...
详细信息
ISBN:
(纸本)9781665413350
For processor cores, software-based self-test (SBST) is a promising complement to scan-based testing, especially for applications that demand high reliability. However, most prior SBST techniques only target stuck-at faults and thus fall short in detecting aging induced timing violations. In this paper, we propose an automatic test program generator for detection of transition delay faults (TDFs) in pipelined processors. The key technique is the conversion of scan-based launch-on-capture (LoC) TDF test patterns to instruction sequences, which are combined to form the self-test program. In the field, the processor under test can execute the test program on demand, in its functional mode, to detect TDFs. To facilitate the pattern-to-instruction conversion, a test program template is developed. Derived from the pipelined processor operation, the template helps systematically and efficiently set the flip-flop values specified in LoC test patterns. The proposed technique is validated on a MIPS32 processor and achieves 97.82% transition delay fault coverage.
The authors give an overview of a concurrent, object-oriented (OO) programming paradigm suited to the development of measurement systems. They show how the design of the graphical user-interface can also fit naturally...
详细信息
The authors give an overview of a concurrent, object-oriented (OO) programming paradigm suited to the development of measurement systems. They show how the design of the graphical user-interface can also fit naturally within the chosen OO architecture and can be implemented in terms of reusable object libraries supporting the construction of user-interfaces. An approach has been proposed to the development of the software of an intelligent measurement system, which is based on the adoption of a concurrent, OO programming model named RTO - real time objects, which is described. RTO integrates in a natural way the OO development of the graphical user-interface. View objects are introduced which mirror the physical object features and help the user to take control of the data required in the stages of a test method.< >
Today, a lot of automatic programming techniques have been proposed and applied various fields. Graph Structured Program Evolution (GRAPE) is one of the recent automatic programming techniques. GRAPE succeeds in gener...
详细信息
ISBN:
(纸本)9781605581316
Today, a lot of automatic programming techniques have been proposed and applied various fields. Graph Structured Program Evolution (GRAPE) is one of the recent automatic programming techniques. GRAPE succeeds in generating the complex programs automatically. In this paper, a new generation alternation model for GRAPE, called Evolutionary Algorithm Considering Program Size (EACP), is proposed. EACP maintains the diversity of program size in the population by using particular fitness assignment and generation alternation. We apply EACP to three test problems, factorial, exponentiation and sorting a list. And we show the effectiveness of EACP and confirm evolution of maintaining the diversity of program size.
In parallelizing compilers on distributed memory systems, distributions of irregular sized array blocks are provided for load balancing and irregular problems. The irregular redistribution is different from the regula...
详细信息
ISBN:
(纸本)0769522165
In parallelizing compilers on distributed memory systems, distributions of irregular sized array blocks are provided for load balancing and irregular problems. The irregular redistribution is different from the regular block-cyclic redistribution. This paper is devoted to developing algorithms for irregular redistribution that attempt to obtain near optimal scheduling while satisfying the minimal communication costs condition and the minimal step condition. Efficient algorithms are developed and their experimental results are compared. One improved list algorithm provides more chance for conflict messages in its relocation phase. It allocates conflict messages through methods used in a divide-and-conquer algorithm and a relocation algorithm proposed previously. The method of selecting the smallest relocation cost guarantees that the improved list algorithm is more efficient than others in average.
A code generator is developed to produce automotive ATE programs from a tester-independent test specification. Requirements and features of the specification interface which were necessary for successful automated pro...
详细信息
A code generator is developed to produce automotive ATE programs from a tester-independent test specification. Requirements and features of the specification interface which were necessary for successful automated program generation are discussed. Generated tests are evaluated on tester hardware and found to be production-worthy. Results and advantages of the approach are observed in practice.
We have studied generation method of regrasping motion for four-fingered robot using evolutionary programming (EP). EP has advantage of finding the alley of optimal numerical values but it requires much iteration to f...
详细信息
We have studied generation method of regrasping motion for four-fingered robot using evolutionary programming (EP). EP has advantage of finding the alley of optimal numerical values but it requires much iteration to find it. This obtained regrasping strategy can not be applied to the other shaped-object except an object used in finding process. Therefore the generated regrasping strategy by EP should be reused for other sized-object. In this paper we proposed the adaptation algorithm for different size of grasping object. We show the effectiveness of the method with the experimental results.
暂无评论