Algorithm for Multi- objective Traveling Salesman Problems based on Modified Transitive closure

One of the challenging facts of the Multi Objective Traveling Salesman Problem (MOTSP) is to find the best compromised solution. In this paper, we have proposed a modified transitive closure algorithm to solve MOTSP using Genetic Algorithm (GA). Modified Transitive Closure method generates all the initial solutions of each objective. By applying Genetic Algorithm (GA), compromised solutions are obtained. Numerical examples are provided to show the efficiency of the proposed algorithm for MOTSP

Topological Frontier-Based Exploration and Map-Building Using Semantic Information

Exploration of unknown environments is a fundamental problem in autonomous robotics that deals with the complexity of autonomously traversing an unknown area while acquiring the most important information of the environment. In this work, a mobile robot exploration algorithm for indoor environments is proposed. It combines frontier-based concepts with behavior-based strategies in order to build a topological representation of the environment. Frontier-based approaches assume that, to gain the most information of an environment, the robot has to move to the regions on the boundary between open space and unexplored space. The novelty of this work is in the semantic frontier classification and frontier selection according to a cost–utility function. In addition, a probabilistic loop closure algorithm is proposed to solve cyclic situations. The system outputs a topological map of the free areas of the environment for further navigation. Finally, simulated and real-world experiments have been carried out, their results and the comparison to other state-of-the-art algorithms show the feasibility of the exploration algorithm proposed and the improvement that it offers with regards to execution time and travelled distance.