{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SSOIRKLW2BV4SMMOZFAYELDSAC","short_pith_number":"pith:SSOIRKLW","schema_version":"1.0","canonical_sha256":"949c88a976d06bc9318ec941822c720089fefaa5ed810cfef83e150e99400881","source":{"kind":"arxiv","id":"1706.04399","version":1},"attestation_state":"computed","paper":{"title":"Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.RO","authors_text":"Cong Hoang Quach, Manh Duong Phung, Quang Ha, Tran Hiep Dinh","submitted_at":"2017-06-14T10:40:19Z","abstract_excerpt":"In built infrastructure monitoring, an efficient path planning algorithm is essential for robotic inspection of large surfaces using computer vision. In this work, we first formulate the inspection path planning problem as an extended travelling salesman problem (TSP) in which both the coverage and obstacle avoidance were taken into account. An enhanced discrete particle swarm optimization (DPSO) algorithm is then proposed to solve the TSP, with performance improvement by using deterministic initialization, random mutation, and edge exchange. Finally, we take advantage of parallel computing to"},"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":"1706.04399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-14T10:40:19Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"bd07f33f203d8759cb815ddfd61292c9a97e41491d55efe68e7e245de961797e","abstract_canon_sha256":"26c01dbe89285ac004ceda1f71521d3c79549d4d4072a2fbfe24b429d436b33a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.767115Z","signature_b64":"ojMTFlxPhQ813jKQ85ateV6PjDfdI9nRcl+SVDOp16Mad0giB7xIQBXm7MmZ18EnTHm2fXNFtX3dCyyAOEIJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949c88a976d06bc9318ec941822c720089fefaa5ed810cfef83e150e99400881","last_reissued_at":"2026-05-18T00:42:22.766440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.766440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.RO","authors_text":"Cong Hoang Quach, Manh Duong Phung, Quang Ha, Tran Hiep Dinh","submitted_at":"2017-06-14T10:40:19Z","abstract_excerpt":"In built infrastructure monitoring, an efficient path planning algorithm is essential for robotic inspection of large surfaces using computer vision. In this work, we first formulate the inspection path planning problem as an extended travelling salesman problem (TSP) in which both the coverage and obstacle avoidance were taken into account. An enhanced discrete particle swarm optimization (DPSO) algorithm is then proposed to solve the TSP, with performance improvement by using deterministic initialization, random mutation, and edge exchange. Finally, we take advantage of parallel computing to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04399","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":""},"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":"1706.04399","created_at":"2026-05-18T00:42:22.766558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04399v1","created_at":"2026-05-18T00:42:22.766558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04399","created_at":"2026-05-18T00:42:22.766558+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSOIRKLW2BV4","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSOIRKLW2BV4SMMO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSOIRKLW","created_at":"2026-05-18T12:31:43.269735+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/SSOIRKLW2BV4SMMOZFAYELDSAC","json":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC.json","graph_json":"https://pith.science/api/pith-number/SSOIRKLW2BV4SMMOZFAYELDSAC/graph.json","events_json":"https://pith.science/api/pith-number/SSOIRKLW2BV4SMMOZFAYELDSAC/events.json","paper":"https://pith.science/paper/SSOIRKLW"},"agent_actions":{"view_html":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC","download_json":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC.json","view_paper":"https://pith.science/paper/SSOIRKLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04399&json=true","fetch_graph":"https://pith.science/api/pith-number/SSOIRKLW2BV4SMMOZFAYELDSAC/graph.json","fetch_events":"https://pith.science/api/pith-number/SSOIRKLW2BV4SMMOZFAYELDSAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC/action/storage_attestation","attest_author":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC/action/author_attestation","sign_citation":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC/action/citation_signature","submit_replication":"https://pith.science/pith/SSOIRKLW2BV4SMMOZFAYELDSAC/action/replication_record"}},"created_at":"2026-05-18T00:42:22.766558+00:00","updated_at":"2026-05-18T00:42:22.766558+00:00"}