A general framework for multi agent task selection

A GENERAL FRAMEWORK FOR MULTI-AGENT TASK SELECTION JAMES FU GUO MING B. Eng (Second Upper) National University of Singapore A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF MECHANICAL ENGINEERING NATIONAL UNIVERSITY OF SINGAPORE 2012 Declaration I hereby declare that the thesis is my original work and it has been written by me in its entirety. I have duly acknowledged all the sources of information which have been used in the thesis. This thesis has also not been submitted for any degree in any university previously. James Fu Guo Ming 27 July 2012 i Summary Multi-agent (or multi-robot) systems have many advantages over single agent systems, which include greater robustness, reliability, scalability and economy. Having multiple agents allow the use of simple agents. The lack of sophistication and capabilities of individual agents is more than made up for by numbers. Together, working in coordination and cooperation, multi-agent systems can solve problems that are difficult or impossible for an individual agent. Multiplicity also adds a layer of redundancy to the system. While it has its advantages, there are many challenges to making the agents work in coordination and cooperation to achieve an effective multi-agent system. One of these challenges is task allocation or how each agent should select and execute its task to maximize overall effectiveness of the whole multi-agent system. Here, we propose a general framework, making use of the idea of Voronoi Tessellations, for multi-agents to distributively perform task selection. Agents make decisions based only on local information. Agents dynamically determine their mutually exclusive local Region of Influence before task selection in their region. As such, the proposed framework is applicable to a dynamic environment. A Utility Function, based on the heterogeneity of the multi-agent system, task replicability, and agent specialization, is developed as a task performance measure for agents to use during task selection. The general framework was applied to two common problems - exploration and patrolling. While exploration requires a single instance of information discovery, patrolling is the continuous process of information update. An example of the former is a search and rescue mission to locate all persons in distress while the mission of detecting intruders in a strategic area will require a round-the-clock patrolling of that area. A proposed Local Voronoi Decomposition (LVD) Algorithm, adapted from the proposed general framework, was implemented for the exploration of an unknown environment. Agents are able to perform online distributive task selection based purely on local ii information. The Voronoi regions eliminate the occurrence of agents selecting the same area for exploration at the same time. The results show an interesting emergence of cooperative behaviours, such as an overall systematic exploration of the free space by the multiple agents, thereby minimizing exploration path overlaps. As the LVD Algorithm does not require a pre-processing of the map, it is able to work well in a dynamically changing map with changing number of agents. Benchmarked against two other wellknown algorithms, the Ants Algorithm and the Brick&Mortar Algorithm, on various test maps, the performance of LVD is clearly superior and is close to the theoretical best. A proposed Probabilistic Ants (PAnts) Algorithm, based on the proposed general framework, was implemented in the patrolling of an unknown environment. The proposed strategy makes use of virtual pheromone traces, which act as potential fields, to guide agents toward regions which have not been visited for a long time. Decision making is done distributively in a probabilistic manner based on an agent’s local pheromone information. Benchmarked against the traditional Ant Algorithm as well as our proposed variant of this for various test maps, PAnts showed a clearly better performance. Keywords: Multi-Agent System, Task Allocation, Task Selection, Local Voronoi Decomposition, Utility Function, Exploration, Patrolling. iii Acknowledgements I thank God for the completion of this thesis. I thank everyone, including family and friends, who have been instrumental to the course of my research. While I have learnt much from a technical standpoint, many more life-lessons have been learnt along the way. I am deeply grateful to my advisor, Prof. Marcelo H. Ang. Jr, for his personal guidance and mentorship, as well as being very patient with my progress over the years. I am thankful for the many profitable discussion sessions, especially on occasions where my work was apparently stuck in some local minima and he was there to provide the much needed perturbation. It is also a most wonderful experience to have some of the discussions at his home and to have the occasional meal with his family, Carol, Mark, Kyle and Ivan. I dedicate this thesis to my parents. They have undoubtedly showed their love and remained supportive throughout the course of my studies. I thank my Dad for the much given advice and even helping to brainstorm in certain areas of my research work. I thank my Mom for showing much concern throughout the years. With the completion of this thesis, I am glad she now has one less thing to worry about. I thank my friends in the Control and Mechatronics Lab for invaluable discussions, sharing of ideas, and just being really good friends to make this whole journey a much more pleasant one, and in particular, Gim Hee, Niak Wu, Mana, Tomek, Weiwei, and Huan. It is always comforting to know that there is someone to have dinner with when I am working late in the lab! A special shout-out goes to Tirtha. A simple question of ”James, are you familiar with Voronois?” one day sparked off a whole series of my research work. Last, but most certainly not the least, I thank my wife, Angeline, for the emotional and spiritual support, and the much needed companionship over the years. I am very iv glad that even through all these years, I don’t recall her asking me the most dreaded question any Ph.D. student could be asked, ”how’s your research going?”. I also thank my two daughters, Olivia and Chloe, for bringing much colour and laughter into my life. Daddy is going to have more time to play with you now! v Contents Declaration i Summary ii Acknowledgments iv Table of Contents vi List of Tables x List of Figures xi Systems with Multiple Robots 1.1 Challenges of Multi-Agent Systems . . . . . . . . . . . . . . . . . . . 1.1.1 Communications . . . . . . . . . . . . . . . . . . . . . . . . . 1.1.2 Heterogeneity vs. Homogeneity . . . . . . . . . . . . . . . . . 1.1.3 Coordination and Cooperation . . . . . . . . . . . . . . . . . . 1.1.4 Task Allocation and Execution . . . . . . . . . . . . . . . . . . 1.1.5 Dynamic Reconfigurability . . . . . . . . . . . . . . . . . . . . Applications of Multi-Agent Systems . . . . . . . . . . . . . . . . . . 1.2.1 The Exploration Problem . . . . . . . . . . . . . . . . . . . . . 1.2.2 The Patrolling Problem . . . . . . . . . . . . . . . . . . . . . . 1.3 Scope of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.5 Thesis Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 vi Contents Literature Survey 10 2.1 Self-Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Multi-Agent Task Selection . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2.1 Negotiation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.2.2 Swarm Intelligence . . . . . . . . . . . . . . . . . . . . . . . . 13 2.2.3 Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . 15 The Exploration Problem . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.3.1 Frontier-Based Approach . . . . . . . . . . . . . . . . . . . . . 17 2.3.2 Potential Field Approach . . . . . . . . . . . . . . . . . . . . . 18 2.3.3 Ants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 The Patrolling Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 19 2.4.1 Watchman Route Problem (WRP) . . . . . . . . . . . . . . . . 20 2.4.2 Cyclic Strategies . . . . . . . . . . . . . . . . . . . . . . . . . 24 2.4.3 Partition-Based Strategies . . . . . . . . . . . . . . . . . . . . 26 2.4.4 Reinforcement Learning . . . . . . . . . . . . . . . . . . . . . 26 2.4.5 Heuristic Agents . . . . . . . . . . . . . . . . . . . . . . . . . 27 2.4.6 Ant Colony Optimization . . . . . . . . . . . . . . . . . . . . . 27 2.3 2.4 Dynamic Local Voronoi Decomposition for Multi-Agent Task Selection 29 3.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 3.1.1 The Task Environment . . . . . . . . . . . . . . . . . . . . . . 31 3.1.2 The Agents . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 The General Framework . . . . . . . . . . . . . . . . . . . . . . . . . 33 3.2.1 Voronoi Tessellations . . . . . . . . . . . . . . . . . . . . . . . 36 3.2.2 The Agent Architecture . . . . . . . . . . . . . . . . . . . . . . 36 3.2.3 Region of Influence . . . . . . . . . . . . . . . . . . . . . . . . 38 3.2.4 Defining Tasks . . . . . . . . . . . . . . . . . . . . . . . . . . 41 3.2.5 Task Lists . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 3.2.6 Local Voronoi Decomposition Algorithm . . . . . . . . . . . . 46 Utility Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 3.2 3.3 vii Contents 3.4 Time, tˆ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.3.2 Resources, rˆ . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 3.3.3 Appropriateness, a ˆ . . . . . . . . . . . . . . . . . . . . . . . . 57 3.3.4 Priority, pˆ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 3.3.5 Feasibility, fˆ . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Local Voronoi Decomposition for Multi-Agent Exploration 64 4.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 4.2 Existing Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 4.2.1 Ants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 4.2.2 Brick&Mortar . . . . . . . . . . . . . . . . . . . . . . . . . . 68 4.3 3.3.1 Local Voronoi Decomposition (LVD) Algorithm for Multi-Agent Exploration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 4.3.1 Local Voronoi Decomposition (LVD) . . . . . . . . . . . . . . 69 4.3.2 The Search Mode . . . . . . . . . . . . . . . . . . . . . . . . . 72 4.3.3 Robustness . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 4.3.4 Emergent Cooperative Behaviour . . . . . . . . . . . . . . . . 74 4.4 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 Dynamic Local Voronoi Decomposition for Multi-Agent Patrolling 82 5.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 5.2 Limitations of Currently Used Strategies . . . . . . . . . . . . . . . . . 86 5.3 Existing Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 5.3.1 Ants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 5.3.2 Biased Ants . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 5.4 Probabilistic Ants (PAnts) Algorithm for the Multi-Agent Patrolling Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 5.4.1 90 Pheromone Deposit and Decay . . . . . . . . . . . . . . . . . . viii Contents 5.4.2 Probabilistic Decision Making . . . . . . . . . . . . . . . . . . 91 5.4.3 The PAnts Algorithm . . . . . . . . . . . . . . . . . . . . . . . 91 5.4.4 Selection of Parameters . . . . . . . . . . . . . . . . . . . . . . 94 5.4.5 Robustness and Adaptability . . . . . . . . . . . . . . . . . . . 95 5.5 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 5.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104 Conclusion 105 6.1 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106 6.2 Limitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 6.3 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110 Bibliography 112 ix Bibliography [68] A. Martinoli and F. Mondada, “Collective and cooperative group behaviours: Biologically inspired experiments in robotics,” Experimental Robotics IV, pp. 3–10, 1995. [Online]. Available: http://www.springerlink.com/index/ dp2718118v7n4122.pdf [69] A. J. Ijspeert, A. Martinoli, A. Billard, and Luca Maria Gambardella, “Collaboration Through the Exploitation of Local Interactions in Autonomous Collective Robotics :,” Autonomous Robots, vol. 11, no. 2, pp. 149–171, 2001. [70] L. Li, A. Martinoli, and Y. S. Abu-mostafa, “Emergent Specialization in Swarm Systems,” Biological Cybernetics, vol. LNCS 2412, pp. 261–266, 2002. [71] M. Dorigo and G. Di Caro, “Ant colony optimization: a new meta-heuristic,” in Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). IEEE, 1999, pp. 1470–1477. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=782657 [72] a. Kulatunga, D. Liu, G. Dissanayake, and S. Siyambalapitiya, “Ant Colony Optimization based Simultaneous Task Allocation and Path Planning of Autonomous Vehicles,” 2006 IEEE Conference on Cybernetics and Intelligent Systems, pp. 1–6, Jun. 2006. [Online]. Available: http://ieeexplore.ieee.org/ lpdocs/epic03/wrapper.htm?arnumber=4017908 [73] Yin and Wang, “Ant colony optimization for the nonlinear resource allocation problem,” Applied Mathematics and Computation, vol. 174, no. 2, pp. 1438–1453, 2006. [Online]. Available: http://linkinghub.elsevier.com/retrieve/ pii/S009630030500562X [74] W. Zhenhua, Z. Weiguo, and L. Guangwen, “UAVs Task Allocation Using Multiple Colonies of Ants,” pp. 371– 374, 2009. [75] A. Dornhaus, F. Kl¨ugl, F. Puppe, and J. Tautz, “Task Selection in Honeybees Experiments Using Multi-Agent Simulation,” in The 3rd German Workshop on Artificial Life, 1998, pp. 171–183. [76] J. Du, L. Zhou, P. Qu, Z. Shi, and L. Yang, “Task allocation in multi-agent systems with swarm intelligence of social insects,” in 2010 Sixth International 121 Bibliography Conference on Natural Computation, vol. 8, no. Icnc. Ieee, Aug. 2010, pp. 4322–4326. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/ wrapper.htm?arnumber=5583611 [77] E. Martinson and R. Arkin, “Learning to role-switch in multi-robot systems,” in 2003 IEEE International Conference on Robotics and Automation, vol. 2. Ieee, 2003, pp. 2727–2734. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/ epic03/wrapper.htm?arnumber=1242005 [78] M. V. N. Prasad, V. R. Lesser, and S. E. Lander, “Learning Organizational Roles in a Heterogeneous Multi-agent System,” in Proceedings of the Second International Conference on Multiagent Systems, 1996, pp. 291–298. [79] X. I. N. Yao, “Evolving artificial neural networks,” Proceedings of the IEEE, vol. 87, no. 9, pp. 1423–1447, 1999. [Online]. Available: http: //ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=784219 [80] M. Quinn, L. Smith, G. Mayley, and P. Husbands, “Evolving Teamwork and Role-Allocation with Real Robots,” ICAL 2003 Proceedings of the eighth international conference on Artificial life, vol. 302, no. 1995, pp. 302–311, 2002. [Online]. Available: http://scholar.google.com/scholar?hl=en&btnG=Search&q= intitle:Evolving+Teamwork+and+Role-Allocation+with+Real+Robots#0 [81] K. Stanley, B. Bryant, and R. Miikkulainen, “Real-Time Neuroevolution in the NERO Video Game,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 6, pp. 653–668, Dec. 2005. [Online]. Available: http: //ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1545941 [82] L. Panait and S. Luke, “Cooperative Multi-Agent Learning: The State of the Art,” Autonomous Agents and Multi-Agent Systems, vol. 11, no. 3, pp. 387–434, Nov. 2005. [Online]. Available: http://www.springerlink.com/index/10. 1007/s10458-005-2631-2 [83] W. Chin and S. Ntafos, “Optimum watchman routes,” in Proceedings of the second annual symposium on Computational geometry - SCG ’86, vol. 28, no. May. New York, New York, USA: ACM Press, 1986, pp. 24–33. [Online]. Available: http://portal.acm.org/citation.cfm?doid=10515.10518 122 Bibliography [84] X. Tan, “Fast computation of shortest watchman routes in simple polygons,” Information Processing Letters, vol. 77, no. 1, pp. 27–33, 2001. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S0020019000001460 [85] T. Bandyopadhyay, Z. Liu, M. H. M. Ang, and W. Seah, “Visibility-based exploration in unknown environment containing structured obstacles,” in ICAR ’05. Proceedings., 12th International Conference on Advanced Robotics. IEEE, 2005, pp. 484–491. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/ wrapper.htm?arnumber=1507453 [86] R. Arkin and J. Diaz, “Line-of-sight constrained exploration for reactive multiagent robotic teams,” in 7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623). IEEE, 2002, pp. 455– 461. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1026963 [87] W. Burgard, M. Moors, D. Fox, R. Simmons, and S. Thrun, “Collaborative multirobot exploration,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), vol. 1. IEEE, 2000, pp. 476–481. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=844100 [88] D. Hougen, S. Benjaafar, J. Bonney, J. Budenske, M. Dvorak, M. Gini, H. French, D. Krantz, P. Li, F. Malver, B. Nelson, N. Papanikolopoulos, P. Rybski, S. Stoeter, R. Voyles, and K. Yesin, “A miniature robotic system for reconnaissance and surveillance,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), vol. 1, no. April. IEEE, 2000, pp. 501–507. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper. htm?arnumber=844104 [89] M. Simoncelli, G. Zunino, H. I. Christensen, and K. Lange, “Autonomous Pool Cleaning : Self Localization and Autonomous Navigation for Cleaning,” Autonomous Robots, vol. 9, no. 3, pp. 261–270, 2000. 123 Bibliography [90] E. M. Arkin, S. P. Fekete, and J. S. Mitchell, “Approximation algorithms for lawn mowing and milling,” Computational Geometry, vol. 17, no. 1-2, pp. 25–50, Oct. 2000. [Online]. Available: http://linkinghub.elsevier.com/retrieve/ pii/S0925772100000158http://www.ncbi.nlm.nih.gov/pubmed/21435355 [91] V. Kumar and F. Sahin, “Foraging in ant colonies applied to the mine detection problem,” in Proceedings of the 2003 IEEE International Workshop on Soft Computing in Industrial Applications, 2003. SMCia/03. Ieee, 2003, pp. 61–66. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper. htm?arnumber=1231345 [92] H. Choset, “Coverage for robotics A survey of recent results,” Annals of Mathematics and Artificial Intelligence, vol. 31, pp. 113–126, 2001. [93] A. Zelinsky, “A mobile robot exploration algorithm,” IEEE Transactions on Robotics and Automation, vol. 8, no. 6, pp. 707–717, 1992. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=182671 [94] H. Gonzalez-banos and J.-c. Latombe, “Planning robot motions for range-image acquisition and automatic 3d model construction,” AAAI Fall Symposium Series 1998, Integrated Planning for Autonomous Agent Architecture, 1998. [95] S. Albers, K. Kursawe, and S. Schuiererf, “Exploring Unknown Environments with Obstacles,” Proceeding in SODA ’99 Proceedings of the tenth annual ACMSIAM symposium on Discrete algorithms, pp. 842 – 843, 1999. [96] D. Lee and M. Recce, “Quantitative Evaluation of the Exploration Strategies of a Mobile Robot,” The International Journal of Robotics Research, vol. 16, no. 4, pp. 413–447, Aug. 1997. [Online]. Available: http: //ijr.sagepub.com/cgi/doi/10.1177/027836499701600401 [97] C. Taylor and D. Kriegman, “Exploration strategies for mobile robots,” [1993] Proceedings IEEE International Conference on Robotics and Automation, vol. 2, pp. 248–253, 1993. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/ wrapper.htm?arnumber=292154 124 Bibliography [98] B. Yamauchi, a. Schultz, and W. Adams, “Mobile robot exploration and mapbuilding with continuous localization,” Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), vol. 4, no. May, pp. 3715–3720, 1998. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/ epic03/wrapper.htm?arnumber=681416 [99] X. Ma, Q. Zhang, and Y. Li, “Genetic Algorithm-based Multi-robot Cooperative Exploration,” in 2007 IEEE International Conference on Control and Automation, vol. 00. IEEE, May 2007, pp. 1018–1023. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4376510 [100] A. Renzaglia and A. Martinelli, “Potential field based approach for coordinate exploration with a multi-robot team,” in 2010 IEEE International Workshop on Safety Security and Rescue Robotics (SSRR). IEEE, Jul. 2010, pp. 1–6. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=5981557 [101] D. Fox, J. Ko, K. Konolige, B. Limketkai, D. Schulz, and B. Stewart, “Distributed Multirobot Exploration and Mapping,” Proceedings of the IEEE, vol. 94, no. 7, pp. 1325–1339, Jul. 2006. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1677947 [102] Y. Wang, A. Liang, and H. Guan, “Frontier-based multi-robot map exploration using Particle Swarm Optimization,” in 2011 IEEE Symposium on Swarm Intelligence, no. 60773093. IEEE, Apr. 2011, pp. 1–6. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5952584 [103] R. Zlot, a. Stentz, M. Dias, and S. Thayer, “Multi-robot exploration controlled by a market economy,” Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), vol. 3, no. May, pp. 3016–3023, 2002. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1013690 [104] B. Yamauchi, “A frontier-based approach for autonomous exploration,” in Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA’97. ’Towards New Computational Principles 125 Bibliography for Robotics and Automation’. IEEE Comput. Soc. Press, 1997, pp. 146– 151. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=613851 [105] ——, “Frontier-Based Exploration Using Multiple Robots,” in Proceedings of the second international conference on Autonomous agents - AGENTS ’98. New York, New York, USA: ACM Press, 1998, pp. 47–53. [Online]. Available: http://portal.acm.org/citation.cfm?doid=280765.280773 [106] S. Koenig, C. Tovey, and W. Halliburton, “Greedy mapping of terrain,” in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation, vol. 4. IEEE, 2001, pp. 3594–3599. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=933175 [107] G. Oriolo, M. Vendittelli, L. Freda, and G. Troso, “The SRT method: randomized strategies for exploration,” in IEEE International Conference on Robotics and Automation. Proceedings. ICRA ’04., no. April. IEEE, 2004, pp. 4688–4694 Vol.5. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1302457 [108] L. Freda and G. Oriolo, “Frontier-Based Probabilistic Strategies for Sensor-Based Exploration,” in International Conference on Robotics and Automation, no. April, 2005, pp. 3892–3898. [109] A. Franchi, L. Freda, G. Oriolo, and M. Vendittelli, “A Randomized Strategy for Cooperative Robot Exploration,” in Proceedings 2007 IEEE International Conference on Robotics and Automation, no. April. IEEE, Apr. 2007, pp. 768–774. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper. htm?arnumber=4209183 [110] O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” in Proceedings. 1985 IEEE International Conference on Robotics and Automation, vol. 2. Institute of Electrical and Electronics Engineers, 1985, pp. 500– 505. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1087247 126 Bibliography [111] S. K. Pradhan, D. R. Parhi, A. K. Panda, and R. K. Behera, “Potential field method to navigate several mobile robots,” Applied Intelligence, vol. 25, no. 3, pp. 321–333, Dec. 2006. [Online]. Available: http: //www.springerlink.com/index/10.1007/s10489-006-0110-3 [112] Y. Koren and J. Borenstein, “Potential field methods and their inherent limitations for mobile robot navigation,” in Proceedings. 1991 IEEE International Conference on Robotics and Automation, no. April. IEEE Comput. Soc. Press, 1991, pp. 1398–1404. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/ epic03/wrapper.htm?arnumber=131810 [113] J. Ren, K. A. McIsaac, and R. V. Patel, “Modified Newton’s method applied to potential field-based navigation for mobile robots,” IEEE Transactions on Robotics, vol. 22, no. 2, pp. 384–391, Apr. 2006. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1618532 [114] J.-O. Kim and P. Khosla, “Real-time obstacle avoidance using harmonic potential functions,” IEEE Transactions on Robotics and Automation, vol. 8, no. 3, pp. 338–349, Jun. 1992. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/ epic03/wrapper.htm?arnumber=143352 [115] O. Simonin, F. Charpillet, and E. Thierry, “Collective construction of numerical potential fields for the foraging problem,” pp. 1–23, 2007. [116] J. Barraquand, B. Langlois, and J.-C. Latombe, “Numerical potential field techniques for robot path planning,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 22, no. 2, pp. 224–241, 1992. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=148426 [117] I. I. A. Wagner, M. Lindenbaum, and A. A. M. Bruckstein, “Distributed covering by ant-robots using evaporating traces,” IEEE Transactions on Robotics and Automation, vol. 15, no. 5, pp. 918–933, 1999. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=795795 [118] S. Koenig and Y. Liu, “Terrain coverage with ant robots,” in Proceedings of the fifth international conference on Autonomous agents - AGENTS ’01. 127 New Bibliography York, New York, USA: ACM Press, 2001, pp. 600–607. [Online]. Available: http://portal.acm.org/citation.cfm?doid=375735.376463 [119] J. Svennebring and S. Koenig, “Building Terrain-Covering Ant Robots: A Feasibility Study,” Autonomous Robots, vol. 16, no. 3, pp. 313–332, May 2004. [Online]. Available: http://www.springerlink.com/openurl.asp?id=doi: 10.1023/B:AURO.0000025793.46961.f6 [120] ——, “Trail-laying robots for robust terrain coverage,” in 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), vol. 1. Ieee, 2003, pp. 75–82. [Online]. Available: http://ieeexplore.ieee.org/ lpdocs/epic03/wrapper.htm?arnumber=1241576 [121] X.-h. Tan, T. Hirata, and Y. Inagaki, “An incremental algorithm for constructing shortest watchman routes,” International Journal of Computational Geometry and Applications, vol. 3, no. 4, pp. 351–365, 1993. [122] X. Tan, T. Hirata, and Y. Inagaki, “Corrigendum to “An Incremental Algorithm for Constructing Shortest Watchman Routes”,” International Journal of Computational Geometry & Applications, vol. 9, no. 6, pp. 319–323, 1999. [123] X. Tan, “Approximation algorithms for the watchman route and zookeeper’s problems,” Discrete Applied Mathematics, vol. 136, no. 2-3, pp. 363– 376, Feb. 2004. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/ S0166218X03004517 [124] S. Ntafos and C. S. Program, “The Robber Route Problem,” Information Processing Letters, vol. 34, no. 2, pp. 59–63, 1990. [125] C. Wei-Pang and S. Ntafos, “The zookeeper route problem,” Information Sciences, vol. 63, no. 3, pp. 245–259, Sep. 1992. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/002002559290072G [126] X. Tan and T. Hirata, “Finding shortest safari routes in simple polygons,” Information Processing Letters, vol. 87, no. 4, pp. 179–186, Aug. 2003. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S0020019003002849 128 Bibliography [127] S. Bespamyatnikh, “An O ( n log n ) algorithm for the zoo-keeper s problem,” Computational Geometry: Theory and Applications, vol. 24, no. 2, pp. 63–74, 2003. [128] X. Tan, “A 2-approximation algorithm for the zookeeper’s problem,” Information Processing Letters, vol. 100, no. 5, pp. 183–187, Dec. 2006. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S0020019006001967 [129] J. Czyzowicz, P. Egyed, H. Everett, D. Rappaport, T. Shermer, D. Souvaine, G. Toussaint, and J. Urrutia, “The Aquarium Keeper s Problem,” in Second Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 459–464. [130] R. Honsberger, Mathematical Gems II. Mathematical Association of America, 1976. [131] V. Chv´atal, “A combinatorial theorem in plane geometry,” Journal of Combinatorial Theory, Series B, vol. 18, no. 1, pp. 39–41, Feb. 1975. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/0095895675900611 [132] X. Kong, H. Everett, and G. Toussaint, “The Graham scan triangulates simple polygons,” Pattern Recognition Letters, vol. 11, no. 11, pp. 713– 716, Nov. 1990. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/ 016786559090089K [133] B. Chazelle, “Triangulating a simple polygon in linear time,” Discrete & Computational Geometry, vol. 6, no. 1, pp. 485–524, Dec. 1991. [Online]. Available: http://www.springerlink.com/index/10.1007/BF02574703 [134] A. Aggarwal, “The art gallery theorem: Its variations, applications, and algorithmic aspects,” Ph.D. dissertation, Johns Hopkins University, 1984. [135] D. Lee and A. Lin, “Computational complexity of art gallery problems,” IEEE Transactions on Information Theory, vol. 32, no. 2, pp. 276–282, Mar. 1986. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1057165 129 Bibliography [136] J. Kahn, M. Klawe, and D. Kleitman, “Traditional galleries require fewer watchmen,” SIAM Journal on Algebraic and Discrete, vol. 4, no. 2, pp. 194–206, 1983. [Online]. Available: http://link.aip.org/link/?SJMAEL/4/194/1 [137] I. Bjorling-Sachs and D. L. Souvaine, “An efficient algorithm for guard placement in polygons with holes,” Discrete & Computational Geometry, vol. 13, no. 1, pp. 77–109, Dec. 1995. [Online]. Available: http: //www.springerlink.com/index/10.1007/BF02574029 [138] T. Danner and L. Kavraki, “Randomized planning for short inspection paths,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), vol. 2, no. April. IEEE, 2000, pp. 971–976. [Online]. Available: http: //ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=844726 [139] H. Gonz´alez-Banos and J.-C. Latombe, “A randomized art-gallery algorithm for sensor placement,” in Proceedings of the seventeenth annual symposium on Computational geometry - SCG ’01. New York, New York, USA: ACM Press, 2001, pp. 232–240. [Online]. Available: http://portal.acm.org/citation.cfm?doid= 378583.378674 [140] M. Kulich, J. Faigl, J. Klema, and J. Kubalik, “Rescue operation planning by soft computing techniques,” in IEEE 4th International Conference on Intelligent Systems Design and Application, 2004, pp. 103–109. [141] G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications, ser. Lecture Notes in Computer Science. Springer-Verlag, 1994, vol. 840, no. 1990. [Online]. Available: http://portal.acm.org/citation.cfm?id= 1744275&dl=&CFID=107579554&CFTOKEN=38385491 [142] G. A. Croes, “A Method for Solving Traveling-Salesman Problems,” Operations Research, vol. 6, no. 6, pp. 791–812, 1958. [143] H. Sengoku and I. Yoshihara, “A fast TSP solver using GA on JAVA,” in Third International Symposium on Artificial Life, and Robotics (AROB III98), 1998, pp. 283–288. 130 Bibliography [144] Y. Chevaleyre, “Theoretical analysis of the multi-agent patrolling problem,” in Intelligent Agent Technology, 2004.(IAT 2004). Proceedings. IEEE/WIC/ACM International Conference on, 2004, pp. 302–308. [Online]. Available: http: //ieeexplore.ieee.org/xpls/abs all.jsp?arnumber=1342959 [145] Y. Elor and A. M. Bruckstein, “Autonomous multi-agent cycle based patrolling,” in ANTS’10 Proceedings of the 7th international conference on Swarm intelligence, 2010, pp. 119–130. [146] N. Christofides, “Worst-case analysis of a new heuristic for the travelling salesman problem,” Graduate School of Industrial Administration, CMU, Tech. Rep., 1976. [147] Y. Elor and A. M. Bruckstein, “Multi-a(ge)nt Graph Patrolling and Partitioning,” 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, pp. 52–57, 2009. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5284867 [148] R. Sutton and A. Barto, Reinforcement learning: An introduction, 1998. [149] A. Almeida, P. Castro, T. Menezes, and G. Ramalho, “Combining Idleness and Distance to Design Heuristic Agents for the Patrolling Task,” in II Brazilian Workshop in Games and Digital Entertainment, 2003, pp. 33–40. [150] A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed Optimization by Ant Colonies,” in Proceedings of the first European Conference on Artificial Life, F. J. Varela and P. Bourgine, Eds., vol. 142, no. or D. Elsevier Publishing, 1991, pp. 134–142. [Online]. Available: http://scholar.google.com/scholar?hl= en&btnG=Search&q=intitle:Distributed+Optimization+by+Ant+Colonies#0 [151] ——, “An investigation of some properties of an ” Ant algorithm ”,” in Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), R M¨anner and B Manderick, Eds., 1992, pp. 509–520. [Online]. Available: http://staff.washington.edu/paymana/swarm/colorni92-ppsn.pdf [152] M. Dorigo and L. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary 131 Bibliography Computation, vol. 1, no. 1, pp. 53–66, Apr. 1997. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=585892 [153] M. Dorigo, V. Maniezzo, and a. Colorni, “Ant system: optimization by a colony of cooperating agents.” IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, vol. 26, no. 1, pp. 29–41, Jan. 1996. [Online]. Available: http://www.ncbi.nlm.nih.gov/pubmed/18263004 [154] F. Lauri and F. Charpillet, “Ant Colony Optimization applied to the Multi-Agent Patrolling Problem,” in in Proceedings of IEEE Swarm Intelligence Symposium, 2006. [155] Y. Mohan and S. G. Ponnambalam, “Exploration Strategies for Learning in Multiagent Foraging,” Swarm, Evolutionary, and Memetic Computing, pp. 17–26, 2011. [156] O. Khatib, K. Yokoi, K. Chang, D. Ruspini, R. Holmberg, and A. Casal, “Coordination and decentralized cooperation of multiple mobile manipulators,” Journal of Robotic Systems, vol. 13, no. 11, pp. 755–764, Nov. 1996. [Online]. Available: http://doi.wiley.com/10.1002/%28SICI%291097-4563%28199611% 2913%3A11%3C755%3A%3AAID-ROB6%3E3.0.CO%3B2-U [157] Y. Hirata, K. Kosuge, H. Asama, H. Kaetsu, and K. Kawabata, “Coordinated transportation of a single object by multiple mobile robots without position information of each robot,” in Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113), vol. 3. IEEE, 2000, pp. 2024–2029. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=895268 [158] J.-H. Kim, H.-S. Shim, H.-S. Kim, M.-J. Jung, I.-H. Choi, and J.-O. Kim, “A cooperative multi-agent system and its real time application to robot soccer,” in Proceedings of International Conference on Robotics and Automation, vol. 1. IEEE, 1997, pp. 638–643. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=620108 132 Bibliography [159] N.-F. Xiao and S. Nahavandi, “Multi-agent model for robotic assembly system,” in Proceedings of the 5th Biannual World Automation Congress. TSI Press, 2002, pp. 495–500. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/ wrapper.htm?arnumber=1049486 [160] Y.-Y. Chen, L.-C. Fu, and Y.-C. Chen, “Multi-agent based dynamic scheduling for a flexible assembly system,” Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), vol. 3, no. May, pp. 2122–2127, 1998. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/ wrapper.htm?arnumber=680634 [161] S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach (3rd Edition). Prentice Hall, 2009. [Online]. Available: http://www.amazon.com/ Artificial-Intelligence-Modern-Approach-Edition/dp/0136042597 [162] J. G. M. Fu and M. H. Ang, “Probabilistic Ants (PAnts) in Multi-Agent Patrolling,” in 2009 IEEE/ASME International Conference on Advanced Intelligent Mechatronics. IEEE, Jul. 2009, pp. 1371–1376. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5229880 [163] J. Von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, L. Schneider and O. Deuber, Eds. Princeton University Press, 1944, vol. 2, no. 9904. [Online]. Available: http://www.archive.org/details/ theoryofgamesand030098mbp [164] R. Jamisola, M. Ang, D. Oetomo, and O. Khatib, “The Operational Space Formulation implementation to aircraft canopy polishing using a mobile manipulator,” in Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), vol. 1, no. May. IEEE, 2002, pp. 400–405. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper. htm?arnumber=1013393 [165] R. Jamisola, M. H. Ang, O. Khatib, D. N. Oetomo, T. M. Lim, and S. Y. Lim, “Compliant Motion Using a Mobile Manipulator: An Operational Space Formulation Approach to Aircraft Canopy Polishing,” ADRO, vol. 19, no. 5, pp. 477–634, 2005. 133 Bibliography [166] Y. Yu, D. Harwood, K. Yoon, and L. S. Davis, “Human appearance modeling for matching across video sequences,” Machine Vision and Applications, vol. 18, no. 3-4, pp. 139–149, Apr. 2007. [Online]. Available: http://www.springerlink.com/index/10.1007/s00138-006-0061-z [167] J. J. Mearsheimer, “Assessing the Conventional Balance: The 3:1 Rule and Its Critics,” International Security, vol. 13, no. 4, p. 54, Jan. 1989. [Online]. Available: http://www.jstor.org/stable/2538780?origin=crossref [168] E. M. Arkin and R. Hassin, “Approximation algorithms for the geometric covering salesman problem,” Discrete Applied Mathematics, vol. 55, no. 3, pp. 197–218, Dec. 1994. [Online]. Available: http://linkinghub.elsevier.com/retrieve/ pii/0166218X94900086 [169] Y. Seng Ng and R. Srinivasan, “Multi-agent based collaborative fault detection and identification in chemical processes,” Engineering Applications of Artificial Intelligence, vol. 23, no. 6, pp. 934–949, Sep. 2010. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S095219761000059X [170] C. Trefftz and J. Szakas, “Parallel algorithms to find the Voronoi diagram and the order-k Voronoi diagram,” in Proceedings International Parallel and Distributed Processing Symposium, vol. 00, no. C. IEEE Comput. Soc, 2003, p. 4. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1213488 [171] G. Dissanayake, H. Durrant-Whyte, and T. Bailey, “A computationally efficient solution to the simultaneous localisation and map building (SLAM) problem,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings, vol. 2, no. April 2000. IEEE, 2006, pp. 1009–1014. [Online]. Available: http: //ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=844732 [172] M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit, “FastSLAM 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges,” in International Joint Conference on Artificial Intelligence, 2003, pp. 1151–1156. 134 Bibliography [173] E. Ferranti, N. Trigoni, and M. Levene, “Brick& Mortar: an on-line multi-agent exploration algorithm,” in Proceedings 2007 IEEE International Conference on Robotics and Automation, no. April. IEEE, Apr. 2007, pp. 761–767. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper. htm?arnumber=4209182 [174] K. Albekord, A. Watkins, G. Wiens, N. Fitz-coy, and K.-c. Lin, “Multiple-Agent Surveillance Mission with Non-Stationary Obstacles,” in Florida Conference on Recent Advances in Robotics, 2004, pp. 1–5. [175] K. Williams and J. Burdick, “Multi-robot boundary coverage with plan revision,” in Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. IEEE, 2006, pp. 1716–1723. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1641954 [176] A. Almeida, G. Ramalho, H. Santana, P. Tedesco, T. Menezes, V. Corruble, and Y. Chevaleyre, “Recent Advances on Multi-Agent Patrolling,” in 17th Brazilian Symposium on Artificial Intelligence, 2004, pp. 474 – 483. [177] F. Sempe and A. Drogoul, “Adaptive patrol for a group of robots,” in Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003), vol. 3, no. October. IEEE, 2003, pp. 2865– 2869. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1249305 [178] T. Balch, “Avoiding the past: a simple but effective strategy for reactive navigation,” in [1993] Proceedings IEEE International Conference on Robotics and Automation. IEEE Comput. Soc. Press, 1993, pp. 678– 685. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=292057 [179] David Payton, M. Daily, B. Hoff, M. Howard, and C. Lee, “Autonomy-Oriented Computation in Pheromone Robotics,” in Proceedings of Workshop on Autonomy Oriented Computation (AOC), Fifth International Conference on Autonomous Agents, 2001, pp. 69–77. 135 Bibliography [180] R. T. Vaughan, K. Stø y, G. S. Sukhatme, and M. J. Matari´c, “Whistling in the Dark: Cooperative Trail Following in Uncertain Localization Space,” in Proceedings of the fourth international conference on Autonomous agents AGENTS ’00. New York, New York, USA: ACM Press, 2000, pp. 187–194. [Online]. Available: http://portal.acm.org/citation.cfm?doid=336595.337351 [181] A. Machado, G. Ramalho, J.-d. Zucker, and A. Drogoul, “Multi-Agent Patrolling : an Empirical Analysis of Alternative Architectures,” Multi-Agent-Based Simulation II: Third International Workshop, MABS 2002, pp. 155–170, 2002. [182] J. Faigl and M. Kulich, “Sensing Locations Positioning for Multi-robot Inspection Planning,” in IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS’06). IEEE, 2006, pp. 79– 84. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm? arnumber=1633422 [183] H. V. D. Parunak, S. Brueckner, J. Sauter, and J. Posdamer, “Mechanisms and Military Applications for Synthetic Pheromones,” in Workshop on Autonomy Oriented Computation, Autonomous Agents 2001, no. May, 2001, pp. 58–67. 136 [...]... dynamic 12 2.2 Multi- Agent Task Selection environments where all acquired information ends up in a centralized Blackboard The work in [53] assumes that all agents are able to evaluate other agents’ utility functions and hence able to identify which agent will perform the available tasks The work in [52] makes use of an auctioning mechanism to determine task allocation Many auction-based schemes make... Ant Task Allocation (ATA) algorithm proposed by Du et el [76], agents probabilistically determine their tasks and update their thresholds upon task completion Unlike ACO, ATA allows for dynamic task allocation where new tasks may arise and agents using ATA keeps its own response 14 2.3 The Exploration Problem threshold records as opposed to ACO using a central database 2.2.3 Machine Learning Machine... term task can encapsulate the idea of a ”role”, as ultimately, it boils down to the agent performing tasks A ”role” can be seen as a collection of subtasks 2.2.1 Negotiation Most multi- agent systems make use of intentional cooperation [45] where multi- agents cooperate explicitly through communication and negotiation [46] In the centralised multi- agent negotiation approach for collaborative air traffic... Thesis of these challenges, namely that of task allocation Task allocation is a fundamental issue in every multi- agent system and significantly affects the overall effectiveness of the system Many task allocation strategies are mission specific One strategy may work well in a specific case, but not so in others This thesis thus focuses on developing a general framework for multi- agent task allocation which... used for the Patrolling Problem 1.4 Contributions A general framework, utilising the concept of Local Voronoi Decomposition (LVD) and a Utility Function, has been developed for multi- agent task selection This framework allows agents to make decisions on task selection, based on local information, in a completely distributed manner This framework is robust to changes and adaptable to a dynamically changing... allocation” can refer to a supervisor or some authority having the final say on all agents’ allocated tasks In other cases, task allocation” can refer to the individual agent s cognition of self-allocation of tasks This thesis focuses on the case where the decision making for task allocation is carried out distributively, i.e., each agent determines for itself which task it should perform next To avoid... able to have the tasks performed in a highly coordinated manner with minimal reliance on communications 1.1 Challenges of Multi- Agent Systems While the use of multi- agents has many advantages over their single agent counterpart, managing and coordinating a whole team of robots to execute tasks efficiently, effectively and successfully can be very challenging as there are many factors and variables which... varying functions and capabilities) A homogeneous multi- agent system is generally easier to manage and to be catered for because it is easier to model such a system In practical cases, multi- agent systems are rarely homogeneous especially in environments where the tasks that are required to be performed are different In such environments, having agents all identical to one another would mean that each... Blackboard architecture and the CNP According to Msoteo and Montano [54], the first robot implementation of the auctionbased scheme was MURDOCH [55] MURDOCH has been demonstrated in a loosely coupled task allocation scenario where all available tasks can be performed by single agents, as well as in a coordinated box-pushing scenario The Cooperative Assignment of Simultaneous Tasks (CAST) auction is a. .. obstacles 2.2 Multi- Agent Task Selection A task can be defined as a subgoal which is required to ba achieved to accomplish the overall mission required in the environment To have good self-organisation in a multiagent system, ensuring efficient task selection by individual agents becomes a challenging problem in a distributed setting because of the dynamic nature of the environment 11 2.2 Multi- Agent Task . some cases, task allocation” can refer to a supervisor or some authority having the final say on all agents’ allocated tasks. In other cases, task allocation” can refer to the individual agent s. challenges, namely that of task allocation. Task allocation is a fundamental issue in every multi- agent system and significantly affects the overall effectiveness of the system. Many task allocation. in a probabilistic manner based on an agent s local pheromone information. Benchmarked against the traditional Ant Algorithm as well as our proposed variant of this for various test maps, PAnts