{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4BYSRMT3FJFIEJPVR6G4L5KMAO","short_pith_number":"pith:4BYSRMT3","schema_version":"1.0","canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","source":{"kind":"arxiv","id":"1812.11135","version":1},"attestation_state":"computed","paper":{"title":"Online Decentralized Receding Horizon Trajectory Optimization for Multi-Robot systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Govind Aadithya R, Shravan Krishnan, Sivanathan K, Vijay Arvindh","submitted_at":"2018-12-28T17:59:44Z","abstract_excerpt":"A novel decentralised trajectory generation algorithm for Multi Agent systems is presented. Multi-robot systems have the capacity to transform lives in a variety of fields. But, trajectory generation for multi-robot systems is still in its nascent stage and limited to heavily controlled environments. To overcome that, an online trajectory optimization algorithm that generates collision-free trajectories for robots, when given initial state and desired end pose, is proposed. It utilizes a simple method for obstacle detection, local shape based maps for obstacles and communication of robots' cur"},"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":"1812.11135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-28T17:59:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6cf85e7c7a87d669241fe675698c65f61bd381d6c253115efd7634c182df7e13","abstract_canon_sha256":"f3954c19dde6f62678e15ebb20f028ef53a45ba6ce55d8384d5755fc0d83e1d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.260285Z","signature_b64":"J+Y2ShrDl5oVLDuu7rhfub1EFdv/di28cGEfflOO2kh8MCzDgPPsanFhS7fx6178IyrTC7j/JOHXq2foBUyQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","last_reissued_at":"2026-05-17T23:57:16.259904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.259904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Decentralized Receding Horizon Trajectory Optimization for Multi-Robot systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Govind Aadithya R, Shravan Krishnan, Sivanathan K, Vijay Arvindh","submitted_at":"2018-12-28T17:59:44Z","abstract_excerpt":"A novel decentralised trajectory generation algorithm for Multi Agent systems is presented. Multi-robot systems have the capacity to transform lives in a variety of fields. But, trajectory generation for multi-robot systems is still in its nascent stage and limited to heavily controlled environments. To overcome that, an online trajectory optimization algorithm that generates collision-free trajectories for robots, when given initial state and desired end pose, is proposed. It utilizes a simple method for obstacle detection, local shape based maps for obstacles and communication of robots' cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11135","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":"1812.11135","created_at":"2026-05-17T23:57:16.259962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11135v1","created_at":"2026-05-17T23:57:16.259962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11135","created_at":"2026-05-17T23:57:16.259962+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BYSRMT3FJFI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BYSRMT3FJFIEJPV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BYSRMT3","created_at":"2026-05-18T12:32:05.422762+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/4BYSRMT3FJFIEJPVR6G4L5KMAO","json":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO.json","graph_json":"https://pith.science/api/pith-number/4BYSRMT3FJFIEJPVR6G4L5KMAO/graph.json","events_json":"https://pith.science/api/pith-number/4BYSRMT3FJFIEJPVR6G4L5KMAO/events.json","paper":"https://pith.science/paper/4BYSRMT3"},"agent_actions":{"view_html":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO","download_json":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO.json","view_paper":"https://pith.science/paper/4BYSRMT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11135&json=true","fetch_graph":"https://pith.science/api/pith-number/4BYSRMT3FJFIEJPVR6G4L5KMAO/graph.json","fetch_events":"https://pith.science/api/pith-number/4BYSRMT3FJFIEJPVR6G4L5KMAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/action/storage_attestation","attest_author":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/action/author_attestation","sign_citation":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/action/citation_signature","submit_replication":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/action/replication_record"}},"created_at":"2026-05-17T23:57:16.259962+00:00","updated_at":"2026-05-17T23:57:16.259962+00:00"}