{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YGR4YORGR3FPYNBEPZ2YW55WZE","short_pith_number":"pith:YGR4YORG","schema_version":"1.0","canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","source":{"kind":"arxiv","id":"1402.2708","version":2},"attestation_state":"computed","paper":{"title":"Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Emilio Frazzoli, Michael Otte, Minghui Zhu, Pratik Chaudhari","submitted_at":"2014-02-12T00:38:05Z","abstract_excerpt":"We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game. A distributed anytime algorithm is proposed to compute a Nash equilibrium of the game. The following properties are proven: (i) the algorithm asymptotically converges to the set of Nash equilibrium; (ii) for scalar cost functionals, the price of stability equals one; (iii) for the worst case, the computational complexity and communication cost are linear in the robot "},"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":"1402.2708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"title_canon_sha256":"d2adb988630e083e9b8cb7849b003d47ecbc933f9cb8aba24410c48cd19d2e4c","abstract_canon_sha256":"ea6c364890a5268ee0700d041ca13cdb37084ac779445a488a1a4c44fb26dcd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.203309Z","signature_b64":"O1wLm1vHbZOMmWE8o5U3qDObS3sNvaMaUeh8DgBBVFv2aDGucOxaG3E1ObOiNiaG/jav0UW7uCHG8gsfYZqwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","last_reissued_at":"2026-05-18T02:58:56.202754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.202754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Emilio Frazzoli, Michael Otte, Minghui Zhu, Pratik Chaudhari","submitted_at":"2014-02-12T00:38:05Z","abstract_excerpt":"We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game. A distributed anytime algorithm is proposed to compute a Nash equilibrium of the game. The following properties are proven: (i) the algorithm asymptotically converges to the set of Nash equilibrium; (ii) for scalar cost functionals, the price of stability equals one; (iii) for the worst case, the computational complexity and communication cost are linear in the robot "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2708","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.2708","created_at":"2026-05-18T02:58:56.202833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2708v2","created_at":"2026-05-18T02:58:56.202833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2708","created_at":"2026-05-18T02:58:56.202833+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGR4YORGR3FP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGR4YORGR3FPYNBE","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGR4YORG","created_at":"2026-05-18T12:28:57.508820+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/YGR4YORGR3FPYNBEPZ2YW55WZE","json":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE.json","graph_json":"https://pith.science/api/pith-number/YGR4YORGR3FPYNBEPZ2YW55WZE/graph.json","events_json":"https://pith.science/api/pith-number/YGR4YORGR3FPYNBEPZ2YW55WZE/events.json","paper":"https://pith.science/paper/YGR4YORG"},"agent_actions":{"view_html":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE","download_json":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE.json","view_paper":"https://pith.science/paper/YGR4YORG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2708&json=true","fetch_graph":"https://pith.science/api/pith-number/YGR4YORGR3FPYNBEPZ2YW55WZE/graph.json","fetch_events":"https://pith.science/api/pith-number/YGR4YORGR3FPYNBEPZ2YW55WZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/action/storage_attestation","attest_author":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/action/author_attestation","sign_citation":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/action/citation_signature","submit_replication":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/action/replication_record"}},"created_at":"2026-05-18T02:58:56.202833+00:00","updated_at":"2026-05-18T02:58:56.202833+00:00"}