in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

This paper is devoted to path following control for electro-mechanical systems described by the port-Hamiltonian form. Path following control is investigated mainly for mechanical systems since the desired path is characterized by its 'position'. Therefore, most of the existing results use the nature of second order differential equations since mechanical systems are described by them. The pres...

Primal-dual path-following methods for constrained minimization problems in function space with low multiplier regularity are introduced and analyzed. Regularity properties of the path are proved. The path structure allows us to define approximating models, which are used for controlling the path parameter in an iterative process for computing a solution of the original problem. The Moreau–Yosi...

This paper addresses the problem of guidance and control for an Autonomous Surface Craft (ASC). A path following approach is used for steering the vehicle along a predefined path. The presented solution is based on the definition of an error vector that should be driven to zero by the path-following controller. The proposed methodology for controller design assumes a polytopic Linear Parameter ...

in this paper a new guidance technique for ballistic missiles and launch vehicles is proposed. generally the lambert guidance is used to generate missile nominal (correlated) parameters through powered flight to put it in a ballistic flight path. because of uncertainties and undesired factors, the nominal position and velocity obtained by lambert technique need to be followed in actual flight. ...

in the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. in this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. two path inequalities for the node-only interdiction problem are represented. it has been proved that the integrality gap of relaxation of the maximum fl...

the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

In this paper, we formulate a virtual target-based path following guidance law aimed towards multi-vehicle path following problem. The guidance law is well suited to precisely follow circular paths while minting desired distance between two adjacent vehicles where path information is only available to the lead vehicle. We analytically show lateral and longitudnal stability and convergence on th...