Carnegie Mellon Robotics Institute
Ravi Balasubramanian and Tucker Balch
tech. report CMU-RI-TR-02-17, Robotics Institute, Carnegie Mellon University, July, 2002
| Download |
|
| Abstract |
| We present a method for computing energy optimal trajectories for an overactuated wheeled robot under quasistatic conditions, enabling it to climb over discontinuous terrain. The trajectories can be arbitrarily close to optimal with respect to energy, depending on available computing resources. We apply our approach to control the Goes-Over-All-Terrain (GOAT) vehicle. The GOAT has four active wheels connected by four separate lever arms to the robot's body, giving it significant mechanical ability. Our approach is to define a continuous space of possible robot configurations as well as discrete actions that carry the robot through the space. When initial and goal states are specified, a classical A.I. planning algorithm can be applied to find a sequence of actions to reach the goal configuration. A thorough analysis of the stability of the robot is done along with a comparison of time-optimal and energy-optimal trajectories. We also compute the minimum required coefficient of friction along the path. The approach is demonstrated in a two-dimensional simulation, applied to several challenging terrain problems. |
| Notes |
Associated Center(s) / Consortia:
Center for the Foundations of Robotics Associated Lab(s) / Group(s):
Manipulation Lab |
| Text Reference |
| Ravi Balasubramanian and Tucker Balch, "Energy-Optimal Trajectories for Overactuated Robots," tech. report CMU-RI-TR-02-17, Robotics Institute, Carnegie Mellon University, July, 2002 |
| BibTeX Reference |
|
@techreport{Balasubramanian_2002_4039, author = "Ravi Balasubramanian and Tucker Balch", title = "Energy-Optimal Trajectories for Overactuated Robots", booktitle = "", institution = "Robotics Institute", month = "July", year = "2002", number= "CMU-RI-TR-02-17", address= "Pittsburgh, PA", } |
| The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University. Contact Us | Update Instructions |