Skip to main content
SpringerLink
Log in

Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11931))

Abstract

In this paper, we study a discrete system of entities residing on a two-dimensional square grid. Each entity is modelled as a node occupying a distinct cell of the grid. The set of all n nodes forms initially a connected shape A. Entities are equipped with a linear-strength pushing mechanism that can push a whole line of entities, from 1 to n, in parallel in a single time-step. A target connected shape B is also provided and the goal is to transform A into B via a sequence of line movements. Existing models based on local movement of individual nodes, such as rotating or sliding a single node, can be shown to be special cases of the present model, therefore their (inefficient, \(\varTheta (n^2)\)) universal transformations carry over. Our main goal is to investigate whether the parallelism inherent in this new type of movement can be exploited for efficient, i.e., sub-quadratic worst-case, transformations. As a first step towards this, we restrict attention solely to centralised transformations and leave the distributed case as a direction for future research. Our results are positive. By focusing on the apparently hard instance of transforming a diagonal A into a straight line B, we first obtain transformations of time \(O(n\sqrt{n})\) without and with preserving the connectivity of the shape throughout the transformation. Then, we further improve by providing two \(O(n\log n)\)-time transformations for this problem. By building upon these ideas, we first manage to develop an \(O(n\sqrt{n})\)-time universal transformation. Our main result is then an \( O(n \log n) \)-time universal transformation. We leave as an interesting open problem a suspected \(\varOmega (n\log n)\)-time lower bound.

The full version of the paper with all omitted details is available on arXiv at: https://arxiv.org/abs/1904.12777 .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In this paper, whenever transforming into a target shape B, we allow any placement of B on the grid, i.e., any shape \(B^\prime \) obtained from B through a sequence of rotations and translations.

  2. 2.

    From vertical to horizontal and vice versa.

  3. 3.

    Due to space restrictions, these can be found in the full version of the paper.

