{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AWURMWL4RBT6GOCAK5FG63M62R","short_pith_number":"pith:AWURMWL4","schema_version":"1.0","canonical_sha256":"05a916597c8867e33840574a6f6d9ed47b20cffc7e4a75d52aa5d9df925f8de9","source":{"kind":"arxiv","id":"2411.13507","version":1},"attestation_state":"computed","paper":{"title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, Noel Csomay-Shanklin, William D. Compton","submitted_at":"2024-11-20T17:57:33Z","abstract_excerpt":"The deployment of robotic systems in real world environments requires the ability to quickly produce paths through cluttered, non-convex spaces. These planned trajectories must be both kinematically feasible (i.e., collision free) and dynamically feasible (i.e., satisfy the underlying system dynamics), necessitating a consideration of both the free space and the dynamics of the robot in the path planning phase. In this work, we explore the application of reachable Bezier polytopes as an efficient tool for generating trajectories satisfying both kinematic and dynamic requirements. Furthermore, "},"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.13507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-20T17:57:33Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"35e876ef613fb0596f274dcdacf31c784e30b0d3a129d33587e31931a6ebe065","abstract_canon_sha256":"df7d037e31f3e4d51b02e4f66df65710b2c743554efb66c8f585fe720d40ff30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:18.368495Z","signature_b64":"OsPDj6o/aVWLQ08P/Yy7c0Rx/18NFq9HVvSw0YcYoONbzK9YhhVHNBzm5U+u4yeDPnBRQ/etVJ496mF4mx8eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a916597c8867e33840574a6f6d9ed47b20cffc7e4a75d52aa5d9df925f8de9","last_reissued_at":"2026-07-05T09:38:18.367987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:18.367987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, Noel Csomay-Shanklin, William D. Compton","submitted_at":"2024-11-20T17:57:33Z","abstract_excerpt":"The deployment of robotic systems in real world environments requires the ability to quickly produce paths through cluttered, non-convex spaces. These planned trajectories must be both kinematically feasible (i.e., collision free) and dynamically feasible (i.e., satisfy the underlying system dynamics), necessitating a consideration of both the free space and the dynamics of the robot in the path planning phase. In this work, we explore the application of reachable Bezier polytopes as an efficient tool for generating trajectories satisfying both kinematic and dynamic requirements. Furthermore, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13507","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/2411.13507/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.13507","created_at":"2026-07-05T09:38:18.368049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13507v1","created_at":"2026-07-05T09:38:18.368049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13507","created_at":"2026-07-05T09:38:18.368049+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWURMWL4RBT6","created_at":"2026-07-05T09:38:18.368049+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWURMWL4RBT6GOCA","created_at":"2026-07-05T09:38:18.368049+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWURMWL4","created_at":"2026-07-05T09:38:18.368049+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/AWURMWL4RBT6GOCAK5FG63M62R","json":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R.json","graph_json":"https://pith.science/api/pith-number/AWURMWL4RBT6GOCAK5FG63M62R/graph.json","events_json":"https://pith.science/api/pith-number/AWURMWL4RBT6GOCAK5FG63M62R/events.json","paper":"https://pith.science/paper/AWURMWL4"},"agent_actions":{"view_html":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R","download_json":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R.json","view_paper":"https://pith.science/paper/AWURMWL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13507&json=true","fetch_graph":"https://pith.science/api/pith-number/AWURMWL4RBT6GOCAK5FG63M62R/graph.json","fetch_events":"https://pith.science/api/pith-number/AWURMWL4RBT6GOCAK5FG63M62R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R/action/storage_attestation","attest_author":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R/action/author_attestation","sign_citation":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R/action/citation_signature","submit_replication":"https://pith.science/pith/AWURMWL4RBT6GOCAK5FG63M62R/action/replication_record"}},"created_at":"2026-07-05T09:38:18.368049+00:00","updated_at":"2026-07-05T09:38:18.368049+00:00"}