REVIEW 3 cited by
Metrics and Optimization of Internal Poses for Highly Redundant Truss-Like Serialized Parallel Manipulators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper presents a kinematic definition of a serialized Stewart platform designed for autonomous in-space assembly called an Assembler. The Assemblers architecture describes problems inherent to the inverse kinematics of over-actuated mixed kinematic systems. This paper also presents a methodology for optimizing poses. In order to accomplish this with the Assembler system, an algorithm for finding a feasible solution to its inverse kinematics was developed with a wrapper for a nonlinear optimization algorithm designed to minimize the magnitude of forces incurred by each actuator. A simulated version of an Assembler was placed into a number of representative poses, and the positions were optimized. The results of these optimizations are discussed in terms of actuator forces, reachability of the platform, and applicability to high-payload structure assembly capabilities.
Forward citations
Cited by 3 Pith papers
-
On Sketching Trimmed Statistics
First sublinear-space one-pass linear sketches for top-k and trimmed-k frequency moments, with upper and lower bounds governed by a tail ratio condition.
-
Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order
Causally indefinite classical processes can compute a constructed Boolean function family with D^0.792 queries instead of D, and indefinite causal order gives an exact three-query quantum algorithm where sequential qu...
-
Improved Approximations for Hard Graph Problems using Predictions
Edge-level predictions that are only epsilon-better than random suffice to beat classical approximation barriers for vertex cover, set cover, maximum independent set, and max cut.
Discussion (0). Sign in to comment.