{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IRNLTAP6J4XG4ZCWV7WKKS2WUT","short_pith_number":"pith:IRNLTAP6","schema_version":"1.0","canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","source":{"kind":"arxiv","id":"1707.07239","version":2},"attestation_state":"computed","paper":{"title":"A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hung Pham, Quang-Cuong Pham","submitted_at":"2017-07-23T02:54:37Z","abstract_excerpt":"Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solvin"},"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":"1707.07239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"c86708efa4953c01d8b426901fcf26a1dd732fe003138f8a50489c517dd6bc9c","abstract_canon_sha256":"020f6d28e39f3992ce8abeb97699ef86e5056bf7d9227abe7a4e7807329984ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.453947Z","signature_b64":"mDNAUTY4Qj/Q8oOuGGXACtV/PS1NKgozc0BVAv1oYRvTSNLy6SFXo+t7vwjB5DERKFyyKCOrxzpCoNAVT7PjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","last_reissued_at":"2026-05-18T00:29:51.453454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.453454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hung Pham, Quang-Cuong Pham","submitted_at":"2017-07-23T02:54:37Z","abstract_excerpt":"Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07239","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":"1707.07239","created_at":"2026-05-18T00:29:51.453528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07239v2","created_at":"2026-05-18T00:29:51.453528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07239","created_at":"2026-05-18T00:29:51.453528+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRNLTAP6J4XG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRNLTAP6J4XG4ZCW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRNLTAP6","created_at":"2026-05-18T12:31:21.493067+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/IRNLTAP6J4XG4ZCWV7WKKS2WUT","json":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT.json","graph_json":"https://pith.science/api/pith-number/IRNLTAP6J4XG4ZCWV7WKKS2WUT/graph.json","events_json":"https://pith.science/api/pith-number/IRNLTAP6J4XG4ZCWV7WKKS2WUT/events.json","paper":"https://pith.science/paper/IRNLTAP6"},"agent_actions":{"view_html":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT","download_json":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT.json","view_paper":"https://pith.science/paper/IRNLTAP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07239&json=true","fetch_graph":"https://pith.science/api/pith-number/IRNLTAP6J4XG4ZCWV7WKKS2WUT/graph.json","fetch_events":"https://pith.science/api/pith-number/IRNLTAP6J4XG4ZCWV7WKKS2WUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/action/storage_attestation","attest_author":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/action/author_attestation","sign_citation":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/action/citation_signature","submit_replication":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/action/replication_record"}},"created_at":"2026-05-18T00:29:51.453528+00:00","updated_at":"2026-05-18T00:29:51.453528+00:00"}