54,460 research outputs found

    Planning natural repointing manoeuvres for nano-spacecraft

    Get PDF
    In this paper the natural dynamics of a rigid body are exploited to plan attitude manoeuvres for a small spacecraft. By utilising the analytical solutions of the angular velocities and making use of Lax pair integration, the time evolution of the attitude of the spacecraft in a convenient quaternion form is derived. This enables repointing manoeuvres to be generated by optimising the free parameters of the analytical expressions, the initial angular velocities of the spacecraft, to match prescribed boundary conditions on the final attitude of the spacecraft. This produces reference motions which can be tracked using a simple proportional-derivative controller. The natural motions are compared in simulation to a conventional quaternion feedback controller and found to require lower accumulated torque. A simple obstacle avoidance algorithm, exploiting the analytic form of natural motions, is also described and implemented in simulation. The computational efficiency of the motion planning method is discussed

    Planning natural repointing manoeuvres for nano-spacecraft

    Get PDF
    In this paper the natural dynamics of a rigid body are exploited to plan attitude manoeuvres for a small spacecraft. By utilising the analytical solutions of the angular velocities and making use of Lax pair integration, the time evolution of the attitude of the spacecraft in a convenient quaternion form is derived. This enables repointing manoeuvres to be generated by optimising the free parameters of the analytical expressions, the initial angular velocities of the spacecraft, to match prescribed boundary conditions on the final attitude of the spacecraft. This produces reference motions which can be tracked using a simple proportional-derivative controller. The natural motions are compared in simulation to a conventional quaternion feedback controller and found to require lower accumulated torque. A simple obstacle avoidance algorithm, exploiting the analytic form of natural motions, is also described and implemented in simulation. The computational efficiency of the motion planning method is discussed

    Complexity management of H.264/AVC video compression.

    Get PDF
    The H. 264/AVC video coding standard offers significantly improved compression efficiency and flexibility compared to previous standards. However, the high computational complexity of H. 264/AVC is a problem for codecs running on low-power hand held devices and general purpose computers. This thesis presents new techniques to reduce, control and manage the computational complexity of an H. 264/AVC codec. A new complexity reduction algorithm for H. 264/AVC is developed. This algorithm predicts "skipped" macroblocks prior to motion estimation by estimating a Lagrange ratedistortion cost function. Complexity savings are achieved by not processing the macroblocks that are predicted as "skipped". The Lagrange multiplier is adaptively modelled as a function of the quantisation parameter and video sequence statistics. Simulation results show that this algorithm achieves significant complexity savings with a negligible loss in rate-distortion performance. The complexity reduction algorithm is further developed to achieve complexity-scalable control of the encoding process. The Lagrangian cost estimation is extended to incorporate computational complexity. A target level of complexity is maintained by using a feedback algorithm to update the Lagrange multiplier associated with complexity. Results indicate that scalable complexity control of the encoding process can be achieved whilst maintaining near optimal complexity-rate-distortion performance. A complexity management framework is proposed for maximising the perceptual quality of coded video in a real-time processing-power constrained environment. A real-time frame-level control algorithm and a per-frame complexity control algorithm are combined in order to manage the encoding process such that a high frame rate is maintained without significantly losing frame quality. Subjective evaluations show that the managed complexity approach results in higher perceptual quality compared to a reference encoder that drops frames in computationally constrained situations. These novel algorithms are likely to be useful in implementing real-time H. 264/AVC standard encoders in computationally constrained environments such as low-power mobile devices and general purpose computers

    A Software Suite for the Control and the Monitoring of Adaptive Robotic Ecologies

    Get PDF
    Adaptive robotic ecologies are networks of heterogeneous robotic devices (sensors, actuators, automated appliances) pervasively embedded in everyday environments, where they learn to cooperate towards the achievement of complex tasks. While their flexibility makes them an increasingly popular way to improve a system’s reliability, scalability, robustness and autonomy, their effective realisation demands integrated control and software solutions for the specification, integration and management of their highly heterogeneous and computational constrained components. In this extended abstract we briefly illustrate the characteristic requirements dictated by robotic ecologies, discuss our experience in developing adaptive robotic ecologies, and provide an overview of the specific solutions developed as part of the EU FP7 RUBICON Project

    Control and Optimization for Aerospace Systems with Stochastic Disturbances, Uncertainties, and Constraints

    Full text link
    The topic of this dissertation is the control and optimization of aerospace systems under the influence of stochastic disturbances, uncertainties, and subject to chance constraints. This problem is motivated by the uncertain operating environments of many aerospace systems, and the ever-present push to extract greater performance from these systems while maintaining safety. Explicitly accounting for the stochastic disturbances and uncertainties in the constrained control design confers the ability to assign the probability of constraint satisfaction depending on the level of risk that is deemed acceptable and allows for the possibility of theoretical constraint satisfaction guarantees. Along these lines, this dissertation presents novel contributions addressing four different problems: 1) chance-constrained path planning for small unmanned aerial vehicles in urban environments, 2) chance-constrained spacecraft relative motion planning in low-Earth orbit, 3) stochastic optimization of suborbital launch operations, and 4) nonlinear model predictive control for tracking near rectilinear halo orbits and a proposed stochastic extension. For the first problem, existing dynamic and informed rapidly-expanding random trees algorithms are combined with a novel quadratic programming-based collision detection algorithm to enable computationally efficient, chance-constrained path planning. For the second problem, a previously proposed constrained relative motion approach based on chained positively invariant sets is extended in this dissertation to the case where the spacecraft dynamics are controlled using output feedback on noisy measurements and are subject to stochastic disturbances. Connectivity between nodes is determined through the use of chance-constrained admissible sets, guaranteeing that constraints are met with a specified probability. For the third problem, a novel approach to suborbital launch operations is presented. It utilizes linear covariance propagation and stochastic clustering optimization to create an effective software-only method for decreasing the probability of a dangerous landing with no physical changes to the vehicle and only minimal changes to its flight controls software. For the fourth problem, the use of suboptimal nonlinear model predictive control (NMPC) coupled with low-thrust actuators is considered for station-keeping on near rectilinear halo orbits. The nonlinear optimization problems in NMPC are solved with time-distributed sequential quadratic programming techniques utilizing the FBstab algorithm. A stochastic extension for this problem is also proposed. The results are illustrated using detailed numerical simulations.PHDAerospace EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/162992/1/awbe_1.pd
    • …
    corecore