It seems that the current implementation of your code involves a large number of if-else conditions to determine the distance of each location from the nearest shelf. This approach can become complex and prone to errors, especially when dealing with multiple positions and overlapping conditions.
To simplify and improve the accuracy of your code, you can consider using a distance calculation based on the Euclidean distance formula. This approach will allow you to calculate the distance between each location and the nearest shelf directly, without the need for extensive if-else conditions.
Here's an example of how you can modify your code using the Euclidean distance formula:
shelf_positions = [5, 7.3; 10.3, 12.6; 15.6, 17.9; 20.9, 23.2; 26.2, 28.5; 31.5, 33.8; 36.8, 39.1; 42.1, 44.4; 47.4, 49.7; 52.7, 55];
corner_aisle_positions = [0, 5; 55, 60];
strong_los_positions = [0, 5; 25, 30; 50, 55];
for nx = 1:length(DatasetTmp_10)
x = DatasetTmp_10(nx, 1);
y = DatasetTmp_10(nx, 2);
% Check if the location is within a shelf area
if any(x >= shelf_positions(:, 1) & x <= shelf_positions(:, 2))
DatasetTmp_10(nx, 14) = 0;
else
% Calculate the distance to the nearest shelf
distances = sqrt((x - shelf_positions(:, 1)).^2 + (y - 10).^2); % Assuming the shelves are located at y = 10
DatasetTmp_10(nx, 14) = min(distances);
% Check if the location is within a corner aisle
if any(x >= corner_aisle_positions(:, 1) & x <= corner_aisle_positions(:, 2))
DatasetTmp_10(nx, 14) = min(DatasetTmp_10(nx, 14), min(abs(x - corner_aisle_positions(:, 1))));
end
% Check if the location is within a strong LOS area
if y >= 0 && y <= 5
DatasetTmp_10(nx, 14) = min(DatasetTmp_10(nx, 14), min(y, 5 - x));
elseif y >= 25 && y <= 30
DatasetTmp_10(nx, 14) = min(DatasetTmp_10(nx, 14), min(y - 25, 30 - x));
elseif y >= 50 && y <= 55
DatasetTmp_10(nx, 14) = min(DatasetTmp_10(nx, 14), min(y - 50, 55 - x));
end
end
end
In this modified code, the positions of shelves, corner aisles, and strong LOS areas are stored in separate arrays for easier reference. The Euclidean distance formula (sqrt((x - shelf_positions(:, 1)).^2 + (y - 10).^2)) is used to calculate the distance between each location and the nearest shelf (assuming shelves are located at y = 10).
The code then checks if the location is within a corner aisle or strong LOS area and calculates the corresponding distance if applicable. Finally, the minimum distance is stored in the DatasetTmp_10(nx, 14)
