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 ltl constraints guaranteeing correctness through synchronization"
  Abstract: In this paper, we consider the automated planning of optimal paths for a robotic team satisfying a high level mission specification. Each robot in the team is modeled as a weighted transition system where the weights have associated deviation values that capture the non-determinism in the traveling times of the robot during its deployment. The mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied at the regions of the environment. Additionally, we have an optimizing proposition capturing some particular task that must be repeatedly completed by the team. The goal is to minimize the maximum time between successive satisfying instances of the optimizing proposition while guaranteeing that the mission is satisfied even under non-deterministic traveling times. Our method relies on the communication capabilities of the robots to guarantee correctness and maintain performance during deployment. After computing a set of optimal satisfying paths for the members of the team, we also compute a set of synchronization sequences for each robot to ensure that the LTL formula is never violated during deployment. 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 "an abstraction free method for multi robot temporal logic optimal control synthesis"):
  with members:
    - "stylus a temporal logic optimal control synthesis algorithm for large scale multi robot systems"
    - "control of magnetic microrobot teams for temporal micromanipulation tasks"
    - "learning sampling distributions for robot motion planning"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "sampling based temporal logic path planning"
    - "sampling based algorithms for optimal motion planning"
    - "synthesis of distributed control and communication schemes from global ltl specifications"
    - "linear encodings of bounded ltl model checking"

Connected through hyperedge HE-2 (induced by source paper "stylus a temporal logic optimal control synthesis algorithm for large scale multi robot systems"):
  with members:
    - "probabilistically safe corridors to guide sampling based motion planning"
    - "monte carlo tree search for efficient visually guided rearrangement planning"
    - "t a heuristic search based algorithm for motion planning with temporal goals"
    - "control of magnetic microrobot teams for temporal micromanipulation tasks"
    - "learning sampling distributions for robot motion planning"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "sampling based temporal logic path planning"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-3 (induced by source paper "control of magnetic microrobot teams for temporal micromanipulation tasks"):
  with members:
    - "sampling based optimal control synthesis for multi robot systems under global temporal tasks"
    - "synthesis of distributed control and communication schemes from global ltl specifications"
    - "optimal path planning 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)