{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UB4QVNN2MGMS7L6RCIRJBY7JZ5","short_pith_number":"pith:UB4QVNN2","schema_version":"1.0","canonical_sha256":"a0790ab5ba61992fafd1122290e3e9cf5bbed88821fabd9e4e0a401408c3a692","source":{"kind":"arxiv","id":"2010.15364","version":1},"attestation_state":"computed","paper":{"title":"Online State-Time Trajectory Planning Using Timed-ESDF in Highly Dynamic Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Delong Zhu, Jiahui Lin, Max Q.-H. Meng, Tong Zhou, Yuqi Fang","submitted_at":"2020-10-29T06:04:30Z","abstract_excerpt":"Online state-time trajectory planning in highly dynamic environments remains an unsolved problem due to the unpredictable motions of moving obstacles and the curse of dimensionality from the state-time space. Existing state-time planners are typically implemented based on randomized sampling approaches or path searching on discretized state graph. The smoothness, path clearance, and planning efficiency of these planners are usually not satisfying. In this work, we propose a gradient-based planner over the state-time space for online trajectory generation in highly dynamic environments. To enab"},"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":"2010.15364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-10-29T06:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"9ca9070b7ade57759315785c89a18004084df5b89f7459338bfa37c82e88d2a1","abstract_canon_sha256":"1e73185c9fd0b649a91da86af6f92484816a7db47bf76e970c4d4529f60d47b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:36.377286Z","signature_b64":"vHTuJYq2+ceDI8oPGxFllYCjvg1pqjyweI4Ry1j5ad+1aLACiQAXxb25T7WPPxuoruFK24WMDag8iHSfvAiRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0790ab5ba61992fafd1122290e3e9cf5bbed88821fabd9e4e0a401408c3a692","last_reissued_at":"2026-07-05T01:47:36.376900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:36.376900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online State-Time Trajectory Planning Using Timed-ESDF in Highly Dynamic Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Delong Zhu, Jiahui Lin, Max Q.-H. Meng, Tong Zhou, Yuqi Fang","submitted_at":"2020-10-29T06:04:30Z","abstract_excerpt":"Online state-time trajectory planning in highly dynamic environments remains an unsolved problem due to the unpredictable motions of moving obstacles and the curse of dimensionality from the state-time space. Existing state-time planners are typically implemented based on randomized sampling approaches or path searching on discretized state graph. The smoothness, path clearance, and planning efficiency of these planners are usually not satisfying. In this work, we propose a gradient-based planner over the state-time space for online trajectory generation in highly dynamic environments. To enab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.15364","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/2010.15364/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":"2010.15364","created_at":"2026-07-05T01:47:36.376962+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.15364v1","created_at":"2026-07-05T01:47:36.376962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15364","created_at":"2026-07-05T01:47:36.376962+00:00"},{"alias_kind":"pith_short_12","alias_value":"UB4QVNN2MGMS","created_at":"2026-07-05T01:47:36.376962+00:00"},{"alias_kind":"pith_short_16","alias_value":"UB4QVNN2MGMS7L6R","created_at":"2026-07-05T01:47:36.376962+00:00"},{"alias_kind":"pith_short_8","alias_value":"UB4QVNN2","created_at":"2026-07-05T01:47:36.376962+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/UB4QVNN2MGMS7L6RCIRJBY7JZ5","json":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5.json","graph_json":"https://pith.science/api/pith-number/UB4QVNN2MGMS7L6RCIRJBY7JZ5/graph.json","events_json":"https://pith.science/api/pith-number/UB4QVNN2MGMS7L6RCIRJBY7JZ5/events.json","paper":"https://pith.science/paper/UB4QVNN2"},"agent_actions":{"view_html":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5","download_json":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5.json","view_paper":"https://pith.science/paper/UB4QVNN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.15364&json=true","fetch_graph":"https://pith.science/api/pith-number/UB4QVNN2MGMS7L6RCIRJBY7JZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/UB4QVNN2MGMS7L6RCIRJBY7JZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5/action/storage_attestation","attest_author":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5/action/author_attestation","sign_citation":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5/action/citation_signature","submit_replication":"https://pith.science/pith/UB4QVNN2MGMS7L6RCIRJBY7JZ5/action/replication_record"}},"created_at":"2026-07-05T01:47:36.376962+00:00","updated_at":"2026-07-05T01:47:36.376962+00:00"}