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: "optimal multi robot path planning on graphs structure and computational complexity"
  Abstract: We study the problem of optimal multi-robot path planning on graphs (MPP) over four distinct minimization objectives: the total arrival time, the makespan (last arrival time), the total distance, and the maximum (single-robot traveled) distance. On the structure side, we show that each pair of these four objectives induces a Pareto front and cannot always be optimized simultaneously. Then, through reductions from 3-SAT, we further establish that computation over each objective is an NP-hard task, providing evidence that solving MPP optimally is generally intractable. Nevertheless, in a related paper, we design complete algorithms and efficient heuristics for optimizing all four objectives, capable of solving MPP optimally or near-optimally for hundreds of robots in challenging setups.

Connected through hyperedge HE-1 (induced by source paper "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs"):
  with members:
    - "the starcraft multi agent challenge"
    - "sear a polynomial time multi robot path planning algorithm with expected constant factor optimality guarantee"
    - "average case constant factor time and distance optimal multi robot path planning in well connected environments"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "pebble motion on graphs with rotations efficient feasibility tests and planning algorithms"

Connected through hyperedge HE-2 (induced by source paper "multi agent path finding with continuous time viewed through satisfiability modulo theories smt"):
  with members:
    - "multi agent pathfinding mapf with continuous time"
    - "multi agent path finding with deadlines"
    - "overview generalizations of multi agent path finding to real world scenarios"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-3 (induced by source paper "finding optimal solutions to token swapping by conflict based search and reduction to sat"):
  with members:
    - "optimal target assignment and path finding for teams of agents"
    - "the time complexity of the token swapping problem and its parallel variants"
    - "complexity of token swapping and its variants"
    - "planning optimal paths for multiple robots on graphs"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-4 (induced by source paper "lazy modeling of variants of token swapping problem and multi agent path finding through combination of satisfiability modulo theories and conflict based search"):
  with members:
    - "the time complexity of the token swapping problem and its parallel variants"
    - "planning optimal paths for multiple robots on graphs"
    - "exploiting subgraph structure in multi robot path planning"

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)