1. There are many global navigation systems for UGVs that can plan routes between starting and target points in a safe way, but they have difficulty dealing with dynamic environments.
2. Different algorithms exist to help with obstacle avoidance, such as bug-based algorithms, vector summation based algorithms, histogram based methods, velocity methods, and nearness diagram methods.
3. Recently proposed extensions of CVM integrate a modified perception stage to add the prediction of dynamic obstacles position in the algorithm and use a modified mapping stage and a new cost function.
The article is generally reliable and trustworthy as it provides an overview of different approaches for avoiding obstacles in moving robots. The article is well-structured and provides detailed descriptions of each approach discussed. It also includes references to relevant research papers which adds credibility to the claims made in the article.
However, there are some potential biases present in the article which should be noted. For example, the author does not provide any counterarguments or explore any alternative approaches that could be used for obstacle avoidance. Additionally, some of the claims made by the author are unsupported by evidence or data which could weaken their reliability. Furthermore, there is no discussion on possible risks associated with using these approaches which could lead readers to overlook potential issues when implementing them in practice.
In conclusion, while this article provides an informative overview of different approaches for avoiding obstacles in moving robots, it should be read critically due to potential biases present within it such as lack of counterarguments or evidence for certain claims made by the author and lack of discussion on possible risks associated with using these approaches.