References

  1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  2. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279–304 (2007)

    Article  MATH  Google Scholar 

  3. Aloupis, G., et al.: Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8), 917–928 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Aloupis, G., Collette, S., Demaine, E.D., Langerman, S., Sacristán, V., Wuhrer, S.: Reconfiguration of cube-style modular robots using O(logn) parallel moves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 342–353. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92182-0_32

    Chapter  Google Scholar 

  5. Becker, A.T., Demaine, E.D., Fekete, S.P., Lonsford, J., Morris-Wright, R.: Particle computation: complexity, algorithms, and logic. Nat. Comput. 18(1), 181–201 (2019)

    Article  MathSciNet  Google Scholar 

  6. Bourgeois, J., Goldstein, S.C.: Distributed intelligent MEMS: progresses and perspective. IEEE Syst. J. 9(3), 1057–1068 (2015)

    Article  Google Scholar 

  7. Butler, Z., Kotay, K., Rus, D., Tomita, K.: Generic decentralized control for lattice-based self-reconfigurable robots. Int. J. Rob. Res. 23(9), 919–937 (2004)

    Article  Google Scholar 

  8. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cornejo, A., Kuhn, F., Ley-Wild, R., Lynch, N.: Keeping mobile robot swarms connected. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 496–511. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04355-0_50

    Chapter  Google Scholar 

  10. Derakhshandeh, Z., Dolev, S., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Brief announcement: Amoebot-a new model for programmable matter. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 220–222. ACM (2014)

    Google Scholar 

  11. Daymude, J.J., et al.: On the runtime of universal coating for programmable matter. Nat. Comput. 17(1), 81–96 (2018)

    Article  MathSciNet  Google Scholar 

  12. Douglas, S.M., Dietz, H., Liedl, T., Högberg, B., Graf, F., Shih, W.M.: Self-assembly of DNA into nanoscale three-dimensional shapes. Nature 459(7245), 414 (2009)

    Article  Google Scholar 

  13. Demaine, E.D.: Playing games with algorithms: algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18–33. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44683-4_3

    Chapter  Google Scholar 

  14. Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Distrib. Comput. 28(2), 131–145 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Défago, X., Gradinariu, M., Messika, S., Raipin-Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46–60. Springer, Heidelberg (2006). https://doi.org/10.1007/11864219_4

    Chapter  Google Scholar 

  16. Derakhshandeh, Z., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: An algorithmic framework for shape formation problems in self-organizing particle systems. In: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, p. 21. ACM (2015)

    Google Scholar 

  17. Derakhshandeh, Z., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Universal shape formation for programmable matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 289–299. ACM (2016)

    Google Scholar 

  18. Di Luna, G.A., Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Line recovery by programmable particles. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, pp. 4:1–4:10. ACM, New York (2018)

    Google Scholar 

  19. Di Luna, G.A., Flocchini, P., Santoro, N., Viglietta, G., Yamauchi, Y.: Shape formation by programmable particles. Distrib. Comput. (2019). https://doi.org/10.1007/s00446-019-00350-6

    Article  Google Scholar 

  20. Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55, 78–88 (2012)

    Article  Google Scholar 

  21. Dumitrescu, A., Pach, J.: Pushing squares around. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 116–123. ACM (2004)

    Google Scholar 

  22. Dumitrescu, A., Suzuki, I., Yamashita, M.: Formations for fast locomotion of metamorphic robotic systems. Int. J. Rob. Res. 23(6), 583–593 (2004)

    Article  Google Scholar 

  23. Dumitrescu, A., Suzuki, I., Yamashita, M.: Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Trans. Rob. Autom. 20(3), 409–418 (2004)

    Article  Google Scholar 

  24. Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, vol. 3(2), pp. 1–185. Morgan & Claypool Publishers, San Rafael (2012)

    MATH  Google Scholar 

  25. Fekete, S., Richa, A.W., Römer, K., Scheideler, C.: Algorithmic foundations of programmable matter (Dagstuhl Seminar 16271). In: Dagstuhl Reports, vol. 6. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, (2016). Also in ACM SIGACT News, vol. 48.2, pp. 87–94 (2017)

    Article  Google Scholar 

  26. Gilpin, K., Knaian, A., Rus, D.: Robot pebbles: one centimeter modules for programmable matter through self-disassembly. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 2485–2492. IEEE (2010)

    Google Scholar 

  27. Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1–2), 72–96 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  28. Knaian, A.N., Cheung, K.C., Lobovsky, M.B., Oines, A.J., Schmidt-Neilsen, P., Gershenfeld, N.A.:. The milli-motein: a self-folding chain of programmable matter with a one centimeter module pitch. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1447–1453. IEEE (2012)

    Google Scholar 

  29. Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Synthesis Lectures on Distributed Computing Theory, vol. 1(1), pp. 1–122. Morgan & Claypool Publishers, San Rafael (2010)

    Google Scholar 

  30. Michail, O., Spirakis, P.G.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207–237 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  31. Michail, O., Spirakis, P.G.: Elements of the theory of dynamic networks. Commun. ACM 61(2), 72–81 (2018)

    Article  Google Scholar 

  32. Michail, O., Skretas, G., Spirakis, P.G.: On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102, 18–39 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  33. Nguyen, A., Guibas, L.J., Yim, M.: Controlled module density helps reconfiguration planning. In: Proceedings of 4th International Workshop on Algorithmic Foundations of Robotics, pp. 23–36 (2000)

    Google Scholar 

  34. Rubenstein, M., Cornejo, A., Nagpal, R.: Programmable self-assembly in a thousand-robot swarm. Science 345(6198), 795–799 (2014)

    Article  Google Scholar 

  35. Rothemund, P.W.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297–302 (2006)

    Article  Google Scholar 

  36. Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 459–468. ACM (2000)

    Google Scholar 

  37. Shibata, M., Mega, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Uniform deployment of mobile agents in asynchronous rings. J. Parallel Distrib. Comput. 119, 92–106 (2018)

    Article  MATH  Google Scholar 

  38. Woods, D., Chen, H.-L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 353–354. ACM (2013)

    Google Scholar 

  39. Winfree, E.: Algorithmic self-assembly of DNA. Ph.D thesis, California Institute of Technology, June 1998

    Google Scholar 

  40. Walter, J.E., Welch, J.L., Amato, N.M.: Distributed reconfiguration of metamorphic robot chains. Distrib. Comput. 17(2), 171–189 (2004)

    Article  MATH  Google Scholar 

  41. Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26–28), 2433–2453 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  42. Yim, M., et al.: Modular self-reconfigurable robot systems [grand challenges of robotics]. IEEE Rob. Autom. Mag. 14(1), 43–52 (2007)

    Article  MathSciNet  Google Scholar 

  43. Yamauchi, Y., Uehara, T., Yamashita, M.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 447–449. ACM (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, UK

    Abdullah Almethen, Othon Michail & Igor Potapov

Authors
  1. Abdullah Almethen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Othon Michail
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Igor Potapov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdullah Almethen .

Editor information

Editors and Affiliations

  1. Paderborn University, Paderborn, Germany

    Falko Dressler

  2. Paderborn University, Paderborn, Germany

    Christian Scheideler

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Almethen, A., Michail, O., Potapov, I. (2019). Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. In: Dressler, F., Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2019. Lecture Notes in Computer Science(), vol 11931. Springer, Cham. https://doi.org/10.1007/978-3-030-34405-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34405-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34404-7

  • Online ISBN: 978-3-030-34405-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation