Computing optimum routes for Label Switched Paths (LSPs) across multiple domains in MPLS Traffic Engineering (MPLS-TE) and GMPLS networks presents a problem because no single point of path computation is aware of all of the links and resources in each domain. A solution may be achieved using the Path Computation Element (PCE) architecture. Where the sequence of domains is known a priori, variou...

Optimization using results of dynamical and mechanical simulation of a robotic nurse unit to assist paraplegic patients, on a virtual path similar to actual hospital environment, is addressed in this paper. Force-Angle tipover stability margin measurement was employed in Genetic Algorithm optimization in order to find optimum driving and locomotion mechanism for the robot. By running the ADAMS ...

Sampling-based path planning algorithms are well-known because they are able to find a path in a very short period of time, even in high-dimensional spaces. However, they are non-smooth, random paths far away from the optimum. In this paper we introduce a novel improving technique based on the Fast Marching Method which improves in a deterministic, non-iterative way the initial path provided by...