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
-
A Conceptual COLREGs-based Obstacle Avoidance Algorithm Implementing Dynamic Path Planning and Collision Risk Assessment
by: Hasan Uğurlu, et al.
Published: (2024-12-01) -
Algorithms for Searching the Shortest Path and Its Modification
by: N. I. Listopad, et al.
Published: (2016-06-01) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
by: Xiaoge Zhang, et al.
Published: (2014-01-01) -
Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks
by: Wenwen Xia, et al.
Published: (2019-01-01) -
An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph
by: Siddhartha Sankar Biswas, et al.
Published: (2013-01-01)