{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2D5KXH2SNJ6LNZHKNMNPJRB7Z6","short_pith_number":"pith:2D5KXH2S","schema_version":"1.0","canonical_sha256":"d0faab9f526a7cb6e4ea6b1af4c43fcf8dc6f8bfe229e84ec52334174280726c","source":{"kind":"arxiv","id":"2411.17052","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Programming-Based Offline Redundancy Resolution of Redundant Manipulators Along Prescribed Paths with Real-Time Adjustment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dexing Kong, Fa Wu, Jianmin Yang, Jiyong Tan, Zhihang Yin, Ziqian Wang","submitted_at":"2024-11-26T02:40:31Z","abstract_excerpt":"Traditional offline redundancy resolution of trajectories for redundant manipulators involves computing inverse kinematic solutions for Cartesian space paths, constraining the manipulator to a fixed path without real-time adjustments. Online redundancy resolution can achieve real-time adjustment of paths, but it cannot consider subsequent path points, leading to the possibility of the manipulator being forced to stop mid-motion due to joint constraints. To address this, this paper introduces a dynamic programming-based offline redundancy resolution for redundant manipulators along prescribed p"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.17052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-26T02:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"dc0434e9f5a7822a0cb00f7275431fcc0aca0eaa8a62c3576a4c69a605b7879d","abstract_canon_sha256":"20533ce3487d7f52527f14dd18d31756100be98ed3e4bc67cfe8d15784d49550"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:40.116642Z","signature_b64":"jWDlZjrSfc3MqarevCYeW8w6y1cT/1Rx68mZiUdJn/NfF4XOedp6/UAhKw9QczBHr0aLwkBqbQBRJWvyFdC+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0faab9f526a7cb6e4ea6b1af4c43fcf8dc6f8bfe229e84ec52334174280726c","last_reissued_at":"2026-07-05T10:33:40.115979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:40.115979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Programming-Based Offline Redundancy Resolution of Redundant Manipulators Along Prescribed Paths with Real-Time Adjustment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dexing Kong, Fa Wu, Jianmin Yang, Jiyong Tan, Zhihang Yin, Ziqian Wang","submitted_at":"2024-11-26T02:40:31Z","abstract_excerpt":"Traditional offline redundancy resolution of trajectories for redundant manipulators involves computing inverse kinematic solutions for Cartesian space paths, constraining the manipulator to a fixed path without real-time adjustments. Online redundancy resolution can achieve real-time adjustment of paths, but it cannot consider subsequent path points, leading to the possibility of the manipulator being forced to stop mid-motion due to joint constraints. To address this, this paper introduces a dynamic programming-based offline redundancy resolution for redundant manipulators along prescribed p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17052","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17052/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.17052","created_at":"2026-07-05T10:33:40.116047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17052v2","created_at":"2026-07-05T10:33:40.116047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17052","created_at":"2026-07-05T10:33:40.116047+00:00"},{"alias_kind":"pith_short_12","alias_value":"2D5KXH2SNJ6L","created_at":"2026-07-05T10:33:40.116047+00:00"},{"alias_kind":"pith_short_16","alias_value":"2D5KXH2SNJ6LNZHK","created_at":"2026-07-05T10:33:40.116047+00:00"},{"alias_kind":"pith_short_8","alias_value":"2D5KXH2S","created_at":"2026-07-05T10:33:40.116047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6","json":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6.json","graph_json":"https://pith.science/api/pith-number/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/graph.json","events_json":"https://pith.science/api/pith-number/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/events.json","paper":"https://pith.science/paper/2D5KXH2S"},"agent_actions":{"view_html":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6","download_json":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6.json","view_paper":"https://pith.science/paper/2D5KXH2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17052&json=true","fetch_graph":"https://pith.science/api/pith-number/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/graph.json","fetch_events":"https://pith.science/api/pith-number/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/action/storage_attestation","attest_author":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/action/author_attestation","sign_citation":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/action/citation_signature","submit_replication":"https://pith.science/pith/2D5KXH2SNJ6LNZHKNMNPJRB7Z6/action/replication_record"}},"created_at":"2026-07-05T10:33:40.116047+00:00","updated_at":"2026-07-05T10:33:40.116047+00:00"}