Decoupled Kinodynamic Planning for a Quadruped Robot over Complex Terrain
High-level planning for hybrid-dynamic, legged systems can be challenging due to a need to simultaneously satisfy kinematic and dynamic constraints. Previously developed sampling-based approaches can rapidly generate plans that satisfy kinematic constraints, but often lead to dynamically infeasible...
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis |
| 出版: |
Massachusetts Institute of Technology
2023
|
| 在線閱讀: | https://hdl.handle.net/1721.1/151851 |
| _version_ | 1826200838973947904 |
|---|---|
| author | Burgess, Michael |
| author2 | Kim, Sangbae |
| author_facet | Kim, Sangbae Burgess, Michael |
| author_sort | Burgess, Michael |
| collection | MIT |
| description | High-level planning for hybrid-dynamic, legged systems can be challenging due to a need to simultaneously satisfy kinematic and dynamic constraints. Previously developed sampling-based approaches can rapidly generate plans that satisfy kinematic constraints, but often lead to dynamically infeasible trajectories. On the other hand, traditional optimization-based approaches can reliably produce feasible trajectories, but are computationally inefficient. In this work, we leverage the strengths of these popular techniques to develop an advantageous novel motion planning formulation. Our methodology decouples kinematic and dynamic constraints to quickly generate emergent, feasible trajectories for legged systems across complex terrains. We decouple constraints into two separate processes. First, we rapidly sample footstep positions across a given terrain using an RRT-like search algorithm. This allows us to satisfy kinematic constraints without committing to a full state trajectory which could be dynamically infeasible, as is a common failure of other sampling-based approaches. Then, we can solve an optimization problem to generate a dynamically feasible trajectory using these contact positions. Since contact locations have already been determined, our optimization problem has a reduced decision space and does not require inconvenient complementarity constraints. As a result, this optimization can be solved more efficiently than traditional trajectory optimization formulations. Implemented in simulation for a 2D quadruped robot, our novel formulation is shown to generate trajectories in less than 15\% of the computation time needed for traditional, coupled planning methods. Furthermore, experiments demonstrate that our method maintains a consistent average solve time across sets of randomly generated terrains, regardless of their complexity. |
| first_indexed | 2024-09-23T11:42:33Z |
| format | Thesis |
| id | mit-1721.1/151851 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T11:42:33Z |
| publishDate | 2023 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1518512023-08-24T03:33:39Z Decoupled Kinodynamic Planning for a Quadruped Robot over Complex Terrain Burgess, Michael Kim, Sangbae Massachusetts Institute of Technology. Department of Mechanical Engineering High-level planning for hybrid-dynamic, legged systems can be challenging due to a need to simultaneously satisfy kinematic and dynamic constraints. Previously developed sampling-based approaches can rapidly generate plans that satisfy kinematic constraints, but often lead to dynamically infeasible trajectories. On the other hand, traditional optimization-based approaches can reliably produce feasible trajectories, but are computationally inefficient. In this work, we leverage the strengths of these popular techniques to develop an advantageous novel motion planning formulation. Our methodology decouples kinematic and dynamic constraints to quickly generate emergent, feasible trajectories for legged systems across complex terrains. We decouple constraints into two separate processes. First, we rapidly sample footstep positions across a given terrain using an RRT-like search algorithm. This allows us to satisfy kinematic constraints without committing to a full state trajectory which could be dynamically infeasible, as is a common failure of other sampling-based approaches. Then, we can solve an optimization problem to generate a dynamically feasible trajectory using these contact positions. Since contact locations have already been determined, our optimization problem has a reduced decision space and does not require inconvenient complementarity constraints. As a result, this optimization can be solved more efficiently than traditional trajectory optimization formulations. Implemented in simulation for a 2D quadruped robot, our novel formulation is shown to generate trajectories in less than 15\% of the computation time needed for traditional, coupled planning methods. Furthermore, experiments demonstrate that our method maintains a consistent average solve time across sets of randomly generated terrains, regardless of their complexity. S.B. 2023-08-23T16:13:28Z 2023-08-23T16:13:28Z 2023-06 2023-07-18T16:17:17.883Z Thesis https://hdl.handle.net/1721.1/151851 In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology |
| spellingShingle | Burgess, Michael Decoupled Kinodynamic Planning for a Quadruped Robot over Complex Terrain |
| title | Decoupled Kinodynamic Planning for a Quadruped Robot
over Complex Terrain |
| title_full | Decoupled Kinodynamic Planning for a Quadruped Robot
over Complex Terrain |
| title_fullStr | Decoupled Kinodynamic Planning for a Quadruped Robot
over Complex Terrain |
| title_full_unstemmed | Decoupled Kinodynamic Planning for a Quadruped Robot
over Complex Terrain |
| title_short | Decoupled Kinodynamic Planning for a Quadruped Robot
over Complex Terrain |
| title_sort | decoupled kinodynamic planning for a quadruped robot over complex terrain |
| url | https://hdl.handle.net/1721.1/151851 |
| work_keys_str_mv | AT burgessmichael decoupledkinodynamicplanningforaquadrupedrobotovercomplexterrain |