KCFRC: Kinematic Collision-Aware Foothold Reachability Criteria for Legged Locomotion

• URL: http://arxiv.org/abs/2602.20850v1
• Date: Tue, 24 Feb 2026 12:46:34 GMT
• Title: KCFRC: Kinematic Collision-Aware Foothold Reachability Criteria for Legged Locomotion
• Abstract summary: We introduce KCFRC, a novel approach for efficient foothold reachability analysis.<n>We show that KCFRC achieves remarkable time efficiency, completing foothold reachability checks for a single leg across 900 potential footholds in an average of 2 ms.<n>We show that KCFRC can accelerate trajectory optimization and is particularly beneficial for contact planning in confined spaces.
• Score: 17.651825410819313
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Legged robots face significant challenges in navigating complex environments, as they require precise real-time decisions for foothold selection and contact planning. While existing research has explored methods to select footholds based on terrain geometry or kinematics, a critical gap remains: few existing methods efficiently validate the existence of a non-collision swing trajectory. This paper addresses this gap by introducing KCFRC, a novel approach for efficient foothold reachability analysis. We first formally define the foothold reachability problem and establish a sufficient condition for foothold reachability. Based on this condition, we develop the KCFRC algorithm, which enables robots to validate foothold reachability in real time. Our experimental results demonstrate that KCFRC achieves remarkable time efficiency, completing foothold reachability checks for a single leg across 900 potential footholds in an average of 2 ms. Furthermore, we show that KCFRC can accelerate trajectory optimization and is particularly beneficial for contact planning in confined spaces, enhancing the adaptability and robustness of legged robots in challenging environments.

Related papers

• Occluding the Solution Space: Planner-Agnostic Adversarial Attacks on Tolerance-Aware Manipulation [57.9825059129472]
  We propose a planner-agnostic attack framework for tolerance-aware manipulation.<n>Our approach shifts the evaluation paradigm to task-level feasibility over goal regions.<n>Online, we formulate the attack as a budgeted maximum-coverage optimization.
  arXiv  Detail & Related papers  (2026-07-04T08:14:44Z)
• IMPACT: An Implicit Active-Set Augmented Lagrangian for Fast Contact-Implicit Trajectory Optimization [10.186515371403772]
  We develop an augmented-Lagrangian approach to CITO for solving MPCC-based CITO with stationarity guarantees.<n>We provide an efficient C++ implementation tailored to trajectory-optimization workloads and evaluate it on the open-source CITO and contact-implicit model predictive control (CI-MPC) benchmarks.
  arXiv  Detail & Related papers  (2026-05-09T19:19:05Z)
• Robust Spatiotemporal Motion Planning for Multi-Agent Autonomous Racing via Topological Gap Identification and Accelerated MPC [30.927534234540502]
  Current methods often oversimplify or abandon strict kinematic constraints.<n>We propose a Topological Identification and Accelerated MPC framework.<n>It reduces total maneuver time by 51.6% in sequential scenarios.<n>It consistently maintains an overtaking success rate exceeding 81% in dense bottlenecks.
  arXiv  Detail & Related papers  (2026-03-10T04:55:30Z)
• START: Traversing Sparse Footholds with Terrain Reconstruction [11.632418196552324]
  We propose START, a single-stage learning framework that enables agile, stable locomotion on highly sparse footholds.<n> START leverages only low-cost onboard vision and proprioception to accurately reconstruct local terrain heightmap.<n> Experimental results demonstrate that START achieves zero-shot transfer across diverse real-world scenarios.
  arXiv  Detail & Related papers  (2025-12-15T10:02:41Z)
• Monte Carlo Tree Search with Velocity Obstacles for safe and efficient motion planning in dynamic environments [49.30744329170107]
  We propose a novel approach for optimal online motion planning with minimal information about dynamic obstacles.<n>The proposed methodology combines Monte Carlo Tree Search (MCTS), for online optimal planning via model simulations, with Velocity Obstacles (VO), for obstacle avoidance.<n>We show the superiority of our methodology with respect to state-of-the-art planners, including Non-linear Model Predictive Control (NMPC), in terms of improved collision rate, computational and task performance.
  arXiv  Detail & Related papers  (2025-01-16T16:45:08Z)
