The difficulty stems from the sheer density of constraints that a space manipulator must respect simultaneously. A redundant arm, such as the seven-degree-of-freedom system studied by the team, has more joints than the minimum needed to position its end effector, which gives it the dexterity to reorient its shoulder and elbow around obstacles. That redundancy, however, turns every planning query into a high-dimensional search. The planner must satisfy kinematic limits on joint angles, velocities, and accelerations; dynamic limits on the torques each joint motor can deliver; collision-avoidance requirements as the arm sweeps through the space around the station; and, critically for inspection work, a line-of-sight constraint that keeps the camera mounted on the end effector pointed at the target within a fixed field of view. The researchers characterize the combined problem as a nonlinear, non-convex optimal control problem, a class in which standard solvers can stall in poor local solutions or fail to converge at all.

Existing approaches each capture only part of the picture. Sampling-based planners, including the widely used Rapidly-exploring Random Tree family, explore high-dimensional configuration spaces by randomly extending tree branches toward unexplored regions. They excel at rapidly finding collision-free paths even among complicated geometry, but the paths they return are typically jagged, dynamically infeasible, and of low quality, and their performance degrades badly once tight task constraints such as camera line-of-sight are added. Optimization-based methods take the opposite tack: they formulate trajectory generation as a mathematical program and, when they converge, produce smooth, dynamically feasible, high-quality trajectories. Their weakness is sensitivity to the initial guess. Without a good warm start, a nonlinear solver may diverge or settle into an unusable local minimum, and no general mechanism exists to supply that starting point automatically.

The insight behind the new method is that these two weaknesses are complementary. A sampling-based planner can find a rough but collision-free route quickly, and that route is exactly the kind of warm start an optimization-based solver needs. The team therefore built a two-level architecture. At the kinematic level, they designed a goal-biased RRT algorithm that steers random sampling toward the goal rather than exploring uniformly, accelerating convergence toward a feasible path. Collision checking uses axis-aligned bounding boxes together with the Separating Axis Theorem, a standard geometric test for determining whether two oriented volumes intersect. Once a path is found, a greedy pruning strategy eliminates redundant waypoints, and cubic spline interpolation converts the pruned waypoint sequence into a smooth, continuous reference trajectory in joint space, providing the high-quality initial guess for the second stage.

At the dynamic level, the method converts the full nonlinear problem into a sequence of convex programs that can be solved reliably and iteratively. The transformation is the technical heart of the work. Obstacle-avoidance constraints, which are inherently nonlinear because they describe distances between moving links and obstacles, are recast as linear inequalities on joint angular velocities using a velocity damping method, effectively forbidding joint rates that would carry any link into a forbidden region. The line-of-sight constraint, which ties the orientation of the end-effector camera to the direction of the target, is linearized through quaternion differentiation, representing rotations in a form amenable to first-order approximation. The manipulator’s dynamic equations, which couple joint accelerations to torques through configuration-dependent inertia terms, are linearized with a first-order Taylor expansion around the current trajectory iterate.

Because each linearization is only locally accurate, the researchers embed two safeguards that make the sequential scheme trustworthy. Successive linearization repeats the approximation at every iteration, so errors inherited from an early guess are corrected as the trajectory evolves. Trust-region constraints limit how far each new iterate may deviate from the trajectory around which the linearization was performed, preventing the solver from leaping to a point where the convex approximation no longer resembles the true nonlinear problem. Together, these mechanisms convert the original nonlinear, non-convex optimal control problem into an iteratively solved convex optimization problem, inheriting the reliability and speed of convex solvers while retaining, in the limit, the fidelity of the full nonlinear formulation.

To evaluate the framework, the team simulated a seven-degree-of-freedom space redundant manipulator in two monitoring scenarios: one in which the inspection target is static and one in which the target moves. In the static scenario, the manipulator must swing around an obstacle positioned directly on its mandatory path while keeping its end-effector camera trained on the target. The optimization converged to the optimum in 17 iterations, and the results show the end-effector line-of-sight angle remaining consistently within the 30-degree field of view throughout the motion, confirming that the camera constraint was enforced at every instant along the trajectory rather than merely at the endpoints.

