{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4SC6FS3VCCELYJNJIXTLIEZB45","short_pith_number":"pith:4SC6FS3V","schema_version":"1.0","canonical_sha256":"e485e2cb751088bc25a945e6b41321e7610b88ed0bf68256113e1cd092158e7e","source":{"kind":"arxiv","id":"2110.10041","version":1},"attestation_state":"computed","paper":{"title":"Learning-based Fast Path Planning in Complex Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Baopu Li, Jianbang Liu, Jiankun Wang, Max Q.-H. Meng, Tingguang Li, Wenzheng Chi","submitted_at":"2021-10-19T15:09:42Z","abstract_excerpt":"In this paper, we present a novel path planning algorithm to achieve fast path planning in complex environments. Most existing path planning algorithms are difficult to quickly find a feasible path in complex environments or even fail. However, our proposed framework can overcome this difficulty by using a learning-based prediction module and a sampling-based path planning module. The prediction module utilizes an auto-encoder-decoder-like convolutional neural network (CNN) to output a promising region where the feasible path probably lies in. In this process, the environment is treated as an "},"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":"2110.10041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-19T15:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"da8963ee24be4ff8e7826944c85066aa7ad03b9fb7f355ab438a0da52150752f","abstract_canon_sha256":"f42362d028226af49d855ee79f05b2c1acb067b2b53b6c6a27661867e6731cf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:02.438152Z","signature_b64":"PCUOqDwkjGH4GFa6CmCqT1kvWrSeov9Li++Ipv6DWXl1cNmDAi3avWEdMOqriZeo9+bOYZvK01htuPc+qepGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e485e2cb751088bc25a945e6b41321e7610b88ed0bf68256113e1cd092158e7e","last_reissued_at":"2026-07-05T03:24:02.436003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:02.436003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-based Fast Path Planning in Complex Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Baopu Li, Jianbang Liu, Jiankun Wang, Max Q.-H. Meng, Tingguang Li, Wenzheng Chi","submitted_at":"2021-10-19T15:09:42Z","abstract_excerpt":"In this paper, we present a novel path planning algorithm to achieve fast path planning in complex environments. Most existing path planning algorithms are difficult to quickly find a feasible path in complex environments or even fail. However, our proposed framework can overcome this difficulty by using a learning-based prediction module and a sampling-based path planning module. The prediction module utilizes an auto-encoder-decoder-like convolutional neural network (CNN) to output a promising region where the feasible path probably lies in. In this process, the environment is treated as an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10041","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/2110.10041/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":"2110.10041","created_at":"2026-07-05T03:24:02.436065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10041v1","created_at":"2026-07-05T03:24:02.436065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10041","created_at":"2026-07-05T03:24:02.436065+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SC6FS3VCCEL","created_at":"2026-07-05T03:24:02.436065+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SC6FS3VCCELYJNJ","created_at":"2026-07-05T03:24:02.436065+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SC6FS3V","created_at":"2026-07-05T03:24:02.436065+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/4SC6FS3VCCELYJNJIXTLIEZB45","json":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45.json","graph_json":"https://pith.science/api/pith-number/4SC6FS3VCCELYJNJIXTLIEZB45/graph.json","events_json":"https://pith.science/api/pith-number/4SC6FS3VCCELYJNJIXTLIEZB45/events.json","paper":"https://pith.science/paper/4SC6FS3V"},"agent_actions":{"view_html":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45","download_json":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45.json","view_paper":"https://pith.science/paper/4SC6FS3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10041&json=true","fetch_graph":"https://pith.science/api/pith-number/4SC6FS3VCCELYJNJIXTLIEZB45/graph.json","fetch_events":"https://pith.science/api/pith-number/4SC6FS3VCCELYJNJIXTLIEZB45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45/action/storage_attestation","attest_author":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45/action/author_attestation","sign_citation":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45/action/citation_signature","submit_replication":"https://pith.science/pith/4SC6FS3VCCELYJNJIXTLIEZB45/action/replication_record"}},"created_at":"2026-07-05T03:24:02.436065+00:00","updated_at":"2026-07-05T03:24:02.436065+00:00"}