### Abstract

We study the problem of computing an exact motion plan for the snakeboard by exploiting its kinematic controllability properties and its decoupling vector fields. Decoupling vector fields allow us to treat the underactuated dynamic system as a kinematic one, and rest-to-rest paths are the concatenation of integral curves of the decoupling vector fields. These paths can then be time-scaled according to actuator limits to yield fast trajectories. Switches between decoupling vector fields must occur at zero velocity, so to find fast trajectories, we wish to find paths minimizing the number of switches. In this paper we solve the minimum switch path planning problem for the snakeboard. We consider two problems: (1) finding motion plans achieving a desired position and orientation of the body of the snakeboard, and (2) the full problem of motion planning for all five configuration variables of the snakeboard. The first problem is solvable in closed form by geometric considerations, while the second problem is solved by a numerical approach with guaranteed convergence. We present a complete characterization of the snakeboard's optimal paths in terms of the number of switches.

Original language | English (US) |
---|---|

Pages | 1437-1443 |

Number of pages | 7 |

State | Published - Dec 26 2003 |

Event | 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems - Las Vegas, NV, United States Duration: Oct 27 2003 → Oct 31 2003 |

### Other

Other | 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems |
---|---|

Country | United States |

City | Las Vegas, NV |

Period | 10/27/03 → 10/31/03 |

### Fingerprint

### ASJC Scopus subject areas

- Control and Systems Engineering
- Software
- Computer Vision and Pattern Recognition
- Computer Science Applications

### Cite this

*Exact Minimum Control Switch Motion Planning for the Snakeboard*. 1437-1443. Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States.

}

**Exact Minimum Control Switch Motion Planning for the Snakeboard.** / Iannitti, Stefano; Lynch, Kevin M.

Research output: Contribution to conference › Paper

TY - CONF

T1 - Exact Minimum Control Switch Motion Planning for the Snakeboard

AU - Iannitti, Stefano

AU - Lynch, Kevin M

PY - 2003/12/26

Y1 - 2003/12/26

N2 - We study the problem of computing an exact motion plan for the snakeboard by exploiting its kinematic controllability properties and its decoupling vector fields. Decoupling vector fields allow us to treat the underactuated dynamic system as a kinematic one, and rest-to-rest paths are the concatenation of integral curves of the decoupling vector fields. These paths can then be time-scaled according to actuator limits to yield fast trajectories. Switches between decoupling vector fields must occur at zero velocity, so to find fast trajectories, we wish to find paths minimizing the number of switches. In this paper we solve the minimum switch path planning problem for the snakeboard. We consider two problems: (1) finding motion plans achieving a desired position and orientation of the body of the snakeboard, and (2) the full problem of motion planning for all five configuration variables of the snakeboard. The first problem is solvable in closed form by geometric considerations, while the second problem is solved by a numerical approach with guaranteed convergence. We present a complete characterization of the snakeboard's optimal paths in terms of the number of switches.

AB - We study the problem of computing an exact motion plan for the snakeboard by exploiting its kinematic controllability properties and its decoupling vector fields. Decoupling vector fields allow us to treat the underactuated dynamic system as a kinematic one, and rest-to-rest paths are the concatenation of integral curves of the decoupling vector fields. These paths can then be time-scaled according to actuator limits to yield fast trajectories. Switches between decoupling vector fields must occur at zero velocity, so to find fast trajectories, we wish to find paths minimizing the number of switches. In this paper we solve the minimum switch path planning problem for the snakeboard. We consider two problems: (1) finding motion plans achieving a desired position and orientation of the body of the snakeboard, and (2) the full problem of motion planning for all five configuration variables of the snakeboard. The first problem is solvable in closed form by geometric considerations, while the second problem is solved by a numerical approach with guaranteed convergence. We present a complete characterization of the snakeboard's optimal paths in terms of the number of switches.

UR - http://www.scopus.com/inward/record.url?scp=0347409508&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347409508&partnerID=8YFLogxK

M3 - Paper

SP - 1437

EP - 1443

ER -