Abstract: A Two-hop Cooperative Virtual Force Robot Deployment (Two-hop COVER) technique is described. An improved Virtual force VF approach considers the mission requirements such as the number of required robots in each locality. The Two-hop COVER expedites the deployment process by establishing a cooperative relation between robots and neighboring landmarks. Two-hop cooperation is utilized as well to reduce the time and distance needed to satisfy mission requirements. In order to reduce randomness and guide remaining robots throughout the area till they find an unsatisfied landmark, each robot utilizes its history to visit only the locations that it has not visited before. Moreover, each robot will communicate with its neighboring robots and landmarks to use their current positions and history to guide its movements.

Abstract: A multi-robot task allocation system includes a plurality of robots communicably coupled via a network. Additionally, the multi-robot task allocation system includes a remote device communicably coupled to the plurality of robots via the network, wherein each of the plurality of robots includes processing circuitry configured to determine when an auction to perform a task is open for bidding. Further, the processing circuitry can calculate a bid for the task, transmit the bid to an auctioneer, receive allocation of the task in response to transmitting the maximum bid, and travel to and execute the allocated task in response to receiving allocation of the task, while also participating in any subsequent auctions.

Abstract: A Two-hop Cooperative Virtual Force Robot Deployment (Two-hop COVER) technique is described. An improved Virtual force VF approach considers the mission requirements such as the number of required robots in each locality. The Two-hop COVER expedites the deployment process by establishing a cooperative relation between robots and neighboring landmarks. Two-hop cooperation is utilized as well to reduce the time and distance needed to satisfy mission requirements. In order to reduce randomness and guide remaining robots throughout the area till they find an unsatisfied landmark, each robot utilizes its history to visit only the locations that it has not visited before. Moreover, each robot will communicate with its neighboring robots and landmarks to use their current positions and history to guide its movements.