A Chimpanzee Troop-Inspired Algorithm for Multiple Unmanned Aerial Vehicles on Patrolling Missions

Persistent patrolling with multiple Unmanned Aerial Vehicles (UAVs) remains challenging due to dynamic surveillance priorities, heterogeneous node importance, and evolving operational constraints. We present the novel Chimpanzee Troop Algorithm for Patrolling (CTAP), a decentralized policy inspired by chimpanzees fission–fusion dynamics and territorial behavior. CTAP provides three capabilities: (i) on-the-fly patrol-group instantiation, (ii) importance-aware territorial partitioning of the patrol graph, and (iii) adaptive boundary expansion via a lightweight shared-memory overlay that coordinates neighboring groups without centralization. Unlike the Ant Colony Optimization (ACO), Heuristic Pathfinder Conscientious Cognitive (HPCC), Recurrent LSTM Path-Maker (RLPM), State-Exchange Bayesian Strategy (SEBS), and Dynamic Task Assignment via Auctions (DTAP) baselines, CTAP couples local-idleness reduction with controlled edge-exploration, yielding stable coverage under shifting demand. We evaluate these approaches across multiple maps and fleet sizes using the average weighted idleness, global worst-weighted idleness, and Time-Normalized Idleness metrics. CTAP reduces the average weighted idleness by 7% to 22% and the global worst-weighted idleness by 30–65% relative to the strongest competitor and attains the lowest Time-Normalized Idleness in every configuration. These results show that a simple, communication-limited, partition-based policy enables robust, scalable patrolling suitable for resource-constrained UAV teams in smart-city environments.