Abstract We present a path-following interior-point algorithm for solving the weighted linear complementarity problem from implementation point of view. studied two variants, which differ only in method updating parameter characterizes central path. The was done C++ programming language and obtained numerical results prove efficiency proposed method.

(q ú 0 is fixed); here in order to get close to the optimal set one should approach the parameter t to the optimal value of the problem. As it is well-known, both the parameterizations, under appropriate choice of F , imply polynomial-time interior-point methods for (1) . If G is a polytope, then it is reasonable to choose as F the standard logarithmic barrier for G ; polynomiality of the assoc...

The paper addresses the problem of steering a fleet of wheeled robots along a set of given spatial paths, while keeping a desired inter-vehicle formation pattern. This problem arises for example when multiple vehicles are required to scan a given area in cooperation. In a possible mission scenario, one of the vehicles acts a leader and follows a path accurately, while the other vehicles follow ...

The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that t...

This paper addresses the problem of path-following in two-dimensional space for underactuated unmanned surface vehicles (USVs), defining a set of guidance laws at kinematic level. The proposed nonlinear Lyapunov-based control law yields convergence of the path following error coordinates to zero. Furthermore, the introduction of a virtual controlled degree of freedom for the target to be follow...

We study the following problem k-constrained shortest path problem: given an acyclic directed graph D = (V,E) with arc weights ci,j , (i, j) ∈ E, two nodes s and t and an integer k, nd a shortest st-path containing at most k arcs. An important application of the problem in linear curve approximation is discussed. Vertices and edges of associated polytopes are determined, and integrality of thes...

With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Interne...

Given an undirected graph G = (V;E) with positive edge weights (lengths) w : E ! <, a set of terminals (sinks) N V , and a unique root node r 2 N , a shortest-path Steiner arborescence (simply called an arborescence in the following) is a Steiner tree rooted at r spanning all terminals in N such that every sourceto-sink path is a shortest path in G. Given a triple (G;N; r), the MinimumShortest-...

The compliant framed modular mobile robot is a new type of wheeled mobile robot for which the motion control problems of posture stabilization, path following, and trajectory tracking are studied. This robot has the advantages of a simple modular design that provides full suspension and steering capability without any additional components. Due to the flexible nature of the robot, the kinematic...