When Does Opportunistic Routing Make Sense?
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Guest editorial: wireless communications in networked robotics
IEEE Wireless Communications
Distributed shortest-path finding by a micro-robot swarm
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
The capacity of random wireless networks
IEEE Transactions on Wireless Communications - Part 1
Testbed results of an opportunistic routing for multi-robot wireless networks
Computer Communications
Node mobility and capacity in wireless controllable ad hoc networks
Computer Communications
Adoption of Vehicular Ad Hoc Networking Protocols by Networked Robots
Wireless Personal Communications: An International Journal
Communication constraints multi-agent territory exploration task
Applied Intelligence
| Hi-index | 0.25 |
Path finding by multiple robots has been studied by many researchers. In particular, when the robot is able to communicate with other colleague robots, path finding will be solved collaboratively among the robots. The main motivation of this article is to apply wireless multihop communications to the collaborative pathfinding problem. For this purpose, we propose a cooperative path finding algorithm (CPA) and report its performance by real implementation on Zig-Bee-based micro-robots as well as MATLAB simulations. There has been some controversy over the use of wireless multihop communications in commercial wireless networks for technical as well as non-technical reasons. However, our study highlights a new potential of multihop communications in inter-robot information exchange. We show the effects of wireless communications on the operation of cooperative multi-robots and find the benefit of multihop communications.