{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OOW2FLJAB5F3T77CHRJSKM4SR6","short_pith_number":"pith:OOW2FLJA","schema_version":"1.0","canonical_sha256":"73ada2ad200f4bb9ffe23c532533928f8cc2349b6b7d9b25f9186af21d364f58","source":{"kind":"arxiv","id":"1603.04610","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.04610","created_at":"2026-05-18T00:46:59.697936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04610v3","created_at":"2026-05-18T00:46:59.697936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04610","created_at":"2026-05-18T00:46:59.697936+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOW2FLJAB5F3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOW2FLJAB5F3T77C","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOW2FLJA","created_at":"2026-05-18T12:30:36.002864+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/OOW2FLJAB5F3T77CHRJSKM4SR6","json":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6.json","graph_json":"https://pith.science/api/pith-number/OOW2FLJAB5F3T77CHRJSKM4SR6/graph.json","events_json":"https://pith.science/api/pith-number/OOW2FLJAB5F3T77CHRJSKM4SR6/events.json","paper":"https://pith.science/paper/OOW2FLJA"},"agent_actions":{"view_html":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6","download_json":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6.json","view_paper":"https://pith.science/paper/OOW2FLJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04610&json=true","fetch_graph":"https://pith.science/api/pith-number/OOW2FLJAB5F3T77CHRJSKM4SR6/graph.json","fetch_events":"https://pith.science/api/pith-number/OOW2FLJAB5F3T77CHRJSKM4SR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/action/storage_attestation","attest_author":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/action/author_attestation","sign_citation":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/action/citation_signature","submit_replication":"https://pith.science/pith/OOW2FLJAB5F3T77CHRJSKM4SR6/action/replication_record"}},"created_at":"2026-05-18T00:46:59.697936+00:00","updated_at":"2026-05-18T00:46:59.697936+00:00"}