Connerney, Ian Edward2021-11-042021-11-042021-11-03vt_gsexam:32747http://hdl.handle.net/10919/106513The capability to perform rendezvous and proximity operations about space objects is central to the next generation of space situational awareness. The ability to diagnose and respond to spacecraft anomalies is often hampered by the lack of capability to perform inspection or testing on the target vehicle in flight. While some limited ability to perform inspection can be provided by an extensible boom, such as the robotic arms deployed on the space shuttle and space station, a free-flying companion vehicle provides maximum flexibility of movement about the target. Safe and efficient utilization of a companion vehicle requires trajectories capable of minimizing spacecraft resources, e.g., time or fuel, while adhering to complex path and state constraints. This paper develops an efficient solution method capable of handling complex constraints based on a grid search A* algorithm and compares solution results against a state-of-the-art nonlinear optimization method. Trajectories are investigated that include nonlinear constraints, such as complex keep-out-regions and thruster plume impingement, that may be required for inspection of a specific target area in a complex environment. This work is widely applicable and can be expanded to apply to a variety of satellite relative motion trajectory planning problems.The capability to perform rendezvous and proximity operations about space objects is central to the next generation of space situational awareness. The ability to diagnose and respond to spacecraft anomalies is often hampered by the lack of capability to perform inspection or testing on the target vehicle in flight. While some limited ability to perform inspection can be provided by an extensible boom, such as the robotic arms deployed on the space shuttle and space station, a free-flying companion vehicle provides maximum flexibility of movement about the target. Safe and efficient utilization of a companion vehicle requires trajectories capable of minimizing spacecraft resources, e.g., time or fuel, while adhering to complex path and state constraints. This paper develops an efficient solution method capable of handling complex constraints based on a grid search A* algorithm and compares solution results against a state-of-the-art nonlinear optimization method. Trajectories are investigated that include complex nonlinear constraints, such as complex keep-out-regions and thruster plume impingement, that may be required for inspection of a specific target area in a complex environment. This work is widely applicable and can be expanded to apply to a variety of satellite relative motion trajectory planning problems.ETDIn CopyrightRelative MotionPath PlanningTrajectory OptimizationRPOA* SearchThesis