Robot to Robot

This article proposes auction aggregation protocols (AAPs) for task assignment in multihop wireless robot networks. A robot collector leads an auction and initiates a response tree construction by transmitting the search message. After receiving the message, each robot makes a decision on whether to retransmit a search message, based on the estimated response cost of its robots, up to fe-hops away. Robots wait to receive the bids from its children in the search tree. Then, robots aggregate responses by selecting the best bid and forward it back toward the robot collector (auctioning robot). When distance is used as the sole cost metrics, the traversal aggregation algorithm [routing with face traversal (RFT)-routing toward the event with the traversal of the face containing the event] can be applied and is an optimal solution. Several other protocols and their enhancements are also described here.

[1]  Michail G. Lagoudakis,et al.  The Generation of Bidding Rules for Auction-Based Robot Coordination , 2005 .

[2]  Ayanna M. Howard,et al.  A Robotic Mobile Sensor Network for Achieving Scientific Measurements in Challenging Environments , 2008 .

[3]  Antidio Viguria,et al.  Upper-bound cost analysis of a market-based algorithm applied to the initial formation problem , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[5]  Debasish Ghose,et al.  Team, Game, and Negotiation based Intelligent Autonomous UAV Task Allocation for Wide Area Applications , 2007, Innovations in Intelligent Machines.

[6]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Yan Meng,et al.  Communication-Efficient Dynamic Task Scheduling for Heterogeneous Multi-Robot Systems , 2007, 2007 International Symposium on Computational Intelligence in Robotics and Automation.

[8]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[9]  Marudachalam Dhanaraj,et al.  Energy Efficient Assignment of Events in Wireless Sensor and Mobile Actor Networks , 2006, 2006 14th IEEE International Conference on Networks.

[10]  Maria L. Gini,et al.  Dynamic task allocation for robots via auctions , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[11]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[12]  Junku Yuh,et al.  The Status of Robotics , 2007, IEEE Robotics & Automation Magazine.

[13]  Jie Wu,et al.  Guest Editors' Introduction: Ad Hoc Networks , 2004, Computer.

[14]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[15]  Vijay Kumar,et al.  Distributed multi-robot task assignment and formation control , 2008, 2008 IEEE International Conference on Robotics and Automation.

[16]  Dario Pompili,et al.  Communication and Coordination in Wireless Sensor and Actor Networks , 2007, IEEE Transactions on Mobile Computing.

[17]  Nuzhet Atay,et al.  Mixed-Integer Linear Programming Solution to Multi-Robot Task Allocation Problem , 2006 .

[18]  Öznur Özkasap,et al.  Ad-Hoc Networks , 2008, Encyclopedia of Algorithms.

[19]  Maria L. Gini,et al.  Auctions for task allocation to robots , 2006, IAS.

[20]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.