Resilience by Reconfiguration: Exploiting Heterogeneity in Robot Teams
Title | Resilience by Reconfiguration: Exploiting Heterogeneity in Robot Teams |
Publication Type | Conference Paper |
Year of Publication | 2019 |
Authors | Ramachandran, Ragesh K., Preiss, James A., Sukhatme, Gaurav S. |
Conference Name | 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) |
Date Published | Nov. 2019 |
Publisher | IEEE |
ISBN Number | 978-1-7281-4004-9 |
Keywords | active inter-robot communication links, communication graph, communication topology, Computing Theory, graph theory, helicopters, integer programming, inter-robot distances, Linear programming, maximal resource distribution, mixed integer semi-definite programming, mobile robots, motion planning, multi-robot systems, networked heterogeneous multirobot system, path planning, pubcrawl, quadrotors, resilience, Resiliency, resource failure, simulated annealing, simulated annealing method |
Abstract | We propose a method to maintain high resource availability in a networked heterogeneous multi-robot system subject to resource failures. In our model, resources such as sensing and computation are available on robots. The robots are engaged in a joint task using these pooled resources. When a resource on a particular robot becomes unavailable (e.g., a sensor ceases to function), the system automatically reconfigures so that the robot continues to have access to this resource by communicating with other robots. Specifically, we consider the problem of selecting edges to be modified in the system's communication graph after a resource failure has occurred. We define a metric that allows us to characterize the quality of the resource distribution in the network represented by the communication graph. Upon a resource becoming unavailable due to failure, we reconFigure the network so that the resource distribution is brought as close to the maximal resource distribution as possible without a large change in the number of active inter-robot communication links. Our approach uses mixed integer semi-definite programming to achieve this goal. We employ a simulated annealing method to compute a spatial formation that satisfies the inter-robot distances imposed by the topology, along with other constraints. Our method can compute a communication topology, spatial formation, and formation change motion planning in a few seconds. We validate our method in simulation and real-robot experiments with a team of seven quadrotors. |
URL | https://ieeexplore.ieee.org/document/8968611 |
DOI | 10.1109/IROS40897.2019.8968611 |
Citation Key | ramachandran_resilience_2019 |
- mobile robots
- simulated annealing method
- simulated annealing
- resource failure
- Resiliency
- resilience
- quadrotors
- pubcrawl
- Path Planning
- networked heterogeneous multirobot system
- multi-robot systems
- motion planning
- active inter-robot communication links
- mixed integer semi-definite programming
- maximal resource distribution
- Linear programming
- inter-robot distances
- integer programming
- helicopters
- graph theory
- Computing Theory
- communication topology
- communication graph