This paper introduces a new variant of the Shortest Path Problem (SPP) called Cost-Balanced (CBPP). Various real problems can either be modeled as BCPP or include sub-problem. We prove several properties related to complexity CBPP problem. In particular, we demonstrate that problem is NP-hard in its general version, but it becomes solvable polynomial time specific family instances. Moreover, ma...

We study a path-planning problem amid a set O of obstacles in R, in which we wish to compute a short path between two points while also maintaining a high clearance from O; the clearance of a point is its distance from a nearest obstacle in O. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynom...

A mobile robot often executes a planned path by measuring its position relative to visible landmarks at known positions and then using this information to estimate its own absolute position. The minimum number of landmarks k required for self-location depends on the types of measurements the robot can perform, such as visual angles using a video camera on a pan-tilt unit, distances using a lase...

Let T be a rooted tree. A path reversal at a node x in T is performed by traversing the path from x to the tree root r and making x the parent of each node on the path other than X. Thus x becomes the new tree root. (See Fig. 1). The cost of the reversal is the number of edges on the path reversed. Path reversal is a variant of the standard path compression algorithm for maintaining disjoint se...

Recently, a two-phase handoff protocol has been proposed to support inter-switch handoff in wireless ATM networks. It employs path extension for each inter-switch handoff, followed by path optimization if necessary. In this paper, we propose a number of path optimi,zation initiation schemes to facilitate the two-phase handoff protocol. The design objective is to determine the time to invoke pat...

In survivable WDM optical networks, one of the critical issues is route computation. Although there is a possibility to optimize the route computation (together with the wavelength assignment) for static traffic pattern, it is impossible to perform such optimization for incremental and dynamic traffic. The conventional approach first computes the working path and then computes an edge-disjoint ...