Intelligent exploration strategy for a mobile robot to reduce the repeated searches in an unknown environment

Main Article Content

Dr. Anandakumar Haldorai, Manishi Shakya, Dr. K. Chanthirasekaran, Dr. J. Sivakumar, Dr.Ram Subbiah, Mr. Shanavas. TN

Abstract

To significantly minimise the effort required to seek in new environments, it is critical to choose an effective search strategy. In mobile robotics, random search is the main search method due to the lower processing capabilities of mobile robots, which result in the detection of only local features. If you're looking for random-walking techniques that emulate social insects' self-organized behaviour, then Levy's struggle approach is very popular. Robot searches are often ineffective since the suggested methodology is very restricted. This article offers an enhanced random walking technique in which each robot's stride size is adjusted to minimise the amount of repeated searches. To find out if the suggested approach was successful and whether it performed as an intelligent exploratory strategy, simulation tests and experiments with real robots were undertaken. The research found that the suggested approach was more successful over a wider area.

Article Details

Section
Articles