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: "nonlinear model predictive control for constrained output path following"
  Abstract: We consider the tracking of geometric paths in output spaces of nonlinear systems subject to input and state constraints without pre-specified timing requirements, commonly referred to as constrained output path-following problems. Specifically, we propose a predictive control approach to constrained path-following problems with and without velocity assignments. We present sufficient convergence conditions based on terminal regions and end penalties. Furthermore, we analyze the geometric nature of constrained output path-following problems and thereby provide insight into the computation of suitable terminal control laws and terminal regions. We draw upon an example from robotics to illustrate our findings.

Connected through hyperedge HE-1 (induced by source paper "on sensing aware model predictive path following control for a reversing general 2 trailer with a car like tractor"):
  with members:
    - "a path planning and path following control framework for a general 2 trailer with a car like tractor"
    - "a survey of motion planning and control techniques for self driving urban vehicles"

Connected through hyperedge HE-2 (induced by source paper "an nmpc approach using convex inner approximations for online motion planning with guaranteed collision freedom"):
  with members:
    - "fastrack a modular framework for fast and guaranteed safe motion planning"
    - "a convex optimization approach to smooth trajectories for motion planning with car like robots"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-3 (induced by source paper "time optimal path tracking via reachability analysis"):
  with members:
    - "a new approach to time optimal path parameterization based on reachability analysis"
    - "implementation of nonlinear model predictive path following control for an industrial robot"
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

Connected through hyperedge HE-4 (induced by source paper "time optimal path tracking online scaling with guarantees"):
  with members:
    - "a new approach to time optimal path parameterization based on reachability analysis"
    - "implementation of nonlinear model predictive path following control for an industrial robot"
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

Connected through hyperedge HE-5 (induced by source paper "on model predictive path following and trajectory tracking for industrial robots"):
  with members:
    - "implementation of nonlinear model predictive path following control for an industrial robot"

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)