Formal Analysis of Artificial Collectives using Parametric Markov Models

There are many potential applications for the deployment of distributed systems composed of identical autonomous agents such as swarm robotic systems or wireless sensor networks, including remote monitoring, space exploration, or environmental clean up. Such systems need to be robust, and the loss of a small number of agents should not compromise the effectiveness of the system as they will often operate in hostile environments where individual members of that system may suffer failures, or communication may be hindered. To address this, these artificial systems are often designed to imitate the behaviour of self-organising systems found in nature, where simple reactive behaviours for individual members of a system can lead to complex global behaviours, and the collective remains robust to the loss of individuals. Despite much research being conducted into the development and evaluation of these systems, the industrial application of these technologies is still low. This issue could be addressed by further demonstrating that they can reliably, and predictably, achieve given objectives. Designing such systems is challenging, and often detailed simulations are developed for their analysis. Simulations give invaluable insight into the behaviour of such a system, however, there are often corner cases that might be overlooked. By developing a formal model of the system using some appropriate formalism, mathematical techniques can be applied during development to ensure that the system behaves correctly with respect to some given specification. These dynamic and inherently stochastic systems can be modelled as Markov processes; memoryless stochastic processes whose behaviour at any moment in time is determined solely by their current state. Model checking is an algorithmic technique to exhaustively check that a representation of a system as a Markov process exhibits some desirable property; furthermore, such an analysis can be extended to analyse systems whose parameters may not be known in an advance. However, the analysis of formal models of large systems is limited due to the resources that are required for their analysis: the size of the model may grow exponentially with the size of the system, and the subsequent analysis may prove to be impossible due to hardware or time constraints. This thesis investigates the suitability of parametric Markov models for the analysis of swarm robotic systems and wireless sensor networks. The analysis of such models is costly in terms of the size of the formal model representing a system, and the computation time required for its subsequent analysis. Modelling techniques and abstractions are developed for the construction of macroscopic models that abstract away from the identities of individual swarm robots or sensor nodes, and instead focus on the desirable global behaviours of such a system, resulting in smaller formal models. New techniques are then introduced to facilitate the analysis of large families of such models, where similarities between models who share some parameter values are exploited to speed up their analysis. In addition, new representations for such models are developed that allow for larger models to be analysed, and also significantly reduce the time required for that analysis

Probabilistic Model Checking of Robots Deployed in Extreme Environments

Robots are increasingly used to carry out critical missions in extreme environments that are hazardous for humans. This requires a high degree of operational autonomy under uncertain conditions, and poses new challenges for assuring the robot's safety and reliability. In this paper, we develop a framework for probabilistic model checking on a layered Markov model to verify the safety and reliability requirements of such robots, both at pre-mission stage and during runtime. Two novel estimators based on conservative Bayesian inference and imprecise probability model with sets of priors are introduced to learn the unknown transition parameters from operational data. We demonstrate our approach using data from a real-world deployment of unmanned underwater vehicles in extreme environments.Comment: Version accepted at the 33rd AAAI Conference on Artificial Intelligence, Honolulu, Hawaii, 201

Supervisory Control Theory for Controlling Swarm Robotics Systems

Swarm robotics systems have the potential to tackle many interesting problems. Their control software is mostly created by ad-hoc development. This makes it hard to deploy swarm robotics systems in real-world scenarios as it is difficult to analyse, maintain, or extend these systems. Formal methods can contribute to overcome these problems. However, they usually do not guarantee that the implementation matches the specification because the system’s control code is typically generated manually. This thesis studies the application of the supervisory control theory (SCT) framework in swarm robotics systems. SCT is widely applied and well established in the man- ufacturing context. It requires the system and the desired behaviours (specifications) to be defined as formal languages. In this thesis, regular languages are used. Regular languages, in the form of deterministic finite state automata, have already been widely applied for controlling swarm robotics systems, enabling a smooth transition from the ad-hoc development currently in practice. This thesis shows that the control code for swarm robotics systems can be automatically generated from formal specifications. Several case studies are presented that serve as guidance for those who want to learn how to specify swarm behaviours using SCT formally. The thesis provides the tools for the implementation of controllers using formal specifications. Controllers are validated on swarms of up to 600 physical robots through a series of systematic experiments. It is also shown that the same controllers can be automatically ported onto different robotics platforms, as long as they offer the required capabilities. The thesis extends and incorporates techniques to the supervisory control theory framework; specifically, the concepts of global events and the use of probabilistic generators. It can be seen as a step towards making formal methods a standard practice in swarm robotics

