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: "planning optimal paths for multiple robots on graphs"
  Abstract: In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs. We propose two multiflow based integer linear programming (ILP) models that computes minimum last arrival time and minimum total distance solutions for our MPP formulation, respectively. The resulting algorithms from these ILP models are complete and guaranteed to yield true optimal solutions. In addition, our flexible framework can easily accommodate other variants of the MPP problem. Focusing on the time optimal algorithm, we evaluate its performance, both as a stand alone algorithm and as a generic heuristic for quickly solving large problem instances. Computational results confirm the effectiveness of our method.

Connected through hyperedge HE-1 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning"):
  with members:
    - "scalable asymptotically optimal multi robot motion planning"
    - "effective metrics for multi robot motion planning"
    - "batch informed trees bit sampling based optimal planning via the heuristically guided search of implicit random geometric graphs"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "optimal sampling based motion planning under differential constraints the drift case with linear affine dynamics"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"

Connected through hyperedge HE-2 (induced by source paper "idle time optimization for target assignment and path finding in sortation centers"):
  with members:
    - "multi agent pathfinding definitions variants and benchmarks"
    - "searching with consistent prioritization for multi agent path finding"
    - "lifelong path planning with kinematic constraints for multi agent pickup and delivery"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "ai buzzwords explained multi agent path finding mapf"
    - "optimal target assignment and path finding for teams of agents"
    - "multi agent path planning and network flow"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-3 (induced by source paper "automatic algorithm selection in multi agent pathfinding"):
  with members:
    - "multi agent path finding with deadlines preliminary results"
    - "matconvnet convolutional neural networks for matlab"
    - "algorithm selection for combinatorial search problems a survey"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-4 (induced by source paper "x anytime multi agent path finding for sparse domains using iterative repairs"):
  with members:
    - "sampling based algorithms for optimal motion planning"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-5 (induced by source paper "multi agent path finding with deadlines preliminary results"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "overview generalizations of multi agent path finding to real world scenarios"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "optimal target assignment and path finding for teams of agents"
    - "multi agent path finding with delay probabilities"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-6 (induced by source paper "searching with consistent prioritization for multi agent path finding"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "overview generalizations of multi agent path finding to real world scenarios"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "complete decentralized method for on line multi robot trajectory planning in valid infrastructures"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-7 (induced by source paper "multi agent path finding with deadlines"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "overview generalizations of multi agent path finding to real world scenarios"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "optimal target assignment and path finding for teams of agents"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-8 (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"
    - "optimal multi robot path planning on graphs structure and computational complexity"
    - "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)