{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WQVFNPAS2G5IZTCVMZYCJTN3Z7","short_pith_number":"pith:WQVFNPAS","schema_version":"1.0","canonical_sha256":"b42a56bc12d1ba8ccc55667024cdbbcfe9818585390a5b24ee6271ffbda4cebe","source":{"kind":"arxiv","id":"1810.02517","version":1},"attestation_state":"computed","paper":{"title":"Multi-Vehicle Trajectory Optimisation On Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Andrew Hill, Philip Gun, Robin Vujanic","submitted_at":"2018-10-05T05:19:27Z","abstract_excerpt":"This paper addresses the problem of planning time-optimal trajectories for multiple cooperative agents along specified paths through a static road network. Vehicle interactions at intersections create non-trivial decisions, with complex flow-on effects for subsequent interactions. A globally optimal, minimum time trajectory is found for all vehicles using Mixed Integer Linear Programming (MILP). Computational performance is improved by minimising binary variables using iteratively applied targeted collision constraints, and efficient goal constraints. Simulation results in an open-pit mining s"},"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":"1810.02517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-05T05:19:27Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d5f2cbcc16977a1fcff58ec362f1d727f6318c785783576d563ecf553bea8c74","abstract_canon_sha256":"913db594e3ced9b4b8718e27524f7a198967e031ef9351abb792dcfa02b96cee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:01.602310Z","signature_b64":"W6nXZV2LIaebeOjZfdj/EFTkHMS1Ys24ylCDbyjlnIWddTZoDXVHxgVopZ/baesHuzFh7I0irXgqJ8KY5drDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42a56bc12d1ba8ccc55667024cdbbcfe9818585390a5b24ee6271ffbda4cebe","last_reissued_at":"2026-05-18T00:04:01.601730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:01.601730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Vehicle Trajectory Optimisation On Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Andrew Hill, Philip Gun, Robin Vujanic","submitted_at":"2018-10-05T05:19:27Z","abstract_excerpt":"This paper addresses the problem of planning time-optimal trajectories for multiple cooperative agents along specified paths through a static road network. Vehicle interactions at intersections create non-trivial decisions, with complex flow-on effects for subsequent interactions. A globally optimal, minimum time trajectory is found for all vehicles using Mixed Integer Linear Programming (MILP). Computational performance is improved by minimising binary variables using iteratively applied targeted collision constraints, and efficient goal constraints. Simulation results in an open-pit mining s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02517","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":""},"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":"1810.02517","created_at":"2026-05-18T00:04:01.601814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02517v1","created_at":"2026-05-18T00:04:01.601814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02517","created_at":"2026-05-18T00:04:01.601814+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQVFNPAS2G5I","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQVFNPAS2G5IZTCV","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQVFNPAS","created_at":"2026-05-18T12:33:01.666342+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/WQVFNPAS2G5IZTCVMZYCJTN3Z7","json":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7.json","graph_json":"https://pith.science/api/pith-number/WQVFNPAS2G5IZTCVMZYCJTN3Z7/graph.json","events_json":"https://pith.science/api/pith-number/WQVFNPAS2G5IZTCVMZYCJTN3Z7/events.json","paper":"https://pith.science/paper/WQVFNPAS"},"agent_actions":{"view_html":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7","download_json":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7.json","view_paper":"https://pith.science/paper/WQVFNPAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02517&json=true","fetch_graph":"https://pith.science/api/pith-number/WQVFNPAS2G5IZTCVMZYCJTN3Z7/graph.json","fetch_events":"https://pith.science/api/pith-number/WQVFNPAS2G5IZTCVMZYCJTN3Z7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7/action/storage_attestation","attest_author":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7/action/author_attestation","sign_citation":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7/action/citation_signature","submit_replication":"https://pith.science/pith/WQVFNPAS2G5IZTCVMZYCJTN3Z7/action/replication_record"}},"created_at":"2026-05-18T00:04:01.601814+00:00","updated_at":"2026-05-18T00:04:01.601814+00:00"}