Formal analysis of communication protocols for wireless sensor systems

Sensor technology is an increasingly popular area of research due to the prevalent use of sensor devices. With the need for accurate, detailed data sensors are increasingly often used together in sensor networks. As the size of these sensor networks grows, so does the importance of efficient methods for their analysis for the prevention of system errors and discovery of design flaws. The increasing number of sensor devices leads to an exponential increase is the state space of the associated model. As such models of realistic systems are decreasingly often small enough for their verification to be feasible. Symmetry reduction techniques developed over the last 30 years, have been shown to be effective in reducing the state space explosion problem, particularly in the case of heterogeneous sensor systems, which contain many identical sensor devices. In this thesis we present our approach to verifying Ctrl-MAC, a novel wireless network protocol that supports bidirectional communication of multiple simultaneous physical properties. We explore the extent to which symmetry reduction can aid the model checking process for a sensor network communication protocol. We present our results, and suggest statistical approaches based on our observations of the protocol. We investigate the use of automated tools for the application of symmetry reduction, in particular GRIP, which is well suited for symmetry reduction of wireless sensor network systems. Models of communication protocols often require the use of synchronisation to model the interaction between devices. We present GRIP 3.0, a new version of the tool, which provides support for the use of synchronised transition statements. We provide results from practical work, coupled together with a discussion of drawbacks and future improvements

Evolutionary Robot Swarms Under Real-World Constraints

