{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3L4TYNHVGSKITUJ4DTSU5UN7LD","short_pith_number":"pith:3L4TYNHV","schema_version":"1.0","canonical_sha256":"daf93c34f5349489d13c1ce54ed1bf58c492c0c348ca57ff9da08d1a03e30dbf","source":{"kind":"arxiv","id":"1903.03823","version":1},"attestation_state":"computed","paper":{"title":"Locomotion Planning through a Hybrid Bayesian Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Farbod Farshidian, Jan Carius, Marco Hutter, Ruben Grandia, Tim Seyde","submitted_at":"2019-03-09T16:20:25Z","abstract_excerpt":"Locomotion planning for legged systems requires reasoning about suitable contact schedules. The contact sequence and timings constitute a hybrid dynamical system and prescribe a subset of achievable motions. State-of-the-art approaches cast motion planning as an optimal control problem. In order to decrease computational complexity, one common strategy separates footstep planning from motion optimization and plans contacts using heuristics. In this paper, we propose to learn contact schedule selection from high-level task descriptors using Bayesian optimization. A bi-level optimization is defi"},"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":"1903.03823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-09T16:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"f76127fbd54de747a49eafbaa42dd7b0728c33d0341d79cc9fd307751fa59dd7","abstract_canon_sha256":"a2825edf4054dba1990af34f866bd7a10a72b13a75ef37d813caa3d76e5e5b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:40.859635Z","signature_b64":"4UAy4WvqntOG0OVn/sPKOxIjWzTrlv29goN0pUX4pl0Z9aTd8L3WhVW7ASmni6Wcu4Rg3JVTGIxIJX+GAGKlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf93c34f5349489d13c1ce54ed1bf58c492c0c348ca57ff9da08d1a03e30dbf","last_reissued_at":"2026-05-17T23:51:40.859075Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:40.859075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locomotion Planning through a Hybrid Bayesian Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Farbod Farshidian, Jan Carius, Marco Hutter, Ruben Grandia, Tim Seyde","submitted_at":"2019-03-09T16:20:25Z","abstract_excerpt":"Locomotion planning for legged systems requires reasoning about suitable contact schedules. The contact sequence and timings constitute a hybrid dynamical system and prescribe a subset of achievable motions. State-of-the-art approaches cast motion planning as an optimal control problem. In order to decrease computational complexity, one common strategy separates footstep planning from motion optimization and plans contacts using heuristics. In this paper, we propose to learn contact schedule selection from high-level task descriptors using Bayesian optimization. A bi-level optimization is defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03823","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":"1903.03823","created_at":"2026-05-17T23:51:40.859159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03823v1","created_at":"2026-05-17T23:51:40.859159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03823","created_at":"2026-05-17T23:51:40.859159+00:00"},{"alias_kind":"pith_short_12","alias_value":"3L4TYNHVGSKI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3L4TYNHVGSKITUJ4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3L4TYNHV","created_at":"2026-05-18T12:33:07.085635+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/3L4TYNHVGSKITUJ4DTSU5UN7LD","json":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD.json","graph_json":"https://pith.science/api/pith-number/3L4TYNHVGSKITUJ4DTSU5UN7LD/graph.json","events_json":"https://pith.science/api/pith-number/3L4TYNHVGSKITUJ4DTSU5UN7LD/events.json","paper":"https://pith.science/paper/3L4TYNHV"},"agent_actions":{"view_html":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD","download_json":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD.json","view_paper":"https://pith.science/paper/3L4TYNHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03823&json=true","fetch_graph":"https://pith.science/api/pith-number/3L4TYNHVGSKITUJ4DTSU5UN7LD/graph.json","fetch_events":"https://pith.science/api/pith-number/3L4TYNHVGSKITUJ4DTSU5UN7LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD/action/storage_attestation","attest_author":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD/action/author_attestation","sign_citation":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD/action/citation_signature","submit_replication":"https://pith.science/pith/3L4TYNHVGSKITUJ4DTSU5UN7LD/action/replication_record"}},"created_at":"2026-05-17T23:51:40.859159+00:00","updated_at":"2026-05-17T23:51:40.859159+00:00"}