• Gait Switching and Enhanced Stabilization of Walking Robots with Deep Learning-based Reachability: A Case Study on Two-link Walker [33.730544094391504]
  We are interested in designing a learning-based locomotion controller whose stability can be examined and guaranteed. This can be achieved by verifying regions of attraction (RoAs) of legged robots to their stable walking gaits.
  arXiv  Detail & Related papers  (2024-09-10T07:16:46Z)
• Aquatic Navigation: A Challenging Benchmark for Deep Reinforcement Learning [53.3760591018817]
  We propose a new benchmarking environment for aquatic navigation using recent advances in the integration between game engines and Deep Reinforcement Learning. Specifically, we focus on PPO, one of the most widely accepted algorithms, and we propose advanced training techniques. Our empirical evaluation shows that a well-designed combination of these ingredients can achieve promising results.
  arXiv  Detail & Related papers  (2024-05-30T23:20:23Z)
• On the Effective Usage of Priors in RSS-based Localization [56.68864078417909]
  We propose a Received Signal Strength (RSS) fingerprint and convolutional neural network-based algorithm, LocUNet. In this paper, we study the localization problem in dense urban settings. We first recognize LocUNet's ability to learn the underlying prior distribution of the Rx position or Rx and transmitter (Tx) association preferences from the training data, and attribute its high performance to these.
  arXiv  Detail & Related papers  (2022-11-28T00:31:02Z)
• Nonprehensile Riemannian Motion Predictive Control [57.295751294224765]
  We introduce a novel Real-to-Sim reward analysis technique to reliably imagine and predict the outcome of taking possible actions for a real robotic platform. We produce a closed-loop controller to reactively push objects in a continuous action space. We observe that RMPC is robust in cluttered as well as occluded environments and outperforms the baselines.
  arXiv  Detail & Related papers  (2021-11-15T18:50:04Z)
• Estimating the Robustness of Public Transport Systems Using Machine Learning [62.997667081978825]
  Planning public transport systems is a highly complex process involving many steps. Integrating robustness from a passenger's point of view makes the task even more challenging. In this paper, we explore a new way of such a scenario-based robustness approximation by using methods from machine learning.
  arXiv  Detail & Related papers  (2021-06-10T05:52:56Z)
• Higher Performance Visual Tracking with Dual-Modal Localization [106.91097443275035]
  Visual Object Tracking (VOT) has synchronous needs for both robustness and accuracy. We propose a dual-modal framework for target localization, consisting of robust localization suppressingors via ONR and the accurate localization attending to the target center precisely via OFC.
  arXiv  Detail & Related papers  (2021-03-18T08:47:56Z)
• STEP: Stochastic Traversability Evaluation and Planning for Safe Off-road Navigation [9.423950528323893]
  We propose an approach for assessing traversability and planning a safe, feasible, and fast trajectory in real-time. Our approach relies on: 1) rapid uncertainty-aware mapping and traversability evaluation, 2) tail risk assessment using the Conditional Value-at-Risk (CVaR), and 3) efficient risk and constraint-aware kinodynamic motion planning. We analyze our method in simulation and validate its efficacy on wheeled and legged robotic platforms exploring extreme terrains including an underground lava tube.
  arXiv  Detail & Related papers  (2021-03-04T04:24:19Z)
• An Efficient Paradigm for Feasibility Guarantees in Legged Locomotion [9.268363503343195]
  We present a paradigm that allows to design feasible Center of Mass (CoM) and body trajectories in an efficient manner. We propose a general formulation of the improved feasible region that guarantees dynamic balance alongside the satisfaction of both joint-torque and kinematic limits.
  arXiv  Detail & Related papers  (2020-11-16T13:58:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.