Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most existing studies of multiple mobile robots assume that robots can distinguish beten other robots and obstacles. Hover, if a flocking algorithm was available that did not require this ability, easier implementation could be expected. In this brief,  propose a flocking algorithm that does not distinguish beten a robot and an obstacle. In other words, all detected objects are regarded as obstacles in the proposed algorithm. Thus, velocity information on neighboring robots is not required.  also show that the proposed algorithm maintains the desired properties of existing flocking algorithms, even though only limited information is used in the proposed algorithm. Furthermore, unlike many previous studies, the effectiveness of the algorithm is demonstrated not only by simulations, but also in real robot experiments. In the experiments, neighboring robots and obstacles are detected using only laser range finders, since the robots do not need to distinguish beten another robot and an obstacle.
['Daito Sakai', 'Hiroaki Fukushima', 'Fumitoshi Matsuno']
I am writing a research paper on a idea Flocking for Multirobots Without Distinguishing Robots and Obstacles
[{"from": "human", "value": "I am writing a research paper on a idea Flocking for Multirobots Without Distinguishing Robots and Obstacles"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most existing studies of multiple mobile robots assume that robots can distinguish beten other robots and obstacles. Hover, if a flocking algorithm was available that did not require this ability, easier implementation could be expected. In this brief,  propose a flocking algorithm that does not distinguish beten a robot and an obstacle. In other words, all detected objects are regarded as obstacles in the proposed algorithm. Thus, velocity information on neighboring robots is not required.  also show that the proposed algorithm maintains the desired properties of existing flocking algorithms, even though only limited information is used in the proposed algorithm. Furthermore, unlike many previous studies, the effectiveness of the algorithm is demonstrated not only by simulations, but also in real robot experiments. In the experiments, neighboring robots and obstacles are detected using only laser range finders, since the robots do not need to distinguish beten another robot and an obstacle."}]