Research / EXP-02

Graph-based post-failure reconfiguration

Interactive prototype: damage changes the feasible state graph, and recovery becomes a path-search problem rather than a return to the nominal configuration.

EXP-02interactive prototype
Experiment at a glance

Experiment at a glance

01

Formal object

Nodes represent stable operating states under the current residual-resource vector, not arbitrary configuration labels.

02

Damage

The synthetic scenario removes actuator A2 permanently. The nominal node becomes unavailable in the post-damage feasible graph.

03

Admissibility

A(ρ) states whether a direct transition is allowed. C(ρ) carries normalized transition burden: time, energy, transient risk and additional degradation.

04

Search

Starting from the certified capture state V1, graph search minimizes path cost while terminal mission utility Φ competes through J(v).

05

Selected route

The prototype computes qf → V1 → V2 → V4. V4 is the best safely reachable terminal state, not the original nominal state.

06

Result

For the declared synthetic weights, V4 has Φ=0.84, path cost 0.36 and J=0.72. The experiment demonstrates the decision structure, not physical validation.

MODEL / TRACE

Formal trace

\[ \rho_d \Rightarrow G(\rho_d) \Rightarrow A(\rho_d),C(\rho_d) \Rightarrow \pi^*=(V_1,V_2,V_4) \Rightarrow V_4. \]
ARTEFACTS

Evidence & reproducibility

Raw data, code and audit artefacts remain directly inspectable for reproducibility and independent checking.