{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3ZMFC2RTPFOTXG5M6GZZ572R6C","short_pith_number":"pith:3ZMFC2RT","schema_version":"1.0","canonical_sha256":"de58516a33795d3b9bacf1b39eff51f082020a4c72f790148c8c83080621e495","source":{"kind":"arxiv","id":"1711.03449","version":3},"attestation_state":"computed","paper":{"title":"Optimization-Based Collision Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Alexander Liniger, Francesco Borrelli, Xiaojing Zhang","submitted_at":"2017-11-09T16:18:17Z","abstract_excerpt":"This paper presents a novel method for reformulating non-differentiable collision avoidance constraints into smooth nonlinear constraints using strong duality of convex optimization. We focus on a controlled object whose goal is to avoid obstacles while moving in an n-dimensional space. The proposed reformulation does not introduce approximations, and applies to general obstacles and controlled objects that can be represented in an n-dimensional space as the finite union of convex sets. Furthermore, we connect our results with the notion of signed distance, which is widely used in traditional "},"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":"1711.03449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:18:17Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"f75ce61aab9d1a19b746bf8b6e079cb04fadf7c8da712ea8be95006509485b45","abstract_canon_sha256":"353e5070ddc4750741f1a6a8c14a424d53dc158f185b26bb6d21ace461571237"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.339746Z","signature_b64":"dJ7Lywy4/NzawtQWrZSZrI2bQR0itmylMgHlPYHsSo2k2PPGYgc51Xn2lnbqOUP+DQJZBh4Le9rIwOQ7UL8ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de58516a33795d3b9bacf1b39eff51f082020a4c72f790148c8c83080621e495","last_reissued_at":"2026-05-18T00:13:47.339061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.339061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization-Based Collision Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Alexander Liniger, Francesco Borrelli, Xiaojing Zhang","submitted_at":"2017-11-09T16:18:17Z","abstract_excerpt":"This paper presents a novel method for reformulating non-differentiable collision avoidance constraints into smooth nonlinear constraints using strong duality of convex optimization. We focus on a controlled object whose goal is to avoid obstacles while moving in an n-dimensional space. The proposed reformulation does not introduce approximations, and applies to general obstacles and controlled objects that can be represented in an n-dimensional space as the finite union of convex sets. Furthermore, we connect our results with the notion of signed distance, which is widely used in traditional "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03449","kind":"arxiv","version":3},"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":"1711.03449","created_at":"2026-05-18T00:13:47.339173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03449v3","created_at":"2026-05-18T00:13:47.339173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03449","created_at":"2026-05-18T00:13:47.339173+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZMFC2RTPFOT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZMFC2RTPFOTXG5M","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZMFC2RT","created_at":"2026-05-18T12:30:58.224056+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/3ZMFC2RTPFOTXG5M6GZZ572R6C","json":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C.json","graph_json":"https://pith.science/api/pith-number/3ZMFC2RTPFOTXG5M6GZZ572R6C/graph.json","events_json":"https://pith.science/api/pith-number/3ZMFC2RTPFOTXG5M6GZZ572R6C/events.json","paper":"https://pith.science/paper/3ZMFC2RT"},"agent_actions":{"view_html":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C","download_json":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C.json","view_paper":"https://pith.science/paper/3ZMFC2RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03449&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZMFC2RTPFOTXG5M6GZZ572R6C/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZMFC2RTPFOTXG5M6GZZ572R6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C/action/storage_attestation","attest_author":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C/action/author_attestation","sign_citation":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C/action/citation_signature","submit_replication":"https://pith.science/pith/3ZMFC2RTPFOTXG5M6GZZ572R6C/action/replication_record"}},"created_at":"2026-05-18T00:13:47.339173+00:00","updated_at":"2026-05-18T00:13:47.339173+00:00"}