Computer Science – Computational Geometry
Scientific paper
2011-04-19
Computer Science
Computational Geometry
13 pages, 3 figures
Scientific paper
In this paper we present algorithms for collective construction systems in which a large number of autonomous mobile robots trans- port modular building elements to construct a desired structure. We focus on building block structures subject to some physical constraints that restrict the order in which the blocks may be attached to the structure. Specifically, we determine a partial ordering on the blocks such that if they are attached in accordance with this ordering, then (i) the structure is a single, connected piece at all intermediate stages of construction, and (ii) no block is attached between two other previously attached blocks, since such a space is too narrow for a robot to maneuver a block into it. Previous work has consider this problem for building 2D structures without holes. Here we extend this work to 2D structures with holes. We accomplish this by modeling the problem as a graph orientation problem and describe an O(n^2) algorithm for solving it. We also describe how this partial ordering may be used in a distributed fashion by the robots to coordinate their actions during the building process.
Fitzsimmons Zachary
Flatland Robin
No associations
LandOfFree
Collective Construction of 2D Block Structures with Holes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Collective Construction of 2D Block Structures with Holes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collective Construction of 2D Block Structures with Holes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-183899