{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TFWAQUG5O5RYWSPSDLVR5VQS4F","short_pith_number":"pith:TFWAQUG5","schema_version":"1.0","canonical_sha256":"996c0850dd77638b49f21aeb1ed612e17192bc265c075614526cb3116123c427","source":{"kind":"arxiv","id":"2107.04926","version":1},"attestation_state":"computed","paper":{"title":"Potential iLQR: A Potential-Minimizing Controller for Planning Multi-Agent Interactive Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Ayberk Yaraneri, Negar Mehr, Talha Kavuncu","submitted_at":"2021-07-10T23:06:24Z","abstract_excerpt":"Many robotic applications involve interactions between multiple agents where an agent's decisions affect the behavior of other agents. Such behaviors can be captured by the equilibria of differential games which provide an expressive framework for modeling the agents' mutual influence. However, finding the equilibria of differential games is in general challenging as it involves solving a set of coupled optimal control problems. In this work, we propose to leverage the special structure of multi-agent interactions to generate interactive trajectories by simply solving a single optimal control "},"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":"2107.04926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-07-10T23:06:24Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"487d0db2dbad0445941ad7749199a5a22db30a7372e3cbea090fa5e1637bebc3","abstract_canon_sha256":"20adb0cc7e68a76fa337840280500cc33364142fd269790420a638df496445ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:44.324125Z","signature_b64":"SetfXZhiIGToAq6pxmjrdFdMdUgm8EO8ILrQf785cV+/gUpLcwQRckY/ztDk/bsFOp6pkx5GcrpITEY6Ot7eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996c0850dd77638b49f21aeb1ed612e17192bc265c075614526cb3116123c427","last_reissued_at":"2026-07-05T02:56:44.323716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:44.323716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Potential iLQR: A Potential-Minimizing Controller for Planning Multi-Agent Interactive Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Ayberk Yaraneri, Negar Mehr, Talha Kavuncu","submitted_at":"2021-07-10T23:06:24Z","abstract_excerpt":"Many robotic applications involve interactions between multiple agents where an agent's decisions affect the behavior of other agents. Such behaviors can be captured by the equilibria of differential games which provide an expressive framework for modeling the agents' mutual influence. However, finding the equilibria of differential games is in general challenging as it involves solving a set of coupled optimal control problems. In this work, we propose to leverage the special structure of multi-agent interactions to generate interactive trajectories by simply solving a single optimal control "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04926","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/2107.04926/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":"2107.04926","created_at":"2026-07-05T02:56:44.323767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.04926v1","created_at":"2026-07-05T02:56:44.323767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04926","created_at":"2026-07-05T02:56:44.323767+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFWAQUG5O5RY","created_at":"2026-07-05T02:56:44.323767+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFWAQUG5O5RYWSPS","created_at":"2026-07-05T02:56:44.323767+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFWAQUG5","created_at":"2026-07-05T02:56:44.323767+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.01929","citing_title":"Distributed games with jumps: An $\\alpha$-potential game approach","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F","json":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F.json","graph_json":"https://pith.science/api/pith-number/TFWAQUG5O5RYWSPSDLVR5VQS4F/graph.json","events_json":"https://pith.science/api/pith-number/TFWAQUG5O5RYWSPSDLVR5VQS4F/events.json","paper":"https://pith.science/paper/TFWAQUG5"},"agent_actions":{"view_html":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F","download_json":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F.json","view_paper":"https://pith.science/paper/TFWAQUG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.04926&json=true","fetch_graph":"https://pith.science/api/pith-number/TFWAQUG5O5RYWSPSDLVR5VQS4F/graph.json","fetch_events":"https://pith.science/api/pith-number/TFWAQUG5O5RYWSPSDLVR5VQS4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F/action/storage_attestation","attest_author":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F/action/author_attestation","sign_citation":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F/action/citation_signature","submit_replication":"https://pith.science/pith/TFWAQUG5O5RYWSPSDLVR5VQS4F/action/replication_record"}},"created_at":"2026-07-05T02:56:44.323767+00:00","updated_at":"2026-07-05T02:56:44.323767+00:00"}