In this paper, a complete model of the elasto-kinematics is formulated in terms of a new kinematic notation, called the algebra of rotations. Based on this formulation, the elegant and concise expressions are derived for the displacement equation and especially the Jacobians governing the motion mapping between the manipulator tip and joint variables as well as link deflections. Introduction of the elasto-kinematics into the elasto-dynamics can directly take into consideration the nonlinear coupling between joint variables and link deflections, and thus improve the result of the elasto-dynamics.

A novel design of a three dimensional localiser intended for autonomous robot vehicles is presented. A prototype is implemented in air using ultrasonic beacons at known positions, and can be adapted to underwater environments where it has important applications, such as deep sea maintenance, data collection and reconnaissance tasks. The paper presents the hardware design, algorithms for position and orientation determination (six degrees of freedom), and performance results of a laboratory prototype. Two approaches are discussed for position and orientation determination – (i) fast single measurement set techniques and (ii) computationally slower Kalman filter based techniques. The Kalman filter approach allows the incorporation of robot motion information, more accurate beacon modelling and the capability of processing data from more than four beacons, the minimum number required for localisation.

This is a concise survey of the activities carried out by the Robotics Laboratory of the “J. Stefan” Institute, University of E. Kardelj, Ljubljana (Yugoslavia) on the field of robotics research and development of robots. A list of research themes is given with a brief explanation of each containing the objectives, the obtained results, the history and the future outlook. Besides, the main projects concerned with the development of industrial robots are described, as well as the equipment which enables practical work and experimentations as a major element of the laboratory research and educational activities.

An algorithm for kinematic motion planning of redundant planar robots, having revolute joints, in an unknown dynamic environment is presented. Distance ranging sensors, mounted on the body of each manipulator link, are simulated here to estimate the proximity of an obstacle. The sensory data is analyzed through a fuzzy controller which estimates whether a collision is imminent, and if so, employs a geometric approach to compute the joint movements necessary to avoid the collision. Obstacles can sometimes move uncompromisingly in the environment attempting a deliberate collision. Strategies to deal with such cases are presented and recovery procedures to circumvent the obstacle from tight corners are suggested. Cases of link overlap have been avoided by considering each link as a body which is sensed as an obstacle by every other link of the same manipulator. Suitable examples are presented to demonstrate the algorithm.

The application of the joint force sensory feedback in both the gross and fine motion control of manipulation robots is considered in the paper. One of the objectives of the paper is to give a historical overview how the idea of the joint force sensory feedback has appeared and developed in the past two decades. The control schemes, which include joint torque sensory feedback, are surveyed in the paper. The main advantages of this approach are discussed: the joint torque feedback offers an elegant way to compensate for the effects of the robot dynamics without real time computation of the robot dynamics, the control schemes are robust in respect of parameter variations. Various problems regarding design and implementation of joint torque sensor are also considered. Special emphasis is given to the application of this approach in hybrid position/force control schemes.

This paper outlines a heuristic approach for the development of a control strategy for finding a safe path for a polyhedral object moving amongst known polyhedral objects. This is achieved by the algorithm A* for finding a minimum cost path in a graph; the algorithm is implemented on a computer under the UNIX operating system, using the NU7 version of PROLOG.