Coordinated Control of Robotic Swarms in Unknown Environments

This thesis gathers the work carried out by the author in the last three years of research and it concerns the study and implementation of algorithms to coordinate and control a swarm of mobile robots moving in unknown environments. In particular, the author's attention is focused on two different approaches in order to solve two different problems. The first algorithm considered in this work deals with the possibility of decomposing a main complex task in many simple subtasks by exploiting the decentralized implementation of the so called \emph{Null Space Behavioral} paradigm. This approach to the problem of merging different subtasks with assigned priority is slightly modified in order to handle critical situations that can be detected when robots are moving through an unknown environment. In fact, issues can occur when one or more robots got stuck in local minima: a smart strategy to avoid deadlock situations is provided by the author and the algorithm is validated by simulative analysis. The second problem deals with the use of concepts borrowed from \emph{graph theory} to control a group differential wheel robots by exploiting the Laplacian solution of the consensus problem. Constraints on the swarm communication topology have been introduced by the use of a range and bearing platform developed at the Distributed Intelligent Systems and Algorithms Laboratory (DISAL), EPFL (Lausanne, CH) where part of author's work has been carried out. The control algorithm is validated by demonstration and simulation analysis and, later, is performed by a team of four robots engaged in a formation mission. To conclude, the capabilities of the algorithm based on the local solution of the consensus problem for differential wheel robots are demonstrated with an application scenario, where nine robots are engaged in a hunting task.

Learning Methods and Algorithms for Semantic Text Classification across Multiple Domains

Information is nowadays a key resource: machine learning and data mining techniques have been developed to extract high-level information from great amounts of data. As most data comes in form of unstructured text in natural languages, research on text mining is currently very active and dealing with practical problems. Among these, text categorization deals with the automatic organization of large quantities of documents in priorly defined taxonomies of topic categories, possibly arranged in large hierarchies. In commonly proposed machine learning approaches, classifiers are automatically trained from pre-labeled documents: they can perform very accurate classification, but often require a consistent training set and notable computational effort. Methods for cross-domain text categorization have been proposed, allowing to leverage a set of labeled documents of one domain to classify those of another one. Most methods use advanced statistical techniques, usually involving tuning of parameters. A first contribution presented here is a method based on nearest centroid classification, where profiles of categories are generated from the known domain and then iteratively adapted to the unknown one. Despite being conceptually simple and having easily tuned parameters, this method achieves state-of-the-art accuracy in most benchmark datasets with fast running times. A second, deeper contribution involves the design of a domain-independent model to distinguish the degree and type of relatedness between arbitrary documents and topics, inferred from the different types of semantic relationships between respective representative words, identified by specific search algorithms. The application of this model is tested on both flat and hierarchical text categorization, where it potentially allows the efficient addition of new categories during classification. Results show that classification accuracy still requires improvements, but models generated from one domain are shown to be effectively able to be reused in a different one.

Unveiling the unknown of cool stars with high-resolution spectroscopy

Cool giant and supergiant stars are among the brightest populations in any stellar system and they are easily observable out to large distances, especially at infrared wavelengths. These stars also dominate the integrated light of star clusters in a wide range of ages, making them powerful tracers of stellar populations in more distant galaxies. High-resolution near-IR spectroscopy is a key tool for quantitatively investigating their kinematic, evolutionary and chemical properties. However, the systematic exploration and calibration of the NIR spectral diagnostics to study these cool stellar populations based on high-resolution spectroscopy is still in its pioneering stage. Any effort to make progress in the field is innovative and of impact on stellar archaeology and stellar evolution. This PhD project takes the challenge of exploring that new parameter space and characterizing the physical properties, the chemical content and the kinematics of cool giants and supergiants in selected disc fields and clusters of our Galaxy, with the ultimate goal of tracing their past and recent star formation and chemical enrichment history. By using optical HARPS-N and near-infrared GIANO-B high-resolution stellar spectra in the context of the large program SPA-Stellar Population Astrophysics: the detailed, age-resolved chemistry of the Milky Way disk” (PI L. Origlia), an extensive study of Arcturus, a standard calibrator for red giant stars, has been performed. New diagnostics of stellar parameters as well as optimal linelists for chemical analysis have been provided. Then, such diagnostics have been used to determine evolutionary properties, detailed chemical abundances of almost 30 different elements and mixing processes of a homogeneous sample of red supergiant stars in the Perseus complex.

Cancers of unknown primary site (CUPs) as a model of metastatic process.

Cancers of unknown primary site (CUPs) are a rare group of metastatic tumours, with a frequency of 3-5%, with an overall survival of 6-10 month. The identification of tumour primary site is usually reached by a combination of diagnostic investigations and immunohistochemical testing of the tumour tissue. In CUP patients, these investigations are inconclusive. Since international guidelines for treatment are based on primary site indication, CUP treatment requires a blind approach. As a consequence, CUPs are usually empiric treated with poorly effective. In this study, we applied a set of microRNAs using EvaGreen-based Droplet Digital PCR in a retrospective and prospective collection of formalin-fixed paraffin-embedded tissue samples. We assessed miRNA expression of 155 samples including primary tumours (N=94), metastases of known origin (N=10) and metastases of unknown origin (N=50). Then, we applied the shrunken centroids predictive algorithm to obtain the CUP’s site(s)-of-origin. The molecular test was successfully applied to all CUP samples and provided a site-of-origin identification for all samples, potentially within a one-week time frame from sample inclusion. In the second part of the study we derived two CUP cell lines, and corresponding patient-derived xenografts (PDXs). CUP cell lines and PDXs underwent histological, molecular, and genomic characterization confirming the features of the original tumour. Tissues-of-origin prediction was obtained from the tumour microRNA expression profile and confirmed by single cell RNA sequencing. Genomic testing analysis identified FGFR2 amplification in both models. Drug-screening assays were performed to test the activity of FGFR2-targeting drug and the combination treatment with the MEK inhibitor trametinib, which proved to be synergic and exceptionally active, both in vitro and in vivo. In conclusion, our study demonstrated that miRNA expression profiling could be employed as diagnostic test. Then we successfully derived two CUP models from patients, used for therapy tests, bringing personalized therapy closer to CUP patients.