An Optimization Based Approach for Determining Whether a Set of Elementary Contacts Is Geometrically Feasible
Keyword(s):
Abstract The contact between two polyhedral objects can be represented with a set of elementary contacts — surface-vertex and edge-edge contacts. However, not all possible contact representations are geometrically possible. An equivalent optimization problem is posed to verify geometric feasibility. A steepest descent algorithm has been implemented and applied to two test cases — one feasible and one infeasible contact representation. The results of this work can be used to implement a predicate that verifies whether a contact representation is geometrically possible. The predicate can be used in a generate-and-test paradigm to synthesize the entire contact space.
2013 ◽
Vol 224
◽
pp. 36-45
◽
Keyword(s):
2006 ◽
Vol E89-A
(5)
◽
pp. 1160-1165
◽
Keyword(s):
Keyword(s):
2018 ◽
Vol 2018
◽
pp. 1-9
◽
Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics
2019 ◽
Vol 126
◽
pp. 87-102
◽