Risk-aware Integrated Task and Motion Planning for Versatile Snake Robots under Localization Failures

📅 2025-02-27
📈 Citations: 0
Influential: 0
📄 PDF
🤖 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.

Technology Category

Application Category

📝 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.
Problem

Research questions and friction points this paper is trying to address.

Risk-aware task and motion planning
Localization failures in snake robots
Convex Mixed Integer Linear Program
Innovation

Methods, ideas, or system contributions that make the work stand out.

BLISS combines proprioception with scans
Reformulated CC-HPOMDP as convex MILP
Achieves significant computational speed improvement
🔎 Similar Papers
No similar papers found.
Ashkan Jasour
Ashkan Jasour
NASA, MIT
Probabilistic PlanningProbabilistic OptimizationRisk-Aware AutonomyRisk-Aware AI
Guglielmo Daddi
Guglielmo Daddi
Politecnico di Torino
Masafumi Endo
Masafumi Endo
Research Scientist, CyberAgent AI Lab
roboticsmotion planningmachine learning
T
Tiago S. Vaquero
Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91109, United States
Michael Paton
Michael Paton
Jet Propulsion Laboratory
Field RoboticsComputer VisionLocalizationMappingAutonomous Route Following
M
Marlin P. Strub
Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91109, United States
S
Sabrina Corpino
Politecnico di Torino, Corso Duca degli Abruzzi 24, TO 10129, Italy
M
Michel Ingham
Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91109, United States
Masahiro Ono
Masahiro Ono
Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91109, United States
Rohan Thakker
Rohan Thakker
Roboticist, Nasa-JPL
Motion PlanningControlsPlanning under Uncertainty