{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6WZDMOUJOZFKGJNGASSSEOVU5I","short_pith_number":"pith:6WZDMOUJ","schema_version":"1.0","canonical_sha256":"f5b2363a89764aa325a604a5223ab4ea2424fbb8eed0e2b3a2661e62889dacdd","source":{"kind":"arxiv","id":"2402.11601","version":2},"attestation_state":"computed","paper":{"title":"Smooth Path Planning with Subharmonic Artificial Potential Field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bo Peng, Lingke Zhang, Rong Xiong","submitted_at":"2024-02-18T14:35:41Z","abstract_excerpt":"When a mobile robot plans its path in an environment with obstacles using Artificial Potential Field (APF) strategy, it may fall into the local minimum point and fail to reach the goal. Also, the derivatives of APF will explode close to obstacles causing poor planning performance. To solve the problems, exponential functions are used to modify potential fields' formulas. The potential functions can be subharmonic when the distance between the robot and obstacles is above a predefined threshold. Subharmonic functions do not have local minimum and the derivatives of exponential functions increas"},"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":"2402.11601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-18T14:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"2498094253a84c12fcd77a6f4ce1cdce478273264ff03d1d84ea8bbeb09c5782","abstract_canon_sha256":"7ee5022e22c83ddf3c492d323827aedb17dbc16c8f190634393aae09808916bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:01.936836Z","signature_b64":"RudzpW+RH4wZrlkRrHFljWfV6vYTj5dBQo1tFQAbdC4FKzbjVCFfi5GZKDZ5/JTOg0BnLWCl1Y5ygnlRlPH5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b2363a89764aa325a604a5223ab4ea2424fbb8eed0e2b3a2661e62889dacdd","last_reissued_at":"2026-07-05T09:00:01.936390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:01.936390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth Path Planning with Subharmonic Artificial Potential Field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bo Peng, Lingke Zhang, Rong Xiong","submitted_at":"2024-02-18T14:35:41Z","abstract_excerpt":"When a mobile robot plans its path in an environment with obstacles using Artificial Potential Field (APF) strategy, it may fall into the local minimum point and fail to reach the goal. Also, the derivatives of APF will explode close to obstacles causing poor planning performance. To solve the problems, exponential functions are used to modify potential fields' formulas. The potential functions can be subharmonic when the distance between the robot and obstacles is above a predefined threshold. Subharmonic functions do not have local minimum and the derivatives of exponential functions increas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11601","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/2402.11601/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":"2402.11601","created_at":"2026-07-05T09:00:01.936449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11601v2","created_at":"2026-07-05T09:00:01.936449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11601","created_at":"2026-07-05T09:00:01.936449+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WZDMOUJOZFK","created_at":"2026-07-05T09:00:01.936449+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WZDMOUJOZFKGJNG","created_at":"2026-07-05T09:00:01.936449+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WZDMOUJ","created_at":"2026-07-05T09:00:01.936449+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15371","citing_title":"Safe and Trustworthy Robot Pathfinding with BIM, MHA*, and NLP","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I","json":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I.json","graph_json":"https://pith.science/api/pith-number/6WZDMOUJOZFKGJNGASSSEOVU5I/graph.json","events_json":"https://pith.science/api/pith-number/6WZDMOUJOZFKGJNGASSSEOVU5I/events.json","paper":"https://pith.science/paper/6WZDMOUJ"},"agent_actions":{"view_html":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I","download_json":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I.json","view_paper":"https://pith.science/paper/6WZDMOUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11601&json=true","fetch_graph":"https://pith.science/api/pith-number/6WZDMOUJOZFKGJNGASSSEOVU5I/graph.json","fetch_events":"https://pith.science/api/pith-number/6WZDMOUJOZFKGJNGASSSEOVU5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I/action/storage_attestation","attest_author":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I/action/author_attestation","sign_citation":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I/action/citation_signature","submit_replication":"https://pith.science/pith/6WZDMOUJOZFKGJNGASSSEOVU5I/action/replication_record"}},"created_at":"2026-07-05T09:00:01.936449+00:00","updated_at":"2026-07-05T09:00:01.936449+00:00"}