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 |