A Neural Network Based Approach to 5-axis Tool-path Length Estimation for Optimal Multi-cutter Selection

2011 ◽  
Vol 8 (2) ◽  
pp. 301-313 ◽  
Author(s):  
L. Geng ◽  
Y.F. Zhang ◽  
J. Y. H Fuh
Keyword(s):  
Neural Network ◽  
Path Length ◽  
Tool Path ◽  
Length Estimation ◽  
Cutter Selection

An Algorithm for a Near Optimal NC Path Generation in Staircase (Lase) Traversal of Convex Polygonal Surfaces

1999 ◽  
Vol 122 (1) ◽  
pp. 182-190 ◽  
Author(s):  
S. V. Kamarthi ◽  
S. T. S. Bukkapatnam ◽  
S. Hsieh
Keyword(s):  
Rapid Prototyping ◽  
Path Length ◽  
Tool Path ◽  
Path Generation ◽  
Convex Polygons ◽  
Sweep Angle ◽  
Pocket Milling ◽  
Different Shapes ◽  
Path Lengths ◽  
Better Than

This paper presents an analytical model of the tool path for staircase traversal of convex polygonal surfaces, and an algorithm—referred to as OPTPATH—developed based on the model to find the sweep angle that gives a near optimal tool path length. The OPTPATH algorithm can be used for staircase traversal with or without (i) overlaps between successive sweep passes, and (ii) rapid traversal along edge passes. This flexibility of OPTPATH renders it applicable not only to conventional operations such as face and pocket milling, but also to other processes such as robotic deburring, rapid prototyping, and robotic spray painting. The effective tool path lengths provided by OPTPATH are compared with those given by the following two algorithms: (i) a common industrial heuristic—referred to as the IH algorithm—and (ii) an algorithm proposed by Prabhu et al. (Prabhu, P. V., Gramopadhye, A. K., and Wang, H. P., 1990, Int. J. Prod. Res., 28, No. 1, pp. 101–130) referred to as PGW algorithm. This comparison is conducted using 100 randomly generated convex polygons of different shapes and a set of seven different tool diameters. It is found that OPTPATH performs better than both the IH as well as PGW algorithms. The superiority of OPTPATH over the two algorithms becomes more pronounced for large tool diameters. [S1087-1357(00)71501-2]

An Intelligent Approach to Multiple Cutters of Maximum Sizes for Three-Axis Milling of Sculptured Surface Parts

2008 ◽  
Vol 131 (1) ◽  
Author(s):  
Zezhong C. Chen ◽  
Gang Liu
Keyword(s):  
Tool Path ◽  
Generic Model ◽  
Interference Detection ◽  
Sculptured Surface ◽  
Surface Machining ◽  
Tool Paths ◽  
Sculptured Surface Machining ◽  
Cutter Selection ◽  
Intelligent Approach ◽  
Local Gouging

Due to their complex geometries, sculptured surface parts should be machined with multiple cutters of optimal sizes for high quality and productivity. Current methods of determining cutter sizes, however, are conservative and inefficient; their repeating process includes subjective cutter selection, intensive tool-path generation, and time-consuming gouging-and-interference detection in simulation. Our research proposes a new intelligent approach to multiple standard cutters of maximum sizes for three-axis sculptured surface machining. An innovative generic model of maximum allowable cutters in three-axis surface milling is built to eliminate any cutter causing local gouging and global interference. After the optimum standard cutters are automatically selected, their accessible regions can be identified, and the corresponding tool-paths can be generated, respectively. This approach is practical and effective in the process planning for three-axis milling of sculptured surface parts.

Information and Topology in Attractor Neural Networks

2007 ◽  
Vol 19 (4) ◽  
pp. 956-973 ◽  
Author(s):  
D. Dominguez ◽  
K. Koroutchev ◽  
E. Serrano ◽  
F. B. Rodríguez
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Mutual Information ◽  
Path Length ◽  
Basin Of Attraction ◽  
Small World ◽  
Hopfield Model ◽  
Optimal Topology ◽  
And Topology ◽  
Wide Range

A wide range of networks, including those with small-world topology, can be modeled by the connectivity ratio and randomness of the links. Both learning and attractor abilities of a neural network can be measured by the mutual information (MI) as a function of the load and the overlap between patterns and retrieval states. In this letter, we use MI to search for the optimal topology with regard to the storage and attractor properties of the network in an Amari-Hopfield model. We find that while an optimal storage implies an extremely diluted topology, a large basin of attraction leads to moderate levels of connectivity. This optimal topology is related to the clustering and path length of the network. We also build a diagram for the dynamical phases with random or local initial overlap and show that very diluted networks lose their attractor ability.

Arterial path length estimation on brachial-ankle pulse wave velocity

2014 ◽  
Vol 32 (4) ◽  
pp. 881-889 ◽  
Author(s):  
Jun Sugawara ◽  
Koichiro Hayashi ◽  
Hirofumi Tanaka
Keyword(s):  
Pulse Wave Velocity ◽  
Wave Velocity ◽  
Path Length ◽  
Pulse Wave ◽  
Length Estimation
Sign in / Sign up

Export Citation Format

Share Document