Gmyr et al., 2017 - Google Patents
Forming tile shapes with a single robotGmyr et al., 2017
View PDF- Document ID
- 16559905559492398115
- Author
- Gmyr R
- Kostitsyna I
- Kuhn F
- Scheideler C
- Strothmann T
- Publication year
- Publication venue
- 33rd European Workshop on Computational Geometry (EuroCG 2017)
External Links
Snippet
We investigate the problem of shape formation with robots on tiles in which a collection of robots has to rearrange a set of movable tiles to form a desired shape. In this preliminary work we consider the case of a single robot operating on an arbitrary number of tiles and …
- 230000015572 biosynthetic process 0 abstract description 15
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gmyr et al. | Forming tile shapes with a single robot | |
| Gmyr et al. | Forming tile shapes with simple robots | |
| Derakhshandeh et al. | Leader election and shape formation with self-organizing programmable matter | |
| Fleischer et al. | Exploring an unknown graph efficiently | |
| Daymude et al. | Computing by programmable particles | |
| Atallah et al. | Algorithms and theory of computation handbook, volume 2: special topics and techniques | |
| Kleinberg | On-line Search in a Simple Polygon. | |
| Das et al. | Map construction of unknown graphs by multiple agents | |
| Yoghourdjian et al. | High-quality ultra-compact grid layout of grouped networks | |
| Miller et al. | Tradeoffs between cost and information for rendezvous and treasure hunt | |
| Lee et al. | Structured triangulation in multi-robot systems: Coverage, patrolling, voronoi partitions, and geodesic centers | |
| Tang et al. | Computational design of steady 3D dissection puzzles | |
| Flocchini et al. | Size Optimal Strategies for Capturing an Intruder in Mesh Networks Ѓ | |
| Browne et al. | General board geometry | |
| Czyzowicz et al. | Building a nest by an automaton | |
| Wang | A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh | |
| Hoffmann et al. | Cellular automata rules solving the wireless sensor network coverage problem | |
| Karchmer et al. | A fast parallel algorithm to color a graph with Δ colors | |
| Sukhov et al. | Virtual Coordinate System Based on a Circulant Topology for Routing in Networks-On-Chip | |
| Sevilgen et al. | Parallel algorithms for tree accumulations | |
| Derakhshandeh | Algorithmic Foundations of Self-Organizing Programmable Matter | |
| Flocchini et al. | Network decontamination under m-immunity | |
| Yang et al. | Fault-tolerant pancyclicity of the Mobius cubes | |
| Chang et al. | Rectilinear duals using monotone staircase polygons | |
| Li et al. | Self-assembly planning of a shape by regular modular robots |