{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HS4KVGKLV5RTRJSOIMQBD7QE35","short_pith_number":"pith:HS4KVGKL","schema_version":"1.0","canonical_sha256":"3cb8aa994baf6338a64e432011fe04df41cbaa765850a5d60b7ed0a72cee02ff","source":{"kind":"arxiv","id":"1810.03749","version":3},"attestation_state":"computed","paper":{"title":"Balancing Global Exploration and Local-connectivity Exploitation with Rapidly-exploring Random disjointed-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Fabio Ramos, Gilad Francis, Tin Lai","submitted_at":"2018-10-08T23:43:33Z","abstract_excerpt":"Sampling efficiency in a highly constrained environment has long been a major challenge for sampling-based planners. In this work, we propose Rapidly-exploring Random disjointed-Trees* (RRdT*), an incremental optimal multi-query planner. RRdT* uses multiple disjointed-trees to exploit local-connectivity of spaces via Markov Chain random sampling, which utilises neighbourhood information derived from previous successful and failed samples. To balance local exploitation, RRdT* actively explore unseen global spaces when local-connectivity exploitation is unsuccessful. The active trade-off between"},"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":"1810.03749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-08T23:43:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e42bda92720353f455849af502638738dca85b20af11c061c3f1961f89684773","abstract_canon_sha256":"1d6e2faa3278011106739162c3c454586c32642c4a498f6d54297d6f7254e694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:33.777467Z","signature_b64":"UpIhBV1OIEHGEKQpj12SwyzWCxR21QCoIaXMDKYDMUqDfwPF0WNwtB6NAdDOzRxOEEgYlm+KJ4/umnLgeDWSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb8aa994baf6338a64e432011fe04df41cbaa765850a5d60b7ed0a72cee02ff","last_reissued_at":"2026-05-17T23:52:33.776996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:33.776996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing Global Exploration and Local-connectivity Exploitation with Rapidly-exploring Random disjointed-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Fabio Ramos, Gilad Francis, Tin Lai","submitted_at":"2018-10-08T23:43:33Z","abstract_excerpt":"Sampling efficiency in a highly constrained environment has long been a major challenge for sampling-based planners. In this work, we propose Rapidly-exploring Random disjointed-Trees* (RRdT*), an incremental optimal multi-query planner. RRdT* uses multiple disjointed-trees to exploit local-connectivity of spaces via Markov Chain random sampling, which utilises neighbourhood information derived from previous successful and failed samples. To balance local exploitation, RRdT* actively explore unseen global spaces when local-connectivity exploitation is unsuccessful. The active trade-off between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03749","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":""},"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":"1810.03749","created_at":"2026-05-17T23:52:33.777061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03749v3","created_at":"2026-05-17T23:52:33.777061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03749","created_at":"2026-05-17T23:52:33.777061+00:00"},{"alias_kind":"pith_short_12","alias_value":"HS4KVGKLV5RT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HS4KVGKLV5RTRJSO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HS4KVGKL","created_at":"2026-05-18T12:32:28.185984+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/HS4KVGKLV5RTRJSOIMQBD7QE35","json":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35.json","graph_json":"https://pith.science/api/pith-number/HS4KVGKLV5RTRJSOIMQBD7QE35/graph.json","events_json":"https://pith.science/api/pith-number/HS4KVGKLV5RTRJSOIMQBD7QE35/events.json","paper":"https://pith.science/paper/HS4KVGKL"},"agent_actions":{"view_html":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35","download_json":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35.json","view_paper":"https://pith.science/paper/HS4KVGKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03749&json=true","fetch_graph":"https://pith.science/api/pith-number/HS4KVGKLV5RTRJSOIMQBD7QE35/graph.json","fetch_events":"https://pith.science/api/pith-number/HS4KVGKLV5RTRJSOIMQBD7QE35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35/action/storage_attestation","attest_author":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35/action/author_attestation","sign_citation":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35/action/citation_signature","submit_replication":"https://pith.science/pith/HS4KVGKLV5RTRJSOIMQBD7QE35/action/replication_record"}},"created_at":"2026-05-17T23:52:33.777061+00:00","updated_at":"2026-05-17T23:52:33.777061+00:00"}