348 research outputs found
LQR-Trees: Feedback motion planning on sparse randomized trees
No full textRecent advances in the direct computation of Lyapunov
functions using convex optimization make it possible to
efficiently evaluate regions of stability for smooth nonlinear
systems. Here we present a feedback motion planning algorithm
which uses these results to efficiently combine locally valid
linear quadratic regulator (LQR) controllers into a nonlinear
feedback policy which probabilistically covers the reachable area
of a (bounded) state space with a region of stability, certifying
that all initial conditions that are capable of reaching the goal
will stabilize to the goal. We investigate the properties of this
systematic nonlinear feedback control design algorithm on simple
underactuated systems and discuss the potential for control of
more complicated control problems like bipedal walking
Minimalistic Control of a Compass Gait Robot in Rough Terrain
No full textAlthough there has been an increasing interest in dynamic bipedal locomotion for significant improvement of energy efficiency and dexterity of mobile robots in the real world, their locomotion capabilities are still mostly restricted on flat surfaces. The difficulty of dynamic locomotion in rough terrain is mainly originated in the stability and controllability of gait patterns while exploiting the natural mechanical dynamics of the robots. For a systematic investigation of the challenging problem, this paper presents the simplest control architecture for the compass gait model which can be used for locomotion in rough terrain. Locomotion of the model is mainly achieved by an open-loop oscillator which induces self-stabilizing gait patterns, and we test the proposed control architecture in a real-world robotic platform. In addition, we also found that this controller is capable of varying stride length with a minimum change of control parameters, which enables locomotion in rough terrains. By using these basic principles of self-stability and gait variability, we extended the proposed controller with a simple sensory feedback about the location in the environment, which makes the robot possible to control gait patterns autonomously for traversing a rough terrain. We describe a set of experimental results and discuss how the proposed minimalistic control architecture can be enhanced for dynamic locomotion control in more complex environment.National Science Foundation (U.S.) (Grant No. 0746194)Swiss National Science Foundation (Grant No. PBZH2-114461
Simulation-based LQR-trees with input and state constraints
No full textWe present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading to a goal state. The generated tree serves as a lookup table control policy to get any reachable initial condition within that region to the goal. The approach combines motion planning with reasoning about the set of states around a trajectory for which the feedback policy of the trajectory is able to stabilize the system. The key idea is to use a random sample from the bounded region for both motion planning and approximation of the stabilizable sets by falsification; this keeps the number of samples and simulations needed to generate covering policies reasonably low. We simulate the nonlinear system to falsify the stabilizable sets, which allows enforcing input and state constraints. Compared to the algebraic verification using sums of squares optimization in our previous work, the simulation-based approximation of the stabilizable set is less exact, but considerably easier to implement and can be applied to a broader range of nonlinear systems. We show simulation results obtained with model systems and study the performance and robustness of the generated policies
A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space
No full textKinodynamic planning algorithms like Rapidly-Exploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex, nonconvex constraints. In practice, these algorithms perform very well on configuration space planning, but struggle to grow efficiently in systems with dynamics or differential constraints. This is due in part to the fact that the conventional distance metric, Euclidean distance, does not take into account system dynamics and constraints when identifying which node in the existing tree is capable of producing children closest to a given point in state space. We show that an affine quadratic regulator (AQR) design can be used to approximate the exact minimum-time distance pseudometric at a reasonable computational cost. We demonstrate improved exploration of the state spaces of the double integrator and simple pendulum when using this pseudometric within the RRT framework, but this improvement drops off as systems' nonlinearity and complexity increase. Future work includes exploring methods for approximating the exact minimum-time distance pseudometric that can reason about dynamics with higher-order terms
Minimalistic control of biped walking in rough terrain
No full textToward our comprehensive understanding of legged locomotion in animals and machines, the compass gait model has been intensively studied for a systematic investigation of complex biped locomotion dynamics. While most of the previous studies focused only on the locomotion on flat surfaces, in this article, we tackle with the problem of bipedal locomotion in rough terrains by using a minimalistic control architecture for the compass gait walking model. This controller utilizes an open-loop sinusoidal oscillation of hip motor, which induces basic walking stability without sensory feedback. A set of simulation analyses show that the underlying mechanism lies in the “phase locking” mechanism that compensates phase delays between mechanical dynamics and the open-loop motor oscillation resulting in a relatively large basin of attraction in dynamic bipedal walking. By exploiting this mechanism, we also explain how the basin of attraction can be controlled by manipulating the parameters of oscillator not only on a flat terrain but also in various inclined slopes. Based on the simulation analysis, the proposed controller is implemented in a real-world robotic platform to confirm the plausibility of the approach. In addition, by using these basic principles of self-stability and gait variability, we demonstrate how the proposed controller can be extended with a simple sensory feedback such that the robot is able to control gait patterns autonomously for traversing a rough terrain.National Science Foundation (U.S.) (grant 0746194)Swiss National Science Foundation (grant PBZH2-114461)Swiss National Science Foundation (grant PP00P2_123387/1
L[subscript 2]-gain optimization for robust bipedal walking on unknown terrain
No full textIn this paper we seek to quantify and explicitly optimize the robustness of a control system for a robot walking on terrain with uncertain geometry. Geometric perturbations to the terrain enter the equations of motion through a relocation of the hybrid event “guards” which trigger an impact event; these perturbations can have a large effect on the stability of the robot and do not fit into the traditional robust control analysis and design methodologies without additional machinery. We attempt to provide that machinery here. In particular, we quantify the robustness of the system to terrain perturbations by defining an L[subscript 2] gain from terrain perturbations to deviations from the nominal limit cycle. We show that the solution to a periodic dissipation inequality provides a sufficient upper bound on this gain for a linear approximation of the dynamics around the limit cycle, and we formulate a semidefinite programming problem to compute the L[subscript 2] gain for the system with a fixed linear controller. We then use either binary search or an iterative optimization method to construct a linear robust controller and to minimize the L[subscript 2] gain. The simulation results on canonical robots suggest that the L[subscript 2] gain is closely correlated to the actual number of steps traversed on the rough terrain, and our controller can improve the robot's robustness to terrain disturbances.National Science Foundation (U.S.) (Contract CNS-0960061)United States. Defense Advanced Research Projects Agency. Maximum Mobility and Manipulation Program (BAA-10-65-M3-FP-024
Metastable Walking Machines
No full textLegged robots that operate in the real world are inherently subject to stochasticity in their dynamics and uncertainty about the terrain. Owing to limited energy budgets and limited control authority, these “disturbances” cannot always be canceled out with high-gain feedback. Minimally actuated walking machines subject to stochastic disturbances no longer satisfy strict conditions for limit-cycle stability; however, they can still demonstrate impressively long-living periods of continuous walking. Here, we employ tools from stochastic processes to examine the “stochastic stability” of idealized rimless-wheel and compass-gait walking on randomly generated uneven terrain. Furthermore, we employ tools from numerical stochastic optimal control to design a controller for an actuated compass gait model which maximizes a measure of stochastic stability—the mean first-passage time—and compare its performance with a deterministic counterpart. Our results demonstrate that walking is well characterized as a metastable process, and that the stochastic dynamics of walking should be accounted for during control design in order to improve the stability of our machines
Robust post-stall perching with a simple fixed-wing glider using LQR-Trees
No full textBirds routinely execute post-stall maneuvers with a speed and precision far beyond the capabilities of our best aircraft control systems. One remarkable example is a bird exploiting post-stall pressure drag in order to rapidly decelerate to land on a perch. Stall is typically associated with a loss of control authority, and it is tempting to attribute this agility of birds to the intricate morphology of the wings and tail, to their precision sensing apparatus, or their ability to perform thrust vectoring. Here we ask whether an extremely simple fixed-wing glider (no propeller) with only a single actuator in the tail is capable of landing precisely on a perch from a large range of initial conditions. To answer this question, we focus on the design of the flight control system; building upon previous work which used linear feedback control design based on quadratic regulators (LQR), we develop nonlinear feedback control based on nonlinear model-predictive control and 'LQR-Trees'. Through simulation using a flat-plate model of the glider, we find that both nonlinear methods are capable of achieving an accurate bird-like perching maneuver from a large range of initial conditions; the 'LQR-Trees' algorithm is particularly useful due to its low computational burden at runtime and its inherent performance guarantees. With this in mind, we then implement the 'LQR-Trees' algorithm on real hardware and demonstrate a 95 percent perching success rate over 147 flights for a wide range of initial speeds. These results suggest that, at least in the absence of significant disturbances like wind gusts, complex wing morphology and sensing are not strictly required to achieve accurate and robust perching even in the post-stall flow regime.United States. Office of Naval Research. Multidisciplinary University Research Initiative (N00014-10-1-0951)National Science Foundation (U.S.) (Award IIS-0915148
Efficient mixed-integer planning for UAVs in cluttered environments
No full textWe present a new approach to the design of smooth trajectories for quadrotor unmanned aerial vehicles (UAVs), which are free of collisions with obstacles along their entire length. To avoid the non-convex constraints normally required for obstacle-avoidance, we perform a mixed-integer optimization in which polynomial trajectories are assigned to convex regions which are known to be obstacle-free. Prior approaches have used the faces of the obstacles themselves to define these convex regions. We instead use IRIS, a recently developed technique for greedy convex segmentation [1], to pre-compute convex regions of safe space. This results in a substantially reduced number of integer variables, which improves the speed with which the optimization can be solved to its global optimum, even for tens or hundreds of obstacle faces. In addition, prior approaches have typically enforced obstacle avoidance at a finite set of sample or knot points. We introduce a technique based on sums-of-squares (SOS) programming that allows us to ensure that the entire piecewise polynomial trajectory is free of collisions using convex constraints. We demonstrate this technique in 2D and in 3D using a dynamical model in the Drake toolbox for Matlab [2].Hertz FoundationMIT Energy InitiativeMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laborator
Reachability-guided sampling for planning under differential constraints
No full textRapidly-exploring random trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency of these algorithms can be severely compromised in the presence of certain kinodynamics constraints. Obstacle fields with tunnels, or tubes are notoriously difficult, as are systems with differential constraints, because the tree grows inefficiently at the boundaries. Here we present a new sampling strategy for the RRT algorithm, based on an estimated feasibility set, which affords a dramatic improvement in performance in these severely constrained systems. We demonstrate the algorithm with a detailed look at the expansion of an RRT in a swing up task, and on path planning for a nonholonomic car.United States. Defense Advanced Research Projects Agency (Learning Locomotion program (AFRL contract # FA8650-05-C-7262)
- …
