Research on Shortest Path Planning and Smoothing Without Obstacle Collision Based on Moving Carrier
In response to the challenges of path planning in complex scenarios, to overcome the influence of optimal path determination by the precision of grid map sizes, and to escape the uncertainty in solving by intelligent algorithms, this paper designs a method for obtaining an adjacency matrix based on...
Saved in:
| Main Authors: | Lingsong Di, Defeng Sun, Yahui Qi, Zhicai Xiao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | International Journal of Aerospace Engineering |
| Online Access: | http://dx.doi.org/10.1155/2024/5235125 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D
by: Gilles Labonté
Published: (2024-09-01) -
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
A Novel Spherical Shortest Path Planning Method for UAVs
by: Fan Liu, et al.
Published: (2024-12-01) -
Design of Simulation Program for Analysis of Shortest Path Algorithms in Grid-Based Path Planning
by: İbrahim Şanlialp, et al.
Published: (2025-03-01) -
Shortest path planning and dynamic rescue forces dispatching for urban flood disasters
by: Jun Liang, et al.
Published: (2025-07-01)