We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors which are used as next-hops to reach the destination. This set is known as the successor set. Collectively, the successor sets from all processes in the network with respect to a given destination form a spanning, dire...

Incrementalgraph search algorithms such as D* Lite reuse previous, and perhaps partial, searches to expedite subsequent path planning tasks. In this article, we are interested in developing incremental graph for finding problems simultaneously optimize multiple objectives travel risk, arrival time, etc. This is challenging because a multi-objective setting, the number of “Pareto-optimal” soluti...

Notwithstanding the growing presence of AGVs in industry, there is a lack research about multi-wheeled which offer higher maneuverability and space efficiency. In this letter, we present generalized path continuity conditions as continuation previous done for vehicles with more constrained kinematic capabilities. We propose novel approach analytically defining various modes (motion modes), that...

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

Single-path routing protocols cannot satisfy the need of Wireless multimedia Sensor networks, and Multi-path routing protocols have many advantages in wireless multimedia sensor networks. Recent years, some researchers have proposed many multi-path routing protocols. The paper introduces and outlines the different multi-path routing protocols in WMSNs and classifies them according to their char...