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: "a general fast and robust implementation of the time optimal path parameterization algorithm"
  Abstract: Finding the time-optimal parameterization of a given path subject to kinodynamic constraints is an essential component in many robotic theories and applications. The objective of this paper is to provide a general, fast, and robust implementation of this component. For this, we give a complete solution to the issue of dynamic singularities, which are the main cause of failure in existing implementations. We then present an open-source implementation of the algorithm in C++/Python and demonstrate its robustness and speed in various robotics settings.

Connected through hyperedge HE-1 (induced by source paper "gomp grasp optimized motion planning for bin picking"):
  with members:
    - "generating grasp poses for a high dof gripper using neural networks"
    - "manipulation trajectory optimization with online grasp synthesis and selection"
    - "6 dof grasping for target driven object manipulation in clutter"
    - "a billion ways to grasp an evaluation of grasp sampling schemes on a dense physics based grasp data set"
    - "6 dof graspnet variational grasp generation for object manipulation"
    - "qt opt scalable deep reinforcement learning for vision based robotic manipulation"
    - "using simulation and domain adaptation to improve efficiency of deep robotic grasping"
    - "grasp pose detection in point clouds"

Connected through hyperedge HE-2 (induced by source paper "teach repeat replan a complete and robust system for aggressive flight in complex environments"):
  with members:
    - "robust and efficient quadrotor trajectory generation for fast autonomous flight"
    - "fiesta fast incremental euclidean distance fields for online motion planning of aerial robots"
    - "real time scalable dense surfel mapping"
    - "visual inertial teach and repeat for aerial inspection"
    - "a complete system for vision based micro aerial vehicle mapping planning and flight in cluttered environments"
    - "vins mono a robust and versatile monocular visual inertial state estimator"
    - "a new approach to time optimal path parameterization based on reachability analysis"
    - "topomap topological mapping and navigation based on visual slam maps"

Connected through hyperedge HE-3 (induced by source paper "time optimal path tracking for industrial robots a dynamic model free reinforcement learning approach"):
  with members:
    - "deep reinforcement learning for time optimal velocity control using prior knowledge"
    - "deep reinforcement learning for high precision assembly tasks"
    - "essential properties of numerical integration for time optimal path constrained trajectory planning"
    - "a new approach to time optimal path parameterization based on reachability analysis"

Connected through hyperedge HE-4 (induced by source paper "inducing multi convexity in path constrained trajectory optimization for mobile manipulators"):
  with members:
    - "combining method of alternating projections and augmented lagrangian for task constrained trajectory optimization"
    - "efficient kinematic planning for mobile manipulators with non holonomic constraints using optimal control"

Connected through hyperedge HE-5 (induced by source paper "asymptotic optimality of a time optimal path parametrization algorithm"):
  with members:
    - "a new approach to time optimal path parameterization based on reachability analysis"

Connected through hyperedge HE-6 (induced by source paper "capturability based analysis optimization and control of 3d bipedal walking"):
  with members:
    - "walking stabilization using step timing and location adjustment on the humanoid robot atlas"
    - "a new approach to time optimal path parameterization based on reachability analysis"
    - "step timing adjustment a step toward generating robust gaits"
    - "multi contact walking pattern generation based on model preview control of 3d com accelerations"

Connected through hyperedge HE-7 (induced by source paper "critically fast pick and place with suction cups"):
  with members:
    - "a new approach to time optimal path parameterization based on reachability analysis"
    - "cartman the low cost cartesian manipulator that won the amazon robotics challenge"
    - "analysis and observations from the first amazon picking challenge"
    - "stability of surface contacts for humanoid robots closed form formulae of the contact wrench cone for rectangular support areas"

Connected through hyperedge HE-8 (induced by source paper "combining method of alternating projections and augmented lagrangian for task constrained trajectory optimization"):
  with members:
    - "kinodynamic planning on constraint manifolds"

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)