{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HO7GQOY3FNLE2WADYFVG4NQUAQ","short_pith_number":"pith:HO7GQOY3","schema_version":"1.0","canonical_sha256":"3bbe683b1b2b564d5803c16a6e36140434ab1eb64ffd67b5605d53063f83bde9","source":{"kind":"arxiv","id":"1501.07704","version":1},"attestation_state":"computed","paper":{"title":"Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Valid Infrastructures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Kleiner, Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap","submitted_at":"2015-01-30T09:07:32Z","abstract_excerpt":"We consider a system consisting of multiple mobile robots in which the user can at any time issue relocation tasks ordering one of the robots to move from its current location to a given destination location. In this paper, we deal with the problem of finding a trajectory for each such relocation task that avoids collisions with other robots. The chosen robot plans its trajectory so as to avoid collision with other robots executing tasks that were issued earlier. We prove that if all possible destinations of the relocation tasks satisfy so-called valid infrastructure property, then this mechan"},"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":"1501.07704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-01-30T09:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"9d967d6d762ab5f8ef94dbde7a472b3f0dbef7b08076f9dc7abffe6410151b7e","abstract_canon_sha256":"05de3ab584cd3ae839b332a6fa3ca459e4931e18d5356727ba06e9f958bab0b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:14.336442Z","signature_b64":"vg9HOolqkmfQm+ph3GWTXrYUqbINAjjtt2owjqjdRTgaRMWsdthK+4YlFQQziRGykGrus/gT1FlzFSs82n9DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bbe683b1b2b564d5803c16a6e36140434ab1eb64ffd67b5605d53063f83bde9","last_reissued_at":"2026-05-18T02:28:14.335956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:14.335956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Valid Infrastructures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Kleiner, Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap","submitted_at":"2015-01-30T09:07:32Z","abstract_excerpt":"We consider a system consisting of multiple mobile robots in which the user can at any time issue relocation tasks ordering one of the robots to move from its current location to a given destination location. In this paper, we deal with the problem of finding a trajectory for each such relocation task that avoids collisions with other robots. The chosen robot plans its trajectory so as to avoid collision with other robots executing tasks that were issued earlier. We prove that if all possible destinations of the relocation tasks satisfy so-called valid infrastructure property, then this mechan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07704","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":"1501.07704","created_at":"2026-05-18T02:28:14.336024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07704v1","created_at":"2026-05-18T02:28:14.336024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07704","created_at":"2026-05-18T02:28:14.336024+00:00"},{"alias_kind":"pith_short_12","alias_value":"HO7GQOY3FNLE","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HO7GQOY3FNLE2WAD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HO7GQOY3","created_at":"2026-05-18T12:29:25.134429+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/HO7GQOY3FNLE2WADYFVG4NQUAQ","json":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ.json","graph_json":"https://pith.science/api/pith-number/HO7GQOY3FNLE2WADYFVG4NQUAQ/graph.json","events_json":"https://pith.science/api/pith-number/HO7GQOY3FNLE2WADYFVG4NQUAQ/events.json","paper":"https://pith.science/paper/HO7GQOY3"},"agent_actions":{"view_html":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ","download_json":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ.json","view_paper":"https://pith.science/paper/HO7GQOY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07704&json=true","fetch_graph":"https://pith.science/api/pith-number/HO7GQOY3FNLE2WADYFVG4NQUAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HO7GQOY3FNLE2WADYFVG4NQUAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ/action/storage_attestation","attest_author":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ/action/author_attestation","sign_citation":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ/action/citation_signature","submit_replication":"https://pith.science/pith/HO7GQOY3FNLE2WADYFVG4NQUAQ/action/replication_record"}},"created_at":"2026-05-18T02:28:14.336024+00:00","updated_at":"2026-05-18T02:28:14.336024+00:00"}