Cooperative collision avoidance in multirobot systems using fuzzy rules and velocity obstacles

Abstract

Collision avoidance is critical in multirobot systems. Most of the current methods for collision avoidance either require high computation costs (e.g., velocity obstacles and mathematical optimization) or cannot always provide safety guarantees (e.g., learning-based methods). Moreover, they cannot deal with uncertain sensing data and linguistic requirements (e.g., the speed of a robot should not be large when it is near to other robots). Hence, to guarantee real-time collision avoidance and deal with linguistic requirements, a distributed and hybrid motion planning method, named Fuzzy-VO, is proposed for multirobot systems. It contains two basic components: fuzzy rules, which can deal with linguistic requirements and compute motion efficiently, and velocity obstacles (VOs), which can generate collision-free motion effectively. The Fuzzy-VO applies an intruder selection method to mitigate the exponential increase of the number of fuzzy rules. In detail, at any time instant, a robot checks the robots that it may collide with and retrieves the most dangerous robot in each sector based on the predicted collision time; then, the robot generates its velocity in real-time via fuzzy inference and VO-based fine-tuning. At each time instant, a robot only needs to retrieve its neighbors’ current positions and velocities, so the method is fully distributed. Extensive simulations with a different number of robots are carried out to compare the performance of Fuzzy-VO with the conventional fuzzy rule method and the VO-based method from different aspects. The results show that: Compared with the conventional fuzzy rule method, the average success rate of the proposed method can be increased by 306.5%; compared with the VO-based method, the average one-step decision time is reduced by 740.9%.

A novel Human-Aware Navigation algorithm based on behavioral intention cognition

“…This issue has garnered attention in the context of the dynamic obstacle method. This approach guides robots to make dynamic responses by enhancing both global path planning methods (e.g., A * [13], Dijkstra [14]) and local path planning methods (such as the velocity obstacle method [15] and the dynamic window method [16]). For instance, Goller et al [17] combined the A * algorithm with a reactive local planning algorithm in densely populated supermarket environments to plan safe paths for robots.…”