A function that finds the shortest path bounded by two curves
find the shortest Euclidean path that is bounded
by the functions low(t) and high(t).
the algorithm is based on Dijkstra shortest path search algorithm
syntax:
[ty y] = shortest_path_mfile(t,low,high)
(See the file shortest_path_example.m - for an example)
input:
t - input time values. row vector.
low(t) - is the lower bound. raw vector.
high(t) - is the upper bound. raw vector.
output:
ty - is a vector of time samples
y(ty) - is the shortest path
引用
yoash levron (2024). A function that finds the shortest path bounded by two curves (https://www.mathworks.com/matlabcentral/fileexchange/26015-a-function-that-finds-the-shortest-path-bounded-by-two-curves), MATLAB Central File Exchange. 取得済み .
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |