Papers
Topics
Authors
Recent
Search
2000 character limit reached

Universal Coating by 3D Hybrid Programmable Matter

Published 28 Mar 2023 in cs.DS and cs.ET | (2303.16180v4)

Abstract: Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size $n$ with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires $\mathcal{O}(n2)$ steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Cooperative cargo transportation by a swarm of molecular machines. Science Robotics, 7(65):eabm0677, 2022.
  2. On the power of the compass (or, why mazes are easier to search than graphs). In 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pages 132–142, 1978. doi:10.1109/SFCS.1978.30.
  3. Solving mazes with single-molecule dna navigators. Nature Materials, 18, 2019. doi:10.1038/s41563-018-0205-3.
  4. Building a nest by an automaton. Algorithmica, 83, 2021. doi:10.1007/s00453-020-00752-0.
  5. Convex hull formation for programmable matter. In Proceedings of the 21st International Conference on Distributed Computing and Networking, ICDCN 2020, 2020. doi:10.1145/3369740.3372916.
  6. Improved leader election for self-organizing programmable matter. In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers, pages 127–140, 2017. doi:10.1007/978-3-319-72751-6_10.
  7. Amoebot - a new model for programmable matter. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’14, page 220–222, 2014. doi:10.1145/2612669.2612712.
  8. On the runtime of universal coating for programmable matter. Natural Computing, 17:81–96, 2016. doi:10.1007/s11047-017-9658-6.
  9. Universal shape formation for programmable matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’16, page 289–299, 2016. doi:10.1145/2935764.2935784.
  10. Universal coating for programmable matter. Theoretical Computer Science, 671:56–68, 2017. doi:10.1016/j.tcs.2016.02.039.
  11. Shape formation by programmable particles. Distributed Computing, 33:69–101, 2019.
  12. Cadbots: Algorithmic aspects of manipulating programmable matter with finite automata. Algorithmica, 83:1–26, 2021. doi:10.1007/s00453-020-00761-z.
  13. Coordinating amoebots via reconfigurable circuits. Journal of Computational Biology, 29, 2022. doi:10.1089/cmb.2021.0363.
  14. Graph exploration by a finite automaton. In Mathematical Foundations of Computer Science 2004, pages 451–462, 2004.
  15. Leader election and local identifiers for 3d programmable matter. Concurrency and Computation: Practice and Experience, 34, 2020. doi:10.1002/cpe.6067.
  16. Shape recognition by a finite automaton robot. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), volume 117 of LIPIcs, pages 52:1–52:15, 2018. doi:10.4230/LIPIcs.MFCS.2018.52.
  17. Forming tile shapes with simple robots. Natural Computing, 19, 2020. doi:10.1007/s11047-019-09774-2.
  18. From dna tiles to functional dna materials. Trends in Chemistry, 1(9):799–814, 2019. doi:10.1016/j.trechm.2019.07.006.
  19. Shape formation in a three-dimensional model for hybrid programmable matter. In Proc. of the 36th European Workshop on Computational Geometry (EuroCG 2020), 2020.
  20. Frank Hoffmann. One pebble does not suffice to search plane labyrinths. In International Symposium on Fundamentals of Computation Theory, 1981.
  21. Fort formation by an automaton. In 2021 International Conference on COMmunication Systems and NETworkS, pages 540–547, 2021. doi:10.1109/COMSNETS51098.2021.9352839.
  22. A dna molecular robot autonomously walking on the cell membrane to drive the cell motility. Angewandte Chemie International Edition, 60, 2021. doi:10.1002/anie.202108210.
  23. Dynamic line maintenance by hybrid programmable matter. International Journal of Networking and Computing, 13(1):18–47, 2023. doi:10.15803/ijnc.13.1_18.
  24. Matthew Patitz. An introduction to tile-based self-assembly and a survey of recent results. Natural Computing, 13, 2013. doi:10.1007/s11047-013-9379-4.
  25. A framework for taxonomy and evaluation of self-reconfigurable robotic systems. IEEE Access, 8:13969–13986, 2020. doi:10.1109/ACCESS.2020.2965327.
  26. 3d coating self-assembly for modular robotic scaffolds. In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 11688–11695, 2020. doi:10.1109/IROS45743.2020.9341324.
  27. Scaffold-based asynchronous distributed self-reconfiguration by continuous module flow. In 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 4840–4846, 2019. doi:10.1109/IROS40897.2019.8967775.
  28. A cargo-sorting dna robot. Science, 357(6356):eaan6558, 2017.
  29. W.K.R. Traversat. Universal coating by programmable matter in 3d. Master’s thesis, Eindhoven University of Technology, 2020. URL: https://pure.tue.nl/ws/portalfiles/portal/168210057/Traversat_W..pdf.
  30. A distributed self-assembly planning algorithm for modular robots. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’18, page 550–558, 2018.
  31. Designing collective behavior in a termite-inspired robot construction team. Science, 343(6172):754–758, 2014.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up