{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7UVRVMHJVA2OI3OV4DZSELDHX2","short_pith_number":"pith:7UVRVMHJ","schema_version":"1.0","canonical_sha256":"fd2b1ab0e9a834e46dd5e0f3222c67be9f17a97f27b3abe4d8b2293a442ba004","source":{"kind":"arxiv","id":"2304.07954","version":2},"attestation_state":"computed","paper":{"title":"Velocity Obstacle for Polytopic Collision Avoidance for Distributed Multi-robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Hongye Su, Jihao Huang, Jun Zeng, Koushil Sreenath, Xuemin Chi, Zhitao Liu","submitted_at":"2023-04-17T02:42:48Z","abstract_excerpt":"Obstacle avoidance for multi-robot navigation with polytopic shapes is challenging. Existing works simplify the system dynamics or consider it as a convex or non-convex optimization problem with positive distance constraints between robots, which limits real-time performance and scalability. Additionally, generating collision-free behavior for polytopic-shaped robots is harder due to implicit and non-differentiable distance functions between polytopes. In this paper, we extend the concept of velocity obstacle (VO) principle for polytopic-shaped robots and propose a novel approach to construct "},"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":"2304.07954","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-04-17T02:42:48Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"c2bc2d8844c50211393cde515d3cf594b666476fc2c2dfa2af6fef62935d4aeb","abstract_canon_sha256":"c2490fab09fe1b7a2eace3dac9178188060ffe08cd164b47eb33527a311e2df8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:14.727875Z","signature_b64":"tnicqCAWjSfrh47TdSeuTCCtY+aLXOQ+01GCBAtWaqoyPR2/mEzqxVuGbnzaLpqm4AcWeMLe0axc73ebiCUAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2b1ab0e9a834e46dd5e0f3222c67be9f17a97f27b3abe4d8b2293a442ba004","last_reissued_at":"2026-07-05T08:29:14.727430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:14.727430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Velocity Obstacle for Polytopic Collision Avoidance for Distributed Multi-robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Hongye Su, Jihao Huang, Jun Zeng, Koushil Sreenath, Xuemin Chi, Zhitao Liu","submitted_at":"2023-04-17T02:42:48Z","abstract_excerpt":"Obstacle avoidance for multi-robot navigation with polytopic shapes is challenging. Existing works simplify the system dynamics or consider it as a convex or non-convex optimization problem with positive distance constraints between robots, which limits real-time performance and scalability. Additionally, generating collision-free behavior for polytopic-shaped robots is harder due to implicit and non-differentiable distance functions between polytopes. In this paper, we extend the concept of velocity obstacle (VO) principle for polytopic-shaped robots and propose a novel approach to construct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07954","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.07954/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.07954","created_at":"2026-07-05T08:29:14.727485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07954v2","created_at":"2026-07-05T08:29:14.727485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07954","created_at":"2026-07-05T08:29:14.727485+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UVRVMHJVA2O","created_at":"2026-07-05T08:29:14.727485+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UVRVMHJVA2OI3OV","created_at":"2026-07-05T08:29:14.727485+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UVRVMHJ","created_at":"2026-07-05T08:29:14.727485+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/7UVRVMHJVA2OI3OV4DZSELDHX2","json":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2.json","graph_json":"https://pith.science/api/pith-number/7UVRVMHJVA2OI3OV4DZSELDHX2/graph.json","events_json":"https://pith.science/api/pith-number/7UVRVMHJVA2OI3OV4DZSELDHX2/events.json","paper":"https://pith.science/paper/7UVRVMHJ"},"agent_actions":{"view_html":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2","download_json":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2.json","view_paper":"https://pith.science/paper/7UVRVMHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07954&json=true","fetch_graph":"https://pith.science/api/pith-number/7UVRVMHJVA2OI3OV4DZSELDHX2/graph.json","fetch_events":"https://pith.science/api/pith-number/7UVRVMHJVA2OI3OV4DZSELDHX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2/action/storage_attestation","attest_author":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2/action/author_attestation","sign_citation":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2/action/citation_signature","submit_replication":"https://pith.science/pith/7UVRVMHJVA2OI3OV4DZSELDHX2/action/replication_record"}},"created_at":"2026-07-05T08:29:14.727485+00:00","updated_at":"2026-07-05T08:29:14.727485+00:00"}