All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to general...

Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

This paper addresses the path following problem of a wheeled mobile robot with rhombic like kinematics (two drivable and steerable wheels) operating in cluttered environments. Four new path following controllers are developed to steer the kinematic model of a rhombic like vehicle along a desired path: three are based on feedback laws derived at a kinematic level with geometrical inspiration; wh...