On the use of a low-cost thermal sensor to improve kinect people detection in a mobile robot

[EN]Detecting people is a key capability for robots that operate in populated environments. In this paper, we have adopted a hierarchical approach that combines classifiers created using supervised learning in order to identify whether a person is in the view-scope of the robot or not. Our approach makes use of vision, depth and thermal sensors mounted on top of a mobile platform.

A low complexity system based on multiple weighted decision trees for indoor localization

[EN] Indoor position estimation has become an attractive research topic due to growing interest in location-aware services. Nevertheless, satisfying solutions have not been found with the considerations of both accuracy and system complexity. From the perspective of lightweight mobile devices, they are extremely important characteristics, because both the processor power and energy availability are limited. Hence, an indoor localization system with high computational complexity can cause complete battery drain within a few hours. In our research, we use a data mining technique named boosting to develop a localization system based on multiple weighted decision trees to predict the device location, since it has high accuracy and low computational complexity.

Useful computer vision techniques for human-robot interaction

[ES]This paper describes some simple but useful computer vision techniques for human-robot interaction. First, an omnidirectional camera setting is described that can detect people in the surroundings of the robot, giving their angular positions and a rough estimate of the distance. The device can be easily built with inexpensive components. Second, we comment on a color-based face detection technique that can alleviate skin-color false positives. Third, a simple head nod and shake detector is described, suitable for detecting affirmative/negative, approval/dissaproval, understanding/disbelief head gestures.

Structure learning of graphical models for task-oriented robot grasping

In the collective imaginaries a robot is a human like machine as any androids in science fiction. However the type of robots that you will encounter most frequently are machinery that do work that is too dangerous, boring or onerous. Most of the robots in the world are of this type. They can be found in auto, medical, manufacturing and space industries. Therefore a robot is a system that contains sensors, control systems, manipulators, power supplies and software all working together to perform a task. The development and use of such a system is an active area of research and one of the main problems is the development of interaction skills with the surrounding environment, which include the ability to grasp objects. To perform this task the robot needs to sense the environment and acquire the object informations, physical attributes that may influence a grasp. Humans can solve this grasping problem easily due to their past experiences, that is why many researchers are approaching it from a machine learning perspective finding grasp of an object using information of already known objects. But humans can select the best grasp amongst a vast repertoire not only considering the physical attributes of the object to grasp but even to obtain a certain effect. This is why in our case the study in the area of robot manipulation is focused on grasping and integrating symbolic tasks with data gained through sensors. The learning model is based on Bayesian Network to encode the statistical dependencies between the data collected by the sensors and the symbolic task. This data representation has several advantages. It allows to take into account the uncertainty of the real world, allowing to deal with sensor noise, encodes notion of causality and provides an unified network for learning. Since the network is actually implemented and based on the human expert knowledge, it is very interesting to implement an automated method to learn the structure as in the future more tasks and object features can be introduced and a complex network design based only on human expert knowledge can become unreliable. Since structure learning algorithms presents some weaknesses, the goal of this thesis is to analyze real data used in the network modeled by the human expert, implement a feasible structure learning approach and compare the results with the network designed by the expert in order to possibly enhance it.

Expression and cellular localization of Copper transporter 2 (Ctr2) in Mus musculus

The Ctr family is an essential part of the copper homeostasis machinery and its members share sequence homology and structural and functional features. Higher eukaryotes express two members of this family Ctr1 and Ctr2. Numerous structural and functional studies are available for Ctr1, the only high affinity Cu(I) transporter thus far identified. Ctr1 holigotrimers mediate cellular copper uptake and this protein was demonstrated to be essential for embryonic development and to play a crucial role in dietary copper acquisition. Instead very little is known about Ctr2, it bears structural homology to the yeast vacuolar copper transporter, which mediates mobilization of vacuolar copper stores. Recent studies using over-expressed epitope-tagged forms of human Ctr2 suggested a function as a low affinity copper transporter that can mediate either copper uptake from the extracellular environment or mobilization of lysosomal copper stores. Using an antibody that recognizes endogenous mouse Ctr2, we studied the expression and localization of endogenous mouse Ctr2 in cell culture and in mouse models to understand its regulation and function in copper homeostasis. By immunoblot we observed a regulation of mCtr2 protein levels in a copper and Ctr1 dependent way. Our observations in cells and transgenic mice suggest that lack of Ctr1 induces a strong downregulation of Ctr2 probably by a post-translational mechanism. By indirect immunofluorescence we observed an exclusive intracellular localization in a perinuclear compartment and no co-localization with lysosomal markers. Immunofluorescence experiments in Ctr1 null cells, supported by sequence analysis, suggest that lysosomes may play a role in mCtr2 biology not as resident compartment, but as a degradation site. In appendix a LC-mass method for analysis of algal biotoxins belonging to the family of PsP (paralytic shellfish poisoning) is described.

