{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UUOLOSWQZJVXF3DTTIXBRRN656","short_pith_number":"pith:UUOLOSWQ","schema_version":"1.0","canonical_sha256":"a51cb74ad0ca6b72ec739a2e18c5beefa74d7515b53397c22491681d0af30309","source":{"kind":"arxiv","id":"2404.00186","version":1},"attestation_state":"computed","paper":{"title":"A Sequential Quadratic Programming Approach to the Solution of Open-Loop Generalized Nash Equilibria for Autonomous Racing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Edward L. Zhu, Francesco Borrelli","submitted_at":"2024-03-29T22:53:51Z","abstract_excerpt":"Dynamic games can be an effective approach for modeling interactive behavior between multiple competitive agents in autonomous racing and they provide a theoretical framework for simultaneous prediction and control in such scenarios. In this work, we propose DG-SQP, a numerical method for the solution of local generalized Nash equilibria (GNE) for open-loop general-sum dynamic games for agents with nonlinear dynamics and constraints. In particular, we formulate a sequential quadratic programming (SQP) approach which requires only the solution of a single convex quadratic program at each iterat"},"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":"2404.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-29T22:53:51Z","cross_cats_sorted":[],"title_canon_sha256":"b967a0f70430bb1984dd98160508fd8a73bbbfbd6134ac1c8805a3c4147d034b","abstract_canon_sha256":"dd4614f57c55dc095716abc12f78ac532ff9ee8bbf6e48657f638558a3a0af57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:29.387028Z","signature_b64":"PfrBIhs4aZpKp6ovgllErMJSkZdGpIbG3yUvBvRO6vtzzQ3sqNdqDS6ufyM8HwFonB9nrXESYkhLL9oASjWnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a51cb74ad0ca6b72ec739a2e18c5beefa74d7515b53397c22491681d0af30309","last_reissued_at":"2026-07-05T08:02:29.386554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:29.386554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sequential Quadratic Programming Approach to the Solution of Open-Loop Generalized Nash Equilibria for Autonomous Racing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Edward L. Zhu, Francesco Borrelli","submitted_at":"2024-03-29T22:53:51Z","abstract_excerpt":"Dynamic games can be an effective approach for modeling interactive behavior between multiple competitive agents in autonomous racing and they provide a theoretical framework for simultaneous prediction and control in such scenarios. In this work, we propose DG-SQP, a numerical method for the solution of local generalized Nash equilibria (GNE) for open-loop general-sum dynamic games for agents with nonlinear dynamics and constraints. In particular, we formulate a sequential quadratic programming (SQP) approach which requires only the solution of a single convex quadratic program at each iterat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00186","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/2404.00186/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":"2404.00186","created_at":"2026-07-05T08:02:29.386610+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00186v1","created_at":"2026-07-05T08:02:29.386610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00186","created_at":"2026-07-05T08:02:29.386610+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUOLOSWQZJVX","created_at":"2026-07-05T08:02:29.386610+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUOLOSWQZJVXF3DT","created_at":"2026-07-05T08:02:29.386610+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUOLOSWQ","created_at":"2026-07-05T08:02:29.386610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28617","citing_title":"A Fast Convergent Algorithm for Solving Non-convex Partially-Decoupled Generalized Nash Equilibrium Problems","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656","json":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656.json","graph_json":"https://pith.science/api/pith-number/UUOLOSWQZJVXF3DTTIXBRRN656/graph.json","events_json":"https://pith.science/api/pith-number/UUOLOSWQZJVXF3DTTIXBRRN656/events.json","paper":"https://pith.science/paper/UUOLOSWQ"},"agent_actions":{"view_html":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656","download_json":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656.json","view_paper":"https://pith.science/paper/UUOLOSWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00186&json=true","fetch_graph":"https://pith.science/api/pith-number/UUOLOSWQZJVXF3DTTIXBRRN656/graph.json","fetch_events":"https://pith.science/api/pith-number/UUOLOSWQZJVXF3DTTIXBRRN656/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656/action/storage_attestation","attest_author":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656/action/author_attestation","sign_citation":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656/action/citation_signature","submit_replication":"https://pith.science/pith/UUOLOSWQZJVXF3DTTIXBRRN656/action/replication_record"}},"created_at":"2026-07-05T08:02:29.386610+00:00","updated_at":"2026-07-05T08:02:29.386610+00:00"}