B.P. Gerkey and M.J. Matari#, "Sold!: Auction Methods for Multi-robot Coordination," IEEE Transactions on Robotics and Automation, Special Issue on Multi-robot Systems, 18(6):758-768, October 2002.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Sensor Network-based Multi-Robot Task Allocation - Batalin, Sukhatme (2003) (2 citations) (Correct)
....impatience. Broadcast of Local Eligibility [11] is also a behavior based approach, with fixed priority tasks. For every task there exists a behavior capable of executing the task and estimating the utility of robot executing the task. Auction based approaches include the M system [12] and Murdoch [13]. Both systems rely on the Contract Net Protocol (CNP) that puts available tasks for auction, and candidate robots make bids that are their task specific utility estimates. The highest bidder (i.e. the best fit robot) wins a contract for the task and proceeds to execute it. DINTA differs from ....
B. P. Gerkey and M. J. Mataric, "Sold!: Auction methods for multi-robot coordination.," in IEEE Transactions on Robotics and Automation, 2002, vol. 18, p. 758768.
A Simple and Scalable Approach for Human-System Interaction - Tews, Sukhatme, Mataric (2003) Self-citation (Matarid) (Correct)
....are classified as discrete or continuous. Discrete services provide only the immediate status of a sensor while continuous services provide streaming updates of their task status. Each system is briefly described next. 1) Murdoch continuous services A task allocation system, Murdoch [19][20] is a form of a Contract Net Protocol [21] used to control three robots in this experiment. Each robot is capable of carrying out three tasks: random walk, target tracking, and delivery. Random walking requires a robot to wander randomly and provides location information to the user. For target ....
B. Gerkey, and M. Matarid, "Sold!: Auction Methods for MultiRobot Coordination", in IEEE Transactions on Robotics and Automation Special Issue on Multi-robot Systems, vol. 18, no. 5, Tamio Arai, Enrico Pagello and Lynne Parker Eds., 2002, pp. 758- 768.
Task Assignment for a Physical Agent Team via a Dynamic - Forward Reverse Auction (2005) (Correct)
No context found.
B.P. Gerkey and M.J. Matari#, "Sold!: Auction Methods for Multi-robot Coordination," IEEE Transactions on Robotics and Automation, Special Issue on Multi-robot Systems, 18(6):758-768, October 2002.
Implementing Alliance In Networked Robots Using Mobile Agents - Liam Cragg And (2004) (Correct)
No context found.
Gerkey B.P. and Mataric M.J. (2002), "Sold!: Auction methods for multi-robot coordination", IEEE Transactions on Robotics and Automation, Special Issue on Multi-robot Systems, 18(5):758768, 2002.
Affective Task Allocation for Distributed Multi-Robot Teams - Gage, Murphy, Valavanis.. (2004) (Correct)
No context found.
B. P. Gerkey and M. J. Mataric, "Sold!: Auction methods for multirobot coordination," IEEE Trans. Robot. Automat., vol. 18, no. 5, pp. 758--768, October 2002.
Hoplites: A Market Framework for Complex Tight.. - Kalra, Stentz, Ferguson (2004) (Correct)
No context found.
B. P. Gerkey and M. J. Matari c, "Sold!: Auction methods for multi-robot coordination," IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 758--768, Oct. 2002.
Reactive, Distributed Layered Architecture for.. - Low, Leow, Ang, Jr. (2004) (Correct)
No context found.
B. P. Gerkey and M. J. Mataric, "Sold!: Auction methods for multirobot coordination," IEEE Trans. Robot. Automat., vol. 18, no. 5, pp. 758--768, 2002.
Sensor Network-based Multi-Robot Task Allocation - Batalin, Sukhatme (2003) (2 citations) (Correct)
No context found.
B. P. Gerkey and M. J. Mataric, "Sold!: Auction methods for multi-robot coordination.," in IEEE Transactions on Robotics and Automation, 2002, vol. 18, pp. 758--768.
Using a Sensor Network for Distributed Multi-Robot Task.. - Batalin, Sukhatme (2003) (Correct)
No context found.
B. P. Gerkey and M. J. Mataric, "Sold!: Auction methods for multirobot coordination." in IEEE Transactions on Robotics and Automation, vol. 18, no. 5, 2002, p. 758768.
A Machine Learning Method for Improving Task Allocation in.. - Dahl, al. (2004) (Correct)
No context found.
Gerkey, Brian P., and Maja J Matari c, "Sold!: Auction methods for multi-robot coordination", IEEE Transactions on Robotics and Automation 18, 5 (October 2002), 758--768.
Application of Mobile Agents to Robust Teleoperation of Internet .. - Cragg, Hu (2003) (Correct)
No context found.
B.P.Gerkey and M.J.Mataric, "Sold!: Auction Methods for Multi-Robot Coordination", IEEE Transactions on Robotics and Automation, 2002.
Building a Fault Tolerant Architecture for Internet Robots.. - Cragg, Tsui, Hu (2003) (Correct)
No context found.
B. P. Gerkey and M. J. Mataric, "Sold!: Auction Methods for Multirobot Coordination", IEEE Transactions on Robotics and Automation, Vol. 18, No. 5, p758-768, 2002.
A Machine Learning Method for Improving Task Allocation in.. - Dahl, al. (Correct)
No context found.
Gerkey, Brian P., and Maja J Matari c, "Sold!: Auction methods for multi-robot coordination", IEEE Transactions on Robotics and Automation 18, 5 (October 2002), 758--768.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC