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 mission planner with timed temporal logic constraints"
  Abstract: In this paper, we present an optimization based method for path planning of a mobile robot subject to time bounded temporal constraints, in a dynamic environment. Temporal logic (TL) can address very complex task specification such as safety, coverage, motion sequencing etc. We use metric temporal logic (MTL) to encode the task specifications with timing constraints. We then translate the MTL formulae into mixed integer linear constraints and solve the associated optimization problem using a mixed integer linear program solver. This approach is different from the automata based methods which generate a finite abstraction of the environment and dynamics, and use an automata theoretic approach to formally generate a path that satisfies the TL specifications. We have applied our approach on several case studies in complex dynamical environments subjected to timed temporal specifications.

Connected through hyperedge HE-1 (induced by source paper "fast composable rescue mission planning for uavs using metric temporal logic"):
  with members:
    - "a hybrid compositional approach to optimal mission planning for multi rotor uavs using metric temporal logic"
    - "efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage"
    - "cooperative task planning of multi agent systems under timed temporal specifications"

Connected through hyperedge HE-2 (induced by source paper "a hybrid compositional approach to optimal mission planning for multi rotor uavs using metric temporal logic"):
  with members:
    - "usbot a modular robotic testbed for programmable self assembly"
    - "timed automata approach for motion planning using metric interval temporal logic"
    - "cooperative task planning of multi agent systems under timed temporal specifications"

Connected through hyperedge HE-3 (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"
    - "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"
    - "optimal multi robot path planning with temporal logic constraints"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-4 (induced by source paper "timed automata approach for motion planning using metric interval temporal logic"):
  with members:
    - "optimal path planning under temporal logic constraints"

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

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)