We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1 ? LIRS (Linear Interval Routing Schemes). The characterization of all the other Interval Routing Schemes with uniform cost links that represent only a single shortest path is known to be NP-Complete. We also show that...

This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...

It has been well established in the literature that the appropriate criterion for optimum trellis coded modulation design on the additive white Gaussian noise channel is maximization of the free Euclidean distance. We show here that when trellis coded modulation is used on a Rician fading channel with interleaving/deinterleaving, the design of the code for optimum performance is guided by other...

In this paper, a hybrid method based on A* algorithm and genetic algorithm in grid map is proposed to solve the optimum path planning for mobile robots. In our scheme, A* algorithm is utilized for searching a constrained shortest path quickly, and the global optimal path is obtained by using genetic algorithm to optimize the path. The method makes the path node is not limited to the center of t...