The paper proposes a methodology for robot programming, based on the concept of automatically assigning available physical resources to the tasks to be performed during program execution, rather than specifying them i...
详细信息
The paper proposes a methodology for robot programming, based on the concept of automatically assigning available physical resources to the tasks to be performed during program execution, rather than specifying them in the user program. This is specially useful in multirobot systems, when several similar machines are included in the same robotized cell, and when the system has to cope with unpredictable length operations. The most interesting feature of the system appears to be its capability of maintaining good performance in those situations where, due to faulty robots, to sudden changes in the production cycle, etc., traditional scheduling and optimization techniques fail to succeed. The paper includes a discussion of the main advantages and drawbacks of the technique, together with some experimental results.
Appropriate analysis of simulation output is important to the success of a simulation study. Many users, however, do not have the skills required to perform such analyses. One way of overcoming this problem is to prov...
详细信息
ISBN:
(纸本)9780780395190
Appropriate analysis of simulation output is important to the success of a simulation study. Many users, however, do not have the skills required to perform such analyses. One way of overcoming this problem is to provide automated tools for analyzing simulation output. An Excel based automated "analyser" is described that performs an analysis of a single scenario. The analyser links to a commercial simulation software package, SIMUL8, and provides recommendations on warm-up, number of replications and run-length. Various standard procedures are used in the analyser with some adaptations to make them suitable for automation. This research demonstrates the potential of the approach. A requirement for further development is more thorough testing of the analysis procedures, particularly for their robustness and generality in use. Further adaptation of the procedures for automation may also be required.
Static program analyzers (SPA) are interactive tools that enhance program understanding by answering queries about programs. An SPA parses source programs and builds a so-called program knowledge base (PKB) that enabl...
详细信息
Static program analyzers (SPA) are interactive tools that enhance program understanding by answering queries about programs. An SPA parses source programs and builds a so-called program knowledge base (PKB) that enables automatic processing of program queries. An SPA design method described in this paper consists of steps during which we (1) identify, a class of program queries we wish to answer, (2) model program information that is required to resolve queries, (3) define physical representation for programs, based on the concept of a hybrid PKB, and (4) implement other SPA components such as a front-end and user interface. Generally, queries related to global properties of programs are best handled if we store program information in a relational database. On the other hand, detailed queries are best supported if we represent programs as attributed syntax trees. A hybrid PKB described in this paper integrates these two program representations. Our notation for specifying a hybrid PKB forms a basis for a generation system that automates some of the routine, but time consuming, tasks involved in implementation of programming tools.< >
A language with first-class arrays has functions that map from arrays to arrays, where arrays are nested rectangular containers. Such languages are conceptually appropriate for a wide range of applications. Unfortunat...
详细信息
A language with first-class arrays has functions that map from arrays to arrays, where arrays are nested rectangular containers. Such languages are conceptually appropriate for a wide range of applications. Unfortunately, straightforward implementations have high memory allocation and data movement overheads. An algorithm and implementation which discover efficient implementations for first-class array expressions is presented. This optimizer achieves results equivalent to the code a good imperative programmer would produce. For many examples, all temporary arrays and unnecessary moves are avoided. To motivate and provide a basis for this work, a first-class array language is defined and examples of its use are given.< >
The general problem of learning discrete mappings is considered. The focus is on the problem of learning a mapping that generalizes an incomplete description specified by a set of examples. The authors' view of th...
详细信息
The general problem of learning discrete mappings is considered. The focus is on the problem of learning a mapping that generalizes an incomplete description specified by a set of examples. The authors' view of this problem's nature is explained for the case of incompletely specified mappings, and on this basis a quantitative measure is given for determining the target learning performance. A neural-net model is proposed and shown to be appropriate for this general task. The model's structure is briefly described and the principles and insight of an earlier proposed adaptive process are explained. How the target of this adaptive process relates to the goal of the adaptation, as the latter is specified, is explained. The model is qualitatively analyzed and compared with the multilayer perceptron and the nonlinear feedforward model. It is shown that the proposed model is functionally equivalent to the perceptron. A number of test examples are presented which provide an insight and an evaluation of the model's performance.< >
This paper proposes a method for supporting software design by utilizing the comment which is usually put on software. It is believed that the software designer often leaves the hint or clue with respect to the reason...
详细信息
This paper proposes a method for supporting software design by utilizing the comment which is usually put on software. It is believed that the software designer often leaves the hint or clue with respect to the reason or rationale for each module or component as the comment on software when he/she designs and implements the software. The comment is utilized for structuring software into a tree and CBR (case-based reasoning) is carried out based on the tree structure for enabling the effective re-use of past software with respect to the structure and organization of software in the upper stream in design. A prototype system has been implemented with the proposed support method and experiments have been carried out to investigate the effectiveness of our approach.
作者:
W. GoslingRoke Manor
Plessey Company Public Limited Company Romsey Hampshire UK
The author surveys 20 years in the field of ATE (automatic test equipment) after the famous 'Cherry Hill' International Test Conference of 1970. The microelectronics revolution, the development of the micropro...
详细信息
The author surveys 20 years in the field of ATE (automatic test equipment) after the famous 'Cherry Hill' International Test Conference of 1970. The microelectronics revolution, the development of the microprocessor, and design for testability are highlighted.< >
The paper deals with automated task programming of flexible manufacturing systems (FMS). The method presented allows a) to progressively specify the operations to be performed in an FMS and b) to automatically synthes...
详细信息
The paper deals with automated task programming of flexible manufacturing systems (FMS). The method presented allows a) to progressively specify the operations to be performed in an FMS and b) to automatically synthesize the core of highly concurrent control software. During the specification phase tasks are modeled as Petri net modules; the analysis of properties is performed in each step of the design process. During the synthesis phase the tasks are defined and the mechanisms of communication, synchronization and mutual exclusion are built into the pertinent task bodies. This technique is presented and illustrated through an example where Ada code is generated.
An algorithm to verify the correct operation of a microprocessor system bus is presented. It indicates which faults are detected by an instruction or group of instructions, allowing the designer to choose a set of ins...
详细信息
An algorithm to verify the correct operation of a microprocessor system bus is presented. It indicates which faults are detected by an instruction or group of instructions, allowing the designer to choose a set of instructions to implement the bus test and verifies the fault coverage obtained by a user-selected set. A set of op-codes for a bus-test-oriented microprocessor is analyzed.< >
With the evolution of software engineering since the advent of structured programming until now, software engineers are faced with tremendous challenges mostly due to the development of large software programs that be...
详细信息
With the evolution of software engineering since the advent of structured programming until now, software engineers are faced with tremendous challenges mostly due to the development of large software programs that behave as open systems. Multi-agent systems, which consist of multiple cooperating intelligent agents within an environment, form a particular class of such systems. This sort of software program, which carries out operations by repeatedly interacting with dynamic environments, has become more and more complex with the emergence of ubiquitous communication and computing technologies that constantly grow and evolve. Agent-oriented computing constitutes an appealing solution for coping with this level of complexity because systems can be built by combining agents. The automated composition of software artifacts to generate new ones may rest on recent progress in artificial intelligence and automatic control that has its roots in the tradition of program synthesis. The goal is to provide software engineers with effective methods in which the planning and control of software actions are integral parts of composition operators, together with synthesis procedures that automatically generate an execution strategy that governs the discrete dynamics of the composed artifact in order to satisfy given requirements. This approach ensures a higher degree of safety because it relies on formal methods. This paper shows how the behavior composition problem issued from the artificial intelligence community can be solved within the framework of the supervisory control theory with the aim to benefit from all of its rich facets.
暂无评论