ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2011.09772
  4. Cited By
Solving Footstep Planning as a Feasibility Problem using L1-norm
  Minimization (Extended Version)

Solving Footstep Planning as a Feasibility Problem using L1-norm Minimization (Extended Version)

19 November 2020
Daeun Song
Pierre Fernbach
T. Flayols
Andrea Del Prete
Nicolas Mansard
Steve Tonneau
Young J. Kim
ArXivPDFHTML

Papers citing "Solving Footstep Planning as a Feasibility Problem using L1-norm Minimization (Extended Version)"

1 / 1 papers shown
Title
Dynamic Bipedal MPC with Foot-level Obstacle Avoidance and Adjustable Step Timing
Dynamic Bipedal MPC with Foot-level Obstacle Avoidance and Adjustable Step Timing
Tianze Wang
Christian Hubicki
27
0
0
19 May 2025
1