{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OOW2FLJAB5F3T77CHRJSKM4SR6","short_pith_number":"pith:OOW2FLJA","canonical_record":{"source":{"id":"1603.04610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-15T09:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"f3e57dd37a777fc523d18871c183f45c5b7358c45e4181f82b7301014130a397","abstract_canon_sha256":"4f8ea00d3dccc6ad3539ffcfa3e12381a1e4ea10ef57175610d2466d3ed5fc85"},"schema_version":"1.0"},"canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","source":{"kind":"arxiv","id":"1603.04610","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04610","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04610v3","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04610","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"OOW2FLJAB5F3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOW2FLJAB5F3T77C","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOW2FLJA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OOW2FLJAB5F3T77CHRJSKM4SR6","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-15T09:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"f3e57dd37a777fc523d18871c183f45c5b7358c45e4181f82b7301014130a397","abstract_canon_sha256":"4f8ea00d3dccc6ad3539ffcfa3e12381a1e4ea10ef57175610d2466d3ed5fc85"},"schema_version":"1.0"},"canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:59.698517Z","signature_b64":"An5p54ZQ/UxBbagaejcf9t47PzTZXPuz+zz6TqzLeMp3P4sjHjSbtLs/juuJf0YCQmBtfzIIjmk7abP/7gaSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","last_reissued_at":"2026-05-18T00:46:59.697840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:59.697840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04610","source_version":3,"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-18T00:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"599S3WTkRbaeJ7xxk6znmiJVG3ttxFpHjWtnDO0CrV8E2B7NCbTrB/pmlfj9dmNzWWXm6vq8oxmIw5r9OqjMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:31.003614Z"},"content_sha256":"c02792030ac78082143be830509bfc1ae5f54e2093f78d8a7cd07ee30a232676","schema_version":"1.0","event_id":"sha256:c02792030ac78082143be830509bfc1ae5f54e2093f78d8a7cd07ee30a232676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OOW2FLJAB5F3T77CHRJSKM4SR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-optimal Coordination of Mobile Robots along Specified Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Arnaud de La Fortelle, Florent Altch\\'e, Xiangjun Qian","submitted_at":"2016-03-15T09:29:28Z","abstract_excerpt":"In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel approach based on time discretization that leads to a mixed-integer linear programming (MILP) formulation. This problem can be solved using general-purpose MILP solvers in a reasonable time, resulting in a resolution-optimal solution. Moreover, unlike previous work found in the literature, our formulation allows an exact linear modeling (up to the discretization resolution) of second-order dynamic constraints. Extensive simulations are perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04610","kind":"arxiv","version":3},"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-18T00:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHUoUXmHHVhaZCp81PDxriDJo3drnV+nj17rawY4Y5M4y+GCiZXBAJmR/YT1n9gO/8K+Swr3Wq1c3qUSchEfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:31.004001Z"},"content_sha256":"e2862e7440a89194faf8875478a38ee50e88678d9481535006a7378bda317070","schema_version":"1.0","event_id":"sha256:e2862e7440a89194faf8875478a38ee50e88678d9481535006a7378bda317070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/bundle.json","state_url":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/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-06-02T02:34:31Z","links":{"resolver":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6","bundle":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/bundle.json","state":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OOW2FLJAB5F3T77CHRJSKM4SR6","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":"4f8ea00d3dccc6ad3539ffcfa3e12381a1e4ea10ef57175610d2466d3ed5fc85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-15T09:29:28Z","title_canon_sha256":"f3e57dd37a777fc523d18871c183f45c5b7358c45e4181f82b7301014130a397"},"schema_version":"1.0","source":{"id":"1603.04610","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04610","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04610v3","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04610","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"OOW2FLJAB5F3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOW2FLJAB5F3T77C","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOW2FLJA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e2862e7440a89194faf8875478a38ee50e88678d9481535006a7378bda317070","target":"graph","created_at":"2026-05-18T00:46:59Z","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":"In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel approach based on time discretization that leads to a mixed-integer linear programming (MILP) formulation. This problem can be solved using general-purpose MILP solvers in a reasonable time, resulting in a resolution-optimal solution. Moreover, unlike previous work found in the literature, our formulation allows an exact linear modeling (up to the discretization resolution) of second-order dynamic constraints. Extensive simulations are perf","authors_text":"Arnaud de La Fortelle, Florent Altch\\'e, Xiangjun Qian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-15T09:29:28Z","title":"Time-optimal Coordination of Mobile Robots along Specified Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04610","kind":"arxiv","version":3},"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:c02792030ac78082143be830509bfc1ae5f54e2093f78d8a7cd07ee30a232676","target":"record","created_at":"2026-05-18T00:46:59Z","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":"4f8ea00d3dccc6ad3539ffcfa3e12381a1e4ea10ef57175610d2466d3ed5fc85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-15T09:29:28Z","title_canon_sha256":"f3e57dd37a777fc523d18871c183f45c5b7358c45e4181f82b7301014130a397"},"schema_version":"1.0","source":{"id":"1603.04610","kind":"arxiv","version":3}},"canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","first_computed_at":"2026-05-18T00:46:59.697840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:59.697840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"An5p54ZQ/UxBbagaejcf9t47PzTZXPuz+zz6TqzLeMp3P4sjHjSbtLs/juuJf0YCQmBtfzIIjmk7abP/7gaSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:59.698517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04610","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c02792030ac78082143be830509bfc1ae5f54e2093f78d8a7cd07ee30a232676","sha256:e2862e7440a89194faf8875478a38ee50e88678d9481535006a7378bda317070"],"state_sha256":"5d99f25de1d0053b80bee1fceb8432418b8b1627b895d2c2f7759b9676fe4a96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoAeyBn0Yd7aEYtcBvqAqRF9TYIsWgAWmK9l38oK2aorWAFfvRva+YD+j5JsXv5sq0w0eou+G6kOOgxHG77EAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:34:31.005895Z","bundle_sha256":"07fec1c8db3871e1010c267a1760dc81ba3c81c86f1a7ec8b180042605a610ba"}}