Abstract
A central problem in swarm robotics is to design a controller that will allow the member robots of the swarm to collectively perform a given task. Of particular interest in massively distributed applications are reactive controllers with severely limited computational and sensory abilities. In this article, we give the results of the first computational complexity analysis of the reactive swarm design problem. Our core results are derived relative to a generalization of what is arguably the simplest possible type of reactive controller, the so-called computation-free controller proposed by Gauci et al., which operates in grid-based environments in a noncontinuous manner. We show that the design of a generalized computation-free swarm for an arbitrary given task in an arbitrary given environment is not polynomial-time solvable either in general or by the most desirable types of approximation algorithms (including evolutionary algorithms with high probabilities of producing correct solutions) but is solvable in effectively polynomial time relative to several types of restrictions on swarms, environments, and tasks. All of our results hold for the design of several more complex types of generalized computation-free swarms. Moreover, all of our intractability and inapproximability results hold for the design of any type of reactive swarm (including those based on the popular feed-forward neural network and Brooks-style subsumption controllers) operating in grid-based environments in a noncontinuous manner whose member robots satisfy two simple conditions. As such, our results give the first theoretical survey of the types of efficient exact and approximate solution algorithms that are and are not possible for designing several types of reactive swarms.
- Scott Aaronson. 2005. Complexity theory column 46: NP-complete problems and physical reality. ACM SIGACT News 36, 1, 30--52. Google Scholar
Digital Library
- Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. 1999. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer. Google Scholar
Digital Library
- Levent Bayındır. 2016. A review of swarm robotics tasks. Neurocomputing 172, 292--321. Google Scholar
Digital Library
- Manuele Brambilla, Eliseo Ferrante, Mauro Birattari, and Marco Dorigo. 2013. Swarm robotics: A review from the swarm engineering perspective. Swarm Intelligence 7, 1, 1--41.Google Scholar
Cross Ref
- Rodney A. Brooks. 1986. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation RA-2, 1, 14--23.Google Scholar
Cross Ref
- Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, and Ge Xia. 2006. Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences 72, 1346--1367. Google Scholar
Digital Library
- René Doursat, Hiroki Sayama, and Olivier Michel. 2013. A review of morphogenetic engineering. Natural Computing 12, 4, 517--535. Google Scholar
Digital Library
- Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer, Berlin Germany. Google Scholar
Digital Library
- Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer, Berlin, Germany. Google Scholar
Digital Library
- Lance Fortnow. 2009. The status of the P versus NP problem. Communications of the ACM 52, 9, 78--86. Google Scholar
Digital Library
- Gianpiero Francesca and Mauro Birattari. 2016. Automatic design of robot swarms: Achievements and challenges. Frontiers in Robotics and AI 3, 29.Google Scholar
Cross Ref
- Gianpiero Francesca, Manuele Brambilla, Arne Brutschy, Vito Trianni, and Mauro Birattari. 2014. AutoMoDe: A novel approach to the automatic design of control software for robot swarms. Swarm Intelligence 8, 2, 89--112.Google Scholar
Cross Ref
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability. W. H. Freeman.Google Scholar
- Melvin Gauci, Jianing Chen, Wei Li, Tony J. Dodd, and Roderich Groß. 2014a. Self-organized aggregation without computation. The International Journal of Robotics Research 33, 8 (2014), 1145--1161. Google Scholar
Digital Library
- Melvin Gauci, Jianing Chen, Wei Li, Tony J. Dodd, and Roderich Groß. 2014b. Clustering objects with robots that do not compute. In Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’14). 421--428. Google Scholar
Digital Library
- Lane A. Hemaspaandra and Ryan Williams. 2012. Complexity theory column 76: An atypical survey of typical-case heuristic algorithms. ACM SIGACT News 43, 4, 70--89. Google Scholar
Digital Library
- Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. 2001. Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63, 4, 512--530. Google Scholar
Digital Library
- Matthew Johnson and Daniel S. Brown. 2015. Evolving and controlling perimeter, rendezvous, and foraging behaviors in a computation-free robot swarm. In Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communication Technologies. 311--314. Google Scholar
Digital Library
- Narendra Karmarkar. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 4, 373--395. Google Scholar
Digital Library
- Yara Khaluf. 2016. Adaptive construction behavior in robot swarms. In ADAPTIVE 2016: The 8th International Conference on Adaptive and Self-Adaptive Systems and Applications. 34--39.Google Scholar
- Stefan Kratsch and Frank Neumann. 2013. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65, 4 (2013), 754--771. Google Scholar
Digital Library
- Johan Kwisthout. 2015. Tree-width and the computational complexity of MAP approximations in Bayesian networks. Journal of Artificial Intelligence Research 53, 699--720. Google Scholar
Digital Library
- Yuri K. Lopes, Stefan M. Trenkwalder, André B. Leal, Tony J. Dodd, and Roderich Groß. 2016. Supervisory control theory applied to swarm robotics. Swarm Intelligence 10, 1, 65--97.Google Scholar
Cross Ref
- Carsten Lund and Mihalis Yannakakis. 1994. On the hardness of approximating minimization problems. Journal of the ACM 41, 5, 960--981. Google Scholar
Digital Library
- Dániel Marx. 2008. Parameterized complexity and approximation algorithms. Computer Journal 51, 1, 60--78. Google Scholar
Digital Library
- Rajeev Motwani and Prabhakar Raghavan. 2010. Randomized Algorithms. Chapman 8 Hall/CRC.Google Scholar
- Robin Murphy. 2000. Introduction to AI Robotics. MIT Press, Cambridge, MA. Google Scholar
Digital Library
- Erol Şahin. 2005. Swarm robotics: From sources of inspiration to domains of application. In Swarm Robotics: SAB 2004 International Workshop (Revised Selected Papers), E. Şahin and W. M. Spears (Eds.). Springer, Germany, 10--20. Google Scholar
Digital Library
- Touraj Soleymani, Vito Trianni, Michael Bonani, Francesco Mondada, and Marco Dorigo. 2015. Bio-inspired construction with mobile robots and compliant pockets. Robotics and Autonomous Systems 74, 340--350. Google Scholar
Digital Library
- Vito Trianni. 2008. Evolutionary Swarm Robotics: Evolving Self-Organising Behaviours in Groups of Autonomous Robots. Studies in Computational Intelligence, Vol. 108. Springer. Google Scholar
Digital Library
- Todd Wareham. 1999. Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D. Dissertation. University of Victoria. Google Scholar
Digital Library
- Todd Wareham. 2015. Exploring algorithmic options for the efficient design and reconfiguration of reactive robot swarms. In Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communication Technologies. 295--302. Google Scholar
Digital Library
- Todd Wareham and Andrew Vardy. 2017. Putting it together: The computational complexity of designing robot controllers and environments for distributed construction. Swarm Intelligence.Google Scholar
- Justin Werfel, Kristin Petersen, and Radhika Nagpal. 2014. Designing collective behavior in a termite-inspired robot construction team. Science 343, 754--758.Google Scholar
Cross Ref
- Avi Wigderson. 2007. P, NP and mathematics—a computational complexity perspective. In Proceedings of ICM 2006: Volume I. EMS Publishing House, Zurich, Switzerland, 665--712.Google Scholar
Cross Ref
Index Terms
Viable Algorithmic Options for Designing Reactive Robot Swarms
Recommendations
Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms
BICT'15: Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)A key challenge in robot swarm engineering is the design
of individual robot controllers such that the robots as a group can
perform a specified task.
In this
paper, we explore algorithmic options for designing and reconfiguring
swarms of synchronous ...
Understanding the Limitations of Particle Swarm Algorithm for Dynamic Optimization Tasks: A Survey Towards the Singularity of PSO for Swarm Robotic Applications
One of the most widely used biomimicry algorithms is the Particle Swarm Optimization (PSO). Since its introduction in 1995, it has caught the attention of both researchers and academicians as a way of solving various optimization problems, such as in ...
Convergence of ant colony multi-agent swarms
HSCC '20: Proceedings of the 23rd International Conference on Hybrid Systems: Computation and ControlAnt Colony algorithms are a set of biologically inspired algorithms used commonly to solve distributed optimization problems. Convergence has been proven in the context of optimization processes, but these proofs are not applicable in the framework of ...






Comments