Joint servoing for robust manipulator force control

An experimental and theoretical comparison is made of force control performance with different types of innerloop joint servoing techniques. The problem of disturbance rejection and sensitivity to plant dynamics variations (robustness) is addressed. Position, velocity, strain gauge derived joint torque, and current servos are designed and implemented on a specially instrumented industrial robot, and the end-effector force feedback performances achieved are compared. Joint strain derived torque servoing is found to provide the best overall robust force control performance. Experimental results of the robust hard-on-hard contact achieved with the novel force controller implementation based on joint torque sensing are provided. Conclusions are drawn on the force control performance achievable on a geared robot given the joint servoing technique.

Developing sensorized arm skin for an octopus inspired robot

Soft skin artefacts made of knitted nylon reinforced silicon rubber were fabricated mimicking octopus skin. A combination of ecoflex 0030 and 0010 were used as matrix of the composite to obtain the right stiffness for the skin artefacts. Material properties were characterised using static uniaxial tension and scissors cutting tests. Two types of tactile sensors were developed to detect normal contact; one used quantum tunnelling composite materials and the second was fabricated from silicone rubber and a conductive textile. Sensitivities of the sensors were tested by applying different modes of loading and the soft sensors were incorporated into the skin prototype. Passive suckers were developed and tested against squid suckers. An integrated skin prototype with embedded deformable sensors and attached suckers developed for the arm of an octopus inspired robot is also presented.

Kinematical analysis of redundant drive wire mechanisms with velocity constraint

In this paper, we propose a new velocity constraint type for Redundant Drive Wire Mechanisms. The purpose of this paper is to demonstrate that the proposed velocity constraint module can fix the orientation of the movable part and to use the kinematical analysis method to obtain the moving direction of the movable part. First, we discuss the necessity of using this velocity constraint type and the possible applications of the proposed mechanism. Second, we derive the basic equations of a wire mechanism with this constraint type. Next, we present a method of motion analysis on active and passive constraint spaces, which is used to find the moving direction of a movable part. Finally, we apply the above analysis method on a wire mechanism with a velocity constraint module and on a wire mechanism with four double actuator modules. By evaluating the results, we prove the validity of the proposed constraint type.

The cyber challenge: a robotics project to enthuse

Robotics is a key theme in many of the degrees offered in Systems Engineering. The topic has proved useful in attracting students to the University, and it also provides the basis of much practical and project work throughout the degrees. This paper focuses on one aspect, a Part 2 project in which students doing various degrees work together to develop a mobile robot which is controlled remotely to navigate an environment and perform specific tasks. In addition to providing practical experience of relevant academic topics, this project helps to contribute to key teaching and learning priorities including problem based learning, motivation and important employability skills.

Software-based study of a non-sorting method for median calculation on a set of integer numbers

This paper presents a software-based study of a hardware-based non-sorting median calculation method on a set of integer numbers. The method divides the binary representation of each integer element in the set into bit slices in order to find the element located in the middle position. The method exhibits a linear complexity order and our analysis shows that the best performance in execution time is obtained when slices of 4-bit in size are used for 8-bit and 16-bit integers, in mostly any data set size. Results suggest that software implementation of bit slice method for median calculation outperforms sorting-based methods with increasing improvement for larger data set size. For data set sizes of N > 5, our simulations show an improvement of at least 40%.

Simultaneous mobile sink allocation in home environments with applications in mobile consumer robotics

This paper presents a novel mobile sink area allocation scheme for consumer based mobile robotic devices with a proven application to robotic vacuum cleaners. In the home or office environment, rooms are physically separated by walls and an automated robotic cleaner cannot make a decision about which room to move to and perform the cleaning task. Likewise, state of the art cleaning robots do not move to other rooms without direct human interference. In a smart home monitoring system, sensor nodes may be deployed to monitor each separate room. In this work, a quad tree based data gathering scheme is proposed whereby the mobile sink physically moves through every room and logically links all separated sub-networks together. The proposed scheme sequentially collects data from the monitoring environment and transmits the information back to a base station. According to the sensor nodes information, the base station can command a cleaning robot to move to a specific location in the home environment. The quad tree based data gathering scheme minimizes the data gathering tour length and time through the efficient allocation of data gathering areas. A calculated shortest path data gathering tour can efficiently be allocated to the robotic cleaner to complete the cleaning task within a minimum time period. Simulation results show that the proposed scheme can effectively allocate and control the cleaning area to the robot vacuum cleaner without any direct interference from the consumer. The performance of the proposed scheme is then validated with a set of practical sequential data gathering tours in a typical office/home environment.

Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks

With the fast development of wireless communications, ZigBee and semiconductor devices, home automation networks have recently become very popular. Since typical consumer products deployed in home automation networks are often powered by tiny and limited batteries, one of the most challenging research issues is concerning energy reduction and the balancing of energy consumption across the network in order to prolong the home network lifetime for consumer devices. The introduction of clustering and sink mobility techniques into home automation networks have been shown to be an efficient way to improve the network performance and have received significant research attention. Taking inspiration from nature, this paper proposes an Ant Colony Optimization (ACO) based clustering algorithm specifically with mobile sink support for home automation networks. In this work, the network is divided into several clusters and cluster heads are selected within each cluster. Then, a mobile sink communicates with each cluster head to collect data directly through short range communications. The ACO algorithm has been utilized in this work in order to find the optimal mobility trajectory for the mobile sink. Extensive simulation results from this research show that the proposed algorithm significantly improves home network performance when using mobile sinks in terms of energy consumption and network lifetime as compared to other routing algorithms currently deployed for home automation networks.