{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AEAQI3WW2ACFLEJV7REEJ5CGPY","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":"7dd84ab01a6024ab5f39e7dc987adecccf4f0d5599cd83a28157aea40c732368","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T06:06:30Z","title_canon_sha256":"cbe7e2029c8937d3211f28c2f77095f7e36b20f1ab603bdaec8f9784ff9b15cd"},"schema_version":"1.0","source":{"id":"2210.03340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03340","created_at":"2026-07-05T05:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03340v1","created_at":"2026-07-05T05:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03340","created_at":"2026-07-05T05:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"AEAQI3WW2ACF","created_at":"2026-07-05T05:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"AEAQI3WW2ACFLEJV","created_at":"2026-07-05T05:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"AEAQI3WW","created_at":"2026-07-05T05:04:18Z"}],"graph_snapshots":[{"event_id":"sha256:e244e76f69d3de158d98ca7a4c2c73afc8468a6f9e4b05896daf5d03650ddbbe","target":"graph","created_at":"2026-07-05T05:04:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.03340/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-mobile robot systems show great advantages over one single robot in many applications. However, the robots are required to form desired task-specified formations, making feasible motions decrease significantly. Thus, it is challenging to determine whether the robots can pass through an obstructed environment under formation constraints, especially in an obstacle-rich environment. Furthermore, is there an optimal path for the robots? To deal with the two problems, a novel graphbased motion planner is proposed in this paper. A mapping between workspace and configuration space of multi-mobi","authors_text":"Heng Zhang, Jiawei Hu, Michael Yu Wang, Wenhang Liu, Zhenhua Xiong","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T06:06:30Z","title":"A Novel Graph-based Motion Planner of Multi-Mobile Robot Systems with Formation and Obstacle Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03340","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:f9b6699cff8dd783f4d7778122d9b8e975a4e930d269d0b55524d7f10d771608","target":"record","created_at":"2026-07-05T05:04:18Z","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":"7dd84ab01a6024ab5f39e7dc987adecccf4f0d5599cd83a28157aea40c732368","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T06:06:30Z","title_canon_sha256":"cbe7e2029c8937d3211f28c2f77095f7e36b20f1ab603bdaec8f9784ff9b15cd"},"schema_version":"1.0","source":{"id":"2210.03340","kind":"arxiv","version":1}},"canonical_sha256":"0101046ed6d004559135fc4844f4467e188d308c707b23690e29f222b8d6959a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0101046ed6d004559135fc4844f4467e188d308c707b23690e29f222b8d6959a","first_computed_at":"2026-07-05T05:04:18.992060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:18.992060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivflr8FeZ7yQBqe7V8XnBytLi2VIKkyae/pwF42phuT44GIldEIdrDe+95tdb1r9PPOS45uV2uFjnLvP2fEHDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:18.992438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.03340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9b6699cff8dd783f4d7778122d9b8e975a4e930d269d0b55524d7f10d771608","sha256:e244e76f69d3de158d98ca7a4c2c73afc8468a6f9e4b05896daf5d03650ddbbe"],"state_sha256":"5af8d8068bf1339b8019bace396df9be72b719fda9dd481ed69ab9362eaa350b"}