2017
DOI: 10.3934/matersci.2017.4.847
|View full text |Cite
|
Sign up to set email alerts
|

Optimal automated path planning for infinitesimal and real-sized particle assemblies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Thereafter, the minimal cost flow problem was set for determination of the optimal permutation based on the total Euclidean distance T of the centroids as [36] (…”
Section: Methodsmentioning
confidence: 99%
“…Thereafter, the minimal cost flow problem was set for determination of the optimal permutation based on the total Euclidean distance T of the centroids as [36] (…”
Section: Methodsmentioning
confidence: 99%
“…is generated based on the Euclidean distance d of each (p, q) combination with n being the set length of p (or q). Then, the optimal permutation of matched nodes is discerned based on their total Euclidean distance T through the minimization problem [32,33] (2)…”
Section: As Schematically Illustrated Inmentioning
confidence: 99%