Abstract | ||
---|---|---|
Programmable matter can be seen as a huge modular robot in which each module can communicate to its connected neighbors and work all together to achieve a common goal, more likely changing the shape of the whole robot. However, when the number of modules increases, the memory used in each module to store the target shape or the computation time to recreate this shape increases too. This article studies different approaches to describe the shape of any object for huge modular robots. The use of a good method for coding scene is a critical aspect that can reduce the memory, the time of transfer and the energy used in many distributed algorithms like self-reconfiguration. This paper proposes a method called Constructive Solid Geometry for Programmable Matter (CSG4PM), a compact description of an object and all the associated algorithms pre-processing and runtime. CSG4PM is compared to three existing solutions to describe a scene.
|
Year | DOI | Venue |
---|---|---|
2017 | 10.1145/3019612.3019706 | SAC 2017: Symposium on Applied Computing
Marrakech
Morocco
April, 2017 |
Field | DocType | ISBN |
Computer science,Constructive solid geometry,Distributed algorithm,Self-reconfiguring modular robot,Modular design,Programmable matter,Robot,Encoding (memory),Computation,Distributed computing | Conference | 978-1-4503-4486-9 |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Thadeu Tucci | 1 | 1 | 1.03 |
Piranda Benoit | 2 | 38 | 11.22 |
Bourgeois Julien | 3 | 403 | 63.53 |