Collision avoiding decentralized sorting of robotic swarm

@article{Kumar2020CollisionAD,
  title={Collision avoiding decentralized sorting of robotic swarm},
  author={Utkarsh Kumar and Adrish Banerjee and Rahul Kala},
  journal={Applied Intelligence},
  year={2020},
  volume={50},
  pages={1316 - 1326}
}
  • Utkarsh Kumar, Adrish Banerjee, Rahul Kala
  • Published in Applied Intelligence 2020
  • Computer Science
  • Sorting the swarm of robots is required when the robots are carrying different loads and they can not simply swap the loads. In 2016, Zhou et al. presented an interesting algorithm to sort a swarm of robots, wherein the authors made a main tree and a feedback tree to assign a topology to the robots, based on which the robots moved while arranging themselves in a sorted order. While the approach was very interesting and the results were critically analyzed by the authors, we see a critical… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    A novel obstacle avoidance algorithm: "Follow the Gap Method"

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    An Asymmetric Distributed Method for Sorting a Robot Swarm

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Routing-based navigation of dense mobile robots

    • Rahul Kala
    • Computer Science
    • Intelligent Service Robotics
    • 2018
    VIEW 2 EXCERPTS

    A parallel distributed strategy for arraying a scattered robot swarm

    VIEW 3 EXCERPTS

    Swarm behavioral sorting based on robotic hardware variation

    VIEW 1 EXCERPT