Scott R. Ploen

A Lie group formulation of robot dynamics

In this article we present a unified geometric treatment of robot dynamics. Using standard ideas from Lie groups and Rieman nian geometry, we formulate the equations of motion for an open chain manipulator both recursively and in closed form. The recursive formulation leads to an O(n) algorithm that ex presses the dynamics entirely in terms of coordinate-free Lie algebraic operations. The Lagrangian formulation also ex presses the dynamics in terms of these Lie algebraic operations and leads to a particularly simple set of closed-form equations, in which the kinematic and inertial parameters appear explic itly and independently of each other. The geometric approach permits a high-level, coordinate-free view of robot dynamics that shows explicitly some of the connections with the larger body of work in mathematics and physics. At the same time the resulting equations are shown to be computationally ef fective and easily differentiated and factored with respect to any of the robot parameters. This latter feature makes the ge ometric formulation attractive for applications such as robot design and calibration, motion optimization, and optimal control, where analytic gradients involving the dynamics are required.

A survey of spacecraft formation flying guidance and control (part 1): guidance

This paper provides a comprehensive survey of spacecraft formation flying guidance (FTG). Here by the term guidance we mean both path planning and optimal, open loop control design.

Convex Programming Approach to Powered Descent Guidance for Mars Landing

We present a convex programming algorithm for the numerical solution of the minimum fuel powered descent guidance problem associated with Mars pinpoint landing. Our main contribution is the formulation of the trajectory optimization problem, which has nonconvex control constraints, as a finite-dimensional convex optimization problem, specifically as a second-order cone programming problem. Second-order cone programming is a subclass of convex programming, and there are efficient second-order cone programming solvers with deterministic convergence properties. Consequently, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications.

Coordinate-invariant algorithms for robot dynamics

We present, using methods from the theory of Lie groups and Lie algebras, a coordinate-invariant formulation of the dynamics of open kinematic chains. We first re-formulate the recursive dynamics algorithm originally given by Park et al. (1995) for open chains in terms of standard linear operators on the Lie algebra of the special Euclidean group. Using straight forward algebraic manipulations, we then recast the resulting algorithm into a set of closed-form dynamic equations. We then reformulate Featherstones (1987) articulated body inertia algorithm using this same geometric framework, and re-derive Rodriguez et al.s (1991, 1992) square factorization of the mass matrix and its inverse. An efficient O(n) recursive algorithm for forward dynamics is also extracted from the inverse factorization. The resulting equations lead to a succinct high-level description of robot dynamics in both joint and operational space coordinates that minimizes symbolic complexity without sacrificing computational efficiency, and provides the basis for a dynamics formulation that does not require link reference frames in the description of the forward kinematics.

A Comparison of Powered Descent Guidance Laws for Mars Pinpoint Landing.

I. Abstract In this paper, we formulate and compare a number of powered terminal descent guidance algorithms for Mars pinpoint landing (PPL). The PPL guidance problem involves finding a trajectory that transfers the spacecraft from any g iven state at engine ignition to a desired terminal state (usually within 100m of a desired target) without violating fuel limits or any state constraints and control constraints. Sp ecifically, we first formulate the fuel-optimal guidance problem and show that a direct method can be used to reduce it to a finite-dimensional convex program. Modern interior point methods can then be used to find the global solution to any desired level of accuracy. Nex t, we discuss a class of suboptimal guidance laws based on simple polynomial basis functions. The performance of the sub-optimal guidance laws under a variety of realistic mission constraints are compared to the global fuel-optimal solution.

Attitude Dynamics and Control of Solar Sails with Articulated Vanes

In this paper we develop a robust nonlinear algorithm for the attitude control of a solar sailcraft with M single degree-of-freedom articulated control vanes. A general attitude controller that tracks an admissible trajectory while rejecting disturbances such as torques due to center-of-mass to center-of-pressure offsets is applied to this problem. We then describe a methodology based on nonlinear programming to allocate the required control torques among the control vanes. A simplified allocation strategy is then applied to a solar sail with four articulated control vanes, and simulation results are given. The performance of the control algorithm and possible limitations of vane-only control are then discussed.

Dynamics of Earth Orbiting Formations

In this paper the equations of motion of a formation consisting of n spacecraft in Earth orbit are derived via Lagrange’s equations. The equations of motion of the formation are developed with respect to both (1) a bound Keplerian reference orbit, and (2) a specific spacecraft in the formation. The major orbital perturbations acting on a formation in low Earth orbit are also included in the analysis. In contrast to the traditional approach based on the balance of linear momentum, the use of Lagrange’s equations leads to a high-level matrix derivation of the formation equations of motion. The matrix form of the nonlinear motion equations is then linearized about a bound Keplerian reference orbit. Next, it is demonstrated that under the assumption of a circular reference orbit, the linearized equations of motion reduce to the well-known Hill-Clohessy-Wiltshire equations. The resulting linear and nonlinear dynamic equations lead to maximal physical insight into the structure of formation dynamics, and are ideally suited for use in the design and validation of formation guidance and control laws.

A Lie group formulation of the dynamics of cooperating robot systems

In this article we formulate the dynamics of cooperating robot systems using standard ideas and notation from the theory of Lie groups. Utilizing the geometric framework introduced in Park et al. (1995), we develop the equations of motion for a system of N cooperating robots manipulating a common workpiece. In the resulting dynamic equations the Jacobian, mass matrix, Coriolis, and gravity terms of the closed chain system admit succinct block-triangular factorizations in terms of the basic linear operators on se(3), the Lie algebra of the Euclidean group SE(3). The resulting closed-form equations provide a high-level description of the equations of motion that reduces the symbolic complexity without sacrificing computational efficiency.

Guaranteed initialization of distributed spacecraft formations

In this paper we present a solution to the formation initialization (FI) problem for N distributed spacecraft located in deep space. Our solution to the FI problem is based on a three-stage sky search procedure that reduces the FI problem for N spacecraft to the simpler problem of initializing a set of sub-formations. An analytical proof demonstrating that our algorithm guarantees formation initialization for N spacecraft constrained to a single plane is presented. An upper bound on the time to initialize a planar formation is also provided. We then demonstrate our FI algorithm in simulation using NASA’s v e-spacecraft Terrestrial Planet Finder mission as an example.

Initialization of distributed spacecraft for precision formation flying

In this paper we present a solution to the formation initialization (FI) problem for N distributed spacecraft located in deep space. Our solution to the FI problem is based on a three-stage sky search procedure that reduces the FI problem for N spacecraft to the simpler problem of initializing a set of sub-formations. We demonstrate our FI algorithm in simulation using NASAs five spacecraft terrestrial planet finder mission as an example.