{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VCQ5I7SLNKETATEMSA5XEWWXH2","short_pith_number":"pith:VCQ5I7SL","schema_version":"1.0","canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","source":{"kind":"arxiv","id":"1508.04727","version":1},"attestation_state":"computed","paper":{"title":"Optimal Dynamic Formation Control of Multi-Agent Systems in Environments with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Xinmiao Sun","submitted_at":"2015-08-19T18:11:17Z","abstract_excerpt":"We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem. When the optimal formation objective is to maximize coverage in a mission space cluttered with obstacles, we separate the process into intervals with no obstacles detected and intervals where one or more obstacles are detected. In "},"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":"1508.04727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"942b814f543cdfb173d1dd42f577f68b7f109b0da218bd83323cb69cca61804f","abstract_canon_sha256":"64e518ae7eae70e30018fc2bb22fca20fdcf86fecea3fe23f8802cb82f1a7c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.984853Z","signature_b64":"P8XN8VIEw4rJgbTLQe/V274R1+A4hEq14xe1moOqpCTEMM87s+qKt/OcRS3SvJN0YhGNJKkqjLO61qeCfF0uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","last_reissued_at":"2026-05-18T01:35:01.984310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.984310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Dynamic Formation Control of Multi-Agent Systems in Environments with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Xinmiao Sun","submitted_at":"2015-08-19T18:11:17Z","abstract_excerpt":"We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem. When the optimal formation objective is to maximize coverage in a mission space cluttered with obstacles, we separate the process into intervals with no obstacles detected and intervals where one or more obstacles are detected. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04727","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":"1508.04727","created_at":"2026-05-18T01:35:01.984419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04727v1","created_at":"2026-05-18T01:35:01.984419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04727","created_at":"2026-05-18T01:35:01.984419+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCQ5I7SLNKET","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCQ5I7SLNKETATEM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCQ5I7SL","created_at":"2026-05-18T12:29:44.643036+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/VCQ5I7SLNKETATEMSA5XEWWXH2","json":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2.json","graph_json":"https://pith.science/api/pith-number/VCQ5I7SLNKETATEMSA5XEWWXH2/graph.json","events_json":"https://pith.science/api/pith-number/VCQ5I7SLNKETATEMSA5XEWWXH2/events.json","paper":"https://pith.science/paper/VCQ5I7SL"},"agent_actions":{"view_html":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2","download_json":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2.json","view_paper":"https://pith.science/paper/VCQ5I7SL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04727&json=true","fetch_graph":"https://pith.science/api/pith-number/VCQ5I7SLNKETATEMSA5XEWWXH2/graph.json","fetch_events":"https://pith.science/api/pith-number/VCQ5I7SLNKETATEMSA5XEWWXH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/action/storage_attestation","attest_author":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/action/author_attestation","sign_citation":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/action/citation_signature","submit_replication":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/action/replication_record"}},"created_at":"2026-05-18T01:35:01.984419+00:00","updated_at":"2026-05-18T01:35:01.984419+00:00"}