Optimal time-jerk trajectory planning for the landing and walking integration mechanism using adaptive genetic

Jinhua Zhou1, Meng Chen2, Jinbao Chen2

  • 1College of Aerospace Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China.

Summary

This study introduces a novel Soft Landing and Walking Integration (SLWI) lunar lander mechanism. Simulations demonstrate its continuous and stable motion, validating the trajectory planning method and optimizing performance.

Related Concept Videos

Hydraulic Jump: Problem Solving01:16

Hydraulic Jump: Problem Solving

To analyze a hydraulic jump in a rectangular channel with a flow speed of 6 meters per second, follow these steps:Calculate Effective Upstream Velocity:When the downstream gate closes, a hydraulic jump forms, traveling upstream at 2 meters per second. This wave speed combines with the initial channel flow velocity, creating an effective upstream velocity.Identify Flow Velocities Before and After the Hydraulic Jump:Upstream of the hydraulic jump, the effective flow velocity includes both the...
383
One-Degree-of-Freedom System01:24

One-Degree-of-Freedom System

In mechanical engineering, one-degree-of-freedom systems form the basis of a wide range of electrical and mechanical components. Using these models, engineers can predict the behavior of various parts in a larger system, which gives them insight into how different forces interact with each other.
A one-degree-of-freedom system is defined by an independent variable that determines its state and behavior. One example of a one-degree-of-freedom system is a simple harmonic oscillator, such as a...
731
Kinematic Equations: Problem Solving01:15

Kinematic Equations: Problem Solving

When analyzing one-dimensional motion with constant acceleration, the problem-solving strategy involves identifying the known quantities and choosing the appropriate kinematic equations to solve for the unknowns. Either one or two kinematic equations are needed to solve for the unknowns, depending on the known and unknown quantities. Generally, the number of equations required is the same as the number of unknown quantities in the given example. Two-body pursuit problems always require two...
27.1K