Bounding on rough terrain with the LittleDog robot

  • Authors:

  • Alexander Shkolnik;Michael Levashov;Ian R. Manchester;Russ Tedrake

  • Affiliations:

  • Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA;Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA;Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA;Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA

  • Venue:
  • International Journal of Robotics Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled as a planar five-link system, with a 16-dimensional state space; computing a plan over rough terrain in this high-dimensional state space that respects the kinodynamic constraints due to underactuation and motor limits is extremely challenging. Rapidly Exploring Random Trees (RRTs) are known for fast kinematic path planning in high-dimensional configuration spaces in the presence of obstacles, but search efficiency degrades rapidly with the addition of challenging dynamics. A computationally tractable planner for bounding was developed by modifying the RRT algorithm by using: (1) motion primitives to reduce the dimensionality of the problem; (2) Reachability Guidance, which dynamically changes the sampling distribution and distance metric to address differential constraints and discontinuous motion primitive dynamics; and (3) sampling with a Voronoi bias in a lower-dimensional â聙聹task spaceâ聙聺 for bounding. Short trajectories were demonstrated to work on the robot, however open-loop bounding is inherently unstable. A feedback controller based on transverse linearization was implemented, and shown in simulation to stabilize perturbations in the presence of noise and time delays.