Detection and localization of GLUTs in spermatozoa from different domestic species

Sperm cells need hexoses as a substrate for their function, for both the maintenance of membrane homeostasis and the movement of the tail. These cells have a peculiar metabolism that has not yet been fully understood, but it is clear that they obtain energy from hexoses through glycolisis and/or oxidative phosphorylation. Spermatozoa are in contact with different external environments, beginning from the testicular and epididymal fluid, passing to the seminal plasma and finally to the female genital tract fluids; in addition, with the spread of reproductive biotechnologies, sperm cells are diluted and stored in various media, containing different energetic substrates. To utilize these energetic sources, sperm cells, as other eukaryotic cells, have a well-constructed protein system, that is mainly represented by the GLUT family proteins. These transporters have a membrane-spanning α-helix structure and work as an enzymatic pump that permit a fast gradient dependent passage of sugar molecules through the lipidic bilayer of sperm membrane. Many GLUTs have been studied in man, bull and rat spermatozoa; the presence of some GLUTs has been also demonstrated in boar and dog spermatozoa. The aims of the present study were - to determine the presence of GLUTs 1, 2, 3, 4 and 5 in boar, horse, dog and donkey spermatozoa and to describe their localization; - to study eventual changes in GLUTs location after capacitation and acrosome reaction in boar, stallion and dog spermatozoa; - to determine possible changes in GLUTs localization after capacitation induced by insulin and IGF stimulation in boar spermatozoa; - to evaluate changes in GLUTs localization after flow-cytometric sex sorting in boar sperm cells. GLUTs 1, 2, 3 and 5 presence and localization have been demonstrated in boar, stallion, dog and donkey spermatozoa by western blotting and immunofluorescence analysis; a relocation in GLUTs after capacitation has been observed only in dog sperm cells, while no changes have been observed in the other species examined. As for boar, the stimulation of the capacitation with insulin and IGF didn’t cause any change in GLUTs localization, as well as for the flow cytometric sorting procedure. In conclusion, this study confirms the presence of GLUTs 1, 2 ,3 and 5 in boar, dog, stallion and donkey spermatozoa, while GLUT 4 seems to be absent, as a confirmation of other studies. Only in dog sperm cells capacitating conditions induce a change in GLUTs distribution, even if the physiological role of these changes should be deepened.

Cooperative Wireless Networks for Localization

This thesis adresses the problem of localization, and analyzes its crucial aspects, within the context of cooperative WSNs. The three main issues discussed in the following are: network synchronization, position estimate and tracking. Time synchronization is a fundamental requirement for every network. In this context, a new approach based on the estimation theory is proposed to evaluate the ultimate performance limit in network time synchronization. In particular the lower bound on the variance of the average synchronization error in a fully connected network is derived by taking into account the statistical characterization of the Message Delivering Time (MDT) . Sensor network localization algorithms estimate the locations of sensors with initially unknown location information by using knowledge of the absolute positions of a few sensors and inter-sensor measurements such as distance and bearing measurements. Concerning this issue, i.e. the position estimate problem, two main contributions are given. The first is a new Semidefinite Programming (SDP) framework to analyze and solve the problem of flip-ambiguity that afflicts range-based network localization algorithms with incomplete ranging information. The occurrence of flip-ambiguous nodes and errors due to flip ambiguity is studied, then with this information a new SDP formulation of the localization problem is built. Finally a flip-ambiguity-robust network localization algorithm is derived and its performance is studied by Monte-Carlo simulations. The second contribution in the field of position estimate is about multihop networks. A multihop network is a network with a low degree of connectivity, in which couples of given any nodes, in order to communicate, they have to rely on one or more intermediate nodes (hops). Two new distance-based source localization algorithms, highly robust to distance overestimates, typically present in multihop networks, are presented and studied. The last point of this thesis discuss a new low-complexity tracking algorithm, inspired by the Fano’s sequential decoding algorithm for the position tracking of a user in a WLAN-based indoor localization system.

Principi di funzionemento e architettura del robot chirurgico Da Vinci S e sue applicazioni in ambito otorinolaringoiatrico.

La tesi descrive il funzionamento del robot chirurgico Da Vinci S ed illustra la sua architettura. Si analizza poi il suo impiego in ambito otorinolaringoiatrico mostrando vantaggi e limiti di questa innovativa tecnologia.

