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: "partitioning of the free space time for on road navigation of autonomous ground vehicles"
  Abstract: In this article, we consider the problem of trajectory planning and control for on-road driving of an autonomous ground vehicle (AGV) in presence of static or moving obstacles. We propose a systematic approach to partition the collision-free portion of the space-time into convex sub-regions that can be interpreted in terms of relative positions with respect to a set of fixed or mobile obstacles. We show that this partitioning allows decomposing the NP-hard problem of computing an optimal collision-free trajectory, as a path-finding problem in a well-designed graph followed by a simple (polynomial time) optimization phase for any quadratic convex cost function. Moreover, robustness criteria such as margin of error while executing the trajectory can easily be taken into account at the graph-exploration phase, thus reducing the number of paths to explore.

Connected through hyperedge HE-1 (induced by source paper "synchronous maneuver searching and trajectory planning for autonomous vehicles in dynamic traffic environments"):
  with members:
    - "game theoretic modeling of driver and vehicle interactions for verification and validation of autonomous vehicle control systems"

Connected through hyperedge HE-2 (induced by source paper "from specifications to behavior maneuver verification in a semantic state space"):
  with members:
    - "incremental sampling based algorithm for minimum violation motion planning"

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)