{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AWENP6XERNJT4Z4JASPQIZOXNX","short_pith_number":"pith:AWENP6XE","schema_version":"1.0","canonical_sha256":"0588d7fae48b533e6789049f0465d76de8a1e25bd4e89d5a69292076aa862dd1","source":{"kind":"arxiv","id":"1907.07521","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Optimization for Trajectory Planning with Heteroscedastic Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivan Markovi\\'c, Juraj Per\\v{s}i\\'c, Luka Petrovi\\'c, Marija Seder","submitted_at":"2019-07-17T13:48:01Z","abstract_excerpt":"Trajectory optimization methods for motion planning attempt to generate trajectories that minimize a suitable objective function. Such methods efficiently find solutions even for high degree-of-freedom robots. However, a globally optimal solution is often intractable in practice and state-of-the-art trajectory optimization methods are thus prone to local minima, especially in cluttered environments. In this paper, we propose a novel motion planning algorithm that employs stochastic optimization based on the cross-entropy method in order to tackle the local minima problem. We represent trajecto"},"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":"1907.07521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-17T13:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"ac69278773bac2a8ec3be858febeaf7cf49e1a984f94ba45bcf24ebaf0ab309f","abstract_canon_sha256":"84ca51a4e901dff78374878728d8fbcb7f1aba41df75c795a597d2a561ab5b9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.876480Z","signature_b64":"yl0kv2hLv0fVeiXixYSXc0JHT8FJ+j7DgNSgwse4JMYs6a9CmWgjTctG5ujuw1JJQ/GxPuL602NHNMZYWTrrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0588d7fae48b533e6789049f0465d76de8a1e25bd4e89d5a69292076aa862dd1","last_reissued_at":"2026-05-17T23:40:21.875828Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.875828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization for Trajectory Planning with Heteroscedastic Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivan Markovi\\'c, Juraj Per\\v{s}i\\'c, Luka Petrovi\\'c, Marija Seder","submitted_at":"2019-07-17T13:48:01Z","abstract_excerpt":"Trajectory optimization methods for motion planning attempt to generate trajectories that minimize a suitable objective function. Such methods efficiently find solutions even for high degree-of-freedom robots. However, a globally optimal solution is often intractable in practice and state-of-the-art trajectory optimization methods are thus prone to local minima, especially in cluttered environments. In this paper, we propose a novel motion planning algorithm that employs stochastic optimization based on the cross-entropy method in order to tackle the local minima problem. We represent trajecto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07521","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":"1907.07521","created_at":"2026-05-17T23:40:21.875935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07521v1","created_at":"2026-05-17T23:40:21.875935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07521","created_at":"2026-05-17T23:40:21.875935+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWENP6XERNJT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWENP6XERNJT4Z4J","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWENP6XE","created_at":"2026-05-18T12:33:12.712433+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/AWENP6XERNJT4Z4JASPQIZOXNX","json":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX.json","graph_json":"https://pith.science/api/pith-number/AWENP6XERNJT4Z4JASPQIZOXNX/graph.json","events_json":"https://pith.science/api/pith-number/AWENP6XERNJT4Z4JASPQIZOXNX/events.json","paper":"https://pith.science/paper/AWENP6XE"},"agent_actions":{"view_html":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX","download_json":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX.json","view_paper":"https://pith.science/paper/AWENP6XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07521&json=true","fetch_graph":"https://pith.science/api/pith-number/AWENP6XERNJT4Z4JASPQIZOXNX/graph.json","fetch_events":"https://pith.science/api/pith-number/AWENP6XERNJT4Z4JASPQIZOXNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX/action/storage_attestation","attest_author":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX/action/author_attestation","sign_citation":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX/action/citation_signature","submit_replication":"https://pith.science/pith/AWENP6XERNJT4Z4JASPQIZOXNX/action/replication_record"}},"created_at":"2026-05-17T23:40:21.875935+00:00","updated_at":"2026-05-17T23:40:21.875935+00:00"}