摘要：Swarm robotics is a number of small robots that are synchronically works together to accomplish a given task. Swarm robotics faces many problems in performing a given task. The problems are pattern formation, aggregation, Chain formation, self-assembly, coordinated movement, hole avoidance, foraging and self-deployment. Foraging is most essential part in swarm robotics. Foraging is the task to discover the item and get back into the shell. The researchers conducted foraging experiments with random-movement of robots and they have end up with unique solutions. Most of the researchers have conducted experiments using the circular arena. The shell is placed at the centre of the arena and environment boundary is well known. In this study, an attempt is made to different strategic movements like straight line approach, parallel line approach, divider approach, expanding square approach, and parallel sweep approach. All these approaches are to be simulated by using player/stage open-source simulation software based on C and C++ programming language in Linux operating system. Finally statistical comparison will be done with task completion time of all these strategies using ANOVA to identify the significant searching strategy.
关键词：enForagingSwarm RoboticsForaging AlgorithmItem Searching StrategyItem Detection Time
