{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WWE4KJMIQSI4CESABRRPBIEFIL","short_pith_number":"pith:WWE4KJMI","schema_version":"1.0","canonical_sha256":"b589c525888491c112400c62f0a08542e2b5c8b1501de1ee802299713bf7ce07","source":{"kind":"arxiv","id":"1807.10425","version":1},"attestation_state":"computed","paper":{"title":"STEAP: simultaneous trajectory estimation and planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Byron Boots, Frank Dellaert, Jing Dong, Mustafa Mukadam","submitted_at":"2018-07-27T03:49:45Z","abstract_excerpt":"We present a unified probabilistic framework for simultaneous trajectory estimation and planning (STEAP). Estimation and planning problems are usually considered separately, however, within our framework we show that solving them simultaneously can be more accurate and efficient. The key idea is to compute the full continuous-time trajectory from start to goal at each time-step. While the robot traverses the trajectory, the history portion of the trajectory signifies the solution to the estimation problem, and the future portion of the trajectory signifies a solution to the planning problem. B"},"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":"1807.10425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-27T03:49:45Z","cross_cats_sorted":[],"title_canon_sha256":"811c89c403e203aa085c78d1713f5d06f1f9631c3f48b78c85aaea76cc7d5531","abstract_canon_sha256":"b1c75f77fb172c282c898935d742c5f1dda47953c5ae0711e80ccc2f2b0d2602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:40.660661Z","signature_b64":"PUIX8HvWP/I29fC+lVulxOr1KEEMR4ttuf5uG3pAkVW8fPwDmKuiH5DZjtOYsb4MbSjjE7OYFzeUxSug75D0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b589c525888491c112400c62f0a08542e2b5c8b1501de1ee802299713bf7ce07","last_reissued_at":"2026-05-18T00:09:40.659973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:40.659973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"STEAP: simultaneous trajectory estimation and planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Byron Boots, Frank Dellaert, Jing Dong, Mustafa Mukadam","submitted_at":"2018-07-27T03:49:45Z","abstract_excerpt":"We present a unified probabilistic framework for simultaneous trajectory estimation and planning (STEAP). Estimation and planning problems are usually considered separately, however, within our framework we show that solving them simultaneously can be more accurate and efficient. The key idea is to compute the full continuous-time trajectory from start to goal at each time-step. While the robot traverses the trajectory, the history portion of the trajectory signifies the solution to the estimation problem, and the future portion of the trajectory signifies a solution to the planning problem. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10425","kind":"arxiv","version":1},"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":"1807.10425","created_at":"2026-05-18T00:09:40.660059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10425v1","created_at":"2026-05-18T00:09:40.660059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10425","created_at":"2026-05-18T00:09:40.660059+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWE4KJMIQSI4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWE4KJMIQSI4CESA","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWE4KJMI","created_at":"2026-05-18T12:33:01.666342+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/WWE4KJMIQSI4CESABRRPBIEFIL","json":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL.json","graph_json":"https://pith.science/api/pith-number/WWE4KJMIQSI4CESABRRPBIEFIL/graph.json","events_json":"https://pith.science/api/pith-number/WWE4KJMIQSI4CESABRRPBIEFIL/events.json","paper":"https://pith.science/paper/WWE4KJMI"},"agent_actions":{"view_html":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL","download_json":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL.json","view_paper":"https://pith.science/paper/WWE4KJMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10425&json=true","fetch_graph":"https://pith.science/api/pith-number/WWE4KJMIQSI4CESABRRPBIEFIL/graph.json","fetch_events":"https://pith.science/api/pith-number/WWE4KJMIQSI4CESABRRPBIEFIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL/action/storage_attestation","attest_author":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL/action/author_attestation","sign_citation":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL/action/citation_signature","submit_replication":"https://pith.science/pith/WWE4KJMIQSI4CESABRRPBIEFIL/action/replication_record"}},"created_at":"2026-05-18T00:09:40.660059+00:00","updated_at":"2026-05-18T00:09:40.660059+00:00"}