Parallel sensing can shorten multi-UAV mapping missions, yet late-stage exploration remains costly when low-yield frontiers continue to trigger flight, reassignment, and communication. We formulate this problem as pre-allocation candidate regulation under sparse summary sharing and propose \method. Each frontier is represented by an inspectable record containing gain, viewpoint quality, travel cost, and peer-state information. Normalized gain evidence lowers the assignment cost within a fixed cap, and an auxiliary peer-connectivity term penalizes moves that increase the peer-distance burden. The allocator selects the eligible candidate with minimum adjusted cost; if none is available, the UAV retains its current target or receives no new assignment. We evaluate the method in three forest-like 3D simulation scenes using five matched runs per scene. Compared with the dense-communication reference (\dcr), final volume was $0.02\%$ lower, while completion time, flight distance, communication volume, and message count decreased by $12.72\%$, $12.01\%$, $37.54\%$, and $29.61\%$, respectively. Compared with the sparse-sharing baseline (\ssb), final volume was $0.08\%$ lower; completion time, flight distance, and message count decreased by $13.26\%$, $12.85\%$, and $7.32\%$, respectively. Communication volume decreased by $2.53\%$, but its confidence interval crossed zero. Module ablations indicate that gain evidence and reward capping both contribute to the observed regulation behavior. Removing the peer-connectivity term produced no significant paired change, so we treat it as an auxiliary regularizer.