2013
DOI: 10.1016/j.cad.2012.10.020
|View full text |Cite
|
Sign up to set email alerts
|

Solving inverse configuration space problems by adaptive sampling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 20 publications
0
4
0
Order By: Relevance
“…It follows that, in general, the idea of a direct approximation of d G seems unsuitable for applications. For the general problem of sampling SO(3), we refer the interested reader to the paper [23].…”
Section: Comments On the Use Of D F Matchmentioning
confidence: 99%
“…It follows that, in general, the idea of a direct approximation of d G seems unsuitable for applications. For the general problem of sampling SO(3), we refer the interested reader to the paper [23].…”
Section: Comments On the Use Of D F Matchmentioning
confidence: 99%
“…The collision-free space CS free is defined as the set of all free configurations in CS. The computation of the complete CS free by the adaptive sampling has been studied in [45,46]. However, computing the complete CS free cannot fulfill the efficiency requirement.…”
Section: Relationship Between the Motion Of An Object And Its Scenarimentioning
confidence: 99%
“…In this paper, we sample the 3D rotation group SO(3) to obtain the set of candidate build orientations. However, there are many gradient-free or stochastic optimization methods [26] such as simulated annealing [27] that can be used to sample SO(3) more efficiently [28] or converge to global optimum.…”
Section: Build Orientation Optimizationmentioning
confidence: 99%