{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WGRP2CCK6SKVR7F75FXC5FQN75","short_pith_number":"pith:WGRP2CCK","schema_version":"1.0","canonical_sha256":"b1a2fd084af49558fcbfe96e2e960dff7e2941b9dd42894da29de6c7d241170c","source":{"kind":"arxiv","id":"2405.20858","version":2},"attestation_state":"computed","paper":{"title":"CSDO: Enhancing Efficiency and Success in Large-Scale Multi-Vehicle Trajectory Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Heye Huang, Jianqiang Wang, Junkai Jiang, Shaobing Xu, Xintao Yan, Yibin Yang","submitted_at":"2024-05-31T14:42:36Z","abstract_excerpt":"This paper presents an efficient algorithm, naming Centralized Searching and Decentralized Optimization (CSDO), to find feasible solution for large-scale Multi-Vehicle Trajectory Planning (MVTP) problem. Due to the intractable growth of non-convex constraints with the number of agents, exploring various homotopy classes that imply different convex domains, is crucial for finding a feasible solution. However, existing methods struggle to explore various homotopy classes efficiently due to combining it with time-consuming precise trajectory solution finding. CSDO, addresses this limitation by se"},"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":"2405.20858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-05-31T14:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"3f5a3dd8989db74b9ac47293ed0cb9caa8a93c14036ff28523b986ec00d622f5","abstract_canon_sha256":"162dd577995bd0c84a02dea5cc54bb8dd6b53d5d8ac3b033c4260747bb83f8ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:35.816505Z","signature_b64":"KFKdn2K17WnSVOHgSmLMG6Mij4T0U6TIBggtTsz1jjPV0YfpK/DjVHdZP/Jk6sE9KjNB2TppZ8fO7hyCYw9pCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1a2fd084af49558fcbfe96e2e960dff7e2941b9dd42894da29de6c7d241170c","last_reissued_at":"2026-07-05T09:24:35.815959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:35.815959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CSDO: Enhancing Efficiency and Success in Large-Scale Multi-Vehicle Trajectory Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Heye Huang, Jianqiang Wang, Junkai Jiang, Shaobing Xu, Xintao Yan, Yibin Yang","submitted_at":"2024-05-31T14:42:36Z","abstract_excerpt":"This paper presents an efficient algorithm, naming Centralized Searching and Decentralized Optimization (CSDO), to find feasible solution for large-scale Multi-Vehicle Trajectory Planning (MVTP) problem. Due to the intractable growth of non-convex constraints with the number of agents, exploring various homotopy classes that imply different convex domains, is crucial for finding a feasible solution. However, existing methods struggle to explore various homotopy classes efficiently due to combining it with time-consuming precise trajectory solution finding. CSDO, addresses this limitation by se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20858","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.20858/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":"2405.20858","created_at":"2026-07-05T09:24:35.816035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20858v2","created_at":"2026-07-05T09:24:35.816035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20858","created_at":"2026-07-05T09:24:35.816035+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGRP2CCK6SKV","created_at":"2026-07-05T09:24:35.816035+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGRP2CCK6SKVR7F7","created_at":"2026-07-05T09:24:35.816035+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGRP2CCK","created_at":"2026-07-05T09:24:35.816035+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/WGRP2CCK6SKVR7F75FXC5FQN75","json":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75.json","graph_json":"https://pith.science/api/pith-number/WGRP2CCK6SKVR7F75FXC5FQN75/graph.json","events_json":"https://pith.science/api/pith-number/WGRP2CCK6SKVR7F75FXC5FQN75/events.json","paper":"https://pith.science/paper/WGRP2CCK"},"agent_actions":{"view_html":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75","download_json":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75.json","view_paper":"https://pith.science/paper/WGRP2CCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20858&json=true","fetch_graph":"https://pith.science/api/pith-number/WGRP2CCK6SKVR7F75FXC5FQN75/graph.json","fetch_events":"https://pith.science/api/pith-number/WGRP2CCK6SKVR7F75FXC5FQN75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75/action/storage_attestation","attest_author":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75/action/author_attestation","sign_citation":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75/action/citation_signature","submit_replication":"https://pith.science/pith/WGRP2CCK6SKVR7F75FXC5FQN75/action/replication_record"}},"created_at":"2026-07-05T09:24:35.816035+00:00","updated_at":"2026-07-05T09:24:35.816035+00:00"}