Single point incremental sheet metal forming is a sheet metal forming process that forms products without the complex dies and tools with low cost. In this study, the incremental sheet metal forming process has been experimentally investigated on the explosively-welded Al/Cu bimetal sheets. Also, the effects of process parameters, such as arrangement of layer`s bimetal, tool diameter and tool p...

Path planning is a problem encountered in multiple domains, including unmanned vehicle control, air traffic control, and future exploration missions to the Moon and Mars. Due to the voluminous and complex nature of the data, path planning in such demanding environments requires the use of automated planners. In order to better understand how to support human operators in the task of path planni...

this study was carried out in zarabd, bardsir and sirjan in kerman province in 2002-2003. a number of 58 green-house owners, five wholesaller and 20 retalisaller selected by systemathic sampling method. the results showed that cost marketing service was from 196 to 620 rials and marketing net benefit was 375 rials for cucumber and 230 rials for tomato. retail marketing net benefit was 204 rials...

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. ...

This paper investigates the problem of path calcul ation of multiple metric routing. Toda 's Internet routing is based on a single metric path selecting algorithm. Single metric path is a best effort service that can only support path for one requirement. In order to support quality-of-service(QoS) call, path is subjec to multiple constraints on routing metric. In many cases, the path finding p...

Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, and wireless channel errors. In this paper, we study the problem of delivering messages from any sensor to an interested client user along the minimum-cost path in a large sensor network. We propose a new cost field based approa...

This paper presents a technique for incorporating terrain traversability data into a global path planning method for field mobile robots operating on rough natural terrain. The focus of this approach is on assessing the traversability characteristics of the global terrain using a multi-valued map representation of traversal dificulty, and using this information to compute a traversal cost funct...

In this paper, we consider the problem of planning anyangle paths with small numbers of turns on grid maps. We propose a novel heuristic search algorithm called Link* that returns paths containing fewer turns at the cost of slightly longer path lengths. Experimental results demonstrate that Link* can produce paths with fewer turns than other any-angle path planning algorithms while still mainta...

The Rooted Distance-Constrained Minimum Spanning Tree Problem (RDMSTP) is defined as follows: given a graph G = (V,E) with node set V = {0,1,...,n} and edge set E, two integer weights, a cost ce and a delay we associated with each edge e of E, and a natural (time limit) number H, we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specifie...