{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JVDO7YGEHWWIPC5CIB6QDXBZVI","short_pith_number":"pith:JVDO7YGE","schema_version":"1.0","canonical_sha256":"4d46efe0c43dac878ba2407d01dc39aa004b3c57bb879d9a266dddfdbb22786a","source":{"kind":"arxiv","id":"2301.04386","version":1},"attestation_state":"computed","paper":{"title":"Decentralized iLQR for Cooperative Trajectory Planning of Connected Autonomous Vehicles via Dual Consensus ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Jun Ma, Shaojie Shen, Zhenmin Huang","submitted_at":"2023-01-11T10:18:01Z","abstract_excerpt":"Developments in cooperative trajectory planning of connected autonomous vehicles (CAVs) have gathered considerable momentum and research attention. Generally, such problems present strong non-linearity and non-convexity, rendering great difficulties in finding the optimal solution. Existing methods typically suffer from low computational efficiency, and this hinders the appropriate applications in large-scale scenarios involving an increasing number of vehicles. To tackle this problem, we propose a novel decentralized iterative linear quadratic regulator (iLQR) algorithm by leveraging the dual"},"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":"2301.04386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-11T10:18:01Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"b66f3667e7789a3faf6cca2dc5ad4dddf3e426e76214d79c4885eb282316b4e2","abstract_canon_sha256":"5735b1bbd69806ec5abe4436050545dab9fde8ad192568bf1316ff825bae2395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:25.004450Z","signature_b64":"erZIcCjhBQFSJsnK7b01dIb84qAZuruQYqWI8IOWQh7Q2jb3nQmW18pmCB4FeV3YvfKtdvWtVLDhpkZbtMyNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d46efe0c43dac878ba2407d01dc39aa004b3c57bb879d9a266dddfdbb22786a","last_reissued_at":"2026-07-05T05:32:25.004011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:25.004011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized iLQR for Cooperative Trajectory Planning of Connected Autonomous Vehicles via Dual Consensus ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Jun Ma, Shaojie Shen, Zhenmin Huang","submitted_at":"2023-01-11T10:18:01Z","abstract_excerpt":"Developments in cooperative trajectory planning of connected autonomous vehicles (CAVs) have gathered considerable momentum and research attention. Generally, such problems present strong non-linearity and non-convexity, rendering great difficulties in finding the optimal solution. Existing methods typically suffer from low computational efficiency, and this hinders the appropriate applications in large-scale scenarios involving an increasing number of vehicles. To tackle this problem, we propose a novel decentralized iterative linear quadratic regulator (iLQR) algorithm by leveraging the dual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04386","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/2301.04386/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":"2301.04386","created_at":"2026-07-05T05:32:25.004068+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.04386v1","created_at":"2026-07-05T05:32:25.004068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04386","created_at":"2026-07-05T05:32:25.004068+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVDO7YGEHWWI","created_at":"2026-07-05T05:32:25.004068+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVDO7YGEHWWIPC5C","created_at":"2026-07-05T05:32:25.004068+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVDO7YGE","created_at":"2026-07-05T05:32:25.004068+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18974","citing_title":"Synergizing Decision Making and Trajectory Planning Using Two-Stage Optimization for Autonomous Vehicles","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI","json":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI.json","graph_json":"https://pith.science/api/pith-number/JVDO7YGEHWWIPC5CIB6QDXBZVI/graph.json","events_json":"https://pith.science/api/pith-number/JVDO7YGEHWWIPC5CIB6QDXBZVI/events.json","paper":"https://pith.science/paper/JVDO7YGE"},"agent_actions":{"view_html":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI","download_json":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI.json","view_paper":"https://pith.science/paper/JVDO7YGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.04386&json=true","fetch_graph":"https://pith.science/api/pith-number/JVDO7YGEHWWIPC5CIB6QDXBZVI/graph.json","fetch_events":"https://pith.science/api/pith-number/JVDO7YGEHWWIPC5CIB6QDXBZVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI/action/storage_attestation","attest_author":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI/action/author_attestation","sign_citation":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI/action/citation_signature","submit_replication":"https://pith.science/pith/JVDO7YGEHWWIPC5CIB6QDXBZVI/action/replication_record"}},"created_at":"2026-07-05T05:32:25.004068+00:00","updated_at":"2026-07-05T05:32:25.004068+00:00"}