{"public_id":"cl_0b6e212beddcd3976b85295dfa1ab524","status":"active","superseded_by_public_id":null,"corpus_id":149667677,"text":"A recursively feasible Newton-like update is proposed to produce robust control invariant sets with desirable large or small volume.","confidence":0.9,"paper":{"corpus_id":149667677,"title":"Full‐complexity polytopic robust control invariant sets for uncertain linear discrete‐time systems","url":"https://sah.borca.ai/papers/149667677"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.9,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_0e58e325f35aaff15fbd5e3f7d3129ca","name":"Newton-like update","description":"An iterative update rule inspired by Newton-type methods for refining the invariant set.","types":["optimization update"],"url":"https://sah.borca.ai/concepts/co_0e58e325f35aaff15fbd5e3f7d3129ca"},{"public_id":"co_65a6bea6155ac2de99a01432ee73df4d","name":"robust control invariant set","description":"A set of states that can be kept invariant despite disturbances and uncertainties by an appropriate controller.","types":["control invariant set"],"url":"https://sah.borca.ai/concepts/co_65a6bea6155ac2de99a01432ee73df4d"},{"public_id":"co_e7418d304a75a8b589822f63732f3f86","name":"recursively feasible","description":"A property of an iterative procedure that maintains feasibility at each step.","types":["property"],"url":"https://sah.borca.ai/concepts/co_e7418d304a75a8b589822f63732f3f86"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_0b6e212beddcd3976b85295dfa1ab524"}