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: "memoryless control design for persistent surveillance under safety constraints"
  Abstract: This paper deals with the design of time-invariant memoryless control policies for robots that move in a finite two- dimensional lattice and are tasked with persistent surveillance of an area in which there are forbidden regions. We model each robot as a controlled Markov chain whose state comprises its position in the lattice and the direction of motion. The goal is to find the minimum number of robots and an associated time-invariant memoryless control policy that guarantees that the largest number of states are persistently surveilled without ever visiting a forbidden state. We propose a design method that relies on a finitely parametrized convex program inspired by entropy maximization principles. Numerical examples are provided.

Connected through hyperedge HE-1 (induced by source paper "correlated orienteering problem and it application to persistent monitoring tasks"):
  with members:
    - "persistent monitoring of events with stochastic arrivals at multiple stations"
    - "persistent monitoring in discrete environments minimizing the maximum weighted latency between observations"
    - "persistent robotic tasks monitoring and sweeping in changing environments"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-2 (induced by source paper "persistent monitoring of events with stochastic arrivals at multiple stations"):
  with members:
    - "persistent monitoring in discrete environments minimizing the maximum weighted latency between observations"
    - "persistent robotic tasks monitoring and sweeping in changing environments"
    - "adaptive and distributed algorithms for vehicle routing in a stochastic and dynamic environment"

Connected through hyperedge HE-3 (induced by source paper "persistent monitoring in discrete environments minimizing the maximum weighted latency between observations"):
  with members:
    - "persistent robotic tasks monitoring and sweeping in changing environments"
    - "an optimal control approach for the persistent monitoring problem"
    - "capacitated vehicle routing with non uniform speeds"

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.SY(Systems and Control)