{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXAWYC7ADAH6T4CQR34U5GOTPI","short_pith_number":"pith:BXAWYC7A","schema_version":"1.0","canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","source":{"kind":"arxiv","id":"1910.13463","version":1},"attestation_state":"computed","paper":{"title":"Towards Scalable Continuous-Time Trajectory Optimization for Multi-Robot Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Govind Aadithya Rajagopalan, Madhavan Shanmugavel, Shravan Krishnan, Sivanathan Kandhasamy","submitted_at":"2019-10-29T18:10:02Z","abstract_excerpt":"Scalable multi-robot transition is essential for ubiquitous adoption of robots. As a step towards it, a computationally efficient decentralized algorithm for continuous-time trajectory optimization in multi-robot scenarios based upon model predictive control is introduced. The robots communicate only their current states and goals rather than sharing their whole trajectory; using this data each robot predicts a continuous-time trajectory for every other robot exploiting optimal control based motion primitives that are corrected for spatial inter-robot interactions using least squares. A non li"},"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":"1910.13463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"3bf1662c997fd598d524447da4c43efc4bd8dac626a3110601216930a7a16f7a","abstract_canon_sha256":"6072d4497c384678cabb16255945b8893aab8ad6b1634ca068cd2793f2de912d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:52.040418Z","signature_b64":"OvK3r8+HWZ7IV3zXi9H/r0F8FxppGpPXaDffgfGU/BJSNvL7ZeLcEq4lCamhks1bngjy28IAPo0hu6zExqISDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","last_reissued_at":"2026-07-05T00:15:52.040019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:52.040019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Scalable Continuous-Time Trajectory Optimization for Multi-Robot Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Govind Aadithya Rajagopalan, Madhavan Shanmugavel, Shravan Krishnan, Sivanathan Kandhasamy","submitted_at":"2019-10-29T18:10:02Z","abstract_excerpt":"Scalable multi-robot transition is essential for ubiquitous adoption of robots. As a step towards it, a computationally efficient decentralized algorithm for continuous-time trajectory optimization in multi-robot scenarios based upon model predictive control is introduced. The robots communicate only their current states and goals rather than sharing their whole trajectory; using this data each robot predicts a continuous-time trajectory for every other robot exploiting optimal control based motion primitives that are corrected for spatial inter-robot interactions using least squares. A non li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13463","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/1910.13463/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":"1910.13463","created_at":"2026-07-05T00:15:52.040082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.13463v1","created_at":"2026-07-05T00:15:52.040082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13463","created_at":"2026-07-05T00:15:52.040082+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXAWYC7ADAH6","created_at":"2026-07-05T00:15:52.040082+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXAWYC7ADAH6T4CQ","created_at":"2026-07-05T00:15:52.040082+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXAWYC7A","created_at":"2026-07-05T00:15:52.040082+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/BXAWYC7ADAH6T4CQR34U5GOTPI","json":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI.json","graph_json":"https://pith.science/api/pith-number/BXAWYC7ADAH6T4CQR34U5GOTPI/graph.json","events_json":"https://pith.science/api/pith-number/BXAWYC7ADAH6T4CQR34U5GOTPI/events.json","paper":"https://pith.science/paper/BXAWYC7A"},"agent_actions":{"view_html":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI","download_json":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI.json","view_paper":"https://pith.science/paper/BXAWYC7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.13463&json=true","fetch_graph":"https://pith.science/api/pith-number/BXAWYC7ADAH6T4CQR34U5GOTPI/graph.json","fetch_events":"https://pith.science/api/pith-number/BXAWYC7ADAH6T4CQR34U5GOTPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/action/storage_attestation","attest_author":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/action/author_attestation","sign_citation":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/action/citation_signature","submit_replication":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/action/replication_record"}},"created_at":"2026-07-05T00:15:52.040082+00:00","updated_at":"2026-07-05T00:15:52.040082+00:00"}