{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AFF7EOMBOL76RZ364S4MOQYPTT","short_pith_number":"pith:AFF7EOMB","schema_version":"1.0","canonical_sha256":"014bf2398172ffe8e77ee4b8c7430f9cd404a74f2ceaf425e7d06f9519778d8b","source":{"kind":"arxiv","id":"2503.07762","version":3},"attestation_state":"computed","paper":{"title":"Multi-layer Motion Planning with Kinodynamic and Spatio-Temporal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abhiroop Ajith, Constantinos Chamzas, Jeel Chatrola, Kevin Leahy","submitted_at":"2025-03-10T18:34:08Z","abstract_excerpt":"We propose a novel, multi-layered planning approach for computing paths that satisfy both kinodynamic and spatiotemporal constraints. Our three-part framework first establishes potential sequences to meet spatial constraints, using them to calculate a geometric lead path. This path then guides an asymptotically optimal sampling-based kinodynamic planner, which minimizes an STL-robustness cost to jointly satisfy spatiotemporal and kinodynamic constraints. In our experiments, we test our method with a velocity-controlled Ackerman-car model and demonstrate significant efficiency gains compared to"},"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":"2503.07762","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-10T18:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"73f93f7c63dd8c2392a8a1ecd30d98a2d8385bdc2a146ab1ef459a622b689998","abstract_canon_sha256":"6abab925e3056a961a72668a80387c42855920e4b5ccb5004ebae320dd22951b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:21.620126Z","signature_b64":"3UGJrONL3xtoY7I3GC/nm4Ble8dvNmtWqz8aEor8/mgtG5ntqNZwk8mntQeo2HP9OST9WeX6irvdhvh9EQNGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014bf2398172ffe8e77ee4b8c7430f9cd404a74f2ceaf425e7d06f9519778d8b","last_reissued_at":"2026-07-05T11:07:21.619450Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:21.619450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-layer Motion Planning with Kinodynamic and Spatio-Temporal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abhiroop Ajith, Constantinos Chamzas, Jeel Chatrola, Kevin Leahy","submitted_at":"2025-03-10T18:34:08Z","abstract_excerpt":"We propose a novel, multi-layered planning approach for computing paths that satisfy both kinodynamic and spatiotemporal constraints. Our three-part framework first establishes potential sequences to meet spatial constraints, using them to calculate a geometric lead path. This path then guides an asymptotically optimal sampling-based kinodynamic planner, which minimizes an STL-robustness cost to jointly satisfy spatiotemporal and kinodynamic constraints. In our experiments, we test our method with a velocity-controlled Ackerman-car model and demonstrate significant efficiency gains compared to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07762","kind":"arxiv","version":3},"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/2503.07762/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":"2503.07762","created_at":"2026-07-05T11:07:21.619542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.07762v3","created_at":"2026-07-05T11:07:21.619542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07762","created_at":"2026-07-05T11:07:21.619542+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFF7EOMBOL76","created_at":"2026-07-05T11:07:21.619542+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFF7EOMBOL76RZ36","created_at":"2026-07-05T11:07:21.619542+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFF7EOMB","created_at":"2026-07-05T11:07:21.619542+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/AFF7EOMBOL76RZ364S4MOQYPTT","json":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT.json","graph_json":"https://pith.science/api/pith-number/AFF7EOMBOL76RZ364S4MOQYPTT/graph.json","events_json":"https://pith.science/api/pith-number/AFF7EOMBOL76RZ364S4MOQYPTT/events.json","paper":"https://pith.science/paper/AFF7EOMB"},"agent_actions":{"view_html":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT","download_json":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT.json","view_paper":"https://pith.science/paper/AFF7EOMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.07762&json=true","fetch_graph":"https://pith.science/api/pith-number/AFF7EOMBOL76RZ364S4MOQYPTT/graph.json","fetch_events":"https://pith.science/api/pith-number/AFF7EOMBOL76RZ364S4MOQYPTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT/action/storage_attestation","attest_author":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT/action/author_attestation","sign_citation":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT/action/citation_signature","submit_replication":"https://pith.science/pith/AFF7EOMBOL76RZ364S4MOQYPTT/action/replication_record"}},"created_at":"2026-07-05T11:07:21.619542+00:00","updated_at":"2026-07-05T11:07:21.619542+00:00"}