{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AEAQI3WW2ACFLEJV7REEJ5CGPY","short_pith_number":"pith:AEAQI3WW","schema_version":"1.0","canonical_sha256":"0101046ed6d004559135fc4844f4467e188d308c707b23690e29f222b8d6959a","source":{"kind":"arxiv","id":"2210.03340","version":1},"attestation_state":"computed","paper":{"title":"A Novel Graph-based Motion Planner of Multi-Mobile Robot Systems with Formation and Obstacle Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Heng Zhang, Jiawei Hu, Michael Yu Wang, Wenhang Liu, Zhenhua Xiong","submitted_at":"2022-10-07T06:06:30Z","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"},"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":"2210.03340","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T06:06:30Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"cbe7e2029c8937d3211f28c2f77095f7e36b20f1ab603bdaec8f9784ff9b15cd","abstract_canon_sha256":"7dd84ab01a6024ab5f39e7dc987adecccf4f0d5599cd83a28157aea40c732368"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:18.992438Z","signature_b64":"ivflr8FeZ7yQBqe7V8XnBytLi2VIKkyae/pwF42phuT44GIldEIdrDe+95tdb1r9PPOS45uV2uFjnLvP2fEHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0101046ed6d004559135fc4844f4467e188d308c707b23690e29f222b8d6959a","last_reissued_at":"2026-07-05T05:04:18.992060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:18.992060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Graph-based Motion Planner of Multi-Mobile Robot Systems with Formation and Obstacle Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Heng Zhang, Jiawei Hu, Michael Yu Wang, Wenhang Liu, Zhenhua Xiong","submitted_at":"2022-10-07T06:06:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03340","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/2210.03340/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":"2210.03340","created_at":"2026-07-05T05:04:18.992116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.03340v1","created_at":"2026-07-05T05:04:18.992116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03340","created_at":"2026-07-05T05:04:18.992116+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEAQI3WW2ACF","created_at":"2026-07-05T05:04:18.992116+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEAQI3WW2ACFLEJV","created_at":"2026-07-05T05:04:18.992116+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEAQI3WW","created_at":"2026-07-05T05:04:18.992116+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/AEAQI3WW2ACFLEJV7REEJ5CGPY","json":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY.json","graph_json":"https://pith.science/api/pith-number/AEAQI3WW2ACFLEJV7REEJ5CGPY/graph.json","events_json":"https://pith.science/api/pith-number/AEAQI3WW2ACFLEJV7REEJ5CGPY/events.json","paper":"https://pith.science/paper/AEAQI3WW"},"agent_actions":{"view_html":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY","download_json":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY.json","view_paper":"https://pith.science/paper/AEAQI3WW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.03340&json=true","fetch_graph":"https://pith.science/api/pith-number/AEAQI3WW2ACFLEJV7REEJ5CGPY/graph.json","fetch_events":"https://pith.science/api/pith-number/AEAQI3WW2ACFLEJV7REEJ5CGPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY/action/storage_attestation","attest_author":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY/action/author_attestation","sign_citation":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY/action/citation_signature","submit_replication":"https://pith.science/pith/AEAQI3WW2ACFLEJV7REEJ5CGPY/action/replication_record"}},"created_at":"2026-07-05T05:04:18.992116+00:00","updated_at":"2026-07-05T05:04:18.992116+00:00"}