{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZMLMATN77YW77KLLCBT7DYNSIX","short_pith_number":"pith:ZMLMATN7","schema_version":"1.0","canonical_sha256":"cb16c04dbffe2dffa96b1067f1e1b245c45f40d24d6251b7c883711a4b82f9f8","source":{"kind":"arxiv","id":"2409.05289","version":3},"attestation_state":"computed","paper":{"title":"Developing Path Planning with Behavioral Cloning and Proximal Policy Optimization for Path-Tracking and Static Obstacle Nudging","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Biao Wang, Mingyan Zhou, Tian Tan, Xiatao Sun","submitted_at":"2024-09-09T02:54:24Z","abstract_excerpt":"In autonomous driving, end-to-end methods utilizing Imitation Learning (IL) and Reinforcement Learning (RL) are becoming more and more common. However, they do not involve explicit reasoning like classic robotics workflow and planning with horizons, resulting in strategies implicit and myopic. In this paper, we introduce a path planning method that uses Behavioral Cloning (BC) for path-tracking and Proximal Policy Optimization (PPO) for static obstacle nudging. It outputs lateral offset values to adjust the given reference waypoints and performs modified path for different controllers. Experim"},"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":"2409.05289","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-09T02:54:24Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"8a1729db8f198df672fdaaf25db843c58c0f6e602bfa81e61cc18edf61c1d85d","abstract_canon_sha256":"21219f2a9e7a11be295c3a086e815a9028f5ee5ce6d179bea8ba2f875d33ad88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:58.601034Z","signature_b64":"D+/reGIknfcd3SAMnJQjjZ/WGO1MWX72/e5bMlv/AbX0/bT4ptIiyO47UollO/aOAiXWX2NA6m5Wx9q/dltbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb16c04dbffe2dffa96b1067f1e1b245c45f40d24d6251b7c883711a4b82f9f8","last_reissued_at":"2026-07-05T09:23:58.600573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:58.600573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Developing Path Planning with Behavioral Cloning and Proximal Policy Optimization for Path-Tracking and Static Obstacle Nudging","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Biao Wang, Mingyan Zhou, Tian Tan, Xiatao Sun","submitted_at":"2024-09-09T02:54:24Z","abstract_excerpt":"In autonomous driving, end-to-end methods utilizing Imitation Learning (IL) and Reinforcement Learning (RL) are becoming more and more common. However, they do not involve explicit reasoning like classic robotics workflow and planning with horizons, resulting in strategies implicit and myopic. In this paper, we introduce a path planning method that uses Behavioral Cloning (BC) for path-tracking and Proximal Policy Optimization (PPO) for static obstacle nudging. It outputs lateral offset values to adjust the given reference waypoints and performs modified path for different controllers. Experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05289","kind":"arxiv","version":3},"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/2409.05289/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":"2409.05289","created_at":"2026-07-05T09:23:58.600642+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05289v3","created_at":"2026-07-05T09:23:58.600642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05289","created_at":"2026-07-05T09:23:58.600642+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMLMATN77YW7","created_at":"2026-07-05T09:23:58.600642+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMLMATN77YW77KLL","created_at":"2026-07-05T09:23:58.600642+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMLMATN7","created_at":"2026-07-05T09:23:58.600642+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.03822","citing_title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX","json":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX.json","graph_json":"https://pith.science/api/pith-number/ZMLMATN77YW77KLLCBT7DYNSIX/graph.json","events_json":"https://pith.science/api/pith-number/ZMLMATN77YW77KLLCBT7DYNSIX/events.json","paper":"https://pith.science/paper/ZMLMATN7"},"agent_actions":{"view_html":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX","download_json":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX.json","view_paper":"https://pith.science/paper/ZMLMATN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05289&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMLMATN77YW77KLLCBT7DYNSIX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMLMATN77YW77KLLCBT7DYNSIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX/action/storage_attestation","attest_author":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX/action/author_attestation","sign_citation":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX/action/citation_signature","submit_replication":"https://pith.science/pith/ZMLMATN77YW77KLLCBT7DYNSIX/action/replication_record"}},"created_at":"2026-07-05T09:23:58.600642+00:00","updated_at":"2026-07-05T09:23:58.600642+00:00"}