Collision Free Navigation of a Multi-Robot Team for Intruder Interception
Ali Marzoughi

TL;DR
This paper presents a comprehensive decentralized multi-robot navigation framework for intruder interception, obstacle avoidance, and energy-efficient movement, validated through mathematical proofs and computer simulations.
Contribution
It introduces novel decentralized algorithms for multi-robot interception, collision avoidance, and energy-efficient navigation in complex environments.
Findings
Proven conditions for successful intruder interception.
Robust collision-free navigation in cluttered environments.
Effective virtual force-based navigation for moving obstacles.
Abstract
In this report, we propose a decentralised motion control algorithm for the mobile robots to intercept an intruder entering (k-intercepting) or escaping (e-intercepting) a protected region. In continuation, we propose a decentralized navigation strategy (dynamic-intercepting) for a multi-robot team known as predators to intercept the intruders or in the other words, preys, from escaping a siege ring which is created by the predators. A necessary and sufficient condition for the existence of a solution of this problem is obtained. Furthermore, we propose an intelligent game-based decision-making algorithm (IGD) for a fleet of mobile robots to maximize the probability of detection in a bounded region. We prove that the proposed decentralised cooperative and non-cooperative game-based decision-making algorithm enables each robot to make the best decision to choose the shortest path with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Guidance and Control Systems · Distributed Control Multi-Agent Systems
