Hwo can i design like this ?

1 次查看（过去 30 天）

显示更早的评论

sara alaraby 2019-1-21

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/440806-hwo-can-i-design-like-this

评论： Walter Roberson 2019-2-4

采纳的回答： Walter Roberson

#Matlab

if i have a matrix 6*6

which gave me info about the distance between all AP

I need to make 3 groups each group consists of 2 AP where AP not repeated in each group depend on the distance

Ex: i will start from AP no. 1 if i select it with AP no.2 as the dist. between the is large

so the second step i will check the 2nd group starting from AP3 & so on

CAN ANY one hwo can i design it by matlab code

Thanks all

6 个评论
显示 4更早的评论隐藏 4更早的评论

sara alaraby 2019-2-1

yes dear this is my rule

Image Analyst 2019-2-3

sara, youi keep forgetting to attach your data, thus delaying a solution.

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Walter Roberson 2019-1-23

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/440806-hwo-can-i-design-like-this#answer_357751

编辑：Walter Roberson 2019-2-2

在 MATLAB Online 中打开

td = YourDistanceMatrix;
pairidx = 0;
pairs = [];
while nnz(td(:) ~= 0 & ~isnan(td(:))) >= 2
  std = size(td);
  [maxd, maxidx] = max(td(:));
  [maxr, maxc] = ind2sub(std, maxidx);
  pairidx = pairidx + 1;
  pairs(pairidx, :) = [maxr, maxc];
  td(maxr, maxc) = nan;
  td(maxc, maxr) = nan;
end

In the above code, distance entries can be nan for forbidden connections, and distances of 0 are ignored under the assumption that they indicate a point connecting to itself (which is not always true: in theory two AP could be a the same location, and this code will refuse to pair them together even if they are the "furthest" remaining APs.)

Because of the possibility of nans and extra 0s, the number of rows output in pairs will not necessarily be the same as half of the number of access points.

11 个评论
显示 9更早的评论隐藏 9更早的评论

sara alaraby 2019-2-4

dear i can't understand well what you mean

can you write such a code for me please

Walter Roberson 2019-2-4

在 MATLAB Online 中打开

td = YourDistanceMatrix;
tripidx = 0;
triples = [];
std = size(td);
while nnz(td(:) ~= 0 & ~isnan(td(:))) >= 2
  [~, maxidx] = max(td(:));
  [maxr, maxc] = ind2sub(std, maxidx);
  td(maxr, maxc) = nan;
  [~, maxc2] = max(td(maxr, :));
  tripidx = tripidx + 1;
  triples(tripidx, :) = [maxr, maxc, maxc2];
  td([maxr maxc maxc2], :) = nan;
  td(:, [maxr maxc maxc2]) = nan;
end

I doubt this is what you want, but it is what you asked for and confirmed that you wanted.

I suspect that what you want is closer to finding the set of three that together cover the greatest triangular area.

请先登录，再进行评论。

类别

Mathematics and Optimization Global Optimization Toolbox Genetic Algorithm

在 Help Center 和 File Exchange 中查找有关 Genetic Algorithm 的更多信息

Community Treasure Hunt

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

Start Hunting!

Translated by