Robust Online Epistemic Replanning of Multi-Robot Missions (2403.00641v1)
Abstract: As Multi-Robot Systems (MRS) become more affordable and computing capabilities grow, they provide significant advantages for complex applications such as environmental monitoring, underwater inspections, or space exploration. However, accounting for potential communication loss or the unavailability of communication infrastructures in these application domains remains an open problem. Much of the applicable MRS research assumes that the system can sustain communication through proximity regulations and formation control or by devising a framework for separating and adhering to a predetermined plan for extended periods of disconnection. The latter technique enables an MRS to be more efficient, but breakdowns and environmental uncertainties can have a domino effect throughout the system, particularly when the mission goal is intricate or time-sensitive. To deal with this problem, our proposed framework has two main phases: i) a centralized planner to allocate mission tasks by rewarding intermittent rendezvous between robots to mitigate the effects of the unforeseen events during mission execution, and ii) a decentralized replanning scheme leveraging epistemic planning to formalize belief propagation and a Monte Carlo tree search for policy optimization given distributed rational belief updates. The proposed framework outperforms a baseline heuristic and is validated using simulations and experiments with aerial vehicles.
- L. Bramblett, S. Gao, and N. Bezzo, “Epistemic prediction and planning with implicit coordination for multi-robot teams in communication restricted environments,” in 2023 IEEE International Conference on Robotics and Automation (ICRA), 2023, pp. 5744–5750.
- L. Bramblett and N. Bezzo, “Epistemic planning for multi-robot systems in communication-restricted environments,” Frontiers in Robotics and AI, vol. 10, p. 1149439, 2023.
- G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a large-scale traveling-salesman problem,” Journal of the operations research society of America, vol. 2, no. 4, pp. 393–410, 1954.
- M. Bellmore and S. Hong, “Transformation of multisalesman problem to the standard traveling salesman problem,” Journal of the ACM (JACM), vol. 21, no. 3, pp. 500–504, 1974.
- B. Miloradović, B. Çürüklü, M. Ekström, and A. V. Papadopoulos, “GMP: A genetic mission planner for heterogeneous multirobot system applications,” IEEE Transactions on Cybernetics, vol. 52, no. 10, pp. 10 627–10 638, 2021.
- M. Frasheri, B. Miloradović, L. Esterle, and A. V. Papadopoulos, “GLocal: A hybrid approach to the multi-agent mission re-planning problem,” in 2023 IEEE Symposium Series on Computational Intelligence (SSCI), 2023, pp. 1696–1703.
- J. Chen, X. Qing, F. Ye, K. Xiao, K. You, and Q. Sun, “Consensus-based bundle algorithm with local replanning for heterogeneous multi-uav system in the time-sensitive and dynamic environment,” The Journal of Supercomputing, vol. 78, no. 2, pp. 1712–1740, 2022.
- M. Otte, M. J. Kuhlman, and D. Sofge, “Auctions for multi-robot task allocation in communication limited environments,” Autonomous Robots, vol. 44, no. 3, pp. 547–584, 2020.
- Y. Gao, Y. Wang, X. Zhong, T. Yang, M. Wang, Z. Xu, Y. Wang, Y. Lin, C. Xu, and F. Gao, “Meeting-merging-mission: A multi-robot coordinate framework for large-scale communication-limited exploration,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 13 700–13 707.
- S. Al-Hussaini, J. M. Gregory, and S. K. Gupta, “Generation of context-dependent policies for robot rescue decision-making in multi-robot teams,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 4317–4324.
- T. Bolander, L. Dissing, and N. Herrmann, “Del-based epistemic planning for human-robot collaboration: Theory and implementation,” in Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, vol. 18, no. 1, 2021, pp. 120–129.
- B. Maubert, S. Pinchinat, F. Schwarzentruber, and S. Stranieri, “Concurrent games in dynamic epistemic logic,” in Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2021, pp. 1877–1883.
- D. E. Knuth, “Backus normal form vs. backus naur form,” Communications of the ACM, vol. 7, no. 12, pp. 735–736, 1964.
- R. Necula, M. Raschip, and M. Breaban, “Balancing the subtours for multiple tsp approached with acs: Clustering-based approaches vs. minmax formulation,” in EVOLVE-A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation VI. Springer, 2018, pp. 210–223.
- L. D. Whitley, T. Starkweather, and D. Fuquay, “Scheduling problems and traveling salesmen: The genetic edge recombination operator,” in ICGA, vol. 89, 1989, pp. 133–40.
- M. Jünger, G. Reinelt, and G. Rinaldi, “The traveling salesman problem,” Handbooks in operations research and management science, vol. 7, pp. 225–330, 1995.
- S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations research, vol. 21, no. 2, pp. 498–516, 1973.
- P. Mazdin and B. Rinner, “Distributed and communication-aware coalition formation and task assignment in multi-robot systems,” IEEE Access, vol. 9, pp. 35 088–35 100, 2021.
- L. Kocsis and C. Szepesvári, “Bandit based monte-carlo planning,” in European conference on machine learning. Springer, 2006, pp. 282–293.
- S. B. Stancliff, J. Dolan, and A. Trebi-Ollennu, “Planning to fail—reliability needs to be considered a priori in multirobot task allocation,” in 2009 IEEE International Conference on Systems, Man and Cybernetics. IEEE, 2009, pp. 2362–2367.