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: "robust multi robot optimal path planning with temporal logic constraints"
  Abstract: In this paper we present a method for automatically planning robust 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, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied even with uncertainty in the robots' traveling times. We characterize a class of LTL formulas that are robust to robot timing errors, for which we generate optimal paths if no timing errors are present, and we present bounds on the deviation from the optimal values in the presence of errors. We implement and experimentally evaluate our method considering a persistent monitoring task in a road network environment.

Connected through hyperedge HE-1 (induced by source paper "multirobot coordination with counting temporal logics"):
  with members:
    - "census signal temporal logic inference for multiagent group behavior analysis"
    - "control of magnetic microrobot teams for temporal micromanipulation tasks"
    - "control synthesis for permutation symmetric high dimensional systems with counting constraints"
    - "the robotarium a remotely accessible swarm robotics research testbed"
    - "linear encodings of bounded ltl model checking"

Connected through hyperedge HE-2 (induced by source paper "event triggered controller synthesis for dynamical systems with temporal logic constraints"):
  with members:
    - "the complexity of temporal logic over the reals"

Connected through hyperedge HE-3 (induced by source paper "robotic swarm control from spatio temporal specifications"):
  with members:
    - "robust temporal logic model predictive control"
    - "a formal methods approach to pattern synthesis in reaction diffusion systems"
    - "on line monitoring for temporal logic robustness"
    - "a receding horizon approach to multi agent planning from local ltl specifications"

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"
    - "optimal multi robot 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"
    - "optimal multi robot path planning with temporal logic constraints"

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

Connected through hyperedge HE-7 (induced by source paper "incremental sampling based algorithm for minimum violation motion planning"):
  with members:
    - "mdp optimal control under temporal logic constraints"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-8 (induced by source paper "optimal multi robot path planning with ltl constraints guaranteeing correctness through synchronization"):
  with members:
    - "mdp optimal control under temporal logic constraints"
    - "optimal multi robot path planning with 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)