Tackling task allocation uncertainty via a combinatorial method
暂无分享,去创建一个
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] Dieter Fox,et al. Adapting the Sample Size in Particle Filters Through KLD-Sampling , 2003, Int. J. Robotics Res..
[3] Manuela Veloso,et al. What to Communicate? Execution-Time Decision in Multi-agent POMDPs , 2006, DARS.
[4] Stein W. Wallace,et al. Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use? , 2000, Oper. Res..
[5] Dieter Fox,et al. KLD-Sampling: Adaptive Particle Filters , 2001, NIPS.
[6] Neil Immerman,et al. The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.
[7] Shobha Venkataraman,et al. Context-specific multiagent coordination and planning with factored MDPs , 2002, AAAI/IAAI.
[8] Iwan Ulrich,et al. VFH+: reliable obstacle avoidance for fast mobile robots , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[9] Aníbal Ollero,et al. Decentralized multi-robot cooperation with auctioned POMDPs , 2012, 2012 IEEE International Conference on Robotics and Automation.
[10] Richard T. Vaughan,et al. The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .
[11] Anthony Stentz,et al. A Market Approach to Multirobot Coordination , 2001 .
[12] Dylan A. Shell,et al. Assessing optimal assignment under uncertainty: An interval-based algorithm , 2010, Int. J. Robotics Res..
[13] Julia L. Higle,et al. Sensitivity Analysis and Uncertainty in Linear Programming , 2003, Interfaces.