{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y22LO7QUOSNYXMJKNNARFOM4YM","short_pith_number":"pith:Y22LO7QU","schema_version":"1.0","canonical_sha256":"c6b4b77e14749b8bb12a6b4112b99cc322ad3229781ce617309256975996b545","source":{"kind":"arxiv","id":"1511.06982","version":1},"attestation_state":"computed","paper":{"title":"Trading Safety Versus Performance: Rapid Deployment of Robotic Swarms with Robust Performance Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Brian M. Sadler, Marco Pavone, Stefano Carpin, Yin-Lam Chow","submitted_at":"2015-11-22T09:27:17Z","abstract_excerpt":"In this paper we consider a stochastic deployment problem, where a robotic swarm is tasked with the objective of positioning at least one robot at each of a set of pre-assigned targets while meeting a temporal deadline. Travel times and failure rates are stochastic but related, inasmuch as failure rates increase with speed. To maximize chances of success while meeting the deadline, a control strategy has therefore to balance safety and performance. Our approach is to cast the problem within the theory of constrained Markov Decision Processes, whereby we seek to compute policies that maximize t"},"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":"1511.06982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-22T09:27:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"265a5e1f41b58c588f7c16ac631db587acbb653bc282f24e638dab06c76d7e90","abstract_canon_sha256":"def3249561b270df49ee598d3040390a8e21a2a57a3eb3f19a8d8ab0c36cd98a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:17.002123Z","signature_b64":"jLdxehhH+CglhLHQt9u3GohY5tC4ln+fz5P+hiY8A6jSRBlvKJ1iUFjs3K8prGQ/uShcR5OxO8xCb5kgldj3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b4b77e14749b8bb12a6b4112b99cc322ad3229781ce617309256975996b545","last_reissued_at":"2026-05-18T01:26:17.001630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:17.001630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading Safety Versus Performance: Rapid Deployment of Robotic Swarms with Robust Performance Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Brian M. Sadler, Marco Pavone, Stefano Carpin, Yin-Lam Chow","submitted_at":"2015-11-22T09:27:17Z","abstract_excerpt":"In this paper we consider a stochastic deployment problem, where a robotic swarm is tasked with the objective of positioning at least one robot at each of a set of pre-assigned targets while meeting a temporal deadline. Travel times and failure rates are stochastic but related, inasmuch as failure rates increase with speed. To maximize chances of success while meeting the deadline, a control strategy has therefore to balance safety and performance. Our approach is to cast the problem within the theory of constrained Markov Decision Processes, whereby we seek to compute policies that maximize t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06982","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":"1511.06982","created_at":"2026-05-18T01:26:17.001703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06982v1","created_at":"2026-05-18T01:26:17.001703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06982","created_at":"2026-05-18T01:26:17.001703+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y22LO7QUOSNY","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y22LO7QUOSNYXMJK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y22LO7QU","created_at":"2026-05-18T12:29:50.041715+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/Y22LO7QUOSNYXMJKNNARFOM4YM","json":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM.json","graph_json":"https://pith.science/api/pith-number/Y22LO7QUOSNYXMJKNNARFOM4YM/graph.json","events_json":"https://pith.science/api/pith-number/Y22LO7QUOSNYXMJKNNARFOM4YM/events.json","paper":"https://pith.science/paper/Y22LO7QU"},"agent_actions":{"view_html":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM","download_json":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM.json","view_paper":"https://pith.science/paper/Y22LO7QU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/Y22LO7QUOSNYXMJKNNARFOM4YM/graph.json","fetch_events":"https://pith.science/api/pith-number/Y22LO7QUOSNYXMJKNNARFOM4YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM/action/storage_attestation","attest_author":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM/action/author_attestation","sign_citation":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM/action/citation_signature","submit_replication":"https://pith.science/pith/Y22LO7QUOSNYXMJKNNARFOM4YM/action/replication_record"}},"created_at":"2026-05-18T01:26:17.001703+00:00","updated_at":"2026-05-18T01:26:17.001703+00:00"}