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: "scalable integrated task and motion planning from signal temporal logic specifications"
  Abstract: This paper aims to develop formal methods to achieve a performance guaranteed integrated task and motion planning (ITMP) with respect to high-level specifications given by signal temporal logic (STL). It is a problem of practical importance because many safety-critical applications in robotics (e.g., navigation, manipulation, and surgery) and autonomous systems (e.g., unmanned aircraft and self-driving cars) require a correct-by-construction design for complex missions. Traditional approaches usually assumed a discretization of the continuous state space or a finite partition of the workspace. Instead, we propose an abstraction-free method that synthesis continuous trajectories with respect to given STL specifications directly. For this, our basic idea is to leverage incremental constraint solving by efficiently adding constraints on motion feasibility at the discrete level. Our approach solves the ITMP from STL specification problem using a scalable logic-based inference combined with optimization, which uses efficient solvers, i.e., satisfiability modulo theories (SMT) and linear programming (LP). Consequently, our method has potential to scale up to handle high dimensional continuous dynamics. The proposed design algorithms are proved to be sound and complete, and numerical results are given to illustrate the effectiveness of the design algorithms.

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)