On the Design of a Boolean-network Robot Swarm: Collective Recognition of Ground Patterns.

Uno dei principali ambiti di ricerca dell’intelligenza artificiale concerne la realizzazione di agenti (in particolare, robot) in grado di aiutare o sostituire l’uomo nell’esecuzione di determinate attività. A tal fine, è possibile procedere seguendo due diversi metodi di progettazione: la progettazione manuale e la progettazione automatica. Quest’ultima può essere preferita alla prima nei contesti in cui occorra tenere in considerazione requisiti quali flessibilità e adattamento, spesso essenziali per lo svolgimento di compiti non banali in contesti reali. La progettazione automatica prende in considerazione un modello col quale rappresentare il comportamento dell’agente e una tecnica di ricerca (oppure di apprendimento) che iterativamente modifica il modello al fine di renderlo il più adatto possibile al compito in esame. In questo lavoro, il modello utilizzato per la rappresentazione del comportamento del robot è una rete booleana (Boolean network o Kauffman network). La scelta di tale modello deriva dal fatto che possiede una semplice struttura che rende agevolmente studiabili le dinamiche tuttavia complesse che si manifestano al suo interno. Inoltre, la letteratura recente mostra che i modelli a rete, quali ad esempio le reti neuronali artificiali, si sono dimostrati efficaci nella programmazione di robot. La metodologia per l’evoluzione di tale modello riguarda l’uso di tecniche di ricerca meta-euristiche in grado di trovare buone soluzioni in tempi contenuti, nonostante i grandi spazi di ricerca. Lavori precedenti hanno gia dimostrato l’applicabilità e investigato la metodologia su un singolo robot. Lo scopo di questo lavoro è quello di fornire prova di principio relativa a un insieme di robot, aprendo nuove strade per la progettazione in swarm robotics. In questo scenario, semplici agenti autonomi, interagendo fra loro, portano all’emergere di un comportamento coordinato adempiendo a task impossibili per la singola unità. Questo lavoro fornisce utili ed interessanti opportunità anche per lo studio delle interazioni fra reti booleane. Infatti, ogni robot è controllato da una rete booleana che determina l’output in funzione della propria configurazione interna ma anche dagli input ricevuti dai robot vicini. In questo lavoro definiamo un task in cui lo swarm deve discriminare due diversi pattern sul pavimento dell’arena utilizzando solo informazioni scambiate localmente. Dopo una prima serie di esperimenti preliminari che hanno permesso di identificare i parametri e il migliore algoritmo di ricerca, abbiamo semplificato l’istanza del problema per meglio investigare i criteri che possono influire sulle prestazioni. E’ stata così identificata una particolare combinazione di informazione che, scambiata localmente fra robot, porta al miglioramento delle prestazioni. L’ipotesi è stata confermata applicando successivamente questo risultato ad un’istanza più difficile del problema. Il lavoro si conclude suggerendo nuovi strumenti per lo studio dei fenomeni emergenti in contesti in cui le reti booleane interagiscono fra loro.

Nonlinear Control Strategies for Cooperative Control of Multi-Robot Systems

This thesis deals with distributed control strategies for cooperative control of multi-robot systems. Specifically, distributed coordination strategies are presented for groups of mobile robots. The formation control problem is initially solved exploiting artificial potential fields. The purpose of the presented formation control algorithm is to drive a group of mobile robots to create a completely arbitrarily shaped formation. Robots are initially controlled to create a regular polygon formation. A bijective coordinate transformation is then exploited to extend the scope of this strategy, to obtain arbitrarily shaped formations. For this purpose, artificial potential fields are specifically designed, and robots are driven to follow their negative gradient. Artificial potential fields are then subsequently exploited to solve the coordinated path tracking problem, thus making the robots autonomously spread along predefined paths, and move along them in a coordinated way. Formation control problem is then solved exploiting a consensus based approach. Specifically, weighted graphs are used both to define the desired formation, and to implement collision avoidance. As expected for consensus based algorithms, this control strategy is experimentally shown to be robust to the presence of communication delays. The global connectivity maintenance issue is then considered. Specifically, an estimation procedure is introduced to allow each agent to compute its own estimate of the algebraic connectivity of the communication graph, in a distributed manner. This estimate is then exploited to develop a gradient based control strategy that ensures that the communication graph remains connected, as the system evolves. The proposed control strategy is developed initially for single-integrator kinematic agents, and is then extended to Lagrangian dynamical systems.