Tese de doutoramento em Engenharia Electrotécnica e de Computadores, na especialidade de Automação e Robótica, apresentada ao Departamento de Engenharia Electrotécnica e de Computadores da Faculdade de Ciências e Tecnologia da Universidade de CoimbraNas últimas décadas, vários cientistas e engenheiros têm vindo a estudar as estratégias provenientes da natureza. Dentro das arquiteturas biológicas, as sociedades que vivem em enxames revelam que agentes simplistas, tais como formigas ou pássaros, são capazes de realizar tarefas complexas usufruindo de mecanismos de cooperação. Estes sistemas abrangem todas as condições necessárias para a sobrevivência, incorporando comportamentos de cooperação, competição e adaptação. Na “batalha” sem fim em prol do progresso dos mecanismos artificiais desenvolvidos pelo homem, a ciência conseguiu simular o primeiro comportamento em enxame no final dos anos oitenta. Desde então, muitas outras áreas, entre as quais a robótica, beneficiaram de mecanismos de tolerância a falhas inerentes da inteligência coletiva de enxames. A área de investigação deste estudo incide na robótica de enxame, consistindo num domínio particular dos sistemas robóticos cooperativos que incorpora os mecanismos de inteligência coletiva de enxames na robótica. Mais especificamente, propõe-se uma solução completa de robótica de enxames a ser aplicada em contexto real. Nesta ótica, as operações de busca e salvamento foram consideradas como o caso de estudo principal devido ao nível de complexidade associado às mesmas. Tais operações ocorrem tipicamente em cenários dinâmicos de elevadas dimensões, com condições adversas que colocam em causa a aplicabilidade dos sistemas robóticos cooperativos. Este estudo centra-se nestes problemas, procurando novos desafios que não podem ser ultrapassados através da simples adaptação da literatura da especialidade em algoritmos de enxame, planeamento, controlo e técnicas de tomada de decisão. As contribuições deste trabalho sustentam-se em torno da extensão do método Particle Swarm Optimization (PSO) aplicado a sistemas robóticos cooperativos, denominado de Robotic Darwinian Particle Swarm Optimization (RDPSO). O RDPSO consiste numa arquitetura robótica de enxame distribuída que beneficia do particionamento dinâmico da população de robôs utilizando mecanismos evolucionários de exclusão social baseados na sobrevivência do mais forte de Darwin. No entanto, apesar de estar assente no caso de estudo do RDPSO, a aplicabilidade dos conceitos aqui propostos não se encontra restrita ao mesmo, visto que todos os algoritmos parametrizáveis de enxame de robôs podem beneficiar de uma abordagem idêntica. Os fundamentos em torno do RDPSO são introduzidos, focando-se na dinâmica dos robôs, nos constrangimentos introduzidos pelos obstáculos e pela comunicação, e nas suas propriedades evolucionárias. Considerando a colocação inicial dos robôs no ambiente como algo fundamental para aplicar sistemas de enxames em aplicações reais, é assim introduzida uma estratégia de colocação de robôs realista. Para tal, a população de robôs é dividida de forma hierárquica, em que são utilizadas plataformas mais robustas para colocar as plataformas de enxame no cenário de forma autónoma. Após a colocação dos robôs no cenário, é apresentada uma estratégia para permitir a criação e manutenção de uma rede de comunicação móvel ad hoc com tolerância a falhas. Esta estratégia não considera somente a distância entre robôs, mas também a qualidade do nível de sinal rádio frequência, redefinindo assim a sua aplicabilidade em cenários reais. Os aspetos anteriormente mencionados estão sujeitos a uma análise detalhada do sistema de comunicação inerente ao algoritmo, para atingir uma implementação mais escalável do RDPSO a cenários de elevada complexidade. Esta elevada complexidade inerente à dinâmica dos cenários motivaram a ultimar o desenvolvimento do RDPSO, integrando para o efeito um mecanismo adaptativo baseado em informação contextual (e.g., nível de atividade do grupo). Face a estas considerações, o presente estudo pode contribuir para expandir o estado-da-arte em robótica de enxame com algoritmos inovadores aplicados em contexto real. Neste sentido, todos os métodos propostos foram extensivamente validados e comparados com alternativas, tanto em simulação como com robôs reais. Para além disso, e dadas as limitações destes (e.g., número limitado de robôs, cenários de dimensões limitadas, constrangimentos reais limitados), este trabalho contribui ainda para um maior aprofundamento do estado-da-arte, onde se propõe um modelo macroscópico capaz de capturar a dinâmica inerente ao RDPSO e, até certo ponto, estimar analiticamente o desempenho coletivo dos robôs perante determinada tarefa. Em suma, esta investigação pode ter aplicabilidade prática ao colmatar a lacuna que se faz sentir no âmbito das estratégias de enxames de robôs em contexto real e, em particular, em cenários de busca e salvamento.Over the past decades, many scientists and engineers have been studying nature’s best and time-tested patterns and strategies. Within the existing biological architectures, swarm societies revealed that relatively unsophisticated agents with limited capabilities, such as ants or birds, were able to cooperatively accomplish complex tasks necessary for their survival. Those simplistic systems embrace all the conditions necessary to survive, thus embodying cooperative, competitive and adaptive behaviours. In the never-ending battle to advance artificial manmade mechanisms, computer scientists simulated the first swarm behaviour designed to mimic the flocking behaviour of birds in the late eighties. Ever since, many other fields, such as robotics, have benefited from the fault-tolerant mechanism inherent to swarm intelligence. The area of research presented in this Ph.D. Thesis focuses on swarm robotics, which is a particular domain of multi-robot systems (MRS) that embodies the mechanisms of swarm intelligence into robotics. More specifically, this Thesis proposes a complete swarm robotic solution that can be applied to real-world missions. Although the proposed methods do not depend on any particular application, search and rescue (SaR) operations were considered as the main case study due to their inherent level of complexity. Such operations often occur in highly dynamic and large scenarios, with harsh and faulty conditions, that pose several problems to MRS applicability. This Thesis focuses on these problems raising new challenges that cannot be handled appropriately by simple adaptation of state-of-the-art swarm algorithms, planning, control and decision-making techniques. The contributions of this Thesis revolve around an extension of the Particle Swarm Optimization (PSO) to MRS, denoted as Robotic Darwinian Particle Swarm Optimization (RDPSO). The RDPSO is a distributed swarm robotic architecture that benefits from the dynamical partitioning of the whole swarm of robots by means of an evolutionary social exclusion mechanism based on Darwin’s survival-of-the-fittest. Nevertheless, although currently applied solely to the RDPSO case study, the applicability of all concepts herein proposed is not restricted to it, since all parameterized swarm robotic algorithms may benefit from a similar approach The RDPSO is then proposed and used to devise the applicability of novel approaches. The fundamentals around the RDPSO are introduced by focusing on robots’ dynamics, obstacle avoidance, communication constraints and its evolutionary properties. Afterwards, taking the initial deployment of robots within the environment as a basis for applying swarm robotics systems into real-world applications, the development of a realistic deployment strategy is proposed. For that end, the population of robots is hierarchically divided, wherein larger support platforms autonomously deploy smaller exploring platforms in the scenario, while considering communication constraints and obstacles. After the deployment, a way of ensuring a fault-tolerant multi-hop mobile ad hoc communication network (MANET) is introduced to explicitly exchange information needed in a collaborative realworld task execution. Such strategy not only considers the maximum communication range between robots, but also the minimum signal quality, thus refining the applicability to real-world context. This is naturally followed by a deep analysis of the RDPSO communication system, describing the dynamics of the communication data packet structure shared between teammates. Such procedure is a first step to achieving a more scalable implementation by optimizing the communication procedure between robots. The highly dynamic characteristics of real-world applications motivated us to ultimate the RDPSO development with an adaptive strategy based on a set of context-based evaluation metrics. This thesis contributes to the state-of-the-art in swarm robotics with novel algorithms for realworld applications. All of the proposed approaches have been extensively validated in benchmarking tasks, in simulation, and with real robots. On top of that, and due to the limitations inherent to those (e.g., number of robots, scenario dimensions, real-world constraints), this Thesis further contributes to the state-of-the-art by proposing a macroscopic model able to capture the RDPSO dynamics and, to some extent, analytically estimate the collective performance of robots under a certain task. It is the author’s expectation that this Ph.D. Thesis may shed some light into bridging the reality gap inherent to the applicability of swarm strategies to real-world scenarios, and in particular to SaR operations.FCT - SFRH/BD /73382/201

A complex systems approach to education in Switzerland

The insights gained from the study of complex systems in biological, social, and engineered systems enables us not only to observe and understand, but also to actively design systems which will be capable of successfully coping with complex and dynamically changing situations. The methods and mindset required for this approach have been applied to educational systems with their diverse levels of scale and complexity. Based on the general case made by Yaneer Bar-Yam, this paper applies the complex systems approach to the educational system in Switzerland. It confirms that the complex systems approach is valid. Indeed, many recommendations made for the general case have already been implemented in the Swiss education system. To address existing problems and difficulties, further steps are recommended. This paper contributes to the further establishment complex systems approach by shedding light on an area which concerns us all, which is a frequent topic of discussion and dispute among politicians and the public, where billions of dollars have been spent without achieving the desired results, and where it is difficult to directly derive consequences from actions taken. The analysis of the education system's different levels, their complexity and scale will clarify how such a dynamic system should be approached, and how it can be guided towards the desired performance

Journal of Telecommunications and Information Technology

kwartalni