The dynamic scenario imposed the additional challenge of tracking a moving target, which forces the planner to continuously reconcile the line-of-sight requirement with the arm’s dynamic limits. The algorithm converged in 18 iterations, and the resulting trajectory satisfied the end-effector line-of-sight constraint effectively even though the driving torque of joint 3 briefly saturated at certain instants, a detail the authors report transparently. Solution times were 112.7 seconds for the static scenario and 122.9 seconds for the dynamic one. The team also compared their goal-biased RRT against a standard RRT across 100 path planning experiments, finding that the biased variant achieved higher computational efficiency and could supply a warm-start reference to the convex stage more rapidly, validating the design of the kinematic layer as well as the dynamic one.

The broader significance of the work lies in how it restructures a notoriously difficult problem rather than attacking it with brute force. By delegating global feasibility to a fast stochastic search and local quality to disciplined convex optimization, the hierarchical method sidesteps the poor scalability of sampling-based planners under dense constraints and the initialization fragility of pure optimization approaches. For mission designers, that means inspection trajectories for redundant space arms can be generated autonomously, smoothly, and with verifiable satisfaction of torque, collision, and camera-pointing limits, capabilities that will matter as orbital stations grow and their upkeep depends increasingly on robotic labor. The authors position the method as a feasible technical solution for autonomous motion planning of space manipulators under end-effector task constraints such as extravehicular visual monitoring, and it arrives at a moment when the demand for such autonomy is rising sharply.

There are, of course, caveats that separate a convincing simulation from flight heritage. The reported solution times of roughly two minutes per scenario are practical for pre-planned inspection sorties but would need assessment against real-time replanning requirements if a target moved unpredictably or an obstacle changed position. The brief torque saturation of joint 3 in the dynamic scenario likewise illustrates how tightly constrained these motions are, and how future refinements might trade trajectory duration against actuator margins. Still, the study offers a concrete, validated recipe for merging two algorithmic traditions that the robotics community has long treated as alternatives, and it demonstrates on a realistic seven-degree-of-freedom system that the combination can deliver executable, constraint-respecting trajectories for one of the most demanding routine tasks in orbital operations.

Subject of Research: Hierarchical motion planning for space redundant manipulators under end-effector line-of-sight and obstacle constraints

Article Title: Hierarchical motion planning method for space redundant manipulators with end-task constraint

Article References: Hierarchical motion planning method for space redundant manipulators with end-task constraint. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: space manipulator, motion planning, redundant manipulator, RRT, sequential convex programming, line-of-sight constraint, obstacle avoidance, trajectory optimization, on-orbit inspection, nonlinear optimal control, warm start, space robotics

The appeal of solid propulsion for a lunar lander lies in what engineers call architectural simplicity. A solid rocket motor is essentially a filled pressure vessel: propellant grain, casing, nozzle, igniter. There are no turbopumps, no pressurized feed lines, no valves throttling the flow of fuel and oxidizer, and no cryogenic fluids boiling away in the harsh thermal environment of space. That simplicity translates directly into reliability, and reliability is the currency that matters most when a single ignition opportunity determines whether a mission ends in triumph or in a plume of lunar dust. Mission planners have long been drawn to the idea of a lander that simply lights a solid motor and rides it down.

The catch is equally fundamental. Once a solid motor is ignited, it burns until the propellant is exhausted, and the thrust it produces cannot be throttled, pulsed, or shut down. The vehicle has exactly one chance to get the burn right. This means the ignition time and the resulting burn duration must be predetermined with extraordinary precision, because there is no pilot or autopilot that can ease off the throttle if the trajectory starts to look wrong. Conventional liquid-engine landers, including the Apollo lunar modules and most modern reusable rocket designs, rely on continuous thrust modulation to chase down errors as they develop. A solid-propellant lander forfeits that safety net entirely, which is why the concept has historically been viewed with skepticism for precision landing missions.

Compounding the problem is a subtler enemy: temperature. The performance of a solid propellant is sensitive to the temperature of the grain itself, and the lunar thermal environment—where a landed or orbiting vehicle can swing between searing sunlit heat and deep frigid darkness—induces propellant temperature variations that cause significant errors in the thrust magnitude the motor actually delivers. A motor characterized at one temperature may produce noticeably different thrust at another, and because the burn cannot be modulated, those errors propagate directly into the trajectory. The Inha team identified this thrust uncertainty as the critical failure mode that conventional open-loop guidance, which simply executes a precomputed trajectory, cannot overcome.

The researchers’ answer is to treat the powered descent as a sequential convex programming problem, a class of optimization techniques that has become the workhorse of modern aerospace trajectory design. Convex programming, popularized for planetary landing by the landmark Mars powered-descent guidance work of Behçet Açıkmeşe and colleagues, has the crucial property that the optimization problem can be solved rapidly and reliably to a global optimum, making it suitable for onboard, real-time computation. The lunar lander problem, however, is not naturally convex: fixed-thrust operation and vertical landing constraints introduce complications that must be carefully reformulated. The Inha framework incorporates these critical flight conditions directly, shaping the optimization so that the resulting trajectory respects the physical realities of a solid motor burn and the demanding attitude requirements of a vertical touchdown.

The truly novel contribution, though, is the closed-loop replanning scheme built on top of that optimizer. Rather than trusting the precomputed trajectory, the lander continuously estimates its actual thrust in flight, comparing how fast it is accelerating against how fast it should be. Because the motor’s thrust cannot be changed, the guidance cannot fix errors by adjusting the engine—but it can adjust everything else. The onboard algorithm periodically re-optimizes the entire remaining trajectory, shifting the ignition timing, reshaping the descent profile, and re-targeting the terminal conditions so that the vehicle, burning exactly as it must, still arrives at the surface with the right velocity and attitude for a soft landing. In effect, the software trades flexibility in thrust for flexibility in timing and geometry, re-solving the whole problem every time the estimate of the motor’s behavior changes.

The numerical simulations reported in the paper show that this approach works. Under thrust deviations of up to 1.5 percent—a level that would produce unacceptable landing errors under an open-loop baseline—the replanning algorithm successfully mitigated the severe thrust errors, ensuring precise terminal convergence and reliable soft-landing performance. The horizontal landing error was constrained to within a few meters of the target, a figure that would enable pinpoint landing rather than merely landing somewhere safe within a broad ellipse. For missions targeting specific scientific sites, lava tubes, polar ice deposits, or pre-positioned infrastructure, the difference between a kilometer-scale and a meter-scale landing footprint is the difference between a feasible and an infeasible mission.

The work sits within a rich lineage of lunar descent guidance research stretching back to the Apollo era, when the zero-effort-miss and zero-effort-velocity guidance concepts first put astronauts on the Moon, and to the foundational optimal thrust-programming analyses of the 1960s. What distinguishes the new framework is its marriage of that classical problem—soft landing under a fixed, unthrottleable thrust profile—with the modern machinery of convex optimization and in-flight estimation. Earlier studies had explored solid-propellant arrangements for the lunar soft-landing problem and hybrid rocket alternatives, but the closed-loop, estimation-driven replanning approach addresses the thrust uncertainty problem in a way those open-loop concepts could not.

The implications extend beyond any single lander design. Solid propulsion’s simplicity makes it attractive for small, low-cost lunar missions, including the growing wave of commercial and academic payloads riding on commercial lander platforms, where every valve, pump, and pressurant tank removed from the design is weight, cost, and failure modes eliminated. A guidance framework that can guarantee meter-class accuracy with a motor that behaves like a firework—light it once and it burns—could open precision landing to mission classes that could never afford the complexity of a throttleable liquid engine. The research was supported by funding from the Korea AeroSpace Administration, reflecting national investment in lunar landing capability.

There remain, of course, the usual caveats that separate simulation from flight. The results are numerical, and translating a real-time optimizer into flight software that runs on radiation-tolerant hardware, fuses real sensor data, and survives the communication blackouts and environmental surprises of an actual descent is a formidable engineering task in its own right. But the core insight is durable and, in its way, elegant: when the engine cannot adapt, the plan must. By making the trajectory itself the adaptive element—continuously re-optimized onboard as the true thrust of the motor reveals itself—the Inha team has shown that the simplest propulsion system in the rocketry catalog can be guided to a landing as precise as any throttled engine could achieve. For the next generation of lunar explorers, the smartest part of the spacecraft may matter more than the most sophisticated one.

Subject of Research: Real-time trajectory optimization and closed-loop replanning for a solid-propellant lunar lander during powered descent

Article Title: Real-Time Landing Trajectory Optimization of a Lunar Lander with Solid Propellant

Article References: Seo, J.-M., Kim, H.-J., & Ryoo, C.-K. (2026). Real-Time Landing Trajectory Optimization of a Lunar Lander with Solid Propellant. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01247-y

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01247-y

Keywords: lunar landing, solid propellant, trajectory optimization, sequential convex programming, real-time replanning, powered descent guidance, thrust estimation, soft landing, spacecraft guidance, convex optimization, lunar exploration, aerospace engineering