Model of megalopolises in the tool path optimisation for CNC plate cutting machines

Ченцов, А. Г.; Chentsov, P. A.; Петунин, А. А.; Sesekin, A. N.

doi:10.1080/00207543.2017.1421784

Cited by 26 publications

(10 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Для достижения точности результата δ, таким образом необходимо выбирать малое , так что полное количество допустимых точек врезки растёт (как ) и полный перебор требует экспоненциального времени. Тем не менее, этот класс задач может успешно решаться, например, средствами динамического программирования (DP) а для небольших -даже точно (см, в частности [11]). В данной работе рассматриваются вопросы поиска оптимального маршрута без применения дискретизации (то есть задача CCP), которые слабо освещены в открытых источниках, см.…”

Section: рис 1 классификация задач резкиunclassified

“…Оценка качества решений, получаемых алгоритмом CCP-Relax проводилась на нескольких раскройных планах, содержащих реальные детали. В качестве базы сравнения был взят точный алгоритм решения задачи GTSP на основе динамического программирования (см [11][18].На рис.…”

unclassified

See 1 more Smart Citation

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

Петунин¹,

Polishchuk²,

Ukolov³

2021

IZVESTIYA SFedU. ENGINEERING SCIENCES

View full text Add to dashboard Cite

show abstract

Section: рис 1 классификация задач резкиunclassified

unclassified

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

Петунин¹,

Polishchuk²,

Ukolov³

2021

IZVESTIYA SFedU. ENGINEERING SCIENCES

View full text Add to dashboard Cite

show abstract

“…The laser cutting has gained particular popularity, based on a focused laser beam, which heats the surface at a specified point to the temperature of evaporation of the material. Moving the laser beam along a given route creates a cut of the material of the desired shape [5,6].…”

Section: Introductionmentioning

confidence: 99%

Digital twin of the process of thermal cutting of flat material into figured parts

Verkhoturov¹,

Verkhoturova²,

Zaripov³

et al. 2021

3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021

View full text Add to dashboard Cite

The designing a digital twin of the process of the thermal cutting of sheet material using laser or gas equipment for its figure cutting is considered. The solution to the problem of optimizing the path of the cutting tool taking into account the thermal effects on the material to be cut is discussed. The solution of the problem of modeling the temperature change of the material to be cut is considered on the basis of a discrete - logical representation of information about the state of the technological system of sheet cutting. The results of a computational experiment are presented.

show abstract

“…However, essential quality features arise; namely, the natural setting of our problem contains constraints and complicated cost functions. Now, we note [4][5][6]. Serious formalization is required.…”

Section: Introductionmentioning

confidence: 99%

Dynamic programming in routing problems (nuclear power, Engineering)

Ченцов¹

2020

MECHANICS, RESOURCE AND DIAGNOSTICS OF MATERIALS AND STRUCTURES (MRDMS-2020): Proceeding of the 14th International Conference O

View full text Add to dashboard Cite

In this investigation, extremal routing problems oriented to engineering applications are considered. These applications can be associated with dismantling of radioactive sources under accidents at nuclear power plants and with control of sheet cutting on CNC machines. Issues related to construction of optimal processes are investigated, including the choice of starting point, regular succession of tasks, and determination of concrete trajectories. To solve this problem, a nonstandard variant of dynamic programming is used. Precedence conditions play an important role in issues of reducing computational complexity. A theoretical procedure is implemented in the form of an algorithm and a standard program for a PC and a supercomputer. Model problems oriented to the above-mentioned engineering applications are resolved.where x ∈ X 0 and α ∈ P. Moreover, the choice of α ∈ P must satisfy to precedence conditions. Namely, a set K, K ⊂ 1, N × 1, N, is xed; we suppose that Condition 2.2.1 in [7] is ful lled. Then [7] (Part 2) A = { α ∈ P| ∀t 1 ∈ 1, N ∀t 2 ∈ 1, N ((α(t 1 ), α(t 2 )) ∈ K) =⇒ (t 1 < t 2 )} = ∅.

show abstract

Model of megalopolises in the tool path optimisation for CNC plate cutting machines

Cited by 26 publications

References 29 publications

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

Digital twin of the process of thermal cutting of flat material into figured parts

Dynamic programming in routing problems (nuclear power, Engineering)

Contact Info

Product

Resources

About