{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CXJPQ53O77RVIMH54J5VG2SPUN","short_pith_number":"pith:CXJPQ53O","schema_version":"1.0","canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","source":{"kind":"arxiv","id":"1907.04799","version":2},"attestation_state":"computed","paper":{"title":"RL-RRT: Kinodynamic Motion Planning via Learning Reachability Estimators from RL Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Aleksandra Faust, Hao-Tien Lewis Chiang, Jasmine Hsu, Lydia Tapia, Marek Fiser","submitted_at":"2019-07-10T15:36:03Z","abstract_excerpt":"This paper addresses two challenges facing sampling-based kinodynamic motion planning: a way to identify good candidate states for local transitions and the subsequent computationally intractable steering between these candidate states. Through the combination of sampling-based planning, a Rapidly Exploring Randomized Tree (RRT) and an efficient kinodynamic motion planner through machine learning, we propose an efficient solution to long-range planning for kinodynamic motion planning. First, we use deep reinforcement learning to learn an obstacle-avoiding policy that maps a robot's sensor obse"},"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":"1907.04799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"06f6416365c0936e38b929c31f64c265ece45d6b3e4c33ddf36f6ab17f627fae","abstract_canon_sha256":"8b18a7d85010ae17f554f30b1d616c2a7e63abfd5145a1292a3236c7d24b4628"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.530852Z","signature_b64":"5AvkcmfbJJfI0x2XZ9XnqzZ9MPb41Ah9I+2/hr9qH84zF3s9RzeQBD+Har8cSyeKDI+bB0Srny2JlwRHR/cpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","last_reissued_at":"2026-05-17T23:40:48.530079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.530079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RL-RRT: Kinodynamic Motion Planning via Learning Reachability Estimators from RL Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Aleksandra Faust, Hao-Tien Lewis Chiang, Jasmine Hsu, Lydia Tapia, Marek Fiser","submitted_at":"2019-07-10T15:36:03Z","abstract_excerpt":"This paper addresses two challenges facing sampling-based kinodynamic motion planning: a way to identify good candidate states for local transitions and the subsequent computationally intractable steering between these candidate states. Through the combination of sampling-based planning, a Rapidly Exploring Randomized Tree (RRT) and an efficient kinodynamic motion planner through machine learning, we propose an efficient solution to long-range planning for kinodynamic motion planning. First, we use deep reinforcement learning to learn an obstacle-avoiding policy that maps a robot's sensor obse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04799","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":""},"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":"1907.04799","created_at":"2026-05-17T23:40:48.530210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04799v2","created_at":"2026-05-17T23:40:48.530210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04799","created_at":"2026-05-17T23:40:48.530210+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXJPQ53O77RV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXJPQ53O77RVIMH5","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXJPQ53O","created_at":"2026-05-18T12:33:15.570797+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/CXJPQ53O77RVIMH54J5VG2SPUN","json":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN.json","graph_json":"https://pith.science/api/pith-number/CXJPQ53O77RVIMH54J5VG2SPUN/graph.json","events_json":"https://pith.science/api/pith-number/CXJPQ53O77RVIMH54J5VG2SPUN/events.json","paper":"https://pith.science/paper/CXJPQ53O"},"agent_actions":{"view_html":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN","download_json":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN.json","view_paper":"https://pith.science/paper/CXJPQ53O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04799&json=true","fetch_graph":"https://pith.science/api/pith-number/CXJPQ53O77RVIMH54J5VG2SPUN/graph.json","fetch_events":"https://pith.science/api/pith-number/CXJPQ53O77RVIMH54J5VG2SPUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/action/storage_attestation","attest_author":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/action/author_attestation","sign_citation":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/action/citation_signature","submit_replication":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/action/replication_record"}},"created_at":"2026-05-17T23:40:48.530210+00:00","updated_at":"2026-05-17T23:40:48.530210+00:00"}