PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 5, 20260 citations

Long-range DCS-Anya trajectory planning algorithm considering initial and terminal state constraints

View Full Paper

Key Points

  • To develop a DCS-Anya trajectory planning algorithm that addresses initial and terminal state constraints in long-range spherical trajectories.
  • Utilized the S-Anya method for path-finding node classification into binary groups.
  • Constructed a heuristic function based on great circle distance for optimal waypoint determination.
  • Developed geometric curves for smoothing multiple great-circle trajectory segments.
  • Introduced the concept of critical cut-in/cut-out points to facilitate velocity-adjusted trajectories.
  • Validated the method against the A* algorithm through comparative simulations.
  • The DCS-Anya method effectively smooths trajectory segments, reducing discontinuities.
  • Improved trajectory planning efficiency compared to traditional methods.
  • Demonstrated successful adherence to initial and terminal state constraints during simulations.

Abstract

In long-range Earth surface planning scenarios, the curvature of the spherical surface significantly influences trajectory planning. Addressing the problem of long-range spherical trajectory planning with initial and end-state constraints, a DCS-Anya trajectory planning method is presented in this paper. Firstly, the S-Anya method is employed to define path-finding nodes into binary groups. A heuristic function is constructed based on the great circle line distance, enabling trajectory searches at any angle and facilitating the determination of optimal waypoints. Then, multiple great-circle trajectories are constructed based on the waypoints, and geometric curves are applied for trajectory smoothing of multiple great-circle trajectory segments, leading to the formulation of the CS-Anya method, which effectively addresses the issue of trajectory segment discontinuity. Furthermore, based on the Dubins method, the concepts of the critical cut-in/cut-out points are proposed to obtain the shortest velocity-adjusted trajectories, and the resulting DCS-Anya method is developed to specifically address constraints on the initial and final states within the context of great-circle trajectories. Finally, comparative simulation experiments are conducted between the proposed method and the A* algorithm to validate the rationality and effectiveness of the proposed approach.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

A 2025 study studied this question.

synapsesocial.com/papers/698434ebf1d9ada3c1fb3a99https://doi.org/10.1051/jnwpu/20254330582/pdf
Ask AI
Helpful
Bookmark
Share
View Full Paper