{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S6AD2XWQRCSJOYJCPGE4GJ7SEY","short_pith_number":"pith:S6AD2XWQ","schema_version":"1.0","canonical_sha256":"97803d5ed088a49761227989c327f226019b091b8a6b58921e1ba8dc69f8ea02","source":{"kind":"arxiv","id":"1504.07940","version":1},"attestation_state":"computed","paper":{"title":"Planning for Optimal Feedback Control in the Volume of Free Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dmitry Yershov, Emilio Frazzoli, Michael Otte","submitted_at":"2015-04-29T17:39:43Z","abstract_excerpt":"The problem of optimal feedback planning among obstacles in d-dimensional configuration spaces is considered. We present a sampling-based, asymptotically optimal feedback planning method. Our method combines an incremental construction of the Delaunay triangulation, volumetric collision-detection module, and a modified Fast Marching Method to compute a converging sequence of feedback functions. The convergence and asymptotic runtime are proven theoretically and investigated during numerical experiments, in which the proposed method is compared with the state-of-the-art asymptotically optimal p"},"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":"1504.07940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-29T17:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"b4b1637eef4de3dce0d4ada7ba8dd51394d205d6563cf680effc29034a7d0615","abstract_canon_sha256":"61524379b886a22c4830a0974f8d038b41cc9a99ad0f5cb44de188ae70039f0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:25.177095Z","signature_b64":"ObJCbv2aZD+D8+WG+uM20lttQ+TxAMHpvlk1jSh/SEKV+5WxSSU9iq3ZWkU2+PBZNdG71byI5b5LgHkEbvvFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97803d5ed088a49761227989c327f226019b091b8a6b58921e1ba8dc69f8ea02","last_reissued_at":"2026-05-18T02:17:25.176340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:25.176340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning for Optimal Feedback Control in the Volume of Free Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dmitry Yershov, Emilio Frazzoli, Michael Otte","submitted_at":"2015-04-29T17:39:43Z","abstract_excerpt":"The problem of optimal feedback planning among obstacles in d-dimensional configuration spaces is considered. We present a sampling-based, asymptotically optimal feedback planning method. Our method combines an incremental construction of the Delaunay triangulation, volumetric collision-detection module, and a modified Fast Marching Method to compute a converging sequence of feedback functions. The convergence and asymptotic runtime are proven theoretically and investigated during numerical experiments, in which the proposed method is compared with the state-of-the-art asymptotically optimal p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07940","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":""},"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":"1504.07940","created_at":"2026-05-18T02:17:25.176463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07940v1","created_at":"2026-05-18T02:17:25.176463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07940","created_at":"2026-05-18T02:17:25.176463+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6AD2XWQRCSJ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6AD2XWQRCSJOYJC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6AD2XWQ","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17212","citing_title":"Planning Smooth and Safe Control Laws for a Unicycle Robot Among Obstacles","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY","json":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY.json","graph_json":"https://pith.science/api/pith-number/S6AD2XWQRCSJOYJCPGE4GJ7SEY/graph.json","events_json":"https://pith.science/api/pith-number/S6AD2XWQRCSJOYJCPGE4GJ7SEY/events.json","paper":"https://pith.science/paper/S6AD2XWQ"},"agent_actions":{"view_html":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY","download_json":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY.json","view_paper":"https://pith.science/paper/S6AD2XWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07940&json=true","fetch_graph":"https://pith.science/api/pith-number/S6AD2XWQRCSJOYJCPGE4GJ7SEY/graph.json","fetch_events":"https://pith.science/api/pith-number/S6AD2XWQRCSJOYJCPGE4GJ7SEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY/action/storage_attestation","attest_author":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY/action/author_attestation","sign_citation":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY/action/citation_signature","submit_replication":"https://pith.science/pith/S6AD2XWQRCSJOYJCPGE4GJ7SEY/action/replication_record"}},"created_at":"2026-05-18T02:17:25.176463+00:00","updated_at":"2026-05-18T02:17:25.176463+00:00"}