Kevin M. Lynch

Solmaz S. Kia, Bryan Van Scoy, Jorge Cortes et al.

This paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents. This problem consists of designing a distributed algorithm that enables a group of agents with communication and computation capabilities to use local interactions to track the average of locally time-varying reference signals at each agent. The objective of this article is to provide an overview of the dynamic average consensus problem that serves as a comprehensive introduction to the problem definition, its applications, and the distributed methods available to solve them. Our primary intention, rather than providing a full account of all the available literature, is to introduce the reader, in a tutorial fashion, to the main ideas behind dynamic average consensus algorithms, the performance trade-offs considered in their design, and the requirements needed for their analysis and convergence guarantees.

J. Zachary Woodruff, Kevin M. Lynch

We define "robotic contact juggling" to be the purposeful control of the motion of a three-dimensional smooth object as it rolls freely on a motion-controlled robot manipulator, or "hand." While specific examples of robotic contact juggling have been studied before, in this paper we provide the first general formulation and solution method for the case of an arbitrary smooth object in single-point rolling contact on an arbitrary smooth hand. Our formulation splits the problem into four subproblems: (1) deriving the second-order rolling kinematics; (2) deriving the three-dimensional rolling dynamics; (3) planning rolling motions that satisfy the rolling dynamics; and (4) feedback stabilization of planned rolling trajectories. The theoretical results are demonstrated in simulation and experiment using feedback from a high-speed vision system.

Nelson Rosa, Kevin M. Lynch

This paper describes a topological approach to generating families of open- and closed-loop walking gaits for underactuated 2D and 3D biped walkers subject to configuration inequality constraints, physical holonomic constraints (e.g.,closed-loop linkages), and virtual holonomic constraints (user-defined constraints enforced through feedback control). Our method constructs implicitly-defined manifolds of feasible periodic gaits within a state-time-control space that parameterizes the biped's hybrid trajectories. Since equilibrium configurations of the biped often belong to such manifolds, we use equilibria as "templates" from which to grow the gait families. Equilibria are reliable seeds for the construction of gait families, eliminating the need for random, intuited, or bio-inspired initial guesses at feasible trajectories in an optimization framework. We demonstrate the approach on several 2D and 3D biped walkers.

Jian Shi, Kevin M. Lynch

We investigate in-hand regrasping by pushing an object against an external constraint and allowing sliding at the fingertips. Each fingertip is modeled as attached to a multidimensional spring mounted to a position-controlled anchor. Spring compliance maps contact forces to spring compressions, ensuring the fingers remain in contact, and sliding "compliance" governs the relationship between sliding motions and tangential contact forces. A spring-sliding compliant regrasp is achieved by controlling the finger anchor motions. We derive the fingertip sliding mechanics for multifingered sliding regrasps and analyze robust regrasping conditions in the presence of finger contact wrench uncertainties. The results are verified in simulation and experiment with a two-fingered sliding regrasp designed to maximize robustness of the operation.

Daniel J. Lynch, Kevin M. Lynch, Paul B. Umbanhowar

Enabling robots to walk and run on yielding terrain is increasingly vital to endeavors ranging from disaster response to extraterrestrial exploration. While dynamic legged locomotion on rigid ground is challenging enough, yielding terrain presents additional challenges such as permanent ground deformation which dissipates energy. In this paper, we examine the soft landing problem: given some impact momentum, bring the robot to rest while minimizing foot penetration depth. To gain insight into properties of penetration depth-minimizing control policies, we formulate a constrained optimal control problem and obtain a bang-bang open-loop force profile. Motivated by examples from biology and recent advances in legged robotics, we also examine impedance-control solutions to the dimensionless soft landing problem. Through simulations, we find that optimal impedance reduces penetration depth nearly as much as the open-loop force profile, while remaining robust to model uncertainty. Through simulations and experiments, we find that the solution space is rich, exhibiting qualitatively different relationships between impact velocity and the optimal impedance for small and large dimensionless impact velocities. Lastly, we discuss the relevance of this work to minimum-cost-of-transport locomotion for several actuator design choices.