Tessellated Biomes: Distributed Robotic Assemblies for Architectural Resilience

Robotic construction systems often treat the material system and the robot as separate design problems, locating intelligence primarily in hardware, sensing, motion planning, and control. This project instead investigates how geometric intelligence can be encoded within architected material systems to simultaneously address requirements for robotic grasping, self-alignment, reversible connection, structural performance, and three-dimensional aggregation. We introduce a self-aligning compound nested lattice module composed of conjoined cuboctahedral-octahedral units. The cuboctahedral features of the modules provide defined surfaces for robotic grasping and alignment, while the octahedral features incorporate screw-releasable snap-fit connectors and corresponding receptors. Additionally, we present a nested arrangement that enables interlocking aggregation along the x, y, and z axes. We demonstrate the system through furniture and architectural scale structures assembled using both a robotic arm and mobile assembler. The resulting configurations include seating, spanning structures, surfaces, and vertical frames. Compression testing of the compound module produced a stiffness of 4,556 N/mm, a maximum load of 3,445 N, and a compressive modulus of 17.5 MPa. The modules can also be disassembled and reused across different configurations, supporting reconfigurable and circular construction.

The tight coupling of subsystems in most robots, though a natural consequence of their complexity, leads to monolithic designs that are time-consuming and difficult to adapt after initial deployment. To address this challenge, we present a framework and supporting abstractions for recomposition during runtime that enable robots to quickly integrate previously unseen modular software, hardware, and compute payloads. Our approach allows non-expert users to quickly add new capabilities in the field through a true plug-and-play process. Crucially, new resources are not only immediately available to a host robot but are also shared with distributed peers, enabling compute-constrained systems to access powerful new remote capabilities. Our framework reduces reconfiguration time to a matter of minutes with no developer intervention, in stark contrast to the hours of expert effort often required for traditional manual integration. We demonstrate our method in two disaster response scenarios, including radioactive source localization at an operational nuclear reactor facility and a thermal-guided search for people in dark, difficult-to-reach spaces. These demonstrations show how in-field recomposition provides timely, flexible, and accessible adaptation to dynamic requirements, representing a critical step toward creating robots that can quickly evolve alongside the tasks, technologies, and environments they support.

In embodied cyber-physical systems, active cyberattacks pose an immediate threat not just to data, but to physical integrity and human safety. While existing security approaches excel at detection, they lack the runtime mechanisms to determine whether a disruption is tolerable or if performance degradation remains within safe operational bounds. This gap leaves autonomous systems vulnerable to graceful failure paralysis, where they cannot distinguish between a safe, degraded state and a catastrophic hazard during an ongoing attack. This paper presents RobResilience, an implementation of a formal resilience framework for embodied cyber-physical systems in a Webots simulation environment, using a PR2 robot and ROS2. The framework evaluates three predicates at runtime: tolerable disruption ($δ$), tolerable degradation ($γ$), and mitigation feasibility ($μ$), over a compromised device set derived from IDS confidence scores. When resilience is lost, the framework triggers available mitigation strategies. We evaluate our implementation through eight attack scenarios that systematically cover all possible combinations of the predicate state space, varying attack targets, degradation rates, and mitigation availability. Results confirm that the runtime behaviour of the implementation is consistent with the theoretical definitions.