human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "efficient multi robot coverage of a known environment"
  Abstract: This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heuristics for solving the multi-robot coverage problem. The first solution presented is a direct extension of an efficient single robot area coverage algorithm, based on an exact cellular decomposition. The second algorithm is a greedy approach that divides the area into equal regions and applies an efficient single-robot coverage algorithm to each region. We present experimental results for two algorithms. Results indicate that our approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.

Connected through hyperedge HE-1 (induced by source paper "a versatile multi robot monte carlo tree search planner for on line coverage path planning"):
  with members:
    - "an approach to autonomous science by modeling geological knowledge in a bayesian framework"
    - "mastering chess and shogi by self play with a general reinforcement learning algorithm"
    - "discrete partitioning and coverage control for gossiping robots"

Connected through hyperedge HE-2 (induced by source paper "riverine coverage with an autonomous surface vehicle over known environments"):
  with members:
    - "multi robot dubins coverage with autonomous surface vehicles"
    - "an autonomous surface vehicle for long term operations"
    - "external force field modeling for autonomous surface vehicles"
    - "efficient informative sensing using multiple robots"

Connected through hyperedge HE-3 (induced by source paper "meander based river coverage by an autonomous surface vehicle"):
  with members:
    - "riverine coverage with an autonomous surface vehicle over known environments"
    - "an autonomous surface vehicle for long term operations"
    - "external force field modeling for autonomous surface vehicles"

Connected through hyperedge HE-4 (induced by source paper "constrained heterogeneous vehicle path planning for large area coverage"):
  with members:
    - "heterogeneous vehicles routing for water canal damage assessment"
    - "multi robot dubins coverage with autonomous surface vehicles"
    - "cooperative planning for fuel constrained aerial vehicles and ground based refueling vehicles for large scale coverage"

Connected through hyperedge HE-5 (induced by source paper "care cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures"):
  with members:
    - "multi robot dubins coverage with autonomous surface vehicles"
    - "fast damage recovery in robotics with the t resilience algorithm"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.RO(Robotics)