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 with temporal logic constraints"
  Abstract: In this paper we present a method for automatically planning optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system. The mission is given as a Linear Temporal Logic formula. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition. Our method is guaranteed to compute an optimal set of robot paths. We utilize a timed automaton representation in order to capture the relative position of the robots in the environment. We then obtain a bisimulation of this timed automaton as a finite transition system that captures the joint behavior of the robots and apply our earlier algorithm for the single robot case to optimize the group motion. We present a simulation of a persistent monitoring task in a road network environment.

Connected through hyperedge HE-1 (induced by source paper "specification patterns for robotic missions"):
  with members:
    - "formal specification and verification of autonomous robotic systems a survey"
    - "extended ltlvis motion planning interface"
    - "synthesizing a lego forklift controller in gr 1 a case study"
    - "a requirements modeling language for the component behavior of cyber physical robotics systems"
    - "events in linear time properties"

Connected through hyperedge HE-2 (induced by source paper "cooperative planning for coupled multi agent systems under timed temporal specifications"):
  with members:
    - "timed automata approach for motion planning using metric interval temporal logic"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "optimal mission planner with timed temporal logic constraints"
    - "cooperative task planning of multi agent systems under timed temporal specifications"
    - "robust connectivity analysis for multi agent systems"
    - "computational methods for stochastic control with metric interval temporal logic specifications"
    - "time constrained temporal logic control of multi affine systems"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-3 (induced by source paper "cooperative task planning of multi agent systems under timed temporal specifications"):
  with members:
    - "optimal mission planner with timed temporal logic constraints"
    - "on mitl and alternating timed automata"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-4 (induced by source paper "on the minimal revision problem of specification automata"):
  with members:
    - "revision of specification automata under quantitative preferences"
    - "negotiating the probabilistic satisfaction of temporal logic motion specifications"
    - "minimum violation ltl planning with conflicting specifications"
    - "robust multi robot optimal path planning with temporal logic constraints"

Connected through hyperedge HE-5 (induced by source paper "measuring global similarity between texts"):
  with members:
    - "network detection theory and performance"
    - "bayesian discovery of threat networks"
    - "robust multi robot optimal path planning with temporal logic constraints"

Connected through hyperedge HE-6 (induced by source paper "revision of specification automata under quantitative preferences"):
  with members:
    - "robust multi robot optimal path planning with temporal logic constraints"

Connected through hyperedge HE-7 (induced by source paper "optimal multi robot path planning with ltl constraints guaranteeing correctness through synchronization"):
  with members:
    - "robust multi robot optimal path planning with temporal logic constraints"
    - "mdp optimal control under temporal logic constraints"

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)