This paper describes the development of a genetic algorithm (GA) based path-planning software for local obstacle avoidance. The GA uses a novel encoding technique, which was developed to optimize the information content of the GA structure. Simulation results were used to further optimize the developed software and determine its optimum field of operation. The results show that the GA finds val...

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

In this paper we will discuss the development and use of a CAD based robot path and process-planning environment for surface finishing of conventional (metal) and nonconventional material (fiberglass composites) workpieces. This system is based on a modular and parametric approach process modeling for experimentation in determining “optimum” process parameters. It can operate upon workpieces of...

This article presents typical ship collision scenarios, simulated using the evolutionary path planning system and analyses the impact of the fitness function scaling on the quality of the solution. The function scaling decreases the selective pressure, which facilitates leaving the local optimum in the calculation process and further exploration of the solution space. The performed investigatio...

We have recently developed a new model of human speech recognition, based on automatic speech recognition techniques [1]. The present paper has two goals. First, we show that the new model performs well in the recognition of lexically ambiguous input. These demonstrations suggest that the model is able to operate in the same optimal way as human listeners. Second, we discuss how to relate the b...

Compared to hardware prefetching, the prefetching in Web systems faces quite high branching factor. Decision points mostly bifurcate the control flow tree in hardware due to the predominant if-then like program constructs. In contrast, in web there is no limit on the number of links in a page. In the case of hardware quite often all the parallel branches are prefetchedand in some cases conditio...

in this paper, the optimum shape of tailor-welded blanks (twb) is investigated. the optimization is performed for two different case studies. the first example is deep drawing of a twb with dissimilar materials and uniform thicknesses and the next example is deep drawing of a twb with similar materials and non-uniform thicknesses. the effect of blank optimization on the weld line movement is in...

This paper focuses on two commonly used path assignment policies for agents traversing a congested network: selfinterested routing, and system-optimum routing. In the selfinterested routing policy each agent selects a path that optimizes its own utility, while in the system-optimum routing, agents are assigned paths with the goal of maximizing system performance. This paper considers a scenario...

This paper studies the multicast problem in the multistage interconnection network (MIN) topology. A regular MIN is a unique path network and can provide only a single path choice in routing or multicas-ting. However, if the MIN is added with a few extra stages, it can ooer greater routing exibilities. Design implications of extra-stage MINs are discussed in this paper. An upper bound on the nu...