Developing inverse motion planning technique for autonomous vehicles using integral nonlinear constraints
Bibliographic record
Abstract
The study considers issues of elaborating and validating a technique of autonomous vehicle motion planning based on sequential trajectory and speed optimization. This method includes components such as representing sought-for functions by finite elements (FE), vehicle kinematic model, sequential quadratic programming for nonlinear constrained optimization, and Gaussian N-point quadrature integration. The primary novelty consists of using the inverse approach for obtaining vehicle trajectory and speed. The curvature and speed are represented by integrated polynomials to reduce the number of unknowns. For this, piecewise functions with two and three degrees of freedom (DOF) are implemented through FE nodal parameters. The technique ensures higher differentiability compared to the needed in the geometric and kinematic equations. Thus, the generated reference curves are characterized by simple and unambiguous forms. The latter fits best the control accuracy and efficiency during the motion tracking phase. Another advantage is replacing the nodal linear equality constraints with integral nonlinear ones. This ensures the non-violation of boundary limits within each FE and not only in nodes. The optimization technique implies that the spatial and time variables must be found separately and staged. The trajectory search is accomplished in the restricted allowable zone composed by superposing an area inside the external and internal boundaries, based on keeping safe distances, excluding areas for moving obstacles. Thus, this study compares two models that use two and three nodal DOF on optimization quality, stability, and rapidity in real-time applications. The simulation example shows numerous graph results of geometric and kinematic parameters with smoothed curves up to the highest derivatives. Finally, the conclusions are made on the efficiency and quality of prognosis, outlining the similarities and differences between the two applied models.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".