{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IDZOKWPC27UBYRYNVP567O5WEZ","short_pith_number":"pith:IDZOKWPC","schema_version":"1.0","canonical_sha256":"40f2e559e2d7e81c470dabfbefbbb6265000eac688dd13a655d269d3ce0dc2d4","source":{"kind":"arxiv","id":"2401.11634","version":1},"attestation_state":"computed","paper":{"title":"MR.CAP: Multi-Robot Joint Control and Planning for Object Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cheng-Hao Kao, Hussein Ali Jaafar, Sajad Saeedi","submitted_at":"2024-01-22T00:12:12Z","abstract_excerpt":"With the recent influx in demand for multi-robot systems throughout industry and academia, there is an increasing need for faster, robust, and generalizable path planning algorithms. Similarly, given the inherent connection between control algorithms and multi-robot path planners, there is in turn an increased demand for fast, efficient, and robust controllers. We propose a scalable joint path planning and control algorithm for multi-robot systems with constrained behaviours based on factor graph optimization. We demonstrate our algorithm on a series of hardware and simulated experiments. Our "},"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":"2401.11634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-01-22T00:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"3b85bab9781f81ab305a3ad33d7a5cd063cbb0ed5f2cb28c1649ac17c81f4692","abstract_canon_sha256":"6669ed036a4a31ad89f82d2fba7decad76d754239c29f93f7fa96d076beba292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:07.636514Z","signature_b64":"HDxf365m55jFI/FvyIJBi5G2IGSF9BHH88PlS/VQSDf3TqxGFsckYs3CI7MjSCAFQWF/DY3RqzUWkPK70qT2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40f2e559e2d7e81c470dabfbefbbb6265000eac688dd13a655d269d3ce0dc2d4","last_reissued_at":"2026-07-05T07:36:07.636089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:07.636089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MR.CAP: Multi-Robot Joint Control and Planning for Object Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cheng-Hao Kao, Hussein Ali Jaafar, Sajad Saeedi","submitted_at":"2024-01-22T00:12:12Z","abstract_excerpt":"With the recent influx in demand for multi-robot systems throughout industry and academia, there is an increasing need for faster, robust, and generalizable path planning algorithms. Similarly, given the inherent connection between control algorithms and multi-robot path planners, there is in turn an increased demand for fast, efficient, and robust controllers. We propose a scalable joint path planning and control algorithm for multi-robot systems with constrained behaviours based on factor graph optimization. We demonstrate our algorithm on a series of hardware and simulated experiments. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11634","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/2401.11634/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":"2401.11634","created_at":"2026-07-05T07:36:07.636143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11634v1","created_at":"2026-07-05T07:36:07.636143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11634","created_at":"2026-07-05T07:36:07.636143+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDZOKWPC27UB","created_at":"2026-07-05T07:36:07.636143+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDZOKWPC27UBYRYN","created_at":"2026-07-05T07:36:07.636143+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDZOKWPC","created_at":"2026-07-05T07:36:07.636143+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/IDZOKWPC27UBYRYNVP567O5WEZ","json":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ.json","graph_json":"https://pith.science/api/pith-number/IDZOKWPC27UBYRYNVP567O5WEZ/graph.json","events_json":"https://pith.science/api/pith-number/IDZOKWPC27UBYRYNVP567O5WEZ/events.json","paper":"https://pith.science/paper/IDZOKWPC"},"agent_actions":{"view_html":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ","download_json":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ.json","view_paper":"https://pith.science/paper/IDZOKWPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11634&json=true","fetch_graph":"https://pith.science/api/pith-number/IDZOKWPC27UBYRYNVP567O5WEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IDZOKWPC27UBYRYNVP567O5WEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ/action/storage_attestation","attest_author":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ/action/author_attestation","sign_citation":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ/action/citation_signature","submit_replication":"https://pith.science/pith/IDZOKWPC27UBYRYNVP567O5WEZ/action/replication_record"}},"created_at":"2026-07-05T07:36:07.636143+00:00","updated_at":"2026-07-05T07:36:07.636143+00:00"}