Deterministic 4D Spacetime Geodesic Planning on Hypercomplex Toroidal Manifolds
Dynamic obstacle avoidance and 4D spacetime pathfinding present severe computational bottlenecks in autonomous robotics. Classical time-expanded graph architectures (e.g., Space-Time A*) suffer from catastrophic state explosion O(|V| x T_horizon), exhausting memory over extended planning horizons. Local continuous opti...