Categories, Quantum Computing, and Swarm Robotics: A Case Study

On the Throughput of the Common Target Area for Robotic Swarm Strategies

A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. This work proposes two measures for evaluating the access efficiency of a common target area as the number of robots in the swarm rises: the maximum target area throughput and its maximum asymptotic throughput. Both are always finite as the number of robots grows, in contrast to the arrival time at the target per number of robots that tends to infinity. Using them, one can analytically compare the effectiveness of different algorithms. In particular, three different theoretical strategies proposed and formally evaluated for reaching a circular target area: (i) forming parallel queues towards the target area, (ii) forming a hexagonal packing through a corridor going to the target, and (iii) making multiple curved trajectories towards the boundary of the target area. The maximum throughput and the maximum asymptotic throughput (or bounds for it) for these strategies are calculated, and these results are corroborated by simulations. The key contribution is not the proposal of new algorithms to alleviate congestion but a fundamental theoretical study of the congestion problem in swarm robotics when the target area is shared.

A Quantum Planner for Robot Motion

The possibility of integrating quantum computation in a traditional system appears to be a viable route to drastically improve the performance of systems endowed with artificial intelligence. An example of such processing consists of implementing a teleo-reactive system employing quantum computing. In this work, we considered the navigation of a robot in an environment where its decisions are drawn from a quantum algorithm. In particular, the behavior of a robot is formalized through a production system. It is used to describe the world, the actions it can perform, and the conditions of the robot’s behavior. According to the production rules, the planning of the robot activities is processed in a recognize–act cycle with a quantum rule processing algorithm. Such a system aims to achieve a significant computational speed-up.