—Finding a path subject to multiple QoS requirements is regarded as a critical component in wireless mesh networks especially the real-time wireless communication applications become increasingly popular. As far as we know, it is an NPcomplete problem. This paper devises a simple and fast Kapproximation algorithm (KAMCOP) to deal with it from the perspective of approximate. The theoretical val...

Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...

In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-graph versions of three famous single-source shortest algorithms (The algorithm based on the topological order of the vertices, Dijkstra algorithm and Bellman-Ford algorithm), which can be viewed as general DP strategies...

In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. In [BD95] a similar three state algorithm with an upper bound of 5 3 4n 2 + O(n) and a lower bound of 1 8n 2 − O(n) were presented for its stabilization time. For this later algorithm we prove an upper bound of 1 12n 2...

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides option continue processing least-weighted margins. In Kruskal algorithm, ordering weight of ribs makes it easy shortest path. This independent nature which will facilitate and improve path creation. Based on results application system trials have been carried out testing comparison...