🤖 AI Summary
To address the insufficient navigation robustness of snake-like robots under localization failure, this paper proposes BLISS: a risk-aware end-to-end task-and-motion planning (TAMP) framework integrating proprioceptive motion control with intermittent LiDAR scanning. The key contribution is the first equivalent reformulation of a risk-constrained hybrid partially observable Markov decision process (CC-HPOMDP) into a computationally tractable convex mixed-integer linear program (MILP), overcoming the historical-dependency-induced intractability inherent in conventional POMDP solvers. BLISS unifies chance-constrained modeling, MILP-based convex approximation, adaptive scanning scheduling, and unified TAMP optimization. Experimental validation on the EELS robotic platform demonstrates that BLISS achieves over a 10× speedup in planning time compared to state-of-the-art POMDP methods and reduces overall navigation time by more than 50% relative to traditional two-stage planning approaches.
📝 Abstract
Snake robots enable mobility through extreme terrains and confined environments in terrestrial and space applications. However, robust perception and localization for snake robots remain an open challenge due to the proximity of the sensor payload to the ground coupled with a limited field of view. To address this issue, we propose Blind-motion with Intermittently Scheduled Scans (BLISS) which combines proprioception-only mobility with intermittent scans to be resilient against both localization failures and collision risks. BLISS is formulated as an integrated Task and Motion Planning (TAMP) problem that leads to a Chance-Constrained Hybrid Partially Observable Markov Decision Process (CC-HPOMDP), known to be computationally intractable due to the curse of history. Our novelty lies in reformulating CC-HPOMDP as a tractable, convex Mixed Integer Linear Program. This allows us to solve BLISS-TAMP significantly faster and jointly derive optimal task-motion plans. Simulations and hardware experiments on the EELS snake robot show our method achieves over an order of magnitude computational improvement compared to state-of-the-art POMDP planners and $>$ 50% better navigation time optimality versus classical two-stage planners.