{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2RLR2KAGHSWHR7V2JNRYYZSWPF","short_pith_number":"pith:2RLR2KAG","schema_version":"1.0","canonical_sha256":"d4571d28063cac78feba4b638c6656796992989af5311cb1db639bacc1f53aab","source":{"kind":"arxiv","id":"1709.00488","version":2},"attestation_state":"computed","paper":{"title":"RMPD - A Recursive Mid-Point Displacement Algorithm for Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ankit V. Manerikar, Avinash C. Kak, Fangda Li","submitted_at":"2017-09-01T21:35:04Z","abstract_excerpt":"Motivated by what is required for real-time path planning, the paper starts out by presenting sRMPD, a new recursive \"local\" planner founded on the key notion that, unless made necessary by an obstacle, there must be no deviation from the shortest path between any two points, which would normally be a straight line path in the configuration space. Subsequently, we increase the power of sRMPD by using it as a \"connect\" subroutine call in a higher-level sampling-based algorithm mRMPD that is inspired by multi-RRT. As a consequence, mRMPD spawns a larger number of space exploring trees in regions"},"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":"1709.00488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-01T21:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"a132fc018fc11261056759116083d01d189600354deb2e7b234fab9a21f146c8","abstract_canon_sha256":"35dcc524950c441df4ce5aa77c4402bb8dbc40db9e34da2ef39333d266dafda2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.592020Z","signature_b64":"IVlfogWjjG4w2HxS6YBOjpNFuWSBztdaxJLcuzi8enJwk1KPuzdyB81MExYBEGn9riIO3xUllpO97vH86E8LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4571d28063cac78feba4b638c6656796992989af5311cb1db639bacc1f53aab","last_reissued_at":"2026-05-18T00:22:39.591639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.591639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RMPD - A Recursive Mid-Point Displacement Algorithm for Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ankit V. Manerikar, Avinash C. Kak, Fangda Li","submitted_at":"2017-09-01T21:35:04Z","abstract_excerpt":"Motivated by what is required for real-time path planning, the paper starts out by presenting sRMPD, a new recursive \"local\" planner founded on the key notion that, unless made necessary by an obstacle, there must be no deviation from the shortest path between any two points, which would normally be a straight line path in the configuration space. Subsequently, we increase the power of sRMPD by using it as a \"connect\" subroutine call in a higher-level sampling-based algorithm mRMPD that is inspired by multi-RRT. As a consequence, mRMPD spawns a larger number of space exploring trees in regions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00488","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":"1709.00488","created_at":"2026-05-18T00:22:39.591699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00488v2","created_at":"2026-05-18T00:22:39.591699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00488","created_at":"2026-05-18T00:22:39.591699+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RLR2KAGHSWH","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RLR2KAGHSWHR7V2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RLR2KAG","created_at":"2026-05-18T12:30:55.937587+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/2RLR2KAGHSWHR7V2JNRYYZSWPF","json":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF.json","graph_json":"https://pith.science/api/pith-number/2RLR2KAGHSWHR7V2JNRYYZSWPF/graph.json","events_json":"https://pith.science/api/pith-number/2RLR2KAGHSWHR7V2JNRYYZSWPF/events.json","paper":"https://pith.science/paper/2RLR2KAG"},"agent_actions":{"view_html":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF","download_json":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF.json","view_paper":"https://pith.science/paper/2RLR2KAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00488&json=true","fetch_graph":"https://pith.science/api/pith-number/2RLR2KAGHSWHR7V2JNRYYZSWPF/graph.json","fetch_events":"https://pith.science/api/pith-number/2RLR2KAGHSWHR7V2JNRYYZSWPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF/action/storage_attestation","attest_author":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF/action/author_attestation","sign_citation":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF/action/citation_signature","submit_replication":"https://pith.science/pith/2RLR2KAGHSWHR7V2JNRYYZSWPF/action/replication_record"}},"created_at":"2026-05-18T00:22:39.591699+00:00","updated_at":"2026-05-18T00:22:39.591699+00:00"}