{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2F6BWN7YYOITMEBVQIEKXQZFUI","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":"95a343ef7deca9419920927209cd90562293b39fc1158e1ba3f84cd20aef2000","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-28T20:47:33Z","title_canon_sha256":"50428f144898b72c451b80c95801c96649b36736956d8fe6e17d65fd24c7e822"},"schema_version":"1.0","source":{"id":"2508.21205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21205","created_at":"2026-07-05T12:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21205v1","created_at":"2026-07-05T12:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21205","created_at":"2026-07-05T12:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"2F6BWN7YYOIT","created_at":"2026-07-05T12:01:29Z"},{"alias_kind":"pith_short_16","alias_value":"2F6BWN7YYOITMEBV","created_at":"2026-07-05T12:01:29Z"},{"alias_kind":"pith_short_8","alias_value":"2F6BWN7Y","created_at":"2026-07-05T12:01:29Z"}],"graph_snapshots":[{"event_id":"sha256:4b7495d4db02f5d629dd29263045e9a67fd1c84adbcc2bbf5a24334007390c0e","target":"graph","created_at":"2026-07-05T12:01:29Z","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/2508.21205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a novel methodology for path planning and scheduling for multi-robot navigation that is based on optimal transport theory and model predictive control. We consider a setup where $N$ robots are tasked to navigate to $M$ targets in a common space with obstacles. Mapping robots to targets first and then planning paths can result in overlapping paths that lead to deadlocks. We derive a strategy based on optimal transport that not only provides minimum cost paths from robots to targets but also guarantees non-overlapping trajectories. We achieve this by discretizing the sp","authors_text":"Federico Pecora, Joseph W. Durham, Mouhacine Benosman, Usman A. Khan, Wenliang Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21205","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:84afeb4e821e98de0988e8d7a69ececed68ee58d33072176181930a8a601c641","target":"record","created_at":"2026-07-05T12:01:29Z","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":"95a343ef7deca9419920927209cd90562293b39fc1158e1ba3f84cd20aef2000","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-28T20:47:33Z","title_canon_sha256":"50428f144898b72c451b80c95801c96649b36736956d8fe6e17d65fd24c7e822"},"schema_version":"1.0","source":{"id":"2508.21205","kind":"arxiv","version":1}},"canonical_sha256":"d17c1b37f8c3913610358208abc325a21120ff9564b2e5e1ae4a471bd4a69c51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d17c1b37f8c3913610358208abc325a21120ff9564b2e5e1ae4a471bd4a69c51","first_computed_at":"2026-07-05T12:01:29.994199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:29.994199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ScogXTcCVc9K2ZUehnZneThTa06WTaDrXcokDzED56+1H1zkBUpOSvjUK/8mtPDsAhbu/FZOjBpW66u9AB44Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:29.994762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.21205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84afeb4e821e98de0988e8d7a69ececed68ee58d33072176181930a8a601c641","sha256:4b7495d4db02f5d629dd29263045e9a67fd1c84adbcc2bbf5a24334007390c0e"],"state_sha256":"1f166bab7cb29f510eb3a947ab68ff50277ce7db4865a76d7c47b64b804cf98f"}