For more than the past decade, there has been significant growing interest in multi-robot systems (MRSs), which use a team of cooperating robots to accomplish tasks collaboratively. This enables multi-robot systems to complete tasks that cannot be completed by a single robot or would be less efficient or effective to complete with a single robot . Multi-robot systems may be characterized along multiple dimensions  including but not limited to the mechanism for coordination among robots (e.g. communication vs. sensing only), centrality of coordination (e.g. centralized vs. decentralized), the extent of information available to team members (e.g. local information vs. global information), sophistication of the control logic executed by robots (e.g. reactive vs. deliberative collaboration), the structure of information propagation within the robotic network (e.g. neighbor-only connectivity vs. all-to-all communication), homogeneity or heterogeneity of the team members.
Algorithms for multi-robot coordination considered in the extant literature [3, 4] make different combinations of assumptions along these dimensions about the underlying multi-robot system to which they are applied. Conversely, the extensive behavior of the multi-robot system is dictated by the properties of the algorithm it uses for internal coordination. Now we consider a particular type of multi-robot system known as a robotic swarm. Robotic swarms are characterized by homogeneous robots executing a simple reactive control law using only local information from proximal swarm members and the environment within a limited spatial neighborhood. The collective behavior (e.g. flocking, rendezvous, dispersion) of the swarm emerges as a result of all swarm members executing the same local control law and no individual swarm member ever necessarily becomes aware of the whole swarm. Swarm behaviors are often not goal-directed but may be combined through behavior composition to accomplish tasks for which no individual behavior was designed [5, 6]. Conventional wisdom in the literature has been that the simplicity of the local control laws executed by swarm members and the locality of the information required for their execution makes robotic swarms more scalable and robust than other types of multi-robot systems because members may be inserted and deleted with minimal system reconfiguration .
In this paper, we compare the performance of algorithms designed specifically for robotic swarms (i.e. systems whose members have access to local information, neighbor-only sensing and simple reactive control laws) to those designed for general multi-robot systems (i.e. systems whose members may have access to global information, all-to-all communication and sophisticated deliberative collaboration). Since all decentralized algorithms can equivalently be implemented in a centralized system, to make the comparison useful, in both cases, we assume coordination is decentralized. Algorithms have been developed for several multi-robot applications  including navigation [7, 8], static area coverage , dynamic area coverage [10, 11, 12, 13], patrolling  and many more. However, in this paper, we limit our comparison to representative algorithms in two application domains: (a) navigation and (b) dynamic area coverage.
Our objective in performing this comparison is to identify and highlight the strengths and weaknesses of swarm and general multi-robot algorithms in a manner that can inform offline design decisions made by engineers or online operational decisions made by supervisory operators of multi-robot systems. For example, for a given application domain, an engineer may decide a simple robotic swarm will suffice without the additional cost and complexity of a general multi-robot system. Conversely, given a multi-robot system, there may be situations where it is beneficial (e.g. reduced coordination complexity) for a supervisory operator to apply an algorithm designed for robotic swarms rather than incur the communication overhead of a general multi-robot coordination algorithm. Other examples exist and it is our hope that the results in this paper can inform such decisions.
We make the following contributions: (a) an empirical evaluation of the performance of representative swarm and general multi-robot algorithms within two different application domains (navigation and dynamic coverage), (b) a comparative analysis of these algorithms based on the theory of information invariants, which provides a theoretical characterization supported by our empirical results.
Ii Swarm and Multi-Robot Algorithm Selection
Ii-a Algorithm Description and Implementation
As shown in Table I, five representative algorithms were implemented to study the relative performance of swarm and decentralized multi-robot algorithms. The algorithms were then analyzed in terms of their information invariants  and their empirical performance was compared with respect to multiple metrics.
|Navigation||Potential Fields ||DMA-RRT |
|Proportional Barrier Certificates [17, 18]|
|Dynamic Area Coverage||Individual Dynamic Coverage ||Group Dynamic Coverage |
Ii-A1 Potential Fields (PF)
This algorithm, as described in , is a gradient-based navigation approach with guaranteed goal convergence. In implementation, the algorithm exhibited numerical issues involving the magnitude of the gradient, discussed in the results section. Characteristics of this algorithm relevant to our comparison: a) no explicit communication between robots (sensing-only swarm algorithm), b) robots initially configured as a connected graph will converge to the goal as a connected graph, c) robots follow the gradient of a potential function with a global minima at the goal while avoiding obstacles and other robots.
Ii-A2 Proportional Barrier Certificates (PBC)
PBC uses a proportional controller in conjunction with a barrier certificates reactive controller as described in [17, 18]. The algorithm uses a quadratic programming approach enabling obstacle avoidance while following the original goal trajectory (proportional controller output). The barrier certificates algorithm guarantees forward invariance of the safe set, implying that inter-robot collision avoidance is guaranteed. Characteristics of this algorithm relevant to our comparison: a) no explicit communication between robots (sensing-only swarm algorithm), b) robots take action to avoid collisions only when sufficiently close (sense the proximity), c) robots follow a proportional controller, creating a straight line path to the goal when there are no obstacles.
The DMA-RRT algorithm outlined in  embeds a closed-loop RRT  in each robot and introduces a merit-based token passing coordination mechanism. Agents with the largest incentive to replan will acquire the token and broadcast their updated plan to all other agents. Other agents then forward simulate this time parameterized trajectory and update their own constraints. Our implementation uses a holonomic model with a proportional controller (PC) for waypoint navigation. It is important to note that we are using the original DMA-RRT algorithm and not the cooperative extension involving emergency stops . Characteristics of this algorithm relevant to our comparison: a) explicit communication between the robots which is bounded above by a set of waypoints, where is the size of the created path, b) communication occurs through a token passing strategy, where only one robot gets to alter its plan at any given time, c) obstacle and inter-robot avoidance is done implicitly through the robots’ creation of non-intersecting paths.
Ii-A4 Individual Dynamic Coverage (IDC)
The dynamic area coverage problem tackled in this work is not to be confused with the static area coverage (e.g. ) problem, where robots move to maximize coverage of map in the final positions to which they converge. Instead, it involves generating robot motion to maximize the coverage (sensed areas) of an entire map by multiple robots over the entire mission time horizon. Dynamic area coverage problems have been tackled by various stigmergic and frontier-based dynamic coverage algorithms such as [21, 22]. The IDC algorithm is a gradient-based dynamic coverage method outlined in . The coverage error is guaranteed to be non-increasing but susceptible to local minima. Perturbations from local minima, in the computational space, involve the selection of a new point (according to a predefined rule) upon which to resume gradient descent. In the real world, this corresponds to an individual robot discontinuing the application of the gradient-based control law, physically moving to a new location and then resuming the application of the gradient-based control law. All robots are perturbed individually and the rule for new position selection was not specified. The algorithm was implemented in a decentralized way by replacing the centralized goal point ordering with an emergency timer as used in the provided implementation of . Characteristics of this algorithm relevant to our comparison are: a) no explicit inter-robot communication (sensing-only swarm algorithm), b) robots follow a gradient descent procedure towards unexplored areas, c) agents get stuck in local minima, d) agents exit local minima independent of other agents, e) each individual grid cell in the map has a limited amount of information that can be exhausted after repeated visits by robots.
Ii-A5 Group Dynamic Coverage (GDC)
This decentralized algorithm involves the multi-robot gradient based dynamic coverage strategy outlined in 
. The algorithm is similar to Perturbation Dynamic Coverage, but in the real world agents are now perturbed all at the same time once a global condition is met (all robots begin to slow down sufficiently) and a leader agent selects a new rendezvous point towards which the entire group moves. Once the multi-robot group is within a certain radius of the newly selected point, all robots shift into dynamic coverage mode and the state machine is reset. In the computational space, this corresponds to all agents reaching an overall local minima, and them all being perturbed by relocating themselves to the same region of the workspace, resuming the gradient descent from there. The main difference between the IDC algorithm and the GDC algorithm is that the latter perturbs all robots at the same time and to the same new point, once the change in coverage of the map descends below a threshold. This method involves the communication of a new swarming point from the leader to every other agent in the group, which in the real world could be accomplished by wireless communication (for example). Characteristics of this algorithm relevant to our comparison are: a) explicit inter-robot communication, b) robots follow a gradient descent vector towards unexplored areas, c) agents are susceptible to local minima, d) agents exit local minimadependent on the new perturbation point that the leader agent selects, e) each individual grid cell in the map has a limited amount of information that can be exhausted after repeated visits by robots.
Iii Experimental Evaluation
Iii-a Reproduction of Results and Scaling
Algorithms were implemented in Python and later integrated into the CMUSWARM Framework . We first reproduced the results in the corresponding papers. For each algorithm, the number of robots were scaled for preliminary qualitative testing beyond the experiments in the original papers. As seen in Figure 1, the time to convergence for Potential Fields, PBC, and GDC generally increase with the number of robots, whereas Individual Dynamic Coverage decreases.
Figure 1 does not contain data on DMA-RRT due to the nature of the initial research. This algorithm was initially evaluated by having multiple robots cycle through a list of goals for 10 minutes. For DMA-RRT, we reproduced scenario A  of the paper which involved 10 agents cycling through 10 goals, and scenario B , with 4 agents cycling through 2 goals. We observed in our reproduction that the higher the number of robots in the simulation, the more collisions were experienced. 111Code used for simulations is available at https://github.com/gabrielarpino/Swarm-vs-Multi-Robot-Algorithms
Iii-B Experimental Setup
The algorithms mentioned above were benchmarked in the CMUSWARM Framework on ROS and Gazebo. Each algorithm was run for 20 trials on 5 different 20x20 meter maps, using 4, 8, and 16 holonomic 0.2 x 0.2 m iRobot Create vehicles totalling 300 trials.
An experimental trial is marked as successful when the algorithm converges and finishes the task within 10 minutes, otherwise it fails. We set a 10 minute cut-off primarily for three reasons. Firstly, we wish to establish a mission-critical time frame, in which the task must be completed. Secondly, the successful trials took far less than 10 minutes, with more than 10 minutes passing when a robot was stuck on an obstacle or in some other observably unrecoverable state. Lastly, with a 10 minute cap on simulation time, with a real time factor making the actual trial take 14+ minutes, running 1000+ trials to cover all 5 algorithms took well over 150 hours. We wish to optimize our Framework’s benchmarking process in the future to lessen this burden, and also introduce automated deadlock detection to determine if the system is in a stuck state.
If an algorithm fails to converge 20/20 times, we state it is intractable in the scenario, otherwise we will keep running trials until 20 successful trials are recorded. Parameter tuning was a manual process performed for each algorithm in the initial 4 robot case. Once a feasible set of parameters was found, they were used in the 4, 8, and 16 robot scenario. Manual re-tuning was done for each map.
Performance is measured by the metrics of convergence time (until task completion), distance travelled, area coverage (for navigation), sensor coverage (for dynamic coverage), and number of collisions. These metrics are significant in mission-critical situations because optimal-time response is necessary in emergency settings, real robots use up fuel with movement, and because collisions can cause the robot system to break. Our measures of convergence time and distance travelled correspond to the dynamic coverage Time and dynamic coverage Cost metrics outlined in 
, and are therefore classified as objective methods of comparison for dynamic coverage algorithms. For navigation, convergence time is the amount of time required for all robots to become within 3 meters of the goal location. For dynamic coverage algorithms, convergence time is measured as the amount of time to reach 100% coverage of the map.
Iii-C Experimental Results
Potential Fields Navigation: Much parameter tweaking was needed in order to have both convergence time and collision avoidance guarantees. PF had 0 inter-robot collisions in obstacle free environments, and the fewest collisions in obstacle filled environments (map 3, Figure 2) among the navigation algorithms, however this algorithm becomes intractable as the number of robots surpasses roughly 8 in any scenario. We believe this is due to the connectivity constraints requiring all robots to be connected within some proximity radius. As more robots are introduced in a spread out scenario (maps 2-5) there is an increasing likelihood of breaking the initial connectivity based on initial spawn location. Furthermore as the number of robots or other static obstacles increases, the system becomes increasingly slow at maneuvering through obstacles (Figure 4). Thus, PF was intractable on the corridor and concave maps with our minimum scenario of 4 robots, as the purely reflexive behaviour results in deadlocks with obstacles. We refrained from scaling further on these maps as a result.
Proportional Barrier Certificates Navigation: The PBC controller was tractable on only the empty maps (1,2) but resulted in the least distance travelled, had the lowest convergence time, and covered the least area in it’s path among all navigation algorithms. The algorithm had few collisions in empty maps (1,2), slightly more than PF; however as the number of robots scaled to 16, it had the most collisions of all algorithms (Figures 3), likely due to the violation of initial safe set conditions. This algorithm requires robots to spawn at least some threshold (denoted by parameter Ds) away from each other at spawn time. In map 1 (Figure 2
) where the robots are spawned in a dense region, this condition is violated in the 16 robot case. Furthermore, there is a chance of this condition being violated in the second map despite a wider initial spawn region. A collision is recorded when the collision disk of 2 robots intersect for every second. Thus, if the initial safe-set guarantee is violated then two or more robots may collide and incur many collisions, skewing the results.
This algorithm required less parameter tweaking than PF; but was very specific to scenario. Further parameter tweaking as the number of robots increased may have prevented collisions; however we set our experimental evaluation to use the same set of parameters for all 3 cases of robots (4,8,16), and only changed parameters between different maps.
DMA-RRT Navigation: DMA-RRT was the most robust of all the algorithms, requiring minimal tweaking of parameters and being the only navigation algorithm that was tractable in every scenario. This algorithm scaled well as the number of robots increased, almost not increasing in convergence time on empty maps and the uniform map (maps 1,2,3) (Figure 2) as the robots had alternative routes to take. On more cluttered environments (maps 4, 5) (Figure 2) the convergence time increased more significantly as the robots must take turns navigating through dense regions (Figure 4). An interesting observation is that in every scenario, the amount of distance travelled increased by less than a factor of 2 despite the number of robots doubling. One possible explanation is that with fewer robots the merit-based token is passed to each robot more frequently, meaning each robot is able to activate its current plan. With all robots acting at once some of them must take longer paths to avoid their neighbour’s broadcasted trajectory which is an obstacle in the environment. However, when there are more robots the convergence time increases because the robots must take turns; however now the robots may take better paths as they aren’t all navigating to the goal at once, many are stationary. Despite the theoretical guarantee of collision avoidance, collisions were present in our evaluation due to latencies in the ROS system and token exchange. Using the extended algorithm, Cooperative DMA-RRT, which involves emergency stops, may reduce the number of collisions when multiple robots face the same goal as it allows an agent to request others to stop if in close proximity.
Individual Dynamic Coverage (IDC): The IDC algorithm had several parameters and required tuning. There were no collisions on empty maps (1,2) (Figure 2) without static obstacles, and the average number of collisions across all maps either remained the same or decreased as number of robots increased. One possible explanation is that with many robots in an environment, the coverage levels of the spawning region quickly increase which hinders many robots from exploring further. This results in less time for convergence, and less total distance travelled as only a few select robots scout the remaining portion of the environment (Figures 5, 6). Additionally, as the robots attract and repel each other by nature of the swarm algorithm, having more robots on the map may aid in preventing clustering of robots in obstacle dense regions.
Group Dynamic Coverage: GDC required more tuning than the swarm coverage algorithm. The behaviour was similar to that of the swarm dynamic coverage; however due to a leader robot guiding other robots to a specific region, significantly more distance was travelled as the whole group moved together and thus repeated coverage of each others area (Figure 6). This further resulted in a longer time for convergence.
In contrast with the navigation task, IDC overall performed better than multi-robot dynamic coverage. IDC required less distance travelled, and time to converge in every scenario. Furthermore, IDC had the lowest number of collisions among any algorithm on the empty maps (1,2) (Figure 2); while multi-robot dynamic coverage yielded less collisions on obstacle maps (3,4,5) (Figure 2).
In general, swarm navigation had less collisions than multi-robot navigation on every map it converged on with less than 16 robots (1,2,3) (Figure 2); however the swarm algorithms quickly became intractable with obstacles and an increased number of robots. Furthermore, the swarm algorithms required significant tuning and it is cumbersome to explore the large parameter space. Finding a configuration that resulted in no collisions renders the convergence time extremely slow; but tweaking so there is convergence within reasonable time introduced collisions.
This means if all robots are closely grouped together, thus sensing each other, it would be equivalent in bandwidth to multi-robot dynamic coverage’s kb/sec because we have 8 robots communicating to each other. However, with swarm algorithms, the lower bound of bandwidth is actually still 0 kb/sec, the reason being if the robots are spread out far enough they won’t sense each other, and thus won’t receive the broadcast.
This highlights a fundamental contrast between the algorithms in our comparison: the swarm algorithms lack of explicit communication as opposed to multi-robot algorithms. Even with the case where sensing is treated as a form of communication, the swarm algorithms still do not have guaranteed communication due to limited sensing radius.
A final note of mention: despite each algorithm having theoretical guarantees for collision avoidance given some set of parameters, no such guarantee was satisfied during experimentation. We believe this is in part due to latency introduced by ROS, along with suboptimal parameter selection for the given scenario.
It was observed that, in the context of dynamic coverage, a swarm algorithm outperforms a multirobot algorithm in the metrics of distance travelled and time to convergence. In the context of navigation, however, this is not the case. The analysis of these findings is based on the Robotics Information Invariants work of  and .
Iv-a Information Invariants Concepts
The theory of Information Invariants for robotics was proposed in 1995 and expands on the work of , where the task of maze searching by an automaton was proved to be solved in three different configurations involving a counter, pebble, or other agent. Since then, the theory has been used to analyze problems in robotic manipulation and control (ex: ).
The theory serves to quantify the tradeoff between sensing, actuation, calibration, and communication in multi-robot systems. As in the work of , our groups of robots are modelled as circuit graphs. The following definitions will prove useful to our analysis:
Definition 3.1 A set of sensors attached to computational and motor components able to alter their position in state space is termed a Sensor System. A system of robots is an example of a Sensor System.
Definition 3.2 Circuit Graphs are graphs representing the sensor system, , where in the case of a system of robots the vertices are the sensori-motor components of the system (each individual robot) and the edges are the sensory or explicit communication connections between robots.
Definition 4.1  For two sensor systems and we say simulates if the output of is the same as the output of . When viewing the sensors systems as dynamical systems, the output of a sensor system refers to the limit set of the sensor system, a term in Dynamical Systems Theory referring to the state a dynamical system reaches after an infinite amount of time has passed. We write .
Our goal is to establish relations such as , where and are swarm/multi-robot systems, and is an additional capability such as sensing or useful computation, implying that and deliver equivalent information.
A calibration of the system constrains the spatial relation between its various nodes, and a calibration required to install a sensor system (how it should be configured at the start of a mission to work) is termed an installation calibration.
Definition 5.1  Consider two sensor systems and . When and require equivalent installation calibrations, and when the calibrations required to install are necessary to specify , we say dominates in calibration complexity.
According to Definition 6.2 in , for two sensor systems and we write when:
dominates in calibration complexity
mb() is bounded above by mb()
where mb(.) denotes the maximum bandwidth of the system as in Definition 6.1 of :
Definition 6.1.  We define the internal (resp. external) bandwidth of a sensor system to be the greatest bandwidth of any internal (resp. external) edge in (an edge represents explicit communication between two robots). We define the maximum bandwidth mb() to be the greater of the internal bandwidth, external bandwidth, and the output size of .
The intuition behind Definition 6.2 is that as a sensor system would be reducible to : It can simulate and is at least as complex in terms of calibration and overall bandwidth. A system of robots would be -wire reducible to if they satisfy Definition 6.2 when possesses additional pathways of communication between robots.
Iv-B Dynamic Area Coverage
In this section, we try to establish an information reduction between IDC and GDC, so as to better explain our findings that multi-robot dynamic coverage does not always perform better than swarm dynamic coverage. Recall that IDC involves no explicit communication of a perturbation point, whereas GDC does.
Due to the gradient based nature of the two algorithms, the only information available to each robot (without explicit communication) at any given time are the own robot’s positions, and the discretized map with information of the coverage levels at every discretized point.
The discretized map used for multi-robot dynamic coverage tasks as in [19, 13] has a fundamental limitation in that the coverage value of a certain cell is capped at a maximum. This characteristic, as we will see, causes loss of information in the system and opens up the possibility for a hierarchy of information theoretic reductions in the task of multi-robot dynamic coverage. It is also a characteristic necessary for the task of dynamic coverage to occur, as the authors introduced it in order for the gradients to not flow towards already explored areas. If cells were not capped, a robot would never finish exploring a given cell. In the computational space, this refers to the fact that no additional information can be stored in the map’s cell, and an agent acting upon this cell will cause no change. In the real world, this could correspond to, for example, robots marking the covered ground with paint, where the painted ground at some point saturates with so much paint that no change is visible.
Let us denote the multi-robot system used to solve the multi-robot dynamic coverage task as , and the multi-robot system used to solve the IDC task as . Following from definition 4.1 in  and simulate each other because their limit sets are the same, therefore:
The multi-robot dynamic coverage system possesses the initial calibration requirement of guaranteeing that all robots are within a proximity radius for communication. This initial calibration requires the installation of n robots such that they are all in communication proximity. The IDC system , however, requires no initial calibrations, and therefore no installation requirements. Thus, and do not require equivalent installation calibrations.
Both dynamic coverage algorithms being analyzed involved a rule for perturbation point selection. These point selection rules are assumed to be deterministic, implying that any randomness inherent in them is pseudorandom and could be replicated through the knowledge of a random seed. The possible rules for point selection can then be split into two families:
A Family 1 rule is a rule that only requires knowledge of the coverage levels of the map. A Family 2 rule is a rule that requires knowledge of the position of at least one other agent in the map.
Following these definitions, we propose certain facts about our system that will be useful in proving our reduction:
The state q of neighbouring robots is not always deducible from the coverage levels of the map.
This result stems from the fact that information is stored in the specified discretized map with the coverage values at every point in the map having a maximum value (a parameter in the algorithm). We can then propose the situation where a neighbouring robot is situated in the middle of a fully covered area that is larger than the neighbouring robot’s coverage radius, so any change in the robot’s position will not increase the coverage levels of the map. Therefore, information is lost and the state of this robot cannot be deduced.
where is a swarm gradient dynamic coverage system, is the set of all robots whose state is necessary by the rule for the new point calculation, and is the number of total robots in the system , because the leader communicates to all other robots in the system.
This proposition suggests that a swarm gradient dynamic coverage system with the leader communication of a new target point simulates a system with the communication of the states of all robots involved in the rule for new point selection. The minimum information communication required by the leader to achieve the same result are the states of all robots involved in the calculation of the new swarming location. With this proposition we are attempting to quantify exactly how much information is inherent in the GDC algorithm, and show that this is more than that present in IDC.
Case 1: If the rule is of Family 1, then there are no robot positions involved and no communication is required at all, both sides are equal. Case 2: If the rule is of Family 2, then using Proposition 1 we know that something must be communicated in order for the new target point to be calculated since it involves the state of at least one of the other agents. The new target point for dynamic coverage can be calculated based on the knowledge of the point selection rule and the robot states involved in the calculation. Therefore, since these two information permutations are able to communicate the same new swarming target points, they are able to accomplish the same goals and consequently have the same limit sets, implying that they simulate each other.
GDC where the coverage levels of the map are bounded above is -wire reducible to IDC using the same map model. In other words,
where is the multi-robot dynamic coverage system, is the IDC system, is the total number of agents -1, and is the number of agents involved in the new point selection rule.
As per Definition 6.2, let us denote the two systems and as and in the definition above.
1. simulates (): It follows from Note 1 that simulates due to their matching limit sets. and also have matching limit sets, because is the system with an additional -wire communication of the robot states, which from Proposition 2 simulates .
2. dominates in calibration complexity: It was mentioned that requires the calibrations of placing all agents within a proximity radius. , however, requires no initial physical calibration relatively. When adding as an information component to , a calibration is now required in order to ensure proper communication of the swarm due to proximity constraints. An additional information processing calibration (nonphysical) is required, and that is of programming the desired swarming rule into every agent such that they can now deduce the new swarming point from the received robot states. This calibration now required to install is necessary to specify the full properties of the system (sufficient proximity for communication, and rule specification), implying that dominates in calibration complexity according to Definition 5.1. NOTE: Both algorithms require the same additional initial calibration that they be sufficiently far away from an obstacle in order to maintain such a state, but this does not alter the analysis.
3. mb() is bounded above by mb(): Taking all the components (vertices) of the system (graph) as black box sensor systems or robots where the only information potential know regarding the system is the output size , then the maximum bandwidth of such systems is bounded above by according to Definition 6.1. Since all robots in both systems are assumed to be homogeneous and all explicitly communicated information shares the same output size , they have the same maximum bandwidth and so it follows that .
This result, together with our experimental findings demonstrating that individual dynamic coverage covered less distance and converged faster in every map scenario, shows that our swarm system with less information complexity than our multi-robot dynamic coverage system is able to constantly outperform the latter in these two metrics. A conclusion can be drawn that adding information complexity in the form of communication to a multiple robot dynamic coverage system does not always increase its performance with regards to convergence time and distance travelled.
Experimental results demonstrated that DMA-RRT converges faster and travels less distance in cluttered environments, meanwhile PBC performs best overall on empty maps, and PF yields the smallest number of collisions on scenarios in which it converges. We will attempt to establish a reduction between these three algorithms in order to offer a better understanding of the experimental findings.
The circuit models for the three navigation algorithms PF, Barrier Certificates, and DMA-RRT will be denoted as , , and for short. Since all three navigation algorithms are guaranteed to achieve the same limit sets (final configurations), they simulate each other as computational circuits:
where the (simulation) operation is elementary transitive .
Work remains in showing that the DMA-RRT algorithm reduces to any of the barrier certificates or PF algorithms, and this can be done by meeting the requirements of Definition 6.2 .
This leads us to an attempt at forming a reduction as outlined in Definition 3.12 :
1. DMA-RRT and barrier certificates simulate each other by virtue of having the same limit sets.
2. Barrier Certificates dominates DMA-RRT in calibration complexity because it has the base requirement that robots must be located within a sufficient distance from an obstacle in order for the safe set to be forward invariant. DMA-RRT, however, has no such constraints.
3. mb(DMA-RRT) is not bounded above by mb(BC) because DMA-RRT communicates an entire path (), whereas Barrier Certificates obstacle sensing produces only a new velocity for a robot to reactively avoid a collision (). Since all robots in both algorithms are seen as black-box sensor sytems with external communication, their maximum bandwidth is denoted by the maximum of their output size and their external bandwidth as in Definition 6.1 .
The converse, Barrier Certificates reducing to DMA-RRT, also does not hold because the calibration complexity of DMA-RRT does not dominate that of Barrier Certificates. A similar argument can be made for the PF algorithm, hence both swarm navigation algorithms are not provably reducible to the multirobot navigation algorithms and vice versa.
This finding suggests that the experimental results relating the performances of the navigation algorithms, differently from those of the dynamic coverage algorithms, do not relate simply through an information theoretic reduction. It appears that the information complexity of DMA-RRT is fundamentally different from that of PBC and PF, offering possible explanations for the advantages of each algorithm in different scenarios.
Our research provided a comparison for identifying and highlighting the pros and cons of swarm and general multi-robot algorithms in a manner that can inform offline design decisions made by engineers or online operational decisions made by supervisory operators of multi-robot systems. We first conducted an evaluation on the ROS platform using five algorithms in order to compare multi-robot and swarm systems in two application domains: navigation and dynamic area coverage. We then present several insights based on our collision, coverage, distance, and convergence metrics. Lastly, we extend our results to a comparative analysis of the algorithms based on the theory of information invariants, which provided a theoretical characterization supported by our empirical results.
-  Z. Yan, N. Jouandeau, and A. A. Cherif, “A survey and analysis of multi-robot coordination,” International Journal of Advanced Robotic Systems, vol. 10, no. 12, p. 399, 2013.
-  L. Iocchi, D. Nardi, and M. Salerno, “Reactivity and deliberation: a survey on multi-robot systems,” in Workshop on Balancing Reactivity and Social Deliberation in Multi-Agent Systems. Springer, 2000, pp. 9–32.
-  F. Bullo, J. Cortes, and S. Martinez, Distributed control of robotic networks: a mathematical approach to motion coordination algorithms. Princeton University Press, 2009.
-  A. Kolling, P. Walker, N. Chakraborty, K. Sycara, and M. Lewis, “Human interaction with robot swarms: A survey,” IEEE Transactions on Human-Machine Systems, vol. 46, no. 1, pp. 9–26, 2016.
-  S. Nagavalli, N. Chakraborty, and K. Sycara, “Automated sequencing of swarm behaviors for supervisory control of robotic swarms,” in Robotics and Automation (ICRA), 2017 IEEE International Conference on. IEEE, 2017, pp. 2674–2681.
-  ——, “On time-optimal behavior scheduling of robotic swarms for achieving multiple goals,” in 2017 IEEE International Conference on Automation Science and Engineering. IEEE, 2017.
-  V. R. Desaraju and J. P. How, “Decentralized path planning for multi-agent teams in complex environments using rapidly-exploring random trees,” in Robotics and Automation (ICRA), 2011 IEEE International Conference on. IEEE, 2011, pp. 4956–4961.
-  J. Alonso-Mora, E. Montijano, M. Schwager, and D. Rus, “Distributed multi-robot formation control among obstacles: A geometric and optimization approach with consensus,” in Robotics and Automation (ICRA), 2016 IEEE International Conference on. IEEE, 2016, pp. 5356–5363.
-  A. Breitenmoser, M. Schwager, J.-C. Metzger, R. Siegwart, and D. Rus, “Voronoi coverage of non-convex environments with a group of networked robots,” in Robotics and Automation (ICRA), 2010 IEEE International Conference on. IEEE, 2010, pp. 4982–4989.
H. Choset, “Coverage for robotics–a survey of recent results,”
Annals of mathematics and artificial intelligence, vol. 31, no. 1, pp. 113–126, 2001.
-  E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,” Robotics and Autonomous Systems, vol. 61, no. 12, pp. 1258–1276, 2013.
-  T. Nestmeyer, P. R. Giordano, H. H. Bülthoff, and A. Franchi, “Decentralized simultaneous multi-target exploration using a connected network of multiple robots,” Autonomous Robots, vol. 41, no. 4, pp. 989–1011, 2017.
-  G. M. Atinç, D. M. Stipanović, P. G. Voulgaris, and M. Karkoub, “Swarm-based dynamic coverage control,” in Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on. IEEE, 2014, pp. 6963–6968.
-  D. Portugal and R. Rocha, “A survey on multi-robot patrolling algorithms,” Technological innovation for sustainability, pp. 139–146, 2011.
-  B. R. Donald, “On information invariants in robotics,” Artificial Intelligence, vol. 72, no. 1-2, pp. 217–304, 1995.
-  X. Li, D. Sun, and J. Yang, “A bounded controller for multirobot navigation while maintaining network connectivity in the presence of obstacles,” Automatica, vol. 49, no. 1, pp. 285–292, 2013.
-  U. Borrmann, L. Wang, A. D. Ames, and M. Egerstedt, “Control barrier certificates for safe swarm behavior,” 2015 IFAC Conference on Analysis and Design of Hybrid Systems (ADHS), vol. 48, no. 27, pp. 68–73, 2015.
-  L. Wang, A. Ames, and M. Egerstedt, “Safety barrier certificates for heterogeneous multi-robot systems,” in 2016 IEEE American Control Conference (ACC). IEEE, 2016, pp. 5213–5218.
-  I. I. Hussein and D. M. Stipanovic, “Effective coverage control for mobile sensor networks with guaranteed collision avoidance,” IEEE Transactions on Control Systems Technology, vol. 15, no. 4, pp. 642–657, 2007.
-  B. D. Luders, S. Karaman, E. Frazzoli, and J. P. How, “Bounds on tracking error using closed-loop rapidly-exploring random trees,” in American Control Conference (ACC), 2010. IEEE, 2010, pp. 5406–5412.
Y. Wang, A. Liang, and H. Guan, “Frontier-based multi-robot map exploration using particle swarm optimization,” in2011 IEEE Symposium on Swarm Intelligence (SIS). IEEE, 2011, pp. 1–6.
-  Q. Tang, F. Yu, Y. Zhang, L. Ding, and P. Eberhard, “A stigmergy based search method for swarm robots,” in 2017 International Conference on Swarm Intelligence (ICSI). Springer, 2017, pp. 199–209.
-  K. Morris, G. Arpino, S. Nagavalli, and K. Sycara, “Full stack swarm architecture,” RISS Working Papers Journal, 2018.
-  Z. Yan, L. Fabresse, J. Laval, and N. Bouraqadi, “Metrics for performance benchmarking of multi-robot exploration,” in Intelligent Robots and Systems (IROS), 2015 IEEE/RSJ International Conference on. IEEE, 2015, pp. 3407–3414.
-  B. R. Donald, J. Jennings, and D. Rus, “Information invariants for distributed manipulation,” The International Journal of Robotics Research, vol. 16, no. 5, pp. 673–702, 1997.
-  M. Blum and D. Kozen, “On the power of the compass (or, why mazes are easier to search than graphs),” in Foundations of Computer Science, 1978., 19th Annual Symposium on. IEEE, 1978, pp. 132–142.
-  K. Böhringer, R. Brown, B. Donald, J. Jennings, and D. Rus, “Distributed robotic manipulation: Experiments in minimalism,” Experimental robotics IV, pp. 11–25, 1997.