Assessing optimal assignment under uncertainty: An interval-based algorithm

International Journal of Robotics Research

Volumn 30, Issue 7, 2011, Pages 936-953

  Liu, Lantao ^a   Shell, Dylan A ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

Assignment problem; Interval Hungarian algorithm; Multi robot; Uncertainty

Indexed keywords

ASSIGNMENT PROBLEMS; CONCURRENT COMPUTING; EXPECTED UTILITY; GAIN INSIGHT; HUNGARIAN ALGORITHM; INTERVAL-BASED ALGORITHMS; LOCATION UNCERTAINTY; MATRIX; MULTI-ROBOT SYSTEMS; MULTIROBOTS; MULTITARGET; NAVIGATION TASKS; OPTIMAL ALLOCATION; OPTIMAL ASSIGNMENT; PHYSICAL ROBOTS; RUNNING TIME; TIME COMPLEXITY; UNCERTAINTY;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

UNCERTAINTY ANALYSIS;

EID: 80052236740     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364911404579     Document Type: Conference Paper

References (22)

1. Atay N and Bayazit B (2006) Mixed-Integer Linear Programming Solution to Multi-Robot Task Allocation Problem. Technical Report WUCSE-2006-54, Department of Computer Science and Engineering, Washington University.
2. Berhault M, Huang H, Keskinocak P, Koenig S, Elmaghraby W, Griffin P, et al. (2003) Robot exploration with combinatorial auctions. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'03), Las Vegas, NV, pp. 1957-1962.
3. Bernstein DS, Zilberstein S and Immerman N (2000) The complexity of decentralized control of Markov Decision Processes. In Conference on Uncertainty in Artificial Intelligence.
4. Bertsekas DP (1992) The auction algorithm for assignment and other network flow problems: A tutorial introduction. Computational Optimization and Applications 1: 7-66.
5. Dias MB and Stentz AT (2001) A Market Approach to Multirobot Coordination. Technical Report CMU-RI-TR-01-26, Robotics Institute, Pittsburgh, PA.
6. Dias MB, Zlot R, Kalra N and Stentz A (2006) Market-based multirobot coordination: a survey and analysis. Proceedings of the IEEE 94: 1257-1270. (Pubitemid 46432340)
7. Dinkelbach W (1969) Sensitivitatsanalysen und Parametrische Programmierung. Berlin: Springer.
8. Fox D (2001) KLD-sampling: adaptive particle filters. In Dietterich TG, Becker S and Ghahramani Z (eds), Advances in Neural Information Processing Systems (NIPS-14). Cambridge, MA: MIT Press, pp. 713-720.
9. Gerkey B, Vaughan RT and Howard A (2003) The player/stage project: tools for multi-robot and distributed sensor systems. In Proceedings of the 11th International Conference on Advanced Robotics.
10. Gerkey BP and Mataríc MJ (2002) Sold!: Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation 18: 758-768.
11. Gerkey BP and Mataríc MJ (2004) A formal analysis and taxonomy of task allocation in multi-robot systems. The International Journal of Robotics Research 23: 939-954.
12. Guestrin C, Venkataraman S and Koller D (2002) Context- Specific Multiagent Coordination and Planning with Factored MDPs. In Proceedings of the eighteenth AAAI National Conference on Artificial Intelligence (AAAI'02), Edmonton, Alberta, Canada, pp. 253-259.
13. Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2: 83-97.
14. Lovász, L. and Plummer, M. D. (1986). Matching Theory. Amsterdam: North-Holland.
15. Mills-Tettey GA, Stentz AT and Dias MB (2007) The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs. Technical Report CMU-RI-TR-07-27, Robotics Institute, Pittsburgh, PA.
16. Munkres J (1957) Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics 5: 32-38.
17. Parker LE (1998) Alliance: an architecture for fault-tolerant multi-robot cooperation. IEEE Transactions on Robotics and Automation 14: 220-240. (Pubitemid 128754313)
18. Pentico DW (2007) Assignment problems: a golden anniversary survey. European Journal of Operations Research 176: 774-793. (Pubitemid 44537618)
19. Roth M, Simmons R and Veloso M (2006) What to communicate? Execution-time decision in multi-agent POMDPs. In Proceedings of the Eighth International Conference on Distributed Autonomous Robotic Systems (DARS'06), Minneapolis, MN, pp. 177-186.
20. Toroslu IH and Üçoluk G (2007) Incremental assignment problem. Information Sciences 117: 1523-1529. (Pubitemid 46037663)
21. Ulrich I and Borenstein J (1998) VFH+: reliable obstacle avoidance for fast mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'98), Leuven, Belgium, pp. 1572-1577.
22. Vaughan RT and Gerkey B (2006) Really reused robot code from the player/stage project. In Brugali D (ed.), Software Engineering for Experimental Robotics (Springer Tracts on Advanced Robotics). Berlin: Springer.