decompose the mission into sub-goals and to decide which UAV should execute which
subgoal (ie task). In an application domain, there are sixty-eight fixed locations, which are to
be inspected by four UAVs after traveling through the minimum time. An ant colony algorithm
(ACO) is used for path planning, and greedy algorithm is used for task allocation.