Path planning can be perceived as a combination of searching and executing the optimal path between the start and destination locations. Deliberative planning capabilities are essential for the motion of autonomous unmanned vehicles in real-world scenarios. There is a challenge in handling the uncertainty concerning the obstacles in a dynamic scenario, thus requiring an intelligent, robust algorithm, with the minimum computational overhead. In this work, a fuzzy gain-based dynamic ant colony optimization (FGDACO) for dynamic path planning is proposed to effectively plan collision-free and smooth paths, with feasible path length and the minimum time. The ant colony system’s pheromone update mechanism was enhanced with a sigmoid gain function for effective exploitation during path planning. Collision avoidance was achieved through the proposed fuzzy logic control. The results were validated using occupancy grids of variable size, and the results were compared against existing methods concerning performance metrics, namely, time and length. The consistency of the algorithm was also analyzed, and the results were statistically verified.

Metaheuristic algorithms are powerful methods for handling complexities in 3D environments because of their adaptability property. This paper proposes a gain-based green ant colony optimization (GGACO) method for 3D path planning on remote sensing images. Shortest paths do not always imply minimum energy consumption. Moreover, computational complexity tends to increase in the case of higher-dimensional data. A novel method is proposed to alleviate this issue, one that provides an efficient path with minimum energy consumption by adding a gain quantity during its search. The results are validated using performance measures, viz., path length, time, and energy cost. Real-time images, along with their corresponding ground truth and digital surface models (DSM), have been sourced from the International Society for Photogrammetry and Remote Sensing (ISPRS). Comparisons have been made against state-of-the-art algorithms and analyzed. Finally, the convergence and stability of the proposed method have been verified; it has been found that the proposed method outperforms the existing method by 6%, 11%, and 5% regarding length, computation time, and energy, respectively

With the tremendous growth of Cloud Vendors, Cloud vendor (CV) prioritization is a complex decision-making problem. Previous studies on CV selection use functional and non-functional attributes, but do not have an apt structure for managing uncertainty in preferences. Motivated by this challenge, in this paper, a scientific framework for prioritization of CVs is proposed, which will help organizations to make decisions on service usage. Probabilistic linguistic term set (PLTS) is adopted as a structure for preference information, which manages uncertainty better by allowing partial information ignorance. Decision makers’ (DMs) relative importance is calculated using the programming model, by properly gaining the advantage of the partial knowledge and attributes, the weights are calculated using the extended statistical variance (SV) method. Further, DMs preferences are aggregated using a hybrid operator, and CVs are prioritized, using extended COPRAS method under the PLTS context. Finally, a case study on CV prioritization is provided for validating the scientific framework and the results are compared with other methods for understanding the strength and weakness of the proposal.