Author name cluster

Matthew Tesch

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

7 papers

1 author row

IROS Conference 2014 Conference Paper

Expensive multiobjective optimization for robotics with consideration of heteroscedastic noise

Ryo Ariizumi
Matthew Tesch
Howie Choset
Fumitoshi Matsuno

In many robotic problems, optimization of the policy for multiple conflicting criteria is required. However this is very challenging due to the existence of noise, which may be input dependent, or heteroscedastic, and the restriction in the number of evaluations, due to robotic experiments which are expensive in time and/or money. This paper presents a multiobjective optimization (MOO) algorithm for expensive-to-evaluate noisy functions for robotics. We present a method for model selection between heteroscedastic and standard homoscedastic Gaussian process regression techniques to create suitable surrogate functions from noisy samples and find the point to be observed at the next step. This algorithm is compared against an existing MOO algorithm which assumes homoscedastic noise, and is then used to optimize the speed and head stability of the sidewinding gait of a snake robot.

Details

IROS Conference 2014 Conference Paper

Snakes on an inclined plane: Learning an adaptive sidewinding motion for changing slopes

Chaohui Gong
Matthew Tesch
David Rollinson
Howie Choset

Sidewinding is an efficient gait adopted by biological and robotic snakes for locomoting on various terrains. The mechanics of this motion on flat ground and steady state terrains have been thoroughly investigated, while its capability to adapt to changing environments is not as well studied. We demonstrate the capability of a snake robot to automatically adjust gait parameters to optimally move up and down slopes of varying angle. This capability is achieved by three components. First, an efficient offline learning algorithm finds a policy mapping the estimated slope angle to the optimal gait parameters. Next, a robust online state estimation technique infers the local terrain characteristics. Finally, the precomputed policy is consulted online to select the optimal gait parameters for this slope. The efficacy of this approach is verified by robot experiments.

Details

ICML Conference 2013 Conference Paper

Expensive Function Optimization with Stochastic Binary Outcomes

Matthew Tesch
Jeff G. Schneider
Howie Choset

Real world systems often have parameterized controllers which can be tuned to improve performance. Bayesian optimization methods provide for efficient optimization of these controllers, so as to reduce the number of required experiments on the expensive physical system. In this paper we address Bayesian optimization in the setting where performance is only observed through a stochastic binary outcome – success or failure of the experiment. Unlike bandit problems, the goal is to maximize the system performance after this offline training phase rather than minimize regret during training. In this work we define the stochastic binary optimization problem and propose an approach using an adaptation of Gaussian Processes for classification that presents a Bayesian optimization framework for this problem. We propose an experiment selection metric for this setting based on expected improvement. We demonstrate the algorithm’s performance on synthetic problems and on a real snake robot learning to move over an obstacle.

Details

ICRA Conference 2013 Conference Paper

Expensive multiobjective optimization for robotics

Matthew Tesch
Jeff G. Schneider
Howie Choset

Many practical optimization problems in robotics involve multiple competing objectives - from design trade-offs to performance metrics of the physical system such as speed and energy efficiency. Proper treatment of these objective functions, while commonplace in fields such as economics, is often overlooked in robotics. Additionally, optimization of the performance of robotic systems can be restricted due to the expensive nature of testing control parameters on a physical system. This paper presents a multi-objective optimization (MOO) algorithm for expensive-to-evaluate functions that generates a Pareto set of solutions. This algorithm is compared against another leading MOO algorithm, and then used to optimize the speed and head stability of the sidewinding gait for a snake robot.

Details

ICRA Conference 2012 Conference Paper

Design and architecture of the unified modular snake robot

Cornell Wright III
Austin D. Buchan
Ben Brown
Jason Geist
Michael Schwerin
David Rollinson
Matthew Tesch
Howie Choset

The design of a hyper-redundant serial-linkage snake robot is the focus of this paper. The snake, which consists of many fully enclosed actuators, incorporates a modular architecture. In our design, which we call the Unified Snake, we consider size, weight, power, and speed tradeoffs. Each module includes a motor and gear train, an SMA wire actuated bistable brake, custom electronics featuring several different sensors, and a custom intermodule connector. In addition to describing the Unified Snake modules, we also discuss the specialized head and tail modules on the robot and the software that coordinates the motion.

Details

IROS Conference 2011 Conference Paper

Adapting control policies for expensive systems to changing environments

Matthew Tesch
Jeff G. Schneider
Howie Choset

Many controlled systems must operate over a range of external conditions. In this paper, we focus on the problem of learning a policy to adapt a system's controller based on the value of these external conditions in order to always perform well (i. e. , maximize system output). In addition, we are concerned with systems for which it is expensive to run experiments, and therefore restrict the number that can be run during training. We formally define the problem setup and the notion of an optimal control policy. We propose two algorithms which aim to find such a policy while minimizing the number of system output evaluations. We present results comparing these algorithms and various other approaches and discuss the inherent tradeoffs in the proposed algorithms. Finally, we use these methods to train both simulated and physical snake robots to automatically adapt to changing terrain, and demonstrate improved performance on test courses with changing environments.

Details

IROS Conference 2011 Conference Paper

Using response surfaces and expected improvement to optimize snake robot gait parameters

Matthew Tesch
Jeff G. Schneider
Howie Choset

Several categories of optimization problems suffer from expensive objective function evaluation, driving the need for smart selection of subsequent experiments. One such category of problems involves physical robotic systems, which often require significant time, effort, and monetary expenditure in order to run tests. To assist in the selection of the next experiment, there has been a focus on the idea of response surfaces in recent years. These surfaces interpolate the existing data and provide a measure of confidence in their error, serving as a low-fidelity surrogate function that can be used to more intelligently choose the next experiment. In this paper, we robustly implement a previous algorithm based on the response surface methodology with an expected improvement criteria. We apply this technique to optimize open-loop gait parameters for snake robots, and demonstrate improved locomotive capabilities.

Details