Modelling variable communication signal strength for experiments with multi-robot teams

Reliable communication is a critical factor for ensuring robust performance of multi-robot teams. A selection of results are presented here comparing the impact of poor network quality on team performance under several conditions. Two different processes for emulating degraded network signal strength are compared in a physical environment: modelled signal degradation (MSD), approximated according to increasing distance from a connected network node (ie robot), versus effective signal degradation (ESD). The results of both signal strength processes exhibit similar trends, demonstrating that ESD in a physical environment can be modelled relatively well using MSD

Hardware-in-the-Loop Simulation for Evaluating Communication Impacts on the Wireless-Network-Controlled Robots

More and more robot automation applications have changed to wireless communication, and network performance has a growing impact on robotic systems. This study proposes a hardware-in-the-loop (HiL) simulation methodology for connecting the simulated robot platform to real network devices. This project seeks to provide robotic engineers and researchers with the capability to experiment without heavily modifying the original controller and get more realistic test results that correlate with actual network conditions. We deployed this HiL simulation system in two common cases for wireless-network-controlled robotic applications: (1) safe multi-robot coordination for mobile robots, and (2) human-motion-based teleoperation for manipulators. The HiL simulation system is deployed and tested under various network conditions in all circumstances. The experiment results are analyzed and compared with the previous simulation methods, demonstrating that the proposed HiL simulation methodology can identify a more reliable communication impact on robot systems.Comment: 6 pages, 11 figures, to appear in 48th Annual Conference of the Industrial Electronics Society IECON 2022 Conferenc

Priority-Based Distributed Coordination for Heterogeneous Multi-Robot Systems with Realistic Assumptions

A standing challenge in current intralogistics is to reliably, effectively, yet safely coordinate large-scale, heterogeneous multi-robot fleets without posing constraints on the infrastructure or unrealistic assumptions on robots. A centralized approach, proposed by some of the authors in prior work, allows to overcome these limitations with medium-scale fleets (i.e., tens of robots). With the aim of scaling to hundreds of robots, in this article we explore a decentralized variant of the same approach. The proposed framework maintains the key features of the original approach, namely, ensuring safety despite uncertainties on robot motions, and generality with respect to robot platforms, motion planners and controllers. We include considerations on liveness and report solutions to prevent or recover from deadlocks in specific situations. We validate the approach empirically in simulation with large, heterogeneous multi-robot fleets (with up to 100 robots) operating in both benchmark and realistic environments

Fleet Management System for an Industry Environment

The article deals with the management of a fleet of AMR robots that perform logistics in production. The entire system design is implemented in the ROS environment - state of the art for the development in robotics. Four already available solutions for fleet management in ROSe are analyzed in detail in the article. These solutions fail when there is a need to change the route plan in a dynamically changing environment. Likewise, some did not sufficiently synchronize the movement of the robots and collisions occurred or, with a larger number of robots, represented an enormous computational load. Our solution was designed to be as simple and reliable as possible for industrial use. It is based on a combination of semi-autonomous and centralized approach. A hybrid map is used for planning the movement of the robot fleet, which provides the advantages of both a metric and a topological map. This route map for a fleet of robots can be easily drawn in readily available CAD software. Synchronization of robots was designed on the principle of semaphore or mutex, which enabled the use of bidirectional paths. The results are verified in simulations and were aimed at verifying the proposed robot synchronization. It was confirmed that the proposed synchronization slows down the robots, but there were no collision situations. By separating route planning from synchronization, we simplified the entire fleet management process and thus created a very efficient system for network and hardware resources. In addition, the system is easily expandable

Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

This paper concerns the coordination and the traffic management of a group of Automated Guided Vehicles (AGVs) moving in a real industrial scenario, such as an automated factory or warehouse. The proposed methodology is based on a three-layer control architecture, which is described as follows: 1) the Top Layer (or Topological Layer) allows to model the traffic of vehicles among the different areas of the environment; 2) the Middle Layer allows the path planner to compute a traffic sensitive path for each vehicle; 3) the Bottom Layer (or Roadmap Layer) defines the final routes to be followed by each vehicle and coordinates the AGVs over time. In the paper we describe the coordination strategy we propose, which is executed once the routes are computed and has the aim to prevent congestions, collisions and deadlocks. The coordination algorithm exploits a novel deadlock prevention approach based on time-expanded graphs. Moreover, the presented control architecture aims at grounding theoretical methods to an industrial application by facing the typical practical issues such as graphs difficulties (load/unload locations, weak connections,), a predefined roadmap (constrained by the plant layout), vehicles errors, dynamical obstacles, etc. In this paper we propose a flexible and robust methodology for multi-AGVs traffic-aware management. Moreover, we propose a coordination algorithm, which does not rely on ad hoc assumptions or rules, to prevent collisions and deadlocks and to deal with delays or vehicle motion errors. Note to Practitioners-This paper concerns the coordination and the traffic management of a group of Automated Guided Vehicles (AGVs) moving in a real industrial scenario, such as an automated factory or warehouse. The proposed methodology is based on a three-layer control architecture, which is described as follows: 1) the Top Layer (or Topological Layer) allows to model the traffic of vehicles among the different areas of the environment; 2) the Middle Layer allows the path planner to compute a traffic sensitive path for each vehicle; 3) the Bottom Layer (or Roadmap Layer) defines the final routes to be followed by each vehicle and coordinates the AGVs over time. In the paper we describe the coordination strategy we propose, which is executed once the routes are computed and has the aim to prevent congestions, collisions and deadlocks. The coordination algorithm exploits a novel deadlock prevention approach based on time-expanded graphs. Moreover, the presented control architecture aims at grounding theoretical methods to an industrial application by facing the typical practical issues such as graphs difficulties (load/unload locations, weak connections, ), a predefined roadmap (constrained by the plant layout), vehicles errors, dynamical obstacles, etc. In this paper we propose a flexible and robust methodology for multi-AGVs traffic-aware management. Moreover, we propose a coordination algorithm, which does not rely on ad hoc assumptions or rules, to prevent collisions and deadlocks and to deal with delays or vehicle motion errors

Provably Safe Multi-Robot Coordination with Unreliable Communication

Coordination is a core problem in multi-robot systems, since it is a key to ensure safety and efficiency. Both centralized and decentralized solutions have been proposed, however, most assume perfect communication. This letter proposes a centralized method that removes this assumption, and is suitable for fleets of robots driven by generic second-order dynamics. We formally prove that: first, safety is guaranteed if communication errors are limited to delays; and second, the probability of unsafety is bounded by a function of the channel model in networks with packet loss. The approach exploits knowledge of the network's non-idealities to ensure the best possible performance of the fleet. The method is validated via several experiments with simulated robots