Results 101 to 110 of about 2,862,029 (221)

Improved NSGA-II method for section forming trajectory planning of boom-type roadheader

open access: yesMeitan kexue jishu
The cutting path planning of boom-type roadheader is the basis of realizing autonomous cutting. Aiming at the problem that the planning trajectory is too simple to support the automatic cutting control effectively due to insufficient consideration of ...
Chao ZHANG   +6 more
doaj   +1 more source

A Review on Cutting Force and Thermal Modeling, Toolpath Planning, and Vibration Suppression for Advanced Manufacturing

open access: yesMachines
Achieving precise prediction and intelligent control remains a pivotal challenge in cutting processes. This need is addressed through a comprehensive survey of three critical enabling technologies: cutting force/temperature modeling, tool path planning ...
Qingyang Jiang, Juan Song
doaj   +1 more source

Cuts, Paths, and Processes in Graphs

open access: yes, 2020
This work studies several optimization problems that are defined in graphs. These include graph cuts with novel objectives, disjoint shortest paths, and three different processes on graphs. We give several polynomial time algorithms for restricted instances and analyze boundaries of complexity of the aforementioned problems.
openaire   +1 more source

Thick Glass High-Quality Cutting by Ultrafast Laser Bessel Beam Perforation-Assisted Separation

open access: yesMicromachines
The cutting of thick glass is extensively employed in aerospace, optical, and other fields. Although ultrafast laser Bessel beams are heavily used for glass cutting, the cutting thickness and cutting quality need to be further improved. In this research,
Suwan Chen   +7 more
doaj   +1 more source

kappa-cut on paths and some trees

open access: yes, 2019
We define the (random) kappa-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon [21] except now a node must be cut kappa times before it is destroyed. The first order terms of the expectation and variance of chi(n), the kappa-cut number of a path of length n ...
Cai, Xing Shi   +3 more
openaire   +1 more source

Cutting path as a rural postman problem

open access: yes, 2012
The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications.
Rodrigues, Ana Maria   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy