Laboratory experiments on the capture of a tumbling object by a spacecraft-manipulator system using a convex-programming-based guidance
Zappulla, Richard, II
MetadataShow full item record
An onboard implementable optimization-based guidance approach for the capture of tumbling objects by spacecraft equipped with a robotic manipulator is demonstrated on a hardware-in-the-loop test bed. The experimental demonstration is conducted using spacecraft simulators operating on the reduced-gravity and drag-free dynamic environment provided by a planar air bearing test bed. The proposed approach uses a two-step sequential convex programming procedure introduced in an earlier work. The first step optimizes the center-of-mass translation while the second step optimizes the motion of the multibody system around its center-of-mass. A sequential convex programming procedure is used on both optimization steps, casting the original optimization problem into a collection of convex programming problems. A proof of convergence is introduced here for the system-wide translation in the presence of non-convex keep-out zone constraints. These experiments significantly advance the demonstrated state-of-the-art for robotic capture maneuvers.
Showing items related by title, author, creator and subject.
Virgili-Llop, Josep; Costantinos Zagaris; Zappulla, Richard II; Bradstree, Andrew; Romano, Marcello (2017-02);This paper presents a convex optimization-based guidance algorithm for maneuvering a spacecraft equipped with a robotic manipulator. A local solution to the original optimization problem is found by solving a collection ...
Keolian, Robert M.; Swift, Gregory W. (The Regents of the University of California, 1995-10-10);A thermoacoustic stack for connecting two heat exchangers in a thermoacoustic energy converter provides a convex fluid-solid interface in a plane perpendicular to an axis for acoustic oscillation of fluid between the two ...
Crane, Jerry Allen (Monterey, California. Naval Postgraduate School, 1991-09);This thesis describes a method for computing globally shortest paths for a point robot in a two-dimensional, orthogonal world composed of convex and concave polygons through the construction of obstacle common tangent ...