{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XLHMGH7TRF4SEAES4Q6GMLWYML","short_pith_number":"pith:XLHMGH7T","schema_version":"1.0","canonical_sha256":"bacec31ff38979220092e43c662ed862f97b74447ce7cc22bbafb9e2c9c564fb","source":{"kind":"arxiv","id":"1410.5200","version":1},"attestation_state":"computed","paper":{"title":"Finding Near-optimal Solutions in Multi-robot Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Kleiner, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2014-10-20T09:04:12Z","abstract_excerpt":"We deal with the problem of planning collision-free trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task is to find trajectories for all robots that reach their destinations with minimum total cost such that the robots will not collide when following the found trajectories. Our approach starts from individually optimal trajectory for each robot, which are then penalized for being in collision with other robots. The penalty is gradually increased and the individual trajectories are iteratively replanned to account for the"},"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":"1410.5200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-10-20T09:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"a1a90f0145309483f89542ecf767d2fd723aeb450e45fc0530599a527f1fa6b4","abstract_canon_sha256":"ba4b3a3f2f0c1b1575f799250c94f27cf80fda355f16e9c71aa7c123531d33e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:37.339401Z","signature_b64":"3E0a+fY6+jD9Qi5PDXE+xKjKZxCVVe85wL2FCjSXeGAEQGcYxi2LSQO4drNtEZMONLrP+tWj5yatKlIQI2xoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bacec31ff38979220092e43c662ed862f97b74447ce7cc22bbafb9e2c9c564fb","last_reissued_at":"2026-05-18T01:09:37.338940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:37.338940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Near-optimal Solutions in Multi-robot Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Kleiner, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2014-10-20T09:04:12Z","abstract_excerpt":"We deal with the problem of planning collision-free trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task is to find trajectories for all robots that reach their destinations with minimum total cost such that the robots will not collide when following the found trajectories. Our approach starts from individually optimal trajectory for each robot, which are then penalized for being in collision with other robots. The penalty is gradually increased and the individual trajectories are iteratively replanned to account for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5200","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":"1410.5200","created_at":"2026-05-18T01:09:37.339005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5200v1","created_at":"2026-05-18T01:09:37.339005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5200","created_at":"2026-05-18T01:09:37.339005+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLHMGH7TRF4S","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLHMGH7TRF4SEAES","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLHMGH7T","created_at":"2026-05-18T12:28:57.508820+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/XLHMGH7TRF4SEAES4Q6GMLWYML","json":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML.json","graph_json":"https://pith.science/api/pith-number/XLHMGH7TRF4SEAES4Q6GMLWYML/graph.json","events_json":"https://pith.science/api/pith-number/XLHMGH7TRF4SEAES4Q6GMLWYML/events.json","paper":"https://pith.science/paper/XLHMGH7T"},"agent_actions":{"view_html":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML","download_json":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML.json","view_paper":"https://pith.science/paper/XLHMGH7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5200&json=true","fetch_graph":"https://pith.science/api/pith-number/XLHMGH7TRF4SEAES4Q6GMLWYML/graph.json","fetch_events":"https://pith.science/api/pith-number/XLHMGH7TRF4SEAES4Q6GMLWYML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML/action/storage_attestation","attest_author":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML/action/author_attestation","sign_citation":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML/action/citation_signature","submit_replication":"https://pith.science/pith/XLHMGH7TRF4SEAES4Q6GMLWYML/action/replication_record"}},"created_at":"2026-05-18T01:09:37.339005+00:00","updated_at":"2026-05-18T01:09:37.339005+00:00"}