{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZEG6L2TXALTODGAU2BRLCZHVDD","short_pith_number":"pith:ZEG6L2TX","schema_version":"1.0","canonical_sha256":"c90de5ea7702e6e19814d062b164f518c5ce571eec26ab39481203959c129bdb","source":{"kind":"arxiv","id":"2406.17286","version":1},"attestation_state":"computed","paper":{"title":"Prioritized experience replay-based DDQN for Unmanned Vehicle Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Haopeng Zhao, Jiabei Liu, Letian Xu, Liu Lipeng, Tianyao Zheng, Tongzhou Jiang","submitted_at":"2024-06-25T05:29:10Z","abstract_excerpt":"Path planning module is a key module for autonomous vehicle navigation, which directly affects its operating efficiency and safety. In complex environments with many obstacles, traditional planning algorithms often cannot meet the needs of intelligence, which may lead to problems such as dead zones in unmanned vehicles. This paper proposes a path planning algorithm based on DDQN and combines it with the prioritized experience replay method to solve the problem that traditional path planning algorithms often fall into dead zones. A series of simulation experiment results prove that the path pla"},"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":"2406.17286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-25T05:29:10Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"222116f6a2d45e41ba5334b3c3434e50e48ace7f5feb434158355385a49d009d","abstract_canon_sha256":"08ce687940a9f89a51f7ef6742941a49f45e71e362541c73e83a70ff83a67b64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:32.248996Z","signature_b64":"z3AQz5EwN1NmprqtppatN2OUnXPYcKx/OV5TSsmOu8I6kA4+MVQZERQ0j60sQuUH5FXMdjXTFdhn7qzycJXgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90de5ea7702e6e19814d062b164f518c5ce571eec26ab39481203959c129bdb","last_reissued_at":"2026-07-05T08:36:32.248581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:32.248581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prioritized experience replay-based DDQN for Unmanned Vehicle Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Haopeng Zhao, Jiabei Liu, Letian Xu, Liu Lipeng, Tianyao Zheng, Tongzhou Jiang","submitted_at":"2024-06-25T05:29:10Z","abstract_excerpt":"Path planning module is a key module for autonomous vehicle navigation, which directly affects its operating efficiency and safety. In complex environments with many obstacles, traditional planning algorithms often cannot meet the needs of intelligence, which may lead to problems such as dead zones in unmanned vehicles. This paper proposes a path planning algorithm based on DDQN and combines it with the prioritized experience replay method to solve the problem that traditional path planning algorithms often fall into dead zones. A series of simulation experiment results prove that the path pla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.17286","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/2406.17286/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":"2406.17286","created_at":"2026-07-05T08:36:32.248639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.17286v1","created_at":"2026-07-05T08:36:32.248639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.17286","created_at":"2026-07-05T08:36:32.248639+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEG6L2TXALTO","created_at":"2026-07-05T08:36:32.248639+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEG6L2TXALTODGAU","created_at":"2026-07-05T08:36:32.248639+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEG6L2TX","created_at":"2026-07-05T08:36:32.248639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08014","citing_title":"Artistic Neural Style Transfer Algorithms with Activation Smoothing","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD","json":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD.json","graph_json":"https://pith.science/api/pith-number/ZEG6L2TXALTODGAU2BRLCZHVDD/graph.json","events_json":"https://pith.science/api/pith-number/ZEG6L2TXALTODGAU2BRLCZHVDD/events.json","paper":"https://pith.science/paper/ZEG6L2TX"},"agent_actions":{"view_html":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD","download_json":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD.json","view_paper":"https://pith.science/paper/ZEG6L2TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.17286&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEG6L2TXALTODGAU2BRLCZHVDD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEG6L2TXALTODGAU2BRLCZHVDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD/action/storage_attestation","attest_author":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD/action/author_attestation","sign_citation":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD/action/citation_signature","submit_replication":"https://pith.science/pith/ZEG6L2TXALTODGAU2BRLCZHVDD/action/replication_record"}},"created_at":"2026-07-05T08:36:32.248639+00:00","updated_at":"2026-07-05T08:36:32.248639+00:00"}