An Efficient Paradigm for Feasibility Guarantees in Legged Locomotion

• URL: http://arxiv.org/abs/2011.07967v2
• Date: Tue, 30 May 2023 21:38:42 GMT
• Title: An Efficient Paradigm for Feasibility Guarantees in Legged Locomotion
• Abstract summary: 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.
• Score: 9.268363503343195
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Developing feasible body trajectories for legged systems on arbitrary terrains is a challenging task. In this paper, we present a paradigm that allows to design feasible Center of Mass (CoM) and body trajectories in an efficient manner. In our previous work [1], we introduced the notion of the 2D feasible region, where static balance and the satisfaction of joint torque limits were guaranteed, whenever the projection of the CoM lied inside the proposed admissible region. In this work we propose a general formulation of the improved feasible region that guarantees dynamic balance alongside the satisfaction of both joint-torque and kinematic limits in an efficient manner. To incorporate the feasibility of the kinematic limits, we introduce an algorithm that computes the reachable region of the CoM. Furthermore, we propose an efficient planning strategy that utilizes the improved feasible region to design feasible CoM and body orientation trajectories. Finally, we validate the capabilities of the improved feasible region and the effectiveness of the proposed planning strategy, using simulations and experiments on the 90 kg Hydraulically actuated Quadruped (HyQ) and the 21 kg Aliengo robots.

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)
• Bi-Level Optimization for Contact and Motion Planning in Rope-Assisted Legged Robots [3.6606977710467326]
  The proposed framework is formulated as a bi-level optimization scheme that addresses a mixed-integer problem.<n>The outer level of the optimization is solved using the Cross-Entropy Method, while the inner level relies on gradient-based nonlinear optimization.<n>The approach is validated on a novel climbing robot platform, ALPINE, across a variety of challenging terrain configurations.
  arXiv  Detail & Related papers  (2026-04-29T17:18:29Z)
• Path Planning and Reinforcement Learning-Driven Control of On-Orbit Free-Flying Multi-Arm Robots [1.0688341355376219]
  This paper presents a hybrid approach that integrates trajectory optimization (TO) and reinforcement learning (RL) for motion planning and control of free-flying multi-arm robots in on-orbit servicing scenarios.<n>The multi-arm robot design, equipped with thrusters for precise body control, enables redundancy and stability in complex space operations.
  arXiv  Detail & Related papers  (2026-03-24T13:31:32Z)
• Two-Stage Path Following for Mobile Manipulators via Dimensionality-Reduced Graph Search and Numerical Optimization [13.862491697262037]
  Efficient path following for mobile manipulators is often hindered by high-dimensional configuration spaces and kinematic constraints.<n>This paper presents a robust two-stage configuration planning framework that decouples the 8-DoF planning problem into a tractable 2-DoF base optimization.
  arXiv  Detail & Related papers  (2026-03-07T02:54:02Z)
• KCFRC: Kinematic Collision-Aware Foothold Reachability Criteria for Legged Locomotion [17.651825410819313]
  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.
  arXiv  Detail & Related papers  (2026-02-24T12:46:34Z)
• Boosting Fine-Grained Urban Flow Inference via Lightweight Architecture and Focalized Optimization [35.11698882937702]
  We propose a unified solution that synergizes architectural efficiency with adaptive optimization.<n>PLGF is a lightweight yet powerful architecture that employs a Progressive Local-Global Fusion strategy.<n>DualFocal Loss is a novel function that integrates dual-space supervision with a difficulty-aware focusing mechanism.
  arXiv  Detail & Related papers  (2025-11-10T13:38:26Z)
• The Maximum Coverage Model and Recommendation System for UAV Vertiports Location Planning [2.682861958273189]
  Cities like Shenzhen are planning large-scale vertiport networks (e.g., 1,200+ facilities by 2026)<n>Existing planning frameworks remain inadequate for this complexity due to historical limitations in data granularity and real-world applicability.<n>This paper proposes a novel optimization framework that simultaneously models urban-scale spatial-temporal demand, heterogeneous user behaviors, and infrastructure capacity constraints.
  arXiv  Detail & Related papers  (2025-08-18T06:31:08Z)
• HOTA: Hamiltonian framework for Optimal Transport Advection [4.964231749898419]
  We present Hamiltonian Optimal Transport Advection (HOTA), a Hamilton-Jacobi-Bellman based method that tackles the dual dynamical OT problem explicitly.<n>Our approach effectively evades the need for explicit density modeling, performing even when the cost functionals are non-smooth.<n> Empirically, HOTA outperforms all baselines in standard benchmarks, as well as in custom datasets with non-differentiable costs.
  arXiv  Detail & Related papers  (2025-07-23T13:51:06Z)
• ReCoM: Realistic Co-Speech Motion Generation with Recurrent Embedded Transformer [58.49950218437718]
  We present ReCoM, an efficient framework for generating high-fidelity and generalizable human body motions synchronized with speech.<n>The core innovation lies in the Recurrent Embedded Transformer (RET), which integrates Dynamic Embedding Regularization (DER) into a Vision Transformer (ViT) core architecture.<n>To enhance model robustness, we incorporate the proposed DER strategy, which equips the model with dual capabilities of noise resistance and cross-domain generalization.
  arXiv  Detail & Related papers  (2025-03-27T16:39:40Z)
• Towards Autonomous Experimentation: Bayesian Optimization over Problem Formulation Space for Accelerated Alloy Development [0.31457219084519]
  We introduce a novel framework that leverages Bayesian optimization over a problem formulation space to identify optimal design formulations. We demonstrate the efficacy of our method through an in silico case study on a Mo-Nb-Ti-V-W alloy system targeted for gas turbine engine blade applications. Future work will incorporate human feedback to further enhance the adaptability of the system in real-world experimental settings.
  arXiv  Detail & Related papers  (2025-02-09T01:05:58Z)
• Physics-Constrained Generative Artificial Intelligence for Rapid Takeoff Trajectory Design [0.0]
  This work proposes physics-constrained generative adversarial networks (physicsGAN) to intelligently parameterize the takeoff control profiles of an eVTOL aircraft. The physicsGAN generated only feasible control profiles of power and wing angle in the feasible space with around 98.9% of designs satisfying all constraints. According to the literature review, this is the first physics-constrained generative artificial intelligence enabled by surrogate models.
  arXiv  Detail & Related papers  (2025-01-07T00:15:04Z)
• DeSiRe-GS: 4D Street Gaussians for Static-Dynamic Decomposition and Surface Reconstruction for Urban Driving Scenes [71.61083731844282]
  We present DeSiRe-GS, a self-supervised gaussian splatting representation. It enables effective static-dynamic decomposition and high-fidelity surface reconstruction in complex driving scenarios.
  arXiv  Detail & Related papers  (2024-11-18T05:49:16Z)
• Potential Based Diffusion Motion Planning [73.593988351275]
  We propose a new approach towards learning potential based motion planning. We train a neural network to capture and learn an easily optimizable potentials over motion planning trajectories. We demonstrate its inherent composability, enabling us to generalize to a multitude of different motion constraints.
  arXiv  Detail & Related papers  (2024-07-08T17:48:39Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Integrating Higher-Order Dynamics and Roadway-Compliance into Constrained ILQR-based Trajectory Planning for Autonomous Vehicles [3.200238632208686]
  Trajectory planning aims to produce a globally optimal route for Autonomous Passenger Vehicles. Existing implementations utilizing the vehicle bicycle kinematic model may not guarantee controllable trajectories. We augment this model by higher-order terms, including the first and second-order derivatives of curvature and longitudinal jerk.
  arXiv  Detail & Related papers  (2023-09-25T22:30:18Z)
• A Unifying Variational Framework for Gaussian Process Motion Planning [44.332875416815384]
  We introduce a framework for robot motion planning based on variational Gaussian processes. Our framework provides a principled and flexible way to incorporate equality-based, inequality-based, and soft motion-planning constraints. Results show that our proposed approach yields a good balance between success rates and path quality.
  arXiv  Detail & Related papers  (2023-09-02T07:51:29Z)
• Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation [84.0621253654014]
  We propose a framework, called BALLET, which adaptively filters for a high-confidence region of interest. We show theoretically that BALLET can efficiently shrink the search space, and can exhibit a tighter regret bound than standard BO.
  arXiv  Detail & Related papers  (2023-07-25T09:45:47Z)
• Dynamic Neighborhood Construction for Structured Large Discrete Action Spaces [2.285821277711785]
  Large discrete action spaces (LDAS) remain a central challenge in reinforcement learning. Existing solution approaches can handle unstructured LDAS with up to a few million actions. We propose Dynamic Neighborhood Construction (DNC), a novel exploitation paradigm for SLDAS.
  arXiv  Detail & Related papers  (2023-05-31T14:26:14Z)
• Leveraging Scene Embeddings for Gradient-Based Motion Planning in Latent Space [24.95320093765214]
  AMP-LS is able to plan in novel, complex scenes while outperforming traditional planning baselines in terms of speed by an order of magnitude. We show that the resulting system is fast enough to enable closed-loop planning in real-world dynamic scenes.
  arXiv  Detail & Related papers  (2023-03-06T18:49:39Z)
• Reinforcement Learning with Prior Policy Guidance for Motion Planning of Dual-Arm Free-Floating Space Robot [11.272278713797537]
  We propose a novel algorithm, Efficient, to facilitate RL-based methods to improve planning accuracy efficiently. Our core contributions are constructing a mixed policy with prior knowledge guidance and introducing infinite norm to build a more reasonable reward function.
  arXiv  Detail & Related papers  (2022-09-03T14:20:17Z)
• Learning Space Partitions for Path Planning [54.475949279050596]
  PlaLaM outperforms existing path planning methods in 2D navigation tasks, especially in the presence of difficult-to-escape local optima. These gains transfer to highly multimodal real-world tasks, where we outperform strong baselines in compiler phase ordering by up to 245% and in molecular design by up to 0.4 on properties on a 0-1 scale.
  arXiv  Detail & Related papers  (2021-06-19T18:06:11Z)
• Path Planning Followed by Kinodynamic Smoothing for Multirotor Aerial Vehicles (MAVs) [61.94975011711275]
  We propose a geometrically based motion planning technique textquotedblleft RRT*textquotedblright; for this purpose. In the proposed technique, we modified original RRT* introducing an adaptive search space and a steering function. We have tested the proposed technique in various simulated environments.
  arXiv  Detail & Related papers  (2020-08-29T09:55:49Z)

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.