Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "path interval" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Path Interval and Its Relevance to Cutting Force in Ball and Filleted End Milling
Autorzy:
Sekine, Tsutomu
Powiązania:
https://bibliotekanauki.pl/articles/2022253.pdf
Data publikacji:
2022
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
path interval
material removal rate
cutting force
ball end mill
filleted end mill
Opis:
Computerized milling process is widely used in product manufacturing. Although manufacturing has gradually become highly-automated, the selection of machining conditions still remains an ever-present challenge in the process. To provide some findings contributable for the process planning, this study focuses on ball and filleted end milling. After brief explanations were given to the path interval determinations in both milling processes, the experiments were conducted to verify and characterize each procedure. The results of computational procedures showed good agreement with the experimental ones. Then, material removal rate and cutting force were analytically proposed for effective selection of machining conditions. The following findings were obtained from the demonstrations with discussion. Ball end milling required relatively large cutting force in the first tool path even though the material removal rate was comparatively small. On the contrary, filleted end mill enabled us to maintain a moderate cutting force in the first tool path even if the material removal rate expanded with increasing tool radius.
Źródło:
Advances in Science and Technology. Research Journal; 2022, 16, 1; 85-94
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative Study on Path Interval and Two Tool Condition Parameters in Ball and Filleted End Milling
Autorzy:
Sekine, Tsutomu
Powiązania:
https://bibliotekanauki.pl/articles/2023326.pdf
Data publikacji:
2021
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
path interval
filleted end mill
tool condition parameter
machining conditions
ball end mill
odstęp między ścieżkami
frez końcowy stożkowy
parametr stanu narzędzia
stan obróbki
frezy kulowe
Opis:
Milling is widely used as a versatile, highly automated manufacturing process. The selection of tool and its machining conditions is an ever-present challenge inherent in the process. To provide some findings contributable for the process planning, this study focuses on ball and filleted end milling. After the path interval determinations were explained briefly, the characteristics of each procedure were revealed with experimental verifications. The results of computational procedures showed good agreement with the experimental ones. Then, predominant frictional distance and cutting speed were proposed for effective selection of machining conditions. The discussion was given based on the results obtained from the demonstrations. Moreover, the relationships to path interval were elucidated through the discussion. In conclusion, several outcomes were organized from the experimental and numerical evidences.
Źródło:
Advances in Science and Technology. Research Journal; 2021, 15, 4; 311-320
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Computational Algorithm for Path Interval Determination in Multi-Axis Filleted End Milling
Autorzy:
Sekine, Tsutomu
Powiązania:
https://bibliotekanauki.pl/articles/102603.pdf
Data publikacji:
2020
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
toolpath generation
path interval
multi-axis CNC machining
torus intersection problem
filleted end mill
generowanie ścieżki narzędzia
interwał ścieżki
wieloosiowa obróbka CNC
problem z przecięciem torusa
zaokrąglony frez trzpieniowy
Opis:
The demands for filleted end milling with high efficiency are increasing more and more. Path interval determination is one of the computational processes in the tool path generation, and its development can offer further improvement in multi-axis filleted end milling. However, to our knowledge, the practical approach has been hardly proposed so far. Hence, this study proposes a novel algorithm to determine a suitable path interval in multi-axis filleted end milling with a tool inclination. The procedure with wide applicability and robustness was described based on the 3D geometrical consideration of filleted end mill. Then, the characteristics of procedure were discussed with the visual data obtained from the computational results.
Źródło:
Advances in Science and Technology. Research Journal; 2020, 14, 2; 198-205
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Axiomatic characterizations of Ptolemaic and chordal graphs
Autorzy:
Changat, Manoj
Sheela, Lekshmi Kamal K.
Narasimha-Shenoi, Prasanth G.
Powiązania:
https://bibliotekanauki.pl/articles/29519357.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
interval function
betweenness axioms
Ptolemaic graphs
transit function
induced path transit function
Opis:
The interval function and the induced path function are two well studied class of set functions of a connected graph having interesting properties and applications to convexity, metric graph theory. Both these functions can be framed as special instances of a general set function termed as a transit function defined on the Cartesian product of a non-empty set V to the power set of V satisfying the expansive, symmetric and idempotent axioms. In this paper, we propose a set of independent first order betweenness axioms on an arbitrary transit function and provide characterization of the interval function of Ptolemaic graphs and the induced path function of chordal graphs in terms of an arbitrary transit function. This in turn gives new characterizations of the Ptolemaic and chordal graphs.
Źródło:
Opuscula Mathematica; 2023, 43, 3; 393-407
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
Autorzy:
Viattchenin, D.
Powiązania:
https://bibliotekanauki.pl/articles/406450.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
project-network
dominant path
heuristic possibilistic clustering
interval-valued data
stationary clustering structure
typical point
Opis:
This paper deals in a preliminary way with the problem of selecting the smallest possible number of dominant paths in a minimized project-network with given bounds on the permissible values of the durations of activities. For this purpose, a classification technique is proposed. This technique is based on a heuristic possibilistic clustering of interval-valued data. The basic concepts of heuristic possibilistic clustering are defined and methods for preprocessing interval-valued data are described. An illustrative example is considered in detail and some conclusions are formulated.
Źródło:
Operations Research and Decisions; 2015, 25, 4; 71-87
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reliable robust path planning with application to mobile robots
Autorzy:
Pepy, R.
Kieffer, M.
Walter, E.
Powiązania:
https://bibliotekanauki.pl/articles/930096.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
analiza interwałowa
planowanie trajektorii
sterowanie odporne
interval analysis
path planning
robust control
state-space models
Opis:
This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for nonholonomic path planning in robotics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 413-424
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies