{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DZCAAMM4LNQLGICEKMY53D7T2M","short_pith_number":"pith:DZCAAMM4","schema_version":"1.0","canonical_sha256":"1e4400319c5b60b320445331dd8ff3d3046c7f49c37f41f4754988ee065c4907","source":{"kind":"arxiv","id":"1906.03684","version":1},"attestation_state":"computed","paper":{"title":"Trajectory Optimization for Robust Humanoid Locomotion with Sample-Efficient Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jia-Jie Zhu, Ludovic Righetti, Majid Khadiv, Mohammad Hasan Yeganegi, S. Ali A. Moosavian","submitted_at":"2019-06-09T18:09:09Z","abstract_excerpt":"Trajectory optimization (TO) is one of the most powerful tools for generating feasible motions for humanoid robots. However, including uncertainties and stochasticity in the TO problem to generate robust motions can easily lead to an interactable problem. Furthermore, since the models used in the TO have always some level of abstraction, it is hard to find a realistic set of uncertainty in the space of abstract model. In this paper we aim at leveraging a sample-efficient learning technique (Bayesian optimization) to robustify trajectory optimization for humanoid locomotion. The main idea is to"},"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":"1906.03684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-09T18:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"7fbc13ac89307b4c6922dd8aa854b807668a15b10161c227d9879713313a0794","abstract_canon_sha256":"1b20538f6e99b84082e4155ebb090bfa57cbd8ef4c1f925e0ad634564058678c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:45.367753Z","signature_b64":"A1hoi+7sd2vwUu3ERaSaz8WGf5TjBWGu6RYFU8Gem5Yphw+iMblFI5YMBz8v27ysliRpdElGbbSW7W3Kbp1qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e4400319c5b60b320445331dd8ff3d3046c7f49c37f41f4754988ee065c4907","last_reissued_at":"2026-05-17T23:43:45.367065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:45.367065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trajectory Optimization for Robust Humanoid Locomotion with Sample-Efficient Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jia-Jie Zhu, Ludovic Righetti, Majid Khadiv, Mohammad Hasan Yeganegi, S. Ali A. Moosavian","submitted_at":"2019-06-09T18:09:09Z","abstract_excerpt":"Trajectory optimization (TO) is one of the most powerful tools for generating feasible motions for humanoid robots. However, including uncertainties and stochasticity in the TO problem to generate robust motions can easily lead to an interactable problem. Furthermore, since the models used in the TO have always some level of abstraction, it is hard to find a realistic set of uncertainty in the space of abstract model. In this paper we aim at leveraging a sample-efficient learning technique (Bayesian optimization) to robustify trajectory optimization for humanoid locomotion. The main idea is to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03684","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":"1906.03684","created_at":"2026-05-17T23:43:45.367178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03684v1","created_at":"2026-05-17T23:43:45.367178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03684","created_at":"2026-05-17T23:43:45.367178+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZCAAMM4LNQL","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZCAAMM4LNQLGICE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZCAAMM4","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/DZCAAMM4LNQLGICEKMY53D7T2M","json":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M.json","graph_json":"https://pith.science/api/pith-number/DZCAAMM4LNQLGICEKMY53D7T2M/graph.json","events_json":"https://pith.science/api/pith-number/DZCAAMM4LNQLGICEKMY53D7T2M/events.json","paper":"https://pith.science/paper/DZCAAMM4"},"agent_actions":{"view_html":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M","download_json":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M.json","view_paper":"https://pith.science/paper/DZCAAMM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03684&json=true","fetch_graph":"https://pith.science/api/pith-number/DZCAAMM4LNQLGICEKMY53D7T2M/graph.json","fetch_events":"https://pith.science/api/pith-number/DZCAAMM4LNQLGICEKMY53D7T2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M/action/storage_attestation","attest_author":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M/action/author_attestation","sign_citation":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M/action/citation_signature","submit_replication":"https://pith.science/pith/DZCAAMM4LNQLGICEKMY53D7T2M/action/replication_record"}},"created_at":"2026-05-17T23:43:45.367178+00:00","updated_at":"2026-05-17T23:43:45.367178+00:00"}