The Study of Cooperative Obstacle Avoidance Method for MWSN Based on Flocking Control

Chen Zuo, Lei Ding, Kai Chen, Renfa LiThe Scientific World JOURNAL 2014 · DOI

TL;DR

This paper presents a novel cooperative obstacle avoidance method for mobile wireless sensor networks (MWSNs) that builds upon traditional flocking control. By integrating an improved Steer-to-Avoid (SA) algorithm and addressing challenges in complex environments like mobile and concave obstacles, the proposed method significantly enhances navigation speed and efficiency compared to existing approaches.

What Problem Does This Paper Address?

Traditional wireless sensor networks (WSNs) often rely on fixed sensor nodes, which lack adaptability in dynamic or unknown environments. Mobile WSNs (MWSNs) offer improved robustness and are increasingly used for applications like target tracking. A key challenge in MWSNs is enabling a group of mobile nodes to collectively track a target while avoiding collisions with each other and with environmental obstacles. Existing flocking control models, while good at maintaining group cohesion and moving towards a target, can struggle with efficient obstacle avoidance, sometimes leading to nodes getting trapped in restricted areas or inefficiently navigating around obstacles. This paper aims to address these limitations by developing a more robust and efficient cooperative obstacle avoidance strategy for MWSNs, particularly in complex scenarios.

Methods

The core of this work is an enhanced cooperative obstacle avoidance model built upon the foundation of Tanner's flocking control model. The authors introduce several key improvements:

  • Improved Steer-to-Avoid (SA) Algorithm: Instead of relying on the obstacle's center (which can be hard to determine), the steering direction is defined by the tangent line at the intersection of the node's velocity line and the obstacle's edge. This provides a more practical and efficient way to determine avoidance maneuvers.
  • Handling Mobile Obstacles: For moving obstacles, nodes predict the obstacle's future position based on its current location and velocity. The SA algorithm is then applied using this predicted position, allowing for more proactive avoidance.
  • Addressing Concave Obstacles: When encountering concave obstacles, the model temporarily de-emphasizes the target's gravitational pull. Instead, nodes search for a path along the edge of the concave obstacle, preventing them from getting trapped. A specific gravitation force is introduced to keep nodes moving along the obstacle's edge.
  • Integration with Flocking Control: The proposed obstacle avoidance strategy is integrated into the existing flocking control framework, which includes separation, coherence, and velocity matching rules, ensuring the group maintains its formation and collective movement.

Datasets

Not discussed in the paper. The authors rely on simulations to evaluate their proposed method.

Key Insights and Ideas

  • Tangent Line for Steering: Defining the steering direction based on the tangent line to the obstacle's edge offers a more practical and robust approach to obstacle avoidance compared to methods relying on obstacle centers.
  • Predictive Avoidance for Mobile Obstacles: Proactively predicting the movement of mobile obstacles and adjusting the avoidance strategy accordingly is crucial for maintaining efficiency and preventing collisions.
  • Edge-Following for Concave Obstacles: Temporarily ignoring the primary target and focusing on navigating along the boundary of concave obstacles is an effective strategy to escape potential traps.
  • Synergy of Flocking and SA: Combining the group coordination of flocking control with the precise avoidance maneuvers of an improved SA algorithm creates a powerful system for complex navigation.

Key Results

The paper presents simulation results comparing their proposed cooperative obstacle avoidance model with the traditional flocking control model in static, mobile, and concave obstacle environments.

  • Static Obstacles: The proposed model achieved significantly improved average speed and time efficiency, reaching the target approximately 2.5 times faster (80 seconds vs. 200 seconds).
  • Mobile Obstacles: The improved model, which considers obstacle velocity and predicts movement, showed higher efficiency than both flocking control and the original cooperative avoidance model. It reached the target in 60 seconds, compared to 90 seconds for the original cooperative model and failing to reach the target within 100 seconds for flocking control.
  • Concave Obstacles: The proposed model successfully navigated concave obstacles, reaching the target in 150 seconds. In contrast, flocking control struggled, potentially entering infinite loops, and the original cooperative model also failed to reach the target within 150 seconds.

Limitations and Future Work

  • Limitations:
    • The paper primarily relies on simulation results, and real-world validation is not presented.
  • The model assumes nodes have sufficient sensor range to detect obstacles and neighboring nodes.
  • The complexity of the environment is explored through static, mobile, and concave obstacles, but other complex scenarios (e.g., dynamic environments with unpredictable changes) might require further investigation.
  • Future Work:
    • The authors suggest that further research could explore more complex environments and potentially integrate adaptive learning mechanisms to enhance the model's flexibility.
  • Real-world implementation and testing would be a valuable next step to validate the simulation findings.

Summary updated

Abstract

Compared with the space fixed feature of traditional wireless sensor network (WSN), mobile WSN has better robustness and adaptability in unknown environment, so that it is always applied in the research of target tracking. In order to reach the target, the nodes group should find a self-adaptive method to avoid the obstacles together in their moving directions. Previous methods, which were based on flocking control model, realized the strategy of obstacle avoidance by means of potential field. However, these may sometimes lead the nodes group to fall into a restricted area like a trap and never get out of it. Based on traditional flocking control model, this paper introduced a new cooperative obstacle avoidance model combined with improved SA obstacle avoidance algorithm. It defined the tangent line of the intersection of node's velocity line and the edge of obstacle as the steering direction. Furthermore, the cooperative obstacle avoidance model was also improved in avoiding complex obstacles. When nodes group encounters mobile obstacles, nodes will predict movement path based on the spatial location and velocity of obstacle. And when nodes group enters concave obstacles, nodes will temporarily ignore the gravity of the target and search path along the edge of the concave obstacles. Simulation results showed that cooperative obstacle avoidance model has significant improvement on average speed and time efficiency in avoiding obstacle compared with the traditional flocking control model. It is more suitable for obstacle avoidance in complex environment.
BibTeX
@article{zuo2014study,
  author = {Chen Zuo and Lei Ding and Kai Chen and Renfa Li},
  title = {{The Study of Cooperative Obstacle Avoidance Method for MWSN Based on Flocking Control}},
  journal = {The Scientific World JOURNAL},
  year = {2014},
  doi = {10.1155/2014/614346},
}
Figure