PADS: Practical Attestation for Highly Dynamic Swarm Topologies

Remote attestation protocols are widely used to detect device configuration (e.g., software and/or data) compromise in Internet of Things (IoT) scenarios. Unfortunately, the performances of such protocols are unsatisfactory when dealing with thousands of smart devices. Recently, researchers are focusing on addressing this limitation. The approach is to run attestation in a collective way, with the goal of reducing computation and communication. Despite these advances, current solutions for attestation are still unsatisfactory because of their complex management and strict assumptions concerning the topology (e.g., being time invariant or maintaining a fixed topology). In this paper, we propose PADS, a secure, efficient, and practical protocol for attesting potentially large networks of smart devices with unstructured or dynamic topologies. PADS builds upon the recent concept of non-interactive attestation, by reducing the collective attestation problem into a minimum consensus one. We compare PADS with a state-of-the art collective attestation protocol and validate it by using realistic simulations that show practicality and efficiency. The results confirm the suitability of PADS for low-end devices, and highly unstructured networks.Comment: Submitted to ESORICS 201

A Survey on Aerial Swarm Robotics

The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas

Multi-Robot Coalition Formation for Distributed Area Coverage

The problem of distributed area coverage using multiple mobile robots is an important problem in distributed multi-robot sytems. Multi-robot coverage is encountered in many real world applications, including unmanned search & rescue, aerial reconnaissance, robotic demining, inspection of engineering structures, and automatic lawn mowing. To achieve optimal coverage, robots should move in an efficient manner and reduce repeated coverage of the same region that optimizes a certain performance metric such as the amount of time or energy expended by the robots. This dissertation especially focuses on using mini-robots with limited capabilities, such as low speed of the CPU and limited storage of the memory, to fulfill the efficient area coverage task. Previous research on distributed area coverage use offline or online path planning algorithms to address this problem. Some of the existing approaches use behavior-based algorithms where each robot implements simple rules and the interaction between robots manifests in the global objective of overall coverage of the environment. Our work extends this line of research using an emergent, swarming based technique where robots use partial coverage histories from themselves as well as other robots in their vicinity to make local decisions that attempt to ensure overall efficient area coverage. We have then extended this technique in two directions. First, we have integreated the individual-robot, swarming-based technique for area coverage to teams of robots that move in formation to perform area coverage more efficiently than robots that move individually. Then we have used a team formation technique from coalition game theory, called Weighted Voting Game (WVG) to handle situations where a team moving in formation while performing area coverage has to dynamically reconfigure into sub-teams or merge with other teams, to continue the area coverage efficiently. We have validated our techniques by testing them on accurate models of e-puck robots in the Webots robot simulation platform, as well as on physical e-puck robots

Cooperative Network Formation between Swarm Robots

Swarm robot technology could be used in future daily applications. It does not require a lot of manpower once it is deployed into the field compared to doing large scale tasks manually done by humans. However, the downside of using swarm robots is that when the number of agents grow the communication between the swarms will also gradually get more complicated. Besides that, when moving large number of agents in a swarm towards completing a specific task together will also be a challenge due to the monitoring of each swarm agent’s location. Lastly, the swarms should be able to reestablish their location with the large swarms if it ever gets lost from the pack. In order to overcome these problems, engineers have been exploring various ways of making robots work together and communicate with each other with different methods and tools. For this project, it will focus more on the type of wireless communication used, ranging from short range Bluetooth to long range Wi-Fi. With the wireless communication established, the swarms should be able to perform multi-hop communication with each agents through different network topologies. Finally, the swarm robots requires a cooperative algorithm in order for it to adapt to various situation in the different environments. When each agent is deployed into outdoor environments, it will have to adapt to the surroundings while maintaining a certain predetermined flight formation and constant communication with each agent and the base station

Using haptic feedback in human swarm interaction

A swarm of robots is a large group of individual agents that autonomously coordinate via local control laws. Their emergent behavior allows simple robots to accomplish complex tasks. Since missions may have complex objectives that change dynamically due to environmental and mission changes, human control and influence over the swarm is needed. The field of Human Swarm Interaction (HSI) is young, with few user studies, and even fewer papers focusing on giving non-visual feedback to the operator. The authors will herein present a background of haptics in robotics and swarms and two studies that explore various conditions under which haptic feedback may be useful in HSI. The overall goal of the studies is to explore the effectiveness of haptic feedback in the presence of other visual stimuli about the swarm system. The findings show that giving feedback about nearby obstacles using a haptic device can improve performance, and that a combination of feedback from obstacle forces via the visual and haptic channels provide the best performance

Trust Repair in Human-Swarm Teams+

Swarm robots are coordinated via simple control laws to generate emergent behaviors such as flocking, rendezvous, and deployment. Human-swarm teaming has been widely proposed for scenarios, such as human-supervised teams of unmanned aerial vehicles (UAV) for disaster rescue, UAV and ground vehicle cooperation for building security, and soldier-UAV teaming in combat. Effective cooperation requires an appropriate level of trust, between a human and a swarm. When an UAV swarm is deployed in a real-world environment, its performance is subject to real-world factors, such as system reliability and wind disturbances. Degraded performance of a robot can cause undesired swarm behaviors, decreasing human trust. This loss of trust, in turn, can trigger human intervention in UAVs' task executions, decreasing cooperation effectiveness if inappropriate. Therefore, to promote effective cooperation we propose and test a trust-repairing method (Trust-repair) restoring performance and human trust in the swarm to an appropriate level by correcting undesired swarm behaviors. Faulty swarms caused by both external and internal factors were simulated to evaluate the performance of the Trust-repair algorithm in repairing swarm performance and restoring human trust. Results show that Trust-repair is effective in restoring trust to a level intermediate between normal and faulty conditions

Data-Driven Architecture to Increase Resilience In Multi-Agent Coordinated Missions

The rise in the use of Multi-Agent Systems (MASs) in unpredictable and changing environments has created the need for intelligent algorithms to increase their autonomy, safety and performance in the event of disturbances and threats. MASs are attractive for their flexibility, which also makes them prone to threats that may result from hardware failures (actuators, sensors, onboard computer, power source) and operational abnormal conditions (weather, GPS denied location, cyber-attacks). This dissertation presents research on a bio-inspired approach for resilience augmentation in MASs in the presence of disturbances and threats such as communication link and stealthy zero-dynamics attacks. An adaptive bio-inspired architecture is developed for distributed consensus algorithms to increase fault-tolerance in a network of multiple high-order nonlinear systems under directed fixed topologies. In similarity with the natural organisms’ ability to recognize and remember specific pathogens to generate its immunity, the immunity-based architecture consists of a Distributed Model-Reference Adaptive Control (DMRAC) with an Artificial Immune System (AIS) adaptation law integrated within a consensus protocol. Feedback linearization is used to modify the high-order nonlinear model into four decoupled linear subsystems. A stability proof of the adaptation law is conducted using Lyapunov methods and Jordan decomposition. The DMRAC is proven to be stable in the presence of external time-varying bounded disturbances and the tracking error trajectories are shown to be bounded. The effectiveness of the proposed architecture is examined through numerical simulations. The proposed controller successfully ensures that consensus is achieved among all agents while the adaptive law v simultaneously rejects the disturbances in the agent and its neighbors. The architecture also includes a health management system to detect faulty agents within the global network. Further numerical simulations successfully test and show that the Global Health Monitoring (GHM) does effectively detect faults within the network