Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents

arXiv:2610.11955v1 Announce Type: new Abstract: We study a problem of searching for a mobile target in an $m$-ray star graph, a natural generalization of linear search to multiple directions. The target is placed adversarially on one of the rays and may move with constant speed. We investigate a two-robot setting, where cooperation and communication play a central role. We study two communication models: the Face-to-Face (F2F) model, where robots communicate only upon meeting, and the Sender-Receiver (S/R) model, where communication is asymmetric. We focus on the {\em away model}, in which the target moves {\em away} from the origin with speed $v