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

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.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2025-08-11
DOI
https://doi.org/10.1051/jnwpu/20254330582/pdf
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Springer Link (Chiba Institute of Technology)
Robotic Path Planning Algorithms
article

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

article en

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.

Springer Link (Chiba Institute of Technology)
Sustainable cities and communities
Openalex Percentile: Top 29%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.