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: "time optimal coordination of mobile robots along specified paths"
  Abstract: In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel approach based on time discretization that leads to a mixed-integer linear programming (MILP) formulation. This problem can be solved using general-purpose MILP solvers in a reasonable time, resulting in a resolution-optimal solution. Moreover, unlike previous work found in the literature, our formulation allows an exact linear modeling (up to the discretization resolution) of second-order dynamic constraints. Extensive simulations are performed to demonstrate the effectiveness of our approach.

Connected through hyperedge HE-1 (induced by source paper "analytically modeling unmanaged intersections with microscopic vehicle interactions"):
  with members:
    - "analyzing traffic delay at unmanaged intersections"

Connected through hyperedge HE-2 (induced by source paper "efficient sampling based bottleneck pathfinding over cost maps"):
  with members:
    - "an efficient algorithm for computing high quality paths amid polygonal obstacles"
    - "new perspective on sampling based motion planning via random geometric graphs"
    - "sampling based bottleneck pathfinding with applications to frechet matching"
    - "on the complexity of an unregulated traffic crossing"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "efficient high quality motion planning by fast all pairs r nearest neighbors"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"

Connected through hyperedge HE-3 (induced by source paper "scheduling autonomous vehicle platoons through an unregulated intersection"):
  with members:
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

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)