{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D2USUBXJQMRQVRRC2NGP3HBXQW","short_pith_number":"pith:D2USUBXJ","schema_version":"1.0","canonical_sha256":"1ea92a06e983230ac622d34cfd9c3785950312f3941a7f4aec95e29796882cac","source":{"kind":"arxiv","id":"1802.03294","version":2},"attestation_state":"computed","paper":{"title":"A fast speed planning algorithm for robotic manipulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Akos Nagy, Andrea Minari, Istvan Vajk, Luca Consolini, Marco Locatelli","submitted_at":"2018-02-09T15:06:03Z","abstract_excerpt":"We consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the maximum forces and torques allowed by the actuators. The addressed optimization problem is a finite dimensional reformulation of the continuous-time speed optimization problem, obtained by discretizing the speed profile with N points. The proposed algorithm has linear complexity with respect to N and to the number of degrees of freedom. Such complexity is the b"},"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":"1802.03294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-09T15:06:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d751d214794acb2e8b8cd0ba8049dc3c68b0a5f3fefda626b14eca9af4b6b717","abstract_canon_sha256":"a1549ed7e653d35ceda9669156fae06bcab6db5204eae09dc32df833c193f02f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:13.289799Z","signature_b64":"/f2QW10AEZu+7yjlscomr147Mp0ENW1eYzQIlH/g2pyMfJnpE+Yws7uTxnk/K8362idQdyTjAeCNBnxEdttTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea92a06e983230ac622d34cfd9c3785950312f3941a7f4aec95e29796882cac","last_reissued_at":"2026-05-18T00:04:13.289196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:13.289196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast speed planning algorithm for robotic manipulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Akos Nagy, Andrea Minari, Istvan Vajk, Luca Consolini, Marco Locatelli","submitted_at":"2018-02-09T15:06:03Z","abstract_excerpt":"We consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the maximum forces and torques allowed by the actuators. The addressed optimization problem is a finite dimensional reformulation of the continuous-time speed optimization problem, obtained by discretizing the speed profile with N points. The proposed algorithm has linear complexity with respect to N and to the number of degrees of freedom. Such complexity is the b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03294","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":""},"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":"1802.03294","created_at":"2026-05-18T00:04:13.289287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03294v2","created_at":"2026-05-18T00:04:13.289287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03294","created_at":"2026-05-18T00:04:13.289287+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2USUBXJQMRQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2USUBXJQMRQVRRC","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2USUBXJ","created_at":"2026-05-18T12:32:19.392346+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/D2USUBXJQMRQVRRC2NGP3HBXQW","json":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW.json","graph_json":"https://pith.science/api/pith-number/D2USUBXJQMRQVRRC2NGP3HBXQW/graph.json","events_json":"https://pith.science/api/pith-number/D2USUBXJQMRQVRRC2NGP3HBXQW/events.json","paper":"https://pith.science/paper/D2USUBXJ"},"agent_actions":{"view_html":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW","download_json":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW.json","view_paper":"https://pith.science/paper/D2USUBXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03294&json=true","fetch_graph":"https://pith.science/api/pith-number/D2USUBXJQMRQVRRC2NGP3HBXQW/graph.json","fetch_events":"https://pith.science/api/pith-number/D2USUBXJQMRQVRRC2NGP3HBXQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW/action/storage_attestation","attest_author":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW/action/author_attestation","sign_citation":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW/action/citation_signature","submit_replication":"https://pith.science/pith/D2USUBXJQMRQVRRC2NGP3HBXQW/action/replication_record"}},"created_at":"2026-05-18T00:04:13.289287+00:00","updated_at":"2026-05-18T00:04:13.289287+00:00"}