Abstract
Existing studies on the multirobot foraging problem often assume safe settings, in which nothing in an environment hinders the robots’ tasks. In many real-world applications, robots have to collect objects from hazardous environments like earthquake rescue, where possible risks exist, with possibilities of destroying robots. At this stage, there are no targeted algorithms for foraging robots in hazardous environments, which can lead to damage to the robot itself and reduce the final foraging efficiency. A motivating example is a rescue scenario, in which the lack of a suitable solution results in many victims not being rescued after all available robots have been destroyed. Foraging robots face a dilemma after some robots have been destroyed: whether to take over tasks of the destroyed robots or continue executing their remaining foraging tasks. The challenges that arise when attempting such a balance are twofold: (1) the loss of robots adds new constraints to traditional problems, complicating the structure of the solution space, and (2) the task allocation strategy in a multirobot team affects the final expected utility, thereby increasing the dimension of the solution space. In this study, we address these challenges in two fundamental environmental settings: homogeneous and heterogeneous cases. For the former case, a decomposition and grafting mechanism is adopted to split this problem into two weakly coupled problems: the foraging task execution problem and the foraging task allocation problem. We propose an exact foraging task allocation algorithm, and graft it to another exact foraging task execution algorithm to find an optimal solution within the polynomial time. For the latter case, it is proven \( \mathcal {NP} \)-hard to find an optimal solution in polynomial time. The decomposition and grafting mechanism is also adopted here, and our proposed greedy risk-aware foraging algorithm is grafted to our proposed hierarchical agglomerative clustering algorithm to find high-utility solutions with low computational overhead. Finally, these algorithms are extensively evaluated through simulations, demonstrating that compared with various benchmarks, they can significantly increase the utility of objects returned by robots before all the robots have been stopped.
- [1] . 2017. Robotic strategic behavior in adversarial environments. In Proceedings of the International Joint Conference on Artificial Intelligence. 5106–5110.Google Scholar
Cross Ref
- [2] . 2011. Multi–robot adversarial patrolling: Facing a full-knowledge opponent. J. Artif. Intell. Res. 42, 1 (2011), 887–916.Google Scholar
Digital Library
- [3] . 2009. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput. Operat. Res. 36, 5 (2009), 1693–1702.Google Scholar
Digital Library
- [4] . 2011. Bee-inspired foraging in an embodied swarm. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. 1311–1312.Google Scholar
- [5] . 2013. The capacitated team orienteering problem with incomplete service. Optimiz. Lett. 7, 7 (2013), 1405–1417.Google Scholar
Cross Ref
- [6] . 2016. Coordinated robot navigation via hierarchical clustering. IEEE Trans. Robot. 32, 2 (2016), 352–371.Google Scholar
Digital Library
- [7] . 2016. Planning search and rescue missions for UAV teams. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. 1777–1782.Google Scholar
- [8] . 2000. Social potentials for scalable multi–robot formations. In Proceedings of the International Conference on Robotics and Automation. 73–80.Google Scholar
Cross Ref
- [9] . 2016. Online planning for collaborative search and rescue by heterogeneous robot teams. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. 1024–1033.Google Scholar
- [10] . 1966. Dynamic programming. Science 153, 3731 (1966), 34–37.Google Scholar
Cross Ref
- [11] . 2011. The orienteering problem with stochastic travel and service times. Ann. Operat. Res. 186, 1 (2011), 61–81.Google Scholar
Cross Ref
- [12] . 2017. A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time. ACM Trans. Intell. Syst. Technol. 9, 3 (2017), 1–21.Google Scholar
Digital Library
- [13] . 2016. Adaptive foraging for simulated and real robotic swarms: The dynamical response threshold approach. Swarm Intell. 10, 1 (2016), 1–31.Google Scholar
Cross Ref
- [14] . 2014. Fast heuristics for near-optimal task allocation in data stream processing over clusters. In Proceedings of the ACM International Conference on Conference on Information and Knowledge Management. 1579–1588.Google Scholar
Digital Library
- [15] . 2014. Multi-agent orienteering problem with time-dependent capacity constraints. Web Intell. Agent Syst. 12, 4 (2014), 347–358.Google Scholar
Cross Ref
- [16] . 2009. Consensus-based decentralized auctions for robust task allocation. IEEE Trans. Robot. 25, 4 (2009), 912–926.Google Scholar
Digital Library
- [17] . 2019. Risk-aware graph search with dynamic edge cost discovery. Int. J. Robot. Res. 38, 2-3 (2019), 182–195.Google Scholar
Digital Library
- [18] . 2009. Introduction to Algorithms. MIT Press, Cambridge, MA.Google Scholar
Digital Library
- [19] . 1959. The truck dispatching problem. Manage. Sci. 6, 1 (1959), 80–91.Google Scholar
Digital Library
- [20] . 1990. The self-organising exploratory pattern of the argentine ant. J. Insect Behav. 3, 2 (1990), 159–168.Google Scholar
Cross Ref
- [21] . 2013. Pareto optimal pairwise sequence alignment. IEEE/ACM Trans. Comput. Biol. Bioinf. 10, 2 (2013), 481–493.Google Scholar
Digital Library
- [22] . 2002. Cluster merging and splitting in hierarchical clustering algorithms. In Proceedings of the IEEE International Conference on Data Mining. IEEE, 139–146.Google Scholar
Cross Ref
- [23] . 2018. Exact algorithms for the chance-constrained vehicle routing problem. Math. Program. 172, 1 (2018), 105–138.Google Scholar
Cross Ref
- [24] . 2013. The orienteering problem with variable profits. Networks 61, 2 (2013), 104–116.Google Scholar
Cross Ref
- [25] . 2016. Social complexity, diet, and brain evolution: Modeling the effects of colony size, worker size, brain size, and foraging behavior on colony fitness in ants. Behav. Ecol. Sociobiol. 70, 7 (2016), 1063–1074.Google Scholar
Cross Ref
- [26] . 2019. Satellite detection of moving vessels in marine environments. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 9452–9459.Google Scholar
Digital Library
- [27] . 2007. Alice in pheromone land: An experimental setup for the study of ant-like robots. In Proceedings of the Swarm Intelligence Symposium. IEEE, 37–44.Google Scholar
Digital Library
- [28] . 2008. Key behavioural factors in a self-organised fish school model. In Annales Zoologici Fennici, Vol. 45. BioOne, 415–428.Google Scholar
- [29] . 1996. Stochastic vehicle routing. Eur. J. Operat. Res. 88, 1 (1996), 3–12.Google Scholar
Cross Ref
- [30] . 2000. An efficient transformation of the generalized vehicle routing problem. Eur. J. Operat. Res. 122, 1 (2000), 11–17.Google Scholar
Cross Ref
- [31] . 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Vol. 43. Springer Science & Business Media.Google Scholar
Cross Ref
- [32] . 2004. Robust Statistics. Vol. 523. John Wiley & Sons.Google Scholar
- [33] . 2000. Optimal PNNI complex node representations for restrictive costs and minimal path computation time. IEEE/ACM Trans. Netw. 8, 4 (2000), 493–506.Google Scholar
Digital Library
- [34] . 1985. The np-completeness column: An ongoing guide. J. Algor. 6, 3 (1985), 434–451.Google Scholar
Cross Ref
- [35] . 2018. The team surviving orienteers problem: Routing teams of robots in uncertain environments with survival constraints. Auton. Robots 42, 4 (2018), 927–952.Google Scholar
Digital Library
- [36] . 2014. Information merging in multi-UAV coperative search. In Proceedings of the IEEE International Conference on Robotics and Automation. IEEE, 3122–3129.Google Scholar
- [37] . 2019. Multiple traveling salesman problem with drones: Mathematical model and heuristic approach. Comput. Industr. Eng. 129 (2019), 14–30.Google Scholar
Digital Library
- [38] . 2008. Incremental learning, clustering and hierarchy formation of whole body motion patterns using adaptive hidden markov chains. Int. J. Robot. Res. 27, 7 (2008), 761–784.Google Scholar
Digital Library
- [39] . 2011. Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heurist. 17, 6 (2011), 729–753.Google Scholar
Cross Ref
- [40] . 1996. Some applications of the generalized travelling salesman problem. J. Operat. Res. Soc. 47, 12 (1996), 1461–1467.Google Scholar
Cross Ref
- [41] . 2006. Analysis of dynamic task allocation in multi-robot systems. Int. J. Robot. Res. 25, 3 (2006), 225–241.Google Scholar
Digital Library
- [42] . 2015. Continuous foraging and information gathering in a multi-agent team. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. 1325–1333.Google Scholar
- [43] . 2019. Multi-robot adversarial patrolling: Handling sequential attacks. Artif. Intell. 274 (2019), 1–25.Google Scholar
Digital Library
- [44] . 2016. The MPFA: A multiple-place foraging algorithm for biologically-inspired robot swarms. In Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 3815–3821.Google Scholar
Digital Library
- [45] . 2017. Hierarchical clustering-task scheduling policy in cluster-based wireless sensor networks. IEEE Trans. Industr. Inf. 14, 5 (2017), 1876–1886.Google Scholar
Cross Ref
- [46] . 2008. Route planning under uncertainty: The canadian traveller problem. In Proceedings of the AAAI Conference on Artificial Intelligence. 969–974.Google Scholar
- [47] . 2004. A pheromone-based utility model for collaborative foraging. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems. IEEE, 36–43.Google Scholar
- [48] . 2002. Self-organized fish schools: An examination of emergent properties. Biol. Bull. 202, 3 (2002), 296–305.Google Scholar
Cross Ref
- [49] . 2013. A review of dynamic vehicle routing problems. Eur. J. Operat. Res. 225, 1 (2013), 1–11.Google Scholar
Cross Ref
- [50] . 2016. Information flow principles for plasticity in foraging robot swarms. Swarm Intell. 10, 1 (2016), 33–63.Google Scholar
Cross Ref
- [51] . 2012. UAV route planning for joint search and track missions–an information-value approach. IEEE Trans. Aerosp. Electr. Syst. 48, 3 (2012), 2551–2565.Google Scholar
Cross Ref
- [52] . 2016. Dynamic vehicle routing problems: Three decades and counting. Networks 67, 1 (2016), 3–31.Google Scholar
Digital Library
- [53] . 2006. Adaptation, genetic drift, pleiotropy, and history in the evolution of bee foraging behavior. Adv. Study Behav. 36 (2006), 305–354.Google Scholar
Cross Ref
- [54] . 2010. Decentralized coordination in robocup rescue. Comput. J. 53, 9 (2010), 1447–1461.Google Scholar
Cross Ref
- [55] . 1991. A ‘Retraction’ method for learned navigation in unknown terrains for a circular robot. IEEE Trans. Robot. Autom. 7, 5 (1991), 699–707.Google Scholar
Cross Ref
- [56] . 1991. TSPLIB—A traveling salesman problem library. ORSA J. Comput. 3, 4 (1991), 376–384.Google Scholar
Cross Ref
- [57] . 2007. Fuzzy divisive hierarchical clustering of soil data using gustafson–kessel algorithm. Chemometr. Intell. Lab. Syst. 86, 1 (2007), 121–129.Google Scholar
Cross Ref
- [58] . 2015. Path planning for optimizing survivability of multi-robot formation in adversarial environments. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems. 4544–4549.Google Scholar
- [59] . 2006. On foraging strategies for large-scale multi-robot systems. In Proceedings of the International Conference on Intelligent Robots and Systems. 2717–2723.Google Scholar
Cross Ref
- [60] . 2014. Revisiting wavefront construction with collective agents: An approach to foraging. Swarm Intell. 8, 2 (2014), 113–138.Google Scholar
Cross Ref
- [61] . 2014. Multi-robot adversarial patrolling: Facing coordinated attacks. In Proceedings of the International Conference on Autonomous Agents & Multiagent Systems. 1093–1100.Google Scholar
- [62] . 2019. Sophisticated collective foraging with minimalist agents: A swarm robotics test. Int. J. Robot. Res. 35, 12 (2019), 1–32.Google Scholar
- [63] . 2017. Optimizing communication and computation for multi-UAV information gathering applications. IEEE Trans. Aerosp. Electr. Syst. 54, 2 (2017), 601–615.Google Scholar
Cross Ref
- [64] . 1969. The multiple terminal delivery problem with probabilistic demands. Transport. Sci. 3, 3 (1969), 192–204.Google Scholar
Digital Library
- [65] . 2016. Personality, foraging behavior and specialization: Integrating behavioral and food web ecology at the individual level. Oecologia 182, 1 (2016), 55–69.Google Scholar
Cross Ref
- [66] . 2011. The orienteering problem: A survey. Eur. J. Operat. Res. 209, 1 (2011), 1–10.Google Scholar
Cross Ref
- [67] . 1998. Efficiently searching a graph by a smell-oriented vertex process. Ann. Math. Artif. Intell. 24, 1 (1998), 211–223.Google Scholar
Digital Library
- [68] . 2000. Mac versus PC: Determinism and randomness as complementary approaches to robotic exploration of continuous unknown domains. Int. J. Robot. Res. 19, 1 (2000), 12–31.Google Scholar
Cross Ref
- [69] . 2009. Foraging robots. In Encyclopedia of Complexity and Systems Science, 3682–3700.Google Scholar
Cross Ref
- [70] . 2009. Towards an engineering science of robot foraging. Distrib. Auton. Robot. Syst. (2009), 185–192.Google Scholar
- [71] . 2012. DHCC: Divisive hierarchical clustering of categorical data. Data Min. Knowl. Discov. 24, 1 (2012), 103–135.Google Scholar
Digital Library
- [72] . 2015. Adversarial modeling in the robotic coverage problem. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. 1–7.Google Scholar
- [73] . 2016. Multi-robot adversarial coverage. In Proceedings of the European Conference on Artificial Intelligence. 1493–1501.Google Scholar
- [74] . 2016. Robotic adversarial coverage of known environments. Int. J. Robot. Res. 35, 12 (2016), 1419–1444.Google Scholar
Digital Library
- [75] . 2019. Expertise-aware truth analysis and task allocation in Mobile crowdsourcing. IEEE Trans. Mobile Comput. (2019).Google Scholar
Index Terms
Risk-aware Collection Strategies for Multirobot Foraging in Hazardous Environments
Recommendations
A Foraging Strategy with Risk Response for Individual Robots in Adversarial Environments
As an essential problem in robotics, foraging means that robots collect objects from a given environment and return them to a specified location. On many occasions, robots are required to perform foraging tasks in adversarial environments, such as ...
Autonomous robot path planning in dynamic environment using a new optimization technique inspired by bacterial foraging technique
Path planning is one of the basic and interesting functions for a mobile robot. This paper explores the application of Bacterial Foraging Optimization to the problem of mobile robot navigation to determine the shortest feasible path to move from any ...






Comments