Artificial Techniques Based on Neural Network and Fuzzy Logic Combination Approach for Avoiding Dynamic Obstacles
Bibliographic record
Abstract
The autonomous mobile robot must be capable of avoiding static and dynamic obstacles in the environment and navigating towards the target without any human effort. A valid low-cost path from start to goal is obtained by A* algorithm. Neural network used for Zone classification. The relative values between mobile robot and obstacle are used for classification which are distance, velocity, and angle. Zone1 is very dangerous while zone 5 is not dangerous. If the neural network classifies the obstacle as a dangerous obstacle and activates the controller. The fuzzy logic makes a decision as a reaction of mobile robot to prevent collision. There are three inputs to the fuzzy logic (relative velocity, relative distance, and relative angle) between mobile robot and obstacle. The outputs of fuzzy logic are velocity and steering angle of mobile robot. Static obstacles have been added to the environment in addition to dynamic obstacles to make the environment more complex. Three dangerous dynamic obstacles to the mobile robot are tested. While mobile robot is avoiding one obstacle, another obstacle enters critical zone and becomes dangerous to mobile robot. The mobile robot avoids the second obstacle while it is avoiding the first obstacle. Then the velocities of mobile robot and obstacles have been increased to prove that the proposed system can handle cases with faster velocities. The simulation results for the tested cases shows the capability of the proposed method for avoiding static and dynamic obstacles in fully known environment.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".