This article introduces a novel path planning algorithm, called m, that reduces the problem of robot path planning to optimisation of a probabilistic finite state automaton. The m-algorithm makes use of renormalised measure m of regular languages to plan the optimal path for a specified goal. Although the underlying navigation model is probabilistic, the m-algorithm yields path plans that can b...

The popularity of autonomous mobile robots have been rapidly increasing due to their new emerging application areas, from room cleaning, tourist guidance to space explorations. However, the development of a satisfactory control algorithm that will enable the autonomous mobile robots to navigate safely especially in dynamic environments is still an open research problem. In this paper, a newly p...

a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...

Main aim of the work is to design an energy efficient routing mechanism based on Dynamic Source Routing (DSR). In order to achieve energy efficient reliable transmission, routing here is divided into two parts. One is to discover the path based on Received Signal Strength (RSS) and residual energy and the other is to select based on minimum energy consumption. By eliminating the nodes that has ...