{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TSXT4YLD434IN537QWKEKTPJNW","short_pith_number":"pith:TSXT4YLD","schema_version":"1.0","canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","source":{"kind":"arxiv","id":"1402.3613","version":1},"attestation_state":"computed","paper":{"title":"Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap, Pavel Janovsk\\'y","submitted_at":"2014-02-14T22:09:44Z","abstract_excerpt":"Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniques and sampling-based iterative algorithms.\n  We compare the performance of a widely-used reactive method ORCA with three variants of a popular planning algorithm RRT* applied to multi-agent path planni"},"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":"1402.3613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2a65edfc78354c801d72f1b06ae45557e343b19ca99babac3f76733da63a6fa4","abstract_canon_sha256":"6e849e58bc95606d7c6bf20c1a724352d10ebfc03d25a600d434b1872b6301d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.121891Z","signature_b64":"mXxLQaQ37UQZgN6rDl4fOOeRj4Rk7Oort7bxCJt2h+FoPAELFmy4i1zeStQk9PN3h3O2Uv87SlMy6gSASVsSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","last_reissued_at":"2026-05-18T02:58:56.121125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.121125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap, Pavel Janovsk\\'y","submitted_at":"2014-02-14T22:09:44Z","abstract_excerpt":"Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniques and sampling-based iterative algorithms.\n  We compare the performance of a widely-used reactive method ORCA with three variants of a popular planning algorithm RRT* applied to multi-agent path planni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3613","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":"1402.3613","created_at":"2026-05-18T02:58:56.121233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3613v1","created_at":"2026-05-18T02:58:56.121233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3613","created_at":"2026-05-18T02:58:56.121233+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSXT4YLD434I","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSXT4YLD434IN537","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSXT4YLD","created_at":"2026-05-18T12:28:52.271510+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/TSXT4YLD434IN537QWKEKTPJNW","json":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW.json","graph_json":"https://pith.science/api/pith-number/TSXT4YLD434IN537QWKEKTPJNW/graph.json","events_json":"https://pith.science/api/pith-number/TSXT4YLD434IN537QWKEKTPJNW/events.json","paper":"https://pith.science/paper/TSXT4YLD"},"agent_actions":{"view_html":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW","download_json":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW.json","view_paper":"https://pith.science/paper/TSXT4YLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3613&json=true","fetch_graph":"https://pith.science/api/pith-number/TSXT4YLD434IN537QWKEKTPJNW/graph.json","fetch_events":"https://pith.science/api/pith-number/TSXT4YLD434IN537QWKEKTPJNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/action/storage_attestation","attest_author":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/action/author_attestation","sign_citation":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/action/citation_signature","submit_replication":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/action/replication_record"}},"created_at":"2026-05-18T02:58:56.121233+00:00","updated_at":"2026-05-18T02:58:56.121233+00:00"}