{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FFKTZXSU3RA37FTEM4DFYETKLW","short_pith_number":"pith:FFKTZXSU","schema_version":"1.0","canonical_sha256":"29553cde54dc41bf966467065c126a5db6b77cb324487aa8047c8d03890e6918","source":{"kind":"arxiv","id":"2501.01559","version":1},"attestation_state":"computed","paper":{"title":"K-ARC: Adaptive Robot Coordination for Multi-Robot Kinodynamic Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Irving Solis, James Motes, Marco Morales, Mike Qin, Nancy M. Amato","submitted_at":"2025-01-02T22:30:07Z","abstract_excerpt":"This work presents Kinodynamic Adaptive Robot Coordination (K-ARC), a novel algorithm for multi-robot kinodynamic planning. Our experimental results show the capability of K-ARC to plan for up to 32 planar mobile robots, while achieving up to an order of magnitude of speed-up compared to previous methods in various scenarios. K-ARC is able to achieve this due to its two main properties. First, K-ARC constructs its solution iteratively by planning in segments, where initial kinodynamic paths are found through optimization-based approaches and the inter-robot conflicts are resolved through sampl"},"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":"2501.01559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-01-02T22:30:07Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"199f36c06d489491296301236a6b6f8f12805f947a0cd2fcac6729a666f28766","abstract_canon_sha256":"e7a862a4e5522dc7d16959a6553186fc0bf4801a995da3400f5b34365901d4bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:26.843212Z","signature_b64":"hVqgmRefmpSLKHDxKLqqzlUdUyi6rSLw46P0ZlB7YLFoYMiumav12qPb95ZpTU1yrd8Hg0v9l5eoyiIzx4AoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29553cde54dc41bf966467065c126a5db6b77cb324487aa8047c8d03890e6918","last_reissued_at":"2026-07-05T09:56:26.842819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:26.842819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-ARC: Adaptive Robot Coordination for Multi-Robot Kinodynamic Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Irving Solis, James Motes, Marco Morales, Mike Qin, Nancy M. Amato","submitted_at":"2025-01-02T22:30:07Z","abstract_excerpt":"This work presents Kinodynamic Adaptive Robot Coordination (K-ARC), a novel algorithm for multi-robot kinodynamic planning. Our experimental results show the capability of K-ARC to plan for up to 32 planar mobile robots, while achieving up to an order of magnitude of speed-up compared to previous methods in various scenarios. K-ARC is able to achieve this due to its two main properties. First, K-ARC constructs its solution iteratively by planning in segments, where initial kinodynamic paths are found through optimization-based approaches and the inter-robot conflicts are resolved through sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01559","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.01559/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.01559","created_at":"2026-07-05T09:56:26.842876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.01559v1","created_at":"2026-07-05T09:56:26.842876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01559","created_at":"2026-07-05T09:56:26.842876+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFKTZXSU3RA3","created_at":"2026-07-05T09:56:26.842876+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFKTZXSU3RA37FTE","created_at":"2026-07-05T09:56:26.842876+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFKTZXSU","created_at":"2026-07-05T09:56:26.842876+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/FFKTZXSU3RA37FTEM4DFYETKLW","json":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW.json","graph_json":"https://pith.science/api/pith-number/FFKTZXSU3RA37FTEM4DFYETKLW/graph.json","events_json":"https://pith.science/api/pith-number/FFKTZXSU3RA37FTEM4DFYETKLW/events.json","paper":"https://pith.science/paper/FFKTZXSU"},"agent_actions":{"view_html":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW","download_json":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW.json","view_paper":"https://pith.science/paper/FFKTZXSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.01559&json=true","fetch_graph":"https://pith.science/api/pith-number/FFKTZXSU3RA37FTEM4DFYETKLW/graph.json","fetch_events":"https://pith.science/api/pith-number/FFKTZXSU3RA37FTEM4DFYETKLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW/action/storage_attestation","attest_author":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW/action/author_attestation","sign_citation":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW/action/citation_signature","submit_replication":"https://pith.science/pith/FFKTZXSU3RA37FTEM4DFYETKLW/action/replication_record"}},"created_at":"2026-07-05T09:56:26.842876+00:00","updated_at":"2026-07-05T09:56:26.842876+00:00"}