Hello, I need help in path planning from a Hamiltonian matrix with a condition that I visit each point only once with starting point known.

2 次查看（过去 30 天）

akash sonnad 2018-5-2

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/398645-hello-i-need-help-in-path-planning-from-a-hamiltonian-matrix-with-a-condition-that-i-visit-each-poi

评论： akash sonnad 2018-5-2

mat=[0,10,8,7,7;10,0,10,5,6;8,10,0,8,9;7,5,8,0,6;7,6,9,6,0] % C is a hamiltonian matrix containing relative distances

In this case the points are A,B,C,D,E and let A be the starting point. Now, from A, I can move to either D or E. So two different paths are possible. How do I write algorithm for this such that I compare the travelling distance for each path and choose with minimum travelling distance? I have code for the matrix with unique elements, but need help when there are more than 1 path is possible.

Note: the number of visiting points is a variable and I chose only 5 i.e A,B,C,D,E just to explain.