image thumbnail

A function that finds the shortest path bounded by two curves

version 1.0.0.0 (25.8 KB) by yoash levron
finds the shortest path bounded between low(t) and high(t).

625 Downloads

Updated 03 Dec 2009

View License

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

Cite As

yoash levron (2021). 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. Retrieved .

MATLAB Release Compatibility
Created with R14
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!