This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations ...

Even if the stability of amobile robot system is guaranteed, this does not imply that its behaviors are satisfactory, or that its trajectories satisfy shortest path, minimum time, minimum energy, and other constraints. To address these concerns, we employ an evolutionary programming (EP) algorithm to obtain the optimal control parameters that govern locomotion control of a mobile robot. The cur...

We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered SSP, which however oblivious to incurred risk. present an alternative view, instead optimizing conditional value-at-risk (CVaR), established risk measure. both chains as well MDP and introduce, through novel insights, two algorithms, based linear...

The dogleg severity is one of the most important parameters in directional drilling. Improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. Selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

In this paper we will consider how to select an optimal set of supply voltages and account for level conversion costs when optimizing the schedule of a resource dominated data path for minimum energy dis-sipation. An integer linear program (ILP) is presented for minimum energy schedules under latency, supply voltage, and resource constraints. The supply voltage assignment for each resource is m...

In a multi-agent routing problem, agents must find the shortest-time path from source to destination while avoiding deadlocks and collisions with other agents. Agents travel over an infrastructure of resources (such as intersections and road segments between intersections), and each resource r has (i) a capacity C(r), which is the maximum number of agents that may occupy the resource at the sam...

In this paper we address several constrained transportation optimization problems (e.g. vehicle routing, shortest Hamiltonian path), for which we present novel algorithmic solutions and extensions, considering several optimization objectives, like minimizing costs and resource usage. All the considered problems are motivated by practical situations arising, for instance, in the mining and metal...