Discretized Constrained Attitude Pathfinding and Control for Satellites

Kjellberg, Henri C.; Lightsey, E. Glenn

doi:10.2514/1.60189

Cited by 70 publications

(27 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kjellberg and Lightsey [1] mention the quadrilateralized spherical cube approach but select the icosahedron-based approach to discretize the surface of the sphere, on which they plot paths and define constraints for a single body-fixed axis. Both approaches initially distribute points on a surface other than a sphere, then project them onto a sphere and finally adjust their placement to improve uniformity of their distribution.…”

Section: Discrete Grid Definitionmentioning

confidence: 99%

See 1 more Smart Citation

Fast Three-Axis Constrained Attitude Pathfinding and Visualization Using Minimum Distortion Parameterizations

Tanygin¹

2015

Journal of Guidance, Control, and Dynamics

View full text Add to dashboard Cite

A new algorithm for designing attitude maneuver paths in the presence of multiple three-axis attitude constraints is presented. The algorithm projects the full three-axis attitude representation into a three-dimensional space using a new distortion-minimizing transformation. The projected representation is discretized on a three-dimensional Cartesian grid and the admissible regions emerge in the projected space from the discretized representation via interpolation of the constraint satisfaction across the grid points. The points are enumerated and graph search algorithms are employed to find minimum cost paths using the appropriately selected cost definitions. The paths are then smoothed and visualized alongside with the admissible regions in three dimensions. Ultimately, the paths can serve as targets for attitude tracking control algorithms.

show abstract

Section: Discrete Grid Definitionmentioning

confidence: 99%

“…R ECENTLY, a general purpose algorithm for designing threeaxis attitude maneuver paths has been proposed by Kjellberg and Lightsey [1]. This algorithm uses a unit celestial sphere that is discretized so that individual points on the sphere correspond to various possible directions of a selected body-fixed axis (e.g., a sensor boresight).…”

Section: Introductionmentioning

confidence: 99%

Fast Three-Axis Constrained Attitude Pathfinding and Visualization Using Minimum Distortion Parameterizations

Tanygin¹

2015

Journal of Guidance, Control, and Dynamics

View full text Add to dashboard Cite

show abstract

“…Dynamic and kinematic constraints have been widely elaborated by some scholars (Kjellberg and Lightsey 2013;Caubet and Biggs 2013). Control torque saturation and angular velocity saturation need to be further considered for a large-angle rapid attitude maneuver (LaValle 1998).…”

Section: Complex Attitude Constraints Of Remote Sensing Satellitementioning

confidence: 99%

A rapid maneuver path planning method with complex sensor pointing constraints in the attitude space

Zhu

et al. 2016

Inf Syst Front

View full text Add to dashboard Cite

Large-scale and high-resolution perception is easy to achieve for the physical world, if satellite technology was used in Internet of Things (IoT) in the future. Remote sensing satellite is superior to original method for ground target detection and environmental perception, which could be completed through onboard perception sensors. In the process of detection and perception, satellite needs to frequently perform attitude maneuver in order to meet a variety of task requirements. We have to face with multi-object, multi-sensors constrained maneuver problem. Not only the kinematic and dynamics constraints should been taken into account, but the engineering bounded constraints need to be considered. Moreover, sensor pointing constraints should be elaborated and analyzed reasonably. It is increasingly important how to achieve attitude maneuver in these complex constraints safely and rapidly. Firstly, sensor pointing constraints are translated to quadratic form in order to simplify the representation and computation in the attitude quaternion space. Secondly, we propose an improved RRT planning algorithm for spacecraft, which is able to address a variety of sensor pointing constraints. This algorithm will be used as a global planner, in which the uniformly distributed nodes in the expansion space are randomly sampled and the expanded nodes are screened out based on the comparative evaluation function. Finally, simulation results validate the advantages of the proposed algorithm.

show abstract

“…One of the advantages of this technique is that the algorithm becomes more efficient as more exclusion constraints are added [18]. The method, however, is not suited for the tracking problem.…”

Section: Existing Constrained Attitude Control Frameworkmentioning

confidence: 99%

“…A recently developed new framework divides the attitude space into discrete cells and uses graph searching algorithms, like A * , to find an optimal solution to the constrained problem [18,46]. One of the advantages of this technique is that the algorithm becomes more efficient as more exclusion constraints are added [18].…”

Section: Existing Constrained Attitude Control Frameworkmentioning

confidence: 99%

Kinematic Steering Law for Conically Constrained Torque-Limited Spacecraft Attitude Control

Ramos

Schaub

2018

Journal of Guidance, Control, and Dynamics

View full text Add to dashboard Cite

show abstract

Discretized Constrained Attitude Pathfinding and Control for Satellites

Cited by 70 publications

References 7 publications

Fast Three-Axis Constrained Attitude Pathfinding and Visualization Using Minimum Distortion Parameterizations

Fast Three-Axis Constrained Attitude Pathfinding and Visualization Using Minimum Distortion Parameterizations

A rapid maneuver path planning method with complex sensor pointing constraints in the attitude space

Kinematic Steering Law for Conically Constrained Torque-Limited Spacecraft Attitude Control

Contact Info

Product

Resources

About