{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GF2HD6LHWVN23HB3QCJVPQCNMI","short_pith_number":"pith:GF2HD6LH","schema_version":"1.0","canonical_sha256":"317471f967b55bad9c3b809357c04d6210aad9538be3eabea6816274663b7aae","source":{"kind":"arxiv","id":"2306.08815","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Arya Anantula, Joydeep Biswas, Rahul Menon, Rohan Chandra, Zayne Sprague","submitted_at":"2023-06-15T02:18:21Z","abstract_excerpt":"This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are"},"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":"2306.08815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-15T02:18:21Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"945a4ffa54fbfbcc5e6e0eb2100a12eb00a1d5b4ae7072d2ba0dcaa6b7fd851b","abstract_canon_sha256":"e27e2e32abf960dcd94134ecec242273aa3be7983c3e9df5a9332d08e8738369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:56.608124Z","signature_b64":"6uKQWILWZmOlxGqJWHu7DXxYrHT4XKpHk3xOn29WO8M5ELdmPoTI2AI1wFeDR8c3m5R14c6J8hMtHViGwoxADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317471f967b55bad9c3b809357c04d6210aad9538be3eabea6816274663b7aae","last_reissued_at":"2026-07-05T06:20:56.607521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:56.607521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Arya Anantula, Joydeep Biswas, Rahul Menon, Rohan Chandra, Zayne Sprague","submitted_at":"2023-06-15T02:18:21Z","abstract_excerpt":"This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08815","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.08815/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":"2306.08815","created_at":"2026-07-05T06:20:56.607601+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08815v1","created_at":"2026-07-05T06:20:56.607601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08815","created_at":"2026-07-05T06:20:56.607601+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF2HD6LHWVN2","created_at":"2026-07-05T06:20:56.607601+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF2HD6LHWVN23HB3","created_at":"2026-07-05T06:20:56.607601+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF2HD6LH","created_at":"2026-07-05T06:20:56.607601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.06946","citing_title":"Learning Implicit Social Navigation Behavior using Deep Inverse Reinforcement Learning","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI","json":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI.json","graph_json":"https://pith.science/api/pith-number/GF2HD6LHWVN23HB3QCJVPQCNMI/graph.json","events_json":"https://pith.science/api/pith-number/GF2HD6LHWVN23HB3QCJVPQCNMI/events.json","paper":"https://pith.science/paper/GF2HD6LH"},"agent_actions":{"view_html":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI","download_json":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI.json","view_paper":"https://pith.science/paper/GF2HD6LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08815&json=true","fetch_graph":"https://pith.science/api/pith-number/GF2HD6LHWVN23HB3QCJVPQCNMI/graph.json","fetch_events":"https://pith.science/api/pith-number/GF2HD6LHWVN23HB3QCJVPQCNMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI/action/storage_attestation","attest_author":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI/action/author_attestation","sign_citation":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI/action/citation_signature","submit_replication":"https://pith.science/pith/GF2HD6LHWVN23HB3QCJVPQCNMI/action/replication_record"}},"created_at":"2026-07-05T06:20:56.607601+00:00","updated_at":"2026-07-05T06:20:56.607601+00:00"}