{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OGWVAXWLV242PHD7VSMFKURUE3","short_pith_number":"pith:OGWVAXWL","schema_version":"1.0","canonical_sha256":"71ad505ecbaeb9a79c7fac9855523426cc091bee91688c8afe71d124fd907055","source":{"kind":"arxiv","id":"1607.06886","version":3},"attestation_state":"computed","paper":{"title":"Real-Time Stochastic Kinodynamic Motion Planning via Multiobjective Search on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ali-akbar Agha-mohammadi, Brian Ichter, Edward Schmerling, Marco Pavone","submitted_at":"2016-07-23T03:44:00Z","abstract_excerpt":"In this paper we present the PUMP (Parallel Uncertainty-aware Multiobjective Planning) algorithm for addressing the stochastic kinodynamic motion planning problem, whereby one seeks a low-cost, dynamically-feasible motion plan subject to a constraint on collision probability (CP). To ensure exhaustive evaluation of candidate motion plans (as needed to tradeoff the competing objectives of performance and safety), PUMP incrementally builds the Pareto front of the problem, accounting for the optimization objective and an approximation of CP. This is performed by a massively parallel multiobjectiv"},"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":"1607.06886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-23T03:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"8ae1d634d988bff2600e405b5b1b91672a2479aa239397110271d319213d6e90","abstract_canon_sha256":"1d2969cf219f2249e47851ec0bc590a9ca1201be8df195f56b0bf5acf65a658c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:04.376742Z","signature_b64":"AmjumIkATMzHA4IfQlnIAyCN5Net6/pZbB2nGWc5d8imLPekW5rN0rnRoE+fz4zvm/MaVwhMDChJo0bXBcJdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ad505ecbaeb9a79c7fac9855523426cc091bee91688c8afe71d124fd907055","last_reissued_at":"2026-05-18T00:50:04.376073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:04.376073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Stochastic Kinodynamic Motion Planning via Multiobjective Search on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ali-akbar Agha-mohammadi, Brian Ichter, Edward Schmerling, Marco Pavone","submitted_at":"2016-07-23T03:44:00Z","abstract_excerpt":"In this paper we present the PUMP (Parallel Uncertainty-aware Multiobjective Planning) algorithm for addressing the stochastic kinodynamic motion planning problem, whereby one seeks a low-cost, dynamically-feasible motion plan subject to a constraint on collision probability (CP). To ensure exhaustive evaluation of candidate motion plans (as needed to tradeoff the competing objectives of performance and safety), PUMP incrementally builds the Pareto front of the problem, accounting for the optimization objective and an approximation of CP. This is performed by a massively parallel multiobjectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06886","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":"1607.06886","created_at":"2026-05-18T00:50:04.376177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06886v3","created_at":"2026-05-18T00:50:04.376177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06886","created_at":"2026-05-18T00:50:04.376177+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGWVAXWLV242","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGWVAXWLV242PHD7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGWVAXWL","created_at":"2026-05-18T12:30:36.002864+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/OGWVAXWLV242PHD7VSMFKURUE3","json":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3.json","graph_json":"https://pith.science/api/pith-number/OGWVAXWLV242PHD7VSMFKURUE3/graph.json","events_json":"https://pith.science/api/pith-number/OGWVAXWLV242PHD7VSMFKURUE3/events.json","paper":"https://pith.science/paper/OGWVAXWL"},"agent_actions":{"view_html":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3","download_json":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3.json","view_paper":"https://pith.science/paper/OGWVAXWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06886&json=true","fetch_graph":"https://pith.science/api/pith-number/OGWVAXWLV242PHD7VSMFKURUE3/graph.json","fetch_events":"https://pith.science/api/pith-number/OGWVAXWLV242PHD7VSMFKURUE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3/action/storage_attestation","attest_author":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3/action/author_attestation","sign_citation":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3/action/citation_signature","submit_replication":"https://pith.science/pith/OGWVAXWLV242PHD7VSMFKURUE3/action/replication_record"}},"created_at":"2026-05-18T00:50:04.376177+00:00","updated_at":"2026-05-18T00:50:04.376177+00:00"}