{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:URRPTPAJO2EU725F5R4IPRN24Z","short_pith_number":"pith:URRPTPAJ","canonical_record":{"source":{"id":"1805.02524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T13:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"7c28b2072c044db52e4bef2ba5c3703b9cad395c481aef18ccad1d736d6981b1","abstract_canon_sha256":"0ad6a65881f91a82a4d4f61d9d548e194f770648f19ff16cdd0b9a9187221a69"},"schema_version":"1.0"},"canonical_sha256":"a462f9bc0976894feba5ec7887c5bae642ae07dee9d425fe597efcd1f27e43bd","source":{"kind":"arxiv","id":"1805.02524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02524","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02524v2","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02524","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"URRPTPAJO2EU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"URRPTPAJO2EU725F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"URRPTPAJ","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:URRPTPAJO2EU725F5R4IPRN24Z","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T13:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"7c28b2072c044db52e4bef2ba5c3703b9cad395c481aef18ccad1d736d6981b1","abstract_canon_sha256":"0ad6a65881f91a82a4d4f61d9d548e194f770648f19ff16cdd0b9a9187221a69"},"schema_version":"1.0"},"canonical_sha256":"a462f9bc0976894feba5ec7887c5bae642ae07dee9d425fe597efcd1f27e43bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.644340Z","signature_b64":"bLaU303RqP+Ftw1DidZrJLS7AaYaetwCfI6Jnkr72RApWQHSJKRrVyNlpSljwJpDctoFj+hEvKpbchcc78l3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a462f9bc0976894feba5ec7887c5bae642ae07dee9d425fe597efcd1f27e43bd","last_reissued_at":"2026-05-18T00:07:17.643709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.643709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02524","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZFKE2YzTLB0svBVXW3EqXzlIldWMcPery8q5Gz+08AsbHOF6LdZNq5UWO+xfCJb43bkM/wU1UCI+16vyBeOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:19.821921Z"},"content_sha256":"fad0fa76a6e12a3e4fd71b95b1081a80bb2a4c06f1e6b38159cf3979b0acb36f","schema_version":"1.0","event_id":"sha256:fad0fa76a6e12a3e4fd71b95b1081a80bb2a4c06f1e6b38159cf3979b0acb36f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:URRPTPAJO2EU725F5R4IPRN24Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Penalty Method Based Approach for Autonomous Navigation using Nonlinear Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ben Hermans, Goele Pipeleers, Panagiotis Patrinos","submitted_at":"2018-05-07T13:41:23Z","abstract_excerpt":"This paper presents a novel model predictive control strategy for controlling autonomous motion systems moving through an environment with obstacles of general shape. In order to solve such a generic non-convex optimization problem and find a feasible trajectory that reaches the destination, the approach employs a quadratic penalty method to enforce the obstacle avoidance constraints, and several heuristics to bypass local minima behind an obstacle. The quadratic penalty method itself aids in avoiding such local minima by gradually finding a path around the obstacle as the penalty factors are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02524","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26C4UGxTFpQhBknLSZRgoki2PyrZkc6ICz67JXJVRTpP2f+rgHP6TpgfJF9B5aQMsN5h4jCTVFhjXkqwslndDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:19.822395Z"},"content_sha256":"7090e7dddf8aa27fe59c598f6af8e124f744c3276b327382c6d3f9e55f82f3ca","schema_version":"1.0","event_id":"sha256:7090e7dddf8aa27fe59c598f6af8e124f744c3276b327382c6d3f9e55f82f3ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URRPTPAJO2EU725F5R4IPRN24Z/bundle.json","state_url":"https://pith.science/pith/URRPTPAJO2EU725F5R4IPRN24Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URRPTPAJO2EU725F5R4IPRN24Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:44:19Z","links":{"resolver":"https://pith.science/pith/URRPTPAJO2EU725F5R4IPRN24Z","bundle":"https://pith.science/pith/URRPTPAJO2EU725F5R4IPRN24Z/bundle.json","state":"https://pith.science/pith/URRPTPAJO2EU725F5R4IPRN24Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URRPTPAJO2EU725F5R4IPRN24Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:URRPTPAJO2EU725F5R4IPRN24Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ad6a65881f91a82a4d4f61d9d548e194f770648f19ff16cdd0b9a9187221a69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T13:41:23Z","title_canon_sha256":"7c28b2072c044db52e4bef2ba5c3703b9cad395c481aef18ccad1d736d6981b1"},"schema_version":"1.0","source":{"id":"1805.02524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02524","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02524v2","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02524","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"URRPTPAJO2EU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"URRPTPAJO2EU725F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"URRPTPAJ","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:7090e7dddf8aa27fe59c598f6af8e124f744c3276b327382c6d3f9e55f82f3ca","target":"graph","created_at":"2026-05-18T00:07:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper presents a novel model predictive control strategy for controlling autonomous motion systems moving through an environment with obstacles of general shape. In order to solve such a generic non-convex optimization problem and find a feasible trajectory that reaches the destination, the approach employs a quadratic penalty method to enforce the obstacle avoidance constraints, and several heuristics to bypass local minima behind an obstacle. The quadratic penalty method itself aids in avoiding such local minima by gradually finding a path around the obstacle as the penalty factors are ","authors_text":"Ben Hermans, Goele Pipeleers, Panagiotis Patrinos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T13:41:23Z","title":"A Penalty Method Based Approach for Autonomous Navigation using Nonlinear Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02524","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fad0fa76a6e12a3e4fd71b95b1081a80bb2a4c06f1e6b38159cf3979b0acb36f","target":"record","created_at":"2026-05-18T00:07:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ad6a65881f91a82a4d4f61d9d548e194f770648f19ff16cdd0b9a9187221a69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T13:41:23Z","title_canon_sha256":"7c28b2072c044db52e4bef2ba5c3703b9cad395c481aef18ccad1d736d6981b1"},"schema_version":"1.0","source":{"id":"1805.02524","kind":"arxiv","version":2}},"canonical_sha256":"a462f9bc0976894feba5ec7887c5bae642ae07dee9d425fe597efcd1f27e43bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a462f9bc0976894feba5ec7887c5bae642ae07dee9d425fe597efcd1f27e43bd","first_computed_at":"2026-05-18T00:07:17.643709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:17.643709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bLaU303RqP+Ftw1DidZrJLS7AaYaetwCfI6Jnkr72RApWQHSJKRrVyNlpSljwJpDctoFj+hEvKpbchcc78l3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:17.644340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad0fa76a6e12a3e4fd71b95b1081a80bb2a4c06f1e6b38159cf3979b0acb36f","sha256:7090e7dddf8aa27fe59c598f6af8e124f744c3276b327382c6d3f9e55f82f3ca"],"state_sha256":"f2390f771b4e34bea1abd203a6f5cd1e04ceeda07041a30bc4da3e7670ee3ec3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mj6o4DO3hhKsyajX5lgM72MbGVBPKWhHIwtuRisXX20f+1bDGWNB4tNFkss1iRz9mJLokqcVh4O5HmnNkIAmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:44:19.825468Z","bundle_sha256":"e4a58c8c4cb5ef439d8911461a3b22a29158689d849249947ad77e3bea420653"}}