Intelligent Haptic Perception for Physical Robot Interaction

Doctorado en Ingeniería mecatrónica. Fecha de entrega de la Tesis doctoral: 8 de enero de 2020. Fecha de lectura de Tesis doctoral: 30 de marzo 2020.The dream of having robots living among us is coming true thanks to the recent advances in Artificial Intelligence (AI). The gap that still exists between that dream and reality will be filled by scientific research, but manifold challenges are yet to be addressed. Handling the complexity and uncertainty of real-world scenarios is still the major challenge in robotics nowadays. In this respect, novel AI methods are giving the robots the capability to learn from experience and therefore to cope with real-life situations. Moreover, we live in a physical world in which physical interactions are both vital and natural. Thus, those robots that are being developed to live among humans must perform tasks that require physical interactions. Haptic perception, conceived as the idea of feeling and processing tactile and kinesthetic sensations, is essential for making this physical interaction possible. This research is inspired by the dream of having robots among us, and therefore, addresses the challenge of developing robots with haptic perception capabilities that can operate in real-world scenarios. This PhD thesis tackles the problems related to physical robot interaction by employing machine learning techniques. Three AI solutions are proposed for different physical robot interaction challenges: i) Grasping and manipulation of humans’ limbs; ii) Tactile object recognition; iii) Control of Variable-Stiffness-Link (VSL) manipulators. The ideas behind this research work have potential robotic applications such as search and rescue, healthcare or rehabilitation. This dissertation consists of a compendium of publications comprising as the main body a compilation of previously published scientific articles. The baseline of this research is composed of a total of five papers published in prestigious peer-reviewed scientific journals and international robotics conferences

Self–organised multi agent system for search and rescue operations

Autonomous multi-agent systems perform inadequately in time critical missions, while they tend to explore exhaustively each location of the field in one phase with out selecting the pertinent strategy. This research aims to solve this problem by introducing a hierarchy of exploration strategies. Agents explore an unknown search terrain with complex topology in multiple predefined stages by performing pertinent strategies depending on their previous observations. Exploration inside unknown, cluttered, and confined environments is one of the main challenges for search and rescue robots inside collapsed buildings. In this regard we introduce our novel exploration algorithm for multi–agent system, that is able to perform a fast, fair, and thorough search as well as solving the multi–agent traffic congestion. Our simulations have been performed on different test environments in which the complexity of the search field has been defined by fractal dimension of Brownian movements. The exploration stages are depicted as defined arenas of National Institute of Standard and Technology (NIST). NIST introduced three scenarios of progressive difficulty: yellow, orange, and red. The main concentration of this research is on the red arena with the least structure and most challenging parts to robot nimbleness

A comparison study of search heuristics for an autonomous multi-vehicle air-sea rescue system

The immense power of the sea presents many life-threatening dangers to humans, and many fall foul of its unforgiving nature. Since manned rescue operations at sea (and indeed other search and rescue operations) are also inherently dangerous for rescue workers, it is common to introduce a level of autonomy to such systems. This thesis investigates via simulations the application of various search algorithms to an autonomous air-sea rescue system, which consists of an unmanned surface vessel as the main hub, and four unmanned helicopter drones. The helicopters are deployed from the deck of the surface vessel and are instructed to search certain areas for survivors of a stricken ship. The main aim of this thesis is to investigate whether common search algorithms can be applied to the autonomous air-sea rescue system to carry out an efficient search for survivors, thus improving the present-day air-sea rescue operations. Firstly, the mathematical model of the helicopter is presented. The helicopter model consists of a set of differential equations representing the translational and rotational dynamics of the whole body, the flapping dynamics of the main rotor blades, the rotor speed dynamics, and rotational transformations from the Earth-fixed frame to the body frame. Next, the navigation and control systems are presented. The navigation system consists of a line-of-sight autopilot which points each vehicle in the direction of its desired waypoint. Collision avoidance is also discussed using the concept of a collision cone. Using the mathematical models, controllers are developed for the helicopters: Proportional-Integral-Derivative (PID) and Sliding Mode controllers are designed and compared. The coordination of the helicopters is carried out using common search algorithms, and the theory, application, and analysis of these algorithms is presented. The search algorithms used are the Random Search, Hill Climbing, Simulated Annealing, Ant Colony Optimisation, Genetic Algorithms, and Particle Swarm Optimisation. Some variations of these methods are also tested, as are some hybrid algorithms. As well as this, three standard search patterns commonly used in maritime search and rescue are tested: Parallel Sweep, Sector Search, and Expanding Square. The effect of adding to the objective function a probability distribution of target locations is also tested. This probability distribution is designed to indicate the likely locations of targets and thus guide the search more effectively. It is found that the probability distribution is generally very beneficial to the search, and gives the search the direction it needs to detect more targets. Another interesting result is that the local algorithms perform significantly better when given good starting points. Overall, the best approach is to search randomly at the start and then hone in on target areas using local algorithms. The best results are obtained when combining a Random Search with a Guided Simulated Annealing algorithm