Algorithmic Approaches to Reconfigurable Assembly Systems
Allan Costa, Benjamin Jenett, Irina Kostitsyna, Amira Abdel-Rahman,, Neil Gershenfeld, Kenneth Cheung

TL;DR
This paper explores algorithmic strategies for reconfiguring large-scale space structures using robotics, analyzing different computational paradigms and their impact on scalability, efficiency, and fault tolerance in in-space assembly.
Contribution
It introduces new graph-based abstractions and compares centralized and distributed algorithms for space structure reconfiguration, providing design recommendations.
Findings
Algorithms vary in efficiency for different objectives
Distributed algorithms improve fault tolerance
Design trade-offs impact scalability and performance
Abstract
Assembly of large scale structural systems in space is understood as critical to serving applications that cannot be deployed from a single launch. Recent literature proposes the use of discrete modular structures for in-space assembly and relatively small scale robotics that are able to modify and traverse the structure. This paper addresses the algorithmic problems in scaling reconfigurable space structures built through robotic construction, where reconfiguration is defined as the problem of transforming an initial structure into a different goal configuration. We analyze different algorithmic paradigms and present corresponding abstractions and graph formulations, examining specialized algorithms that consider discretized space and time steps. We then discuss fundamental design trades for different computational architectures, such as centralized versus distributed, and present two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
