Pith. sign in

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

arxiv 2003.12144 v1 pith:NAPHEQ2G submitted 2020-03-26 cs.RO

classification cs.RO
keywords assemblerposesactuatoralgorithmassemblydesignedforcesinverse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Sketching Trimmed Statistics

    cs.DS 2025-06 conditional novelty 7.0 of 10

    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.

  2. Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

    quant-ph 2025-06 conditional novelty 7.0 of 10

    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...

  3. Improved Approximations for Hard Graph Problems using Predictions

    cs.LG 2025-05 conditional novelty 7.0 of 10

    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.

Pith tools