Toward Safer Navigation of Heterogeneous Mobile Robots in Distributed Scheme: A Novel Time-to-Collision-Based Method
Bibliographic record
Abstract
For safe and efficient navigation of heterogeneous multiple mobile robots (HMRs), it is essential to incorporate dynamics (mass and inertia) in motion control algorithms. Many methods rely only on kinematics or point-mass models, resulting in conservative results or occasionally failure. This is especially true for robots with different masses. In this article, we develop a novel navigation methodology for a distributed scheme by incorporating the robots' dynamics through calculating the time to collision (TTC) and designing a new controller accordingly that avoids collisions. We first propose a new predictive collision term by TTC that will be used to quantify imminent collisions among HMRs. Subsequently, using this term, we develop a novel nonlinear controller that explicitly incorporates TTC in the design and guarantees collision-free motion. Simulations and experiments were performed to demonstrate the effectiveness of the developed methods. We first compared the results of our proposed approach with controllers that only consider the robots' kinematics. It was shown that the proposed control strategy (a TTC-based controller) proves to be less conservative when determining safe motions. Specifically, for environments with limited space, it was demonstrated that using robots' kinematics may result in a collision, while our strategy results in safe motion. We also performed experiments that proved collision-free navigation of HMRs with this approach. The outcomes of this work provide more reliable motion control for HMRs, especially when the robots' masses or inertias are significantly different, for example, warehouses. The developments in this work are also applicable to vehicles and can therefore be beneficial in automated collision avoidance in autonomous driving and intelligent transportation.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".