{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2A64KLAOXIF3U6XSKUDPKCMY6D","short_pith_number":"pith:2A64KLAO","schema_version":"1.0","canonical_sha256":"d03dc52c0eba0bba7af25506f50998f0cca6c06961bf70c810f7e2631bd2d1a6","source":{"kind":"arxiv","id":"2403.17353","version":1},"attestation_state":"computed","paper":{"title":"Multi-Objective Trajectory Planning with Dual-Encoder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Beibei Zhang, Chentao Mao, Feng Gao, Haoyi Niu, Shuai Li, Tian Xiang, Wenyuan Bai, Xiangming Xi, Yuhua Zheng","submitted_at":"2024-03-26T03:32:45Z","abstract_excerpt":"Time-jerk optimal trajectory planning is crucial in advancing robotic arms' performance in dynamic tasks. Traditional methods rely on solving complex nonlinear programming problems, bringing significant delays in generating optimized trajectories. In this paper, we propose a two-stage approach to accelerate time-jerk optimal trajectory planning. Firstly, we introduce a dual-encoder based transformer model to establish a good preliminary trajectory. This trajectory is subsequently refined through sequential quadratic programming to improve its optimality and robustness. Our approach outperforms"},"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":"2403.17353","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-26T03:32:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"61d16a28bff71df28f9752341da1934c7a425add6967324295bb533c472b90f0","abstract_canon_sha256":"177cd8e289499ad4960e024de9052397d46f4127a10e7f090f52e037dd27cd41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:49.368517Z","signature_b64":"23eXrx3Uqys6BnGLOimqQv4pn/cGgsCj6P+QUL9k0sH/FlA/vdJBm/Zg9qWMnnZ/5uwssGFbLR+1uG4h650BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03dc52c0eba0bba7af25506f50998f0cca6c06961bf70c810f7e2631bd2d1a6","last_reissued_at":"2026-07-05T08:00:49.368026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:49.368026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective Trajectory Planning with Dual-Encoder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Beibei Zhang, Chentao Mao, Feng Gao, Haoyi Niu, Shuai Li, Tian Xiang, Wenyuan Bai, Xiangming Xi, Yuhua Zheng","submitted_at":"2024-03-26T03:32:45Z","abstract_excerpt":"Time-jerk optimal trajectory planning is crucial in advancing robotic arms' performance in dynamic tasks. Traditional methods rely on solving complex nonlinear programming problems, bringing significant delays in generating optimized trajectories. In this paper, we propose a two-stage approach to accelerate time-jerk optimal trajectory planning. Firstly, we introduce a dual-encoder based transformer model to establish a good preliminary trajectory. This trajectory is subsequently refined through sequential quadratic programming to improve its optimality and robustness. Our approach outperforms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17353","kind":"arxiv","version":1},"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/2403.17353/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":"2403.17353","created_at":"2026-07-05T08:00:49.368084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.17353v1","created_at":"2026-07-05T08:00:49.368084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17353","created_at":"2026-07-05T08:00:49.368084+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A64KLAOXIF3","created_at":"2026-07-05T08:00:49.368084+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A64KLAOXIF3U6XS","created_at":"2026-07-05T08:00:49.368084+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A64KLAO","created_at":"2026-07-05T08:00:49.368084+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/2A64KLAOXIF3U6XSKUDPKCMY6D","json":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D.json","graph_json":"https://pith.science/api/pith-number/2A64KLAOXIF3U6XSKUDPKCMY6D/graph.json","events_json":"https://pith.science/api/pith-number/2A64KLAOXIF3U6XSKUDPKCMY6D/events.json","paper":"https://pith.science/paper/2A64KLAO"},"agent_actions":{"view_html":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D","download_json":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D.json","view_paper":"https://pith.science/paper/2A64KLAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.17353&json=true","fetch_graph":"https://pith.science/api/pith-number/2A64KLAOXIF3U6XSKUDPKCMY6D/graph.json","fetch_events":"https://pith.science/api/pith-number/2A64KLAOXIF3U6XSKUDPKCMY6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D/action/storage_attestation","attest_author":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D/action/author_attestation","sign_citation":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D/action/citation_signature","submit_replication":"https://pith.science/pith/2A64KLAOXIF3U6XSKUDPKCMY6D/action/replication_record"}},"created_at":"2026-07-05T08:00:49.368084+00:00","updated_at":"2026-07-05T08:00:49.368084+00:00"}