{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EIUGYCAOGKA7GGJOZPD3ABIMKK","short_pith_number":"pith:EIUGYCAO","schema_version":"1.0","canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","source":{"kind":"arxiv","id":"2407.08848","version":3},"attestation_state":"computed","paper":{"title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bernhard Paus Graesdal, Leslie Pack Kaelbling, Rebecca H. Jiang, Russ Tedrake, Shao Yuan Chew Chia","submitted_at":"2024-07-11T20:15:00Z","abstract_excerpt":"We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that generalizes A* search to the GCS setting, where a continuous-valued decision is made at each graph vertex, and constraints across graph edges couple these decisions, influencing costs and feasibility. Such mixed discrete-continuous planning is needed in many domains, including motion planning around obstacles and planning through contact. This setting provides a unique challenge for best-first search algorithms: the cost a"},"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":"2407.08848","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-11T20:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"8b72e2c18adf8c2fabdd866f6f27f82c5d45d51bd6d204d92205696bff66fa25","abstract_canon_sha256":"0c2e7adf787d35032b05b6f3a3ac0f19c9c58c73646f89d5833de7b8923d4cca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:49.023473Z","signature_b64":"3Sdo6CFNtDin57zcYjug2lJHEBMtAbJAhd5nmA6W2lOS5o/+YYrRFzBFigj1XrtZxr26lYtLNJtkKnC0vrm3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22286c080e3281f3192ecbc7b0050c52b72e40aa9067ef5cabb52f86b34193b8","last_reissued_at":"2026-07-05T09:46:49.022984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:49.022984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bernhard Paus Graesdal, Leslie Pack Kaelbling, Rebecca H. Jiang, Russ Tedrake, Shao Yuan Chew Chia","submitted_at":"2024-07-11T20:15:00Z","abstract_excerpt":"We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that generalizes A* search to the GCS setting, where a continuous-valued decision is made at each graph vertex, and constraints across graph edges couple these decisions, influencing costs and feasibility. Such mixed discrete-continuous planning is needed in many domains, including motion planning around obstacles and planning through contact. This setting provides a unique challenge for best-first search algorithms: the cost a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08848","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/2407.08848/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":"2407.08848","created_at":"2026-07-05T09:46:49.023045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08848v3","created_at":"2026-07-05T09:46:49.023045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08848","created_at":"2026-07-05T09:46:49.023045+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIUGYCAOGKA7","created_at":"2026-07-05T09:46:49.023045+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIUGYCAOGKA7GGJO","created_at":"2026-07-05T09:46:49.023045+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIUGYCAO","created_at":"2026-07-05T09:46:49.023045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20095","citing_title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK","json":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK.json","graph_json":"https://pith.science/api/pith-number/EIUGYCAOGKA7GGJOZPD3ABIMKK/graph.json","events_json":"https://pith.science/api/pith-number/EIUGYCAOGKA7GGJOZPD3ABIMKK/events.json","paper":"https://pith.science/paper/EIUGYCAO"},"agent_actions":{"view_html":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK","download_json":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK.json","view_paper":"https://pith.science/paper/EIUGYCAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08848&json=true","fetch_graph":"https://pith.science/api/pith-number/EIUGYCAOGKA7GGJOZPD3ABIMKK/graph.json","fetch_events":"https://pith.science/api/pith-number/EIUGYCAOGKA7GGJOZPD3ABIMKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/action/storage_attestation","attest_author":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/action/author_attestation","sign_citation":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/action/citation_signature","submit_replication":"https://pith.science/pith/EIUGYCAOGKA7GGJOZPD3ABIMKK/action/replication_record"}},"created_at":"2026-07-05T09:46:49.023045+00:00","updated_at":"2026-07-05T09:46:49.023045+00:00"}