This paper proposed a new methodology to solve collision free path planning problem for industrial robot using genetic algorithms. The method poses an optimization problem that aims to minimize the significant points traveling distance of the robot. The behaviour of more two operational parameters – the end effector traveling distance and computational time – is analysed. This algorithm is able...

The ultimate goal in robotics is to create machines which are more independent and rely less on humans to guide them in their operation. There are many sub-systems which may be present in such a robot, one of which is path planning — the ability to determine a sequence of positions or configurations between an initial and goal position within a particular obstacle cluttered workspace. Many clas...

In this paper comparison results of convex type are established for several path-dependent options in some classes of semimartingale models. The options considered are some classes of lookback options, Asian and American options and barrier options. Comparison of the path-dependent options is based on ordering properties of the local characteristics of the underlying processes as well as on sui...

We show that, for a class of systems described by a Lagrangian L(x, ˙ x, t) = 1 2 ˙ x 2 − V (x, t) the propagator K x ′′ , t ′′ ; x ′ , t ′ = e i ¯ h t ′′ t ′ dtL(x, ˙ x,t) D [x(t)] can be reduced via Noether's Theorem to a standard path integral multiplied by a phase factor. Using Henstock's integration technique, this path integral is given a firm mathematical basis. Finally, we recast the pr...

We give a formal semantics for dynamic linking and re-linking of code. The semantics is at source language level, and allows linking at a finer grain than current Java or C# implementations: Besides supporting the loading and verification of classes interleaved with program execution, it also allows type-safe removal and replacement of classes, fields and methods. Such extended features support...

Computation of a collision-free path for a movable object among obstacles is an important problem in the fields of robotics. The simplest version of motion planning consists in generating a collisionfree path for a movable object among known and static obstacles. In this paper, we introduce a two stages evolutionary algorithm. The first stage is designed to compute a collission-free path in a k...

This paper describes a dynamic programming algorithm to solve a family of problems in the reconstruction of evolutionary trees from protein sequence data, that of constructing "minimal" colorings. This dynamic programming formulation can be modified to efficiently enumerate the number of minimal colorings and thereby be used to calculate the average cost of any given edge, where the average is ...

Dynamic linking supports flexible code deployment, allowing partially linked code to link further code on the fly, as needed. Thus, end-users enjoy the advantage of automatically receiving any updates, without any need for any explicit actions on their side, such as re-compilation, or re-linking. On the down side, two executions of a program may link in different versions of code, which in some...