On Uniqueness of Filippov’s Solutions for Non-Smooth Systems Having Multiple Discontinuity Surfaces With Applications to Control Engineering
Bibliographic record
Abstract
The analysis of the uniqueness of Filippov’s solutions to non-smooth control systems is important before the solutions can be sought. Such an analysis is extremely challenging when the discontinuity surface is the intersecting discontinuity surfaces. The key step is to study the intersections of the convex sets from Filippov’s inclusions and the sets containing vectors tangent to the discontinuity surfaces. Due to the fact that all the elements of these sets are functions of the states and time and their numerical values can not be obtained before the uniqueness of the solution is analyzed, the determination of such intersections, symbolically, is extremely difficult. In this paper, we propose to firstly transform the control system to a new state space where the discontinuity surfaces can be written in special forms. Secondly, we expand the sets associated with Filippov’s inclusion such that the determinations of the intersections become feasible. Two examples of practical non-smooth control systems are presented to demonstrate the efficacy of the method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".