955 resultados para Modular programming.
Developing ISO 14649-based conversational programming system for multi-channel complex machine tools
Resumo:
A multi-channel complex machine tool (MCCM) is a versatile machining system equipped with more than two spindles and turrets for both turning and milling operations. Despite the potential of such a tool, the value of the hardware is largely dependent on how the machine tools are effectively programmed for machining. In this paper we consider a shop-floor programming system based on ISO 14649 (called e-CAM), the international standard for the interface between computer-aided manufacture (CAM) and computer numerical control (CNC). To be deployed in practical industrial usage a great deal of research has to be carried out. In this paper we present: 1) Design consideration for an e-CAM system, 2) The architecture design of e-CAM, 3) Major algorithms to fulfill the modules defined in the architecture, and 4) Implementation details.
Resumo:
A modular dilated MZI based optical switch with integrated SOAs is demonstrated with excellent -40dB crosstalk/extinction ratio, 3ns switching time and nearly penalty-free operation. Studies show an 8×8 switch with 14dB IPDR for 0.5dB penalty. © 2014 OSA.
Resumo:
Locomotion has been one of the frequently used case studies in hands-on curricula in robotics education. Students are usually instructed to construct their own wheeled or legged robots from modular robot kits. In the development process of a robot students tend to emphasize on the programming part and consequently, neglect the design of the robot's body. However, the morphology of a robot (i.e. its body shape and material properties) plays an important role especially in dynamic tasks such as locomotion. In this paper we introduce a case study of a tutorial on soft-robotics where students were encouraged to focus solely on the morphology of a robot to achieve stable and fast locomotion. The students should experience the influence material properties exert on the performance of a robot and consequently, extract design principles. This tutorial was held in the context of the 2012 Summer School on Soft Robotics at ETH Zurich, which was one of the world's first courses specialized in the emerging field. We describe the tutorial set-up, the used hardware and software, the students assessment criteria as well as the results. Based on the high creativity and diversity of the robots built by the students, we conclude that the concept of this tutorial has great potentials for both education and research. © 2013 IEEE.
Resumo:
The adaptation of robots to changing tasks has been explored in modular self-reconfigurable robot research, where the robot structure is altered by adapting the connectivity of its constituent modules. As these modules are generally complex and large, an upper bound is imposed on the resolution of the built structures. Inspired by growth of plants or animals, robotic body extension (RBE) based on hot melt adhesives allows a robot to additively fabricate and assemble tools, and integrate them into its own body. This enables the robot to achieve tasks which it could not achieve otherwise. The RBE tools are constructed from hot melt adhesives and therefore generally small and only passive. In this paper, we seek to show physical extension of a robotic system in the order of magnitude of the robot, with actuation of integrated body parts, while maintaining the ability of RBE to construct parts with high resolution. Therefore, we present an enhancement of RBE based on hot melt adhesives with modular units, combining the flexibility of RBE with the advantages of simple modular units. We explain the concept of this new approach and demonstrate with two simple unit types, one fully passive and the other containing a single motor, how the physical range of a robot arm can be extended and additional actuation can be added to the robot body. © 2012 IEEE.
Resumo:
This paper describes a two-step packing algorithm for LUT clusters of which the LUT input multipliers are depopulated. In the first step, a greedy algorithm is used to search for BLE locations and cluster inputs. If the greedy algorithm fails, the second step with network flow programming algorithm is employed. Numerical results illustrate that our two-step packing algorithm obtains better packing density than one-step greedy packing algorithm.
Resumo:
In this paper we present a methodology and its implementation for the design and verification of programming circuit used in a family of application-specific FPGAs that share a common architecture. Each member of the family is different either in the types of functional blocks contained or in the number of blocks of each type. The parametrized design methodology is presented here to achieve this goal. Even though our focus is on the programming circuitry that provides the interface between the FPGA core circuit and the external programming hardware, the parametrized design method can be generalized to the design of entire chip for all members in the FPGA family. The method presented here covers the generation of the design RTL files and the support files for synthesis, place-and-route layout and simulations. The proposed method is proven to work smoothly within the complete chip design methodology. We will describe the implementation of this method to the design of the programming circuit in details including the design flow from the behavioral-level design to the final layout as well as the verification. Different package options and different programming modes are included in the description of the design. The circuit design implementation is based on SMIC 0.13-micron CMOS technology.
Resumo:
The formal specification language LFC was designed to support formal specification acquisition. However, it is yet suited to be used as a meta-language for specifying programming language processing. This paper introduces LFC as a meta-language, and compares it with ASF+SDF, an algebraic specification formalism that can also be used to programming languages.
Resumo:
ICSE
Resumo:
本文提出一个不用 Kuhn- Tucker条件而直接搜索严格凸二次规划最优目标点的鲁棒方法 .在搜索过程中 ,目标点沿约束多面体边界上的一条折线移动 .这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广 ,在单纯形法中 ,目标点从一个顶点移到另一个顶点。