{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6J4ANZSGZNTF6LAD72VJU7LMLC","short_pith_number":"pith:6J4ANZSG","canonical_record":{"source":{"id":"1902.03390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-09T07:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"328b48a743aa2ba1d06aa417860b7f6448e1183f205eb8f2dd32582a231d247c","abstract_canon_sha256":"431a797040172202339838036eb439fde19095f17e85b03906ac694687335f44"},"schema_version":"1.0"},"canonical_sha256":"f27806e646cb665f2c03feaa9a7d6c589b3c7a25843774383035ebddca4e0762","source":{"kind":"arxiv","id":"1902.03390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03390","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03390v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03390","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"6J4ANZSGZNTF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6J4ANZSGZNTF6LAD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6J4ANZSG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6J4ANZSGZNTF6LAD72VJU7LMLC","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-09T07:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"328b48a743aa2ba1d06aa417860b7f6448e1183f205eb8f2dd32582a231d247c","abstract_canon_sha256":"431a797040172202339838036eb439fde19095f17e85b03906ac694687335f44"},"schema_version":"1.0"},"canonical_sha256":"f27806e646cb665f2c03feaa9a7d6c589b3c7a25843774383035ebddca4e0762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.991370Z","signature_b64":"yz1U8xa2froSVA3C2H0FPAHOOQvdj94xgoucYx25WNJxc6hIzovDXW9QklKj88LuZsn4dbDhfBqIkmlo/4ObAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f27806e646cb665f2c03feaa9a7d6c589b3c7a25843774383035ebddca4e0762","last_reissued_at":"2026-05-17T23:54:20.990673Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.990673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03390","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk0eVWM3M2foNZcUdkopoUi+hvgPJQ2GlmVL2+u5EwZM7n0WgxKcIyDD2Te8Tdj4s+aMyhfVTZveEG208SU9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:33:40.496472Z"},"content_sha256":"139c8900df66f1421efa678ae5297500ed40cb588e87ae804f29b1b145e97f5a","schema_version":"1.0","event_id":"sha256:139c8900df66f1421efa678ae5297500ed40cb588e87ae804f29b1b145e97f5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6J4ANZSGZNTF6LAD72VJU7LMLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of dynamic mobile robot path planning based on evolutionary methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Masoud Fetanat, Saeed Bagheri Shouraki, Sajjad Haghzad","submitted_at":"2019-02-09T07:56:23Z","abstract_excerpt":"This paper presents evolutionary methods for optimization in dynamic mobile robot path planning. In dynamic mobile path planning, the goal is to find an optimal feasible path from starting point to target point with various obstacles, as well as smoothness and safety in the proposed path. Pattern search (PS) algorithm, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to find an optimal path for mobile robots to reach to target point with obstacle avoidance. For showing the success of the proposed method, first they are applied to two different paths with a dynamic environm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03390","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9t+DjaObKjUu7Ry6amb+Se9iqMLcZiLAvezN/vri6qdx0q5SwlFuZxFQGi08QK5isCGls2pVs4VQhsRtCUo8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:33:40.497119Z"},"content_sha256":"5dda2488cc7323e30d6d00305611e787d73df49154a0036e2da3c8f4435360b8","schema_version":"1.0","event_id":"sha256:5dda2488cc7323e30d6d00305611e787d73df49154a0036e2da3c8f4435360b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/bundle.json","state_url":"https://pith.science/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T07:33:40Z","links":{"resolver":"https://pith.science/pith/6J4ANZSGZNTF6LAD72VJU7LMLC","bundle":"https://pith.science/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/bundle.json","state":"https://pith.science/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6J4ANZSGZNTF6LAD72VJU7LMLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6J4ANZSGZNTF6LAD72VJU7LMLC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"431a797040172202339838036eb439fde19095f17e85b03906ac694687335f44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-09T07:56:23Z","title_canon_sha256":"328b48a743aa2ba1d06aa417860b7f6448e1183f205eb8f2dd32582a231d247c"},"schema_version":"1.0","source":{"id":"1902.03390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03390","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03390v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03390","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"6J4ANZSGZNTF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6J4ANZSGZNTF6LAD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6J4ANZSG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5dda2488cc7323e30d6d00305611e787d73df49154a0036e2da3c8f4435360b8","target":"graph","created_at":"2026-05-17T23:54:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper presents evolutionary methods for optimization in dynamic mobile robot path planning. In dynamic mobile path planning, the goal is to find an optimal feasible path from starting point to target point with various obstacles, as well as smoothness and safety in the proposed path. Pattern search (PS) algorithm, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to find an optimal path for mobile robots to reach to target point with obstacle avoidance. For showing the success of the proposed method, first they are applied to two different paths with a dynamic environm","authors_text":"Masoud Fetanat, Saeed Bagheri Shouraki, Sajjad Haghzad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-09T07:56:23Z","title":"Optimization of dynamic mobile robot path planning based on evolutionary methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03390","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:139c8900df66f1421efa678ae5297500ed40cb588e87ae804f29b1b145e97f5a","target":"record","created_at":"2026-05-17T23:54:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"431a797040172202339838036eb439fde19095f17e85b03906ac694687335f44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-09T07:56:23Z","title_canon_sha256":"328b48a743aa2ba1d06aa417860b7f6448e1183f205eb8f2dd32582a231d247c"},"schema_version":"1.0","source":{"id":"1902.03390","kind":"arxiv","version":1}},"canonical_sha256":"f27806e646cb665f2c03feaa9a7d6c589b3c7a25843774383035ebddca4e0762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f27806e646cb665f2c03feaa9a7d6c589b3c7a25843774383035ebddca4e0762","first_computed_at":"2026-05-17T23:54:20.990673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:20.990673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yz1U8xa2froSVA3C2H0FPAHOOQvdj94xgoucYx25WNJxc6hIzovDXW9QklKj88LuZsn4dbDhfBqIkmlo/4ObAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:20.991370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:139c8900df66f1421efa678ae5297500ed40cb588e87ae804f29b1b145e97f5a","sha256:5dda2488cc7323e30d6d00305611e787d73df49154a0036e2da3c8f4435360b8"],"state_sha256":"9c8d6808db9f0da2d62df4e3ae17389e21b59e48463eeca333f903cfe04ea463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0991y+wMNtFcdU8Zb9f0T01nz52hgaYJ1zCkyLXzWzzG5OMTuQc2rmKyVf8gBnOqjZ+An4w3QeOCvaKlpB9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:33:40.500825Z","bundle_sha256":"3b509fa1d9e8920f3e262932c9c52e047dffa1a5bef8633d3e245d1e7178e99e"}}