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 simple robots | |
| Gmyr et al. | Forming tile shapes with a single robot | |
| Daymude et al. | Computing by programmable particles | |
| Fleischer et al. | Exploring an unknown graph efficiently | |
| Dieudonné et al. | How to meet asynchronously at polynomial cost | |
| Atallah et al. | Algorithms and theory of computation handbook, volume 2: special topics and techniques | |
| JP2009053849A (en) | Path search system, path search method, and autonomous traveling body | |
| Miller et al. | Tradeoffs between cost and information for rendezvous and treasure hunt | |
| Gorain et al. | Deterministic graph exploration with advice | |
| d’Angelo et al. | Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model | |
| Wang et al. | Pattern generation in cellular robotic systems | |
| Huang et al. | Detailed placement and global routing co-optimization with complex constraints | |
| Browne et al. | General board geometry | |
| 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 | |
| CN102819581A (en) | Method for generating polygonal chain with concentrated topology of geographic information system | |
| Gordon et al. | Hamiltonian walks of phylogenetic treespaces | |
| CN114442642B (en) | Path planning method, path planning device, computer equipment and storage medium | |
| Connor et al. | Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes | |
| Bereg et al. | On the robustness of a synchronized multi-robot system | |
| Derakhshandeh | Algorithmic Foundations of Self-Organizing Programmable Matter | |
| Jiang et al. | Selection expressions for procedural modeling | |
| Bampas et al. | Robustness of the rotor–router mechanism | |
| Yang et al. | Fault-tolerant pancyclicity of the Mobius cubes | |
| Doi et al. | Search by a metamorphic robotic system in a finite 2D square Grid |