Manipulator joint trajectories are planned to make an arbitrary cost function as good as possible in consideration of physical constraints based on kinematics and dynamics of a manipulator system. An algorithm presented in this paper is an iteratively improving method using the local controllability of B spline. It can be also applied to the case that some points are specified and joint trajectories must pass through those points. This algorithm is applied to an example of trajectory planning of a manipulator with two links and two degrees of freedom.

The problem of finding an allowable object trajectory for a cooperating two-robot system is investigated. The purpose is to move an object from one point to another by firmly grasping it at two different points using two robotic hands. The major difficulty is caused by the fact that, unless the robots have true six degrees of freedom, the trajectories the object can follow are severely limited and, in general, are difficult to find. The method proposed in the paper is based on reformulating the problem as a nonlinear optimization problem with equality constraints in terms of the joint variables. The optimization problem is then solved numerically on a computer. The solution automatically gives the corresponding joint variable trajectories as well, thus eliminating the need for solving the inverse kinematic problem. The method has been successfully applied to a real experimental system.

The dynamics of a mechanical manipulator have the inherent characteristics of being highly non-linear and strongly coupled due to the interaction of the inertial, centripetal, coriolis and gravitational forces.

These characteristics produce difficulties in predicting the dynamic behaviour of a given manipulator's structure. These interactive forces depend largely on the geometrical configuration and operational conditions of a manipulator. Therefore, it is essential to investigate the dynamics behaviour under different conditions in order to obtain an optimal design.

This paper presents a study of the dynamics behaviour of a robot's arm with particular reference to the mechanical manipulator being designed by the AEAC. A computer software package has been developed to facilitate the investigation of the potential dynamics behaviour of a robot's arm and provides the designer with useful information for the real time control of high performance robots. This package also enables the designer to closely monitor the implications of his design.

The software of this package is based on the Lagrangian model, taking advantage of the recursive formulation. A brief description of the types of velocity trajectories used in this study is also included in this paper.

The software for the modelling was written in FORTRAN 77 in single precision and run on a UNIVAC operating system.

When fitting contacts to connectors, the flexibility of the wires and the irregularity of the contact shapes have proved to be the greatest obstacles in developing automation. Within the framework of the present project, two methods for fitting irregular and flexible parts have been developed, both using industrial robots supported by vibrating tools. For theoretical analysis the irregular, flexible part is mathematically idealized. The tests are carried out with these idealized parts and crimp contacts. These tests proved that the vibration method is suitable for fitting irregular, flexible parts.

This report deals with the development of new control vehicles for the bedridden, physically handicapped person who needs a help-system for carrying things to the bedside from the stock in the room. This new control method is characterized by a unit loop system on the drive track. This unit loop system was constructed to execute three actions: stop, backward and right forward movement, under the control of a on-board microcomputer.

This control method is used in small rooms. It also enables one to increase the driving area of a vehicle without reprogramming and adjusting the control mechanism.

The programming of robots forms a popular research topic. Different approaches for developing ideal robot programming system have already been proposed. They all attempt to raise the level of abstraction of the robot programming system. They differ, however, to a great extent in the stage of maturity they have reached to become eligible for industrial application. “Explicit robot programming languages”, in which every robot action has to be specified explicitly, can be said to be ready for industrial application. Therefore a detailed analysis is made of the requirements that are put on the class of “explicit robot programming languages”. Their basic composing elements are recognized and discussed in detail.

A single-loop spatial mechanism kinematically becomes an open robot, if we separate the grounded joint of the input link which may then be considered as the end effector of the robot. Any position of the end-effector within the workspace of such an open robot can be reached via a number of different configurations of the links. These configurations are called “branches” of the open robot for that particular position of the end effector.

If the open robot is now stretched to a limiting position by a force exerted on the end effector, all the possible branches of the mechanism approach each other. When they become coincident, they form the “limiting configuration”. Any two related branches are at opposite sides of the limiting configuration. From the relationship between the links in th elimiting configuration and in related branches, conditions for aviodance of branching of the original closed-loop mechanism can be obtained. This is necessary in order to assure that a set of consistent relative displacements are specified for the open robot to move displacements are specified for the open robot to move toward the desired end-effector position without jumping from one branch to another. As for the closed-loop mechanism, open robot branching aviodance ensures that a desired sequence of positions of a particular floating link in the loop will be generated without changing the branch of the link configuration.

In this paper, the above approach is applied to RSSR, RRSC, RRSRR, RRRRRRR and RPCRRR spatial closed-loop motion-generator mechanisms and the corresponding conditions for aviodance of branching in the synthesis of the mechanisms are derived.

Classifications of pictures and pictorial knowledge are presented. Pictorial knowledge is divided into three classes – angular pictorial knowledge, side pictorial knowledge, and angular and side pictorial knowledge. A block diagram of these three pictorial knowledge classes and a pictorial knowledge transformation module is also presented with illustrative examples. Pictorial semantic networks which in terms of pictorial nodes, property nodes, “is a” links, “has property” links, and “if and only if” links are introduced. Transitivity, generalization, specialization, inheritance hierarchy, and knowledge transformation properties are stated and illustrated by examples. Triangular, quadrangular, and polygonal knowledge representation using pictorial semantic networks are presented. The concepts of deducible property nodes are also presented with illustrative examples. Additional facts can be established from pictorial semantic networks. Thus, pictorial semantic networks are a useful way to represent pictorial knowledge in domains that use well-established taxonomies to simplify problem solving in pictorial information systems. Pictorial semantic networks offer what appears to be a fertile field for future study. The results may have useful applications in knowledge representation, expert systems, artificial intelligence, knowledge - based systems, pictorial information systems and related areas.