{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CLX44FZQ7JAQCDTQXVM2OBPO73","short_pith_number":"pith:CLX44FZQ","schema_version":"1.0","canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","source":{"kind":"arxiv","id":"1907.05300","version":1},"attestation_state":"computed","paper":{"title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Brent Schlotfeldt, Chi Zhang, Jiayue Wu, Osbert Bastani, Sarah Y. Tang, Shuo Li, Vijay Kumar","submitted_at":"2019-07-11T15:20:50Z","abstract_excerpt":"In this paper, we present a learning approach to goal assignment and trajectory planning for unlabeled robots operating in 2D, obstacle-filled workspaces. More specifically, we tackle the unlabeled multi-robot motion planning problem with motion constraints as a multi-agent reinforcement learning problem with some sparse global reward. In contrast with previous works, which formulate an entirely new hand-crafted optimization cost or trajectory generation algorithm for a different robot dynamic model, our framework is a general approach that is applicable to arbitrary robot models. Further, by "},"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":"1907.05300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"066b8a91c65159088cd85863375bbd753582480e6821ee1115c8563a1a9b81df","abstract_canon_sha256":"5c66cfb66d421ad4bd3bfada5926512b4e3c4ec2bae091c2e20af8e807c07442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.844836Z","signature_b64":"ndmlyukdN2q1xwJ81U0Y2C07174airmE6xp+YjudF9FSoYI/O8fjk9kxu4go51znAL2ZzeGlm4ClttLWe6ljAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","last_reissued_at":"2026-05-17T23:40:50.844251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.844251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Brent Schlotfeldt, Chi Zhang, Jiayue Wu, Osbert Bastani, Sarah Y. Tang, Shuo Li, Vijay Kumar","submitted_at":"2019-07-11T15:20:50Z","abstract_excerpt":"In this paper, we present a learning approach to goal assignment and trajectory planning for unlabeled robots operating in 2D, obstacle-filled workspaces. More specifically, we tackle the unlabeled multi-robot motion planning problem with motion constraints as a multi-agent reinforcement learning problem with some sparse global reward. In contrast with previous works, which formulate an entirely new hand-crafted optimization cost or trajectory generation algorithm for a different robot dynamic model, our framework is a general approach that is applicable to arbitrary robot models. Further, by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05300","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":"1907.05300","created_at":"2026-05-17T23:40:50.844345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05300v1","created_at":"2026-05-17T23:40:50.844345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05300","created_at":"2026-05-17T23:40:50.844345+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLX44FZQ7JAQ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLX44FZQ7JAQCDTQ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLX44FZQ","created_at":"2026-05-18T12:33:15.570797+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/CLX44FZQ7JAQCDTQXVM2OBPO73","json":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73.json","graph_json":"https://pith.science/api/pith-number/CLX44FZQ7JAQCDTQXVM2OBPO73/graph.json","events_json":"https://pith.science/api/pith-number/CLX44FZQ7JAQCDTQXVM2OBPO73/events.json","paper":"https://pith.science/paper/CLX44FZQ"},"agent_actions":{"view_html":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73","download_json":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73.json","view_paper":"https://pith.science/paper/CLX44FZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05300&json=true","fetch_graph":"https://pith.science/api/pith-number/CLX44FZQ7JAQCDTQXVM2OBPO73/graph.json","fetch_events":"https://pith.science/api/pith-number/CLX44FZQ7JAQCDTQXVM2OBPO73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/action/storage_attestation","attest_author":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/action/author_attestation","sign_citation":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/action/citation_signature","submit_replication":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/action/replication_record"}},"created_at":"2026-05-17T23:40:50.844345+00:00","updated_at":"2026-05-17T23:40:50.844345+00:00"}