{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WRHM5DUWG22V2C3EGLCGKASNRC","short_pith_number":"pith:WRHM5DUW","schema_version":"1.0","canonical_sha256":"b44ece8e9636b55d0b6432c465024d88af9c5055319f180a7ddad4a793572157","source":{"kind":"arxiv","id":"2408.13377","version":1},"attestation_state":"computed","paper":{"title":"Safe Bubble Cover for Motion Planning on Distance Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cedric Le Gentil, Ki Myung Brian Lee, Lan Wu, Nikolay Atanasov, Teresa Vidal-Calleja, Zhirui Dai","submitted_at":"2024-08-23T21:24:39Z","abstract_excerpt":"We consider the problem of planning collision-free trajectories on distance fields. Our key observation is that querying a distance field at one configuration reveals a region of safe space whose radius is given by the distance value, obviating the need for additional collision checking within the safe region. We refer to such regions as safe bubbles, and show that safe bubbles can be obtained from any Lipschitz-continuous safety constraint. Inspired by sampling-based planning algorithms, we present three algorithms for constructing a safe bubble cover of free space, named bubble roadmap (BRM)"},"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":"2408.13377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-08-23T21:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"1282d2a841b5918ce27ff676cc5b9c056f832156e7f60241985cd99369d0d84c","abstract_canon_sha256":"684d2e66d6efab7befde197feaf9f957cc9a1ef097c362e761455677e8ca6d04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:49.648693Z","signature_b64":"ECPAIeiApra0lSO9o233pyVCZQAitwWKSNZbsMMoozpHJYDgliPgfb0+dGvchkjoYeeddUVrULOx0xzGy4g6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44ece8e9636b55d0b6432c465024d88af9c5055319f180a7ddad4a793572157","last_reissued_at":"2026-07-05T08:58:49.648151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:49.648151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Bubble Cover for Motion Planning on Distance Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cedric Le Gentil, Ki Myung Brian Lee, Lan Wu, Nikolay Atanasov, Teresa Vidal-Calleja, Zhirui Dai","submitted_at":"2024-08-23T21:24:39Z","abstract_excerpt":"We consider the problem of planning collision-free trajectories on distance fields. Our key observation is that querying a distance field at one configuration reveals a region of safe space whose radius is given by the distance value, obviating the need for additional collision checking within the safe region. We refer to such regions as safe bubbles, and show that safe bubbles can be obtained from any Lipschitz-continuous safety constraint. Inspired by sampling-based planning algorithms, we present three algorithms for constructing a safe bubble cover of free space, named bubble roadmap (BRM)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13377","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/2408.13377/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":"2408.13377","created_at":"2026-07-05T08:58:49.648210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13377v1","created_at":"2026-07-05T08:58:49.648210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13377","created_at":"2026-07-05T08:58:49.648210+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRHM5DUWG22V","created_at":"2026-07-05T08:58:49.648210+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRHM5DUWG22V2C3E","created_at":"2026-07-05T08:58:49.648210+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRHM5DUW","created_at":"2026-07-05T08:58:49.648210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.04929","citing_title":"Neural Configuration-Space Barriers for Manipulation Planning and Control","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2503.04929","citing_title":"Neural Configuration-Space Barriers for Manipulation Planning and Control","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC","json":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC.json","graph_json":"https://pith.science/api/pith-number/WRHM5DUWG22V2C3EGLCGKASNRC/graph.json","events_json":"https://pith.science/api/pith-number/WRHM5DUWG22V2C3EGLCGKASNRC/events.json","paper":"https://pith.science/paper/WRHM5DUW"},"agent_actions":{"view_html":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC","download_json":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC.json","view_paper":"https://pith.science/paper/WRHM5DUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13377&json=true","fetch_graph":"https://pith.science/api/pith-number/WRHM5DUWG22V2C3EGLCGKASNRC/graph.json","fetch_events":"https://pith.science/api/pith-number/WRHM5DUWG22V2C3EGLCGKASNRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC/action/storage_attestation","attest_author":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC/action/author_attestation","sign_citation":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC/action/citation_signature","submit_replication":"https://pith.science/pith/WRHM5DUWG22V2C3EGLCGKASNRC/action/replication_record"}},"created_at":"2026-07-05T08:58:49.648210+00:00","updated_at":"2026-07-05T08:58:49.648210+00:00"}