Composition of Templates for Transitional Legged Behaviors

Compositional methods for developing, analyzing and synthesizing robot behaviors construed as controlled hybrid dynamical systems with regular properties [1] has proven an effective framework for achieving steady state gaits [2,3]. Exploiting their potential for programming transitional behaviors, requiring more complicated interactions with the environment [4,5] has been limited by our inability to find appropriate constituent models (“templates” [6]) from which to construct these complex behaviors

Quasi-Static and Dynamic Mismatch for Door Opening and Stair Climbing With a Legged Robot

This paper contributes to quantifying the notion of robotic fitness by developing a set of necessary conditions that determine whether a small quadruped has the ability to open a class of doors or climb a class of stairs using only quasi-static maneuvers. After verifying that several such machines from the recent robotics literature are mismatched in this sense to the common human scale environment, we present empirical workarounds for the Minitaur quadrupedal platform that enable it to leap up, force the door handle and push through the door, as well as bound up the stairs, thereby accomplishing through dynamical maneuvers otherwise (i.e., quasi-statically) achievable tasks. For more information: Kod*la

Composition of Templates for Transitional Pedipulation Behaviors

Abstract. We document the reliably repeatable dynamical mounting and dismounting of wheeled stools and carts, and of fixed ledges, by the Minitaur robot. Because these tasks span a range of length scales that preclude quasi-static execution, we use a hybrid dynamical systems framework to variously compose and thereby systematically reuse a small lexicon of templates (low degree of freedom behavioral primitives). The resulting behaviors comprise the key competences beyond mere locomotion required for robust implementation on a legged mobile manipulator of a simple version of the warehouseman’s problem

Autonomous Legged Hill and Stairwell Ascent

This paper documents near-autonomous negotiation of synthetic and natural climbing terrain by a rugged legged robot, achieved through sequential composition of appropriate perceptually triggered locomotion primitives. The first, simple composition achieves autonomous uphill climbs in unstructured outdoor terrain while avoiding surrounding obstacles such as trees and bushes. The second, slightly more complex composition achieves autonomous stairwell climbing in a variety of different buildings. In both cases, the intrinsic motor competence of the legged platform requires only small amounts of sensory information to yield near-complete autonomy. Both of these behaviors were developed using X-RHex, a new revision of RHex that is a laboratory on legs, allowing a style of rapid development of sensorimotor tasks with a convenience near to that of conducting experiments on a lab bench. Applications of this work include urban search and rescue as well as reconnaissance operations in which robust yet simple-to-implement autonomy allows a robot access to difficult environments with little burden to a human operator

Sensor-Based Reactive Execution of Symbolic Rearrangement Plans by a Legged Mobile Manipulator

We demonstrate the physical rearrangement of wheeled stools in a moderately cluttered indoor environment by a quadrupedal robot that autonomously achieves a user\u27s desired configuration. The robot\u27s behaviors are planned and executed by a three layer hierarchical architecture consisting of: an offline symbolic task and motion planner; a reactive layer that tracks the reference output of the deliberative layer and avoids unanticipated obstacles sensed online; and a gait layer that realizes the abstract unicycle commands from the reactive module through appropriately coordinated joint level torque feedback loops. This work also extends prior formal results about the reactive layer to a broad class of nonconvex obstacles. Our design is verified both by formal proofs as well as empirical demonstration of various assembly tasks. For more information: Kod*la

Navigation of Distinct Euclidean Particles via Hierarchical Clustering

We present a centralized online (completely reactive) hybrid navigation algorithm for bringing a swarm of n perfectly sensed and actuated point particles in Euclidean d space (for arbitrary n and d) to an arbitrary goal configuration with the guarantee of no collisions along the way. Our construction entails a discrete abstraction of configurations using cluster hierarchies, and relies upon two prior recent constructions: (i) a family of hierarchy-preserving control policies and (ii) an abstract discrete dynamical system for navigating through the space of cluster hierarchies. Here, we relate the (combinatorial) topology of hierarchical clusters to the (continuous) topology of configurations by constructing “portals” — open sets of configurations supporting two adjacent hierarchies. The resulting online sequential composition of hierarchy-invariant swarming followed by discrete selection of a hierarchy “closer” to that of the destination along with its continuous instantiation via an appropriate portal configuration yields a computationally effective construction for the desired navigation policy

The Problem of Signal and Symbol Integration: A Study of Cooperative Mobile Autonomous Agent Behaviors

This paper explores and reasons about the interplay between symbolic and continuous representations. We first provide some historical perspective on signal and symbol integration as viewed by the Artificial Intelligence (AI), Robotics and Computer Vision communities. The domain of autonomous robotic agents residing in dynamically changing environments anchors well different aspects of this integration and allows us to look at the problem in its entirety. Models of reasoning, sensing and control actions of such agents determine three different dimensions for discretization of the agent-world behavioral state space. The design and modeling of robotic agents, where these three aspects have to be closely tied together, provide a good experimental platform for addressing the signal-to-symbol transformation problem. We present some experimental results from the domain of cooperating mobile agents involved in tasks of navigation and manipulation

Stability analysis of the GAL regulatory network in Saccharomyces cerevisiae and Kluyveromyces lactis

<p>Abstract</p> <p>Background</p> <p>In the yeast <it>Saccharomyces cerevisiae</it>, interactions between galactose, Gal3p, Gal80p, and Gal4p determine the transcriptional status of the genes required for the galactose utilization. Increase in the cellular galactose concentration causes the galactose molecules to bind onto Gal3p which, via Gal80p, activates Gal4p, which induces the GAL3 and GAL80 gene transcription. Recently, a linear time-invariant multi-input multi-output (MIMO) model of this GAL regulatory network has been proposed; the inputs being galactose and Gal4p, and the outputs being the active Gal4p and galactose utilization. Unfortunately, this model assumes the cell culture to be homogeneous, although it is not so in practice. We overcome this drawback by including more biochemical reactions, and derive a quadratic ordinary differential equation (ODE) based model.</p> <p>Results</p> <p>We show that the model, referred to above, does not exhibit bistability. We establish sufficiency conditions for the domain of attraction of an equilibrium point of our ODE model for the special case of full-state feedback controller. We observe that the GAL regulatory system of <it>Kluyveromyces lactis </it>exhibits an aberration of monotone nonlinearity and apply the Rantzer multipliers to establish a class of stabilizing controllers for this system.</p> <p>Conclusion</p> <p>Feedback in a GAL regulatory system can be used to enhance the cellular memory. We show that the system can be modeled as a quadratic nonlinear system for which the effect of feedback on the domain of attraction of the equilibrium point can be characterized using <it>linear matrix inequality </it>(LMI) conditions that are easily implementable in software. The benefit of this result is that a mathematically sound approach to the synthesis of full-state and partial-state feedback controllers to regulate the cellular memory is now possible, irrespective of the number of state-variables or parameters of interest.</p