{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EKC3BC3KIP45DLCKGDFWBJV6EG","short_pith_number":"pith:EKC3BC3K","schema_version":"1.0","canonical_sha256":"2285b08b6a43f9d1ac4a30cb60a6be21a63dfafdb8dde635cddd820712ebde46","source":{"kind":"arxiv","id":"2310.12828","version":2},"attestation_state":"computed","paper":{"title":"Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach in Informed Sampling-Based Path Planning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Fan Wu, Kejia Chen, Kuanqi Cai, Liding Zhang, Lingyun Chen, Peter Krumbholz, Sami Haddadin, Yu Zhang, Zhenshan Bing, Zhilin Yuan","submitted_at":"2023-10-19T15:25:05Z","abstract_excerpt":"In path planning, anytime almost-surely asymptotically optimal planners dominate the benchmark of sampling-based planners. A notable example is Batch Informed Trees (BIT*), where planners iteratively determine paths to batches of vertices within the exploration area. However, utilizing a consistent batch size is inefficient for initial pathfinding and optimal performance, it relies on effective task allocation. This paper introduces Flexible Informed Trees (FIT*), a sampling-based planner that integrates an adaptive batch-size method to enhance the initial path convergence rate. FIT* employs 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":"2310.12828","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-19T15:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"3a86cbeec417d0e961a75ac2a84d1daf40f4b486dbed85867d373927cd2079b8","abstract_canon_sha256":"0215e76bdb807cda74e90b28796e5ea0ecb4327d6f706dbb2d83672f77b3a772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:03.718333Z","signature_b64":"XrfqkYTyXIuCKQs8qL4A2VnUmuW0TC15HWKGQ/4K0s8sCRXJRvuiJZopkM5KxI37UH3z1Ujf8r4RNL1kI6dTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2285b08b6a43f9d1ac4a30cb60a6be21a63dfafdb8dde635cddd820712ebde46","last_reissued_at":"2026-07-05T11:59:03.717924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:03.717924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach in Informed Sampling-Based Path Planning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Fan Wu, Kejia Chen, Kuanqi Cai, Liding Zhang, Lingyun Chen, Peter Krumbholz, Sami Haddadin, Yu Zhang, Zhenshan Bing, Zhilin Yuan","submitted_at":"2023-10-19T15:25:05Z","abstract_excerpt":"In path planning, anytime almost-surely asymptotically optimal planners dominate the benchmark of sampling-based planners. A notable example is Batch Informed Trees (BIT*), where planners iteratively determine paths to batches of vertices within the exploration area. However, utilizing a consistent batch size is inefficient for initial pathfinding and optimal performance, it relies on effective task allocation. This paper introduces Flexible Informed Trees (FIT*), a sampling-based planner that integrates an adaptive batch-size method to enhance the initial path convergence rate. FIT* employs a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12828","kind":"arxiv","version":2},"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/2310.12828/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":"2310.12828","created_at":"2026-07-05T11:59:03.717980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12828v2","created_at":"2026-07-05T11:59:03.717980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12828","created_at":"2026-07-05T11:59:03.717980+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKC3BC3KIP45","created_at":"2026-07-05T11:59:03.717980+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKC3BC3KIP45DLCK","created_at":"2026-07-05T11:59:03.717980+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKC3BC3K","created_at":"2026-07-05T11:59:03.717980+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/EKC3BC3KIP45DLCKGDFWBJV6EG","json":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG.json","graph_json":"https://pith.science/api/pith-number/EKC3BC3KIP45DLCKGDFWBJV6EG/graph.json","events_json":"https://pith.science/api/pith-number/EKC3BC3KIP45DLCKGDFWBJV6EG/events.json","paper":"https://pith.science/paper/EKC3BC3K"},"agent_actions":{"view_html":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG","download_json":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG.json","view_paper":"https://pith.science/paper/EKC3BC3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12828&json=true","fetch_graph":"https://pith.science/api/pith-number/EKC3BC3KIP45DLCKGDFWBJV6EG/graph.json","fetch_events":"https://pith.science/api/pith-number/EKC3BC3KIP45DLCKGDFWBJV6EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG/action/storage_attestation","attest_author":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG/action/author_attestation","sign_citation":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG/action/citation_signature","submit_replication":"https://pith.science/pith/EKC3BC3KIP45DLCKGDFWBJV6EG/action/replication_record"}},"created_at":"2026-07-05T11:59:03.717980+00:00","updated_at":"2026-07-05T11:59:03.717980+00:00"}