skip to main content
research-article

Viable Algorithmic Options for Designing Reactive Robot Swarms

Published:16 April 2018Publication History
Skip Abstract Section

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.

References

  1. Scott Aaronson. 2005. Complexity theory column 46: NP-complete problems and physical reality. ACM SIGACT News 36, 1, 30--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. Levent Bayındır. 2016. A review of swarm robotics tasks. Neurocomputing 172, 292--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. René Doursat, Hiroki Sayama, and Olivier Michel. 2013. A review of morphogenetic engineering. Natural Computing 12, 4, 517--535. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer, Berlin Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer, Berlin, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lance Fortnow. 2009. The status of the P versus NP problem. Communications of the ACM 52, 9, 78--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Gianpiero Francesca and Mauro Birattari. 2016. Automatic design of robot swarms: Achievements and challenges. Frontiers in Robotics and AI 3, 29.Google ScholarGoogle ScholarCross RefCross Ref
  12. 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 ScholarGoogle ScholarCross RefCross Ref
  13. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability. W. H. Freeman.Google ScholarGoogle Scholar
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. Narendra Karmarkar. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 4, 373--395. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle Scholar
  21. Stefan Kratsch and Frank Neumann. 2013. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65, 4 (2013), 754--771. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Johan Kwisthout. 2015. Tree-width and the computational complexity of MAP approximations in Bayesian networks. Journal of Artificial Intelligence Research 53, 699--720. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarCross RefCross Ref
  24. Carsten Lund and Mihalis Yannakakis. 1994. On the hardness of approximating minimization problems. Journal of the ACM 41, 5, 960--981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Dániel Marx. 2008. Parameterized complexity and approximation algorithms. Computer Journal 51, 1, 60--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Rajeev Motwani and Prabhakar Raghavan. 2010. Randomized Algorithms. Chapman 8 Hall/CRC.Google ScholarGoogle Scholar
  27. Robin Murphy. 2000. Introduction to AI Robotics. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  29. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  30. Vito Trianni. 2008. Evolutionary Swarm Robotics: Evolving Self-Organising Behaviours in Groups of Autonomous Robots. Studies in Computational Intelligence, Vol. 108. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Todd Wareham. 1999. Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D. Dissertation. University of Victoria. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  33. Todd Wareham and Andrew Vardy. 2017. Putting it together: The computational complexity of designing robot controllers and environments for distributed construction. Swarm Intelligence.Google ScholarGoogle Scholar
  34. Justin Werfel, Kristin Petersen, and Radhika Nagpal. 2014. Designing collective behavior in a termite-inspired robot construction team. Science 343, 754--758.Google ScholarGoogle ScholarCross RefCross Ref
  35. 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 ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Viable Algorithmic Options for Designing Reactive Robot Swarms

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Autonomous and Adaptive Systems
          ACM Transactions on Autonomous and Adaptive Systems  Volume 13, Issue 1
          March 2018
          184 pages
          ISSN:1556-4665
          EISSN:1556-4703
          DOI:10.1145/3208359
          Issue’s Table of Contents

          Copyright © 2018 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 16 April 2018
          • Accepted: 1 October 2017
          • Revised: 1 August 2017
          • Received: 1 December 2016
          Published in taas Volume 13, Issue 1

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!