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 new approach to time optimal path parameterization based on reachability analysis"
  Abstract: Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solving small Linear Programs (LPs). The resulting algorithm is faster than NI-based methods and as robust as CO-based ones (100% success rate), as confirmed by extensive numerical evaluations. Moreover, the proposed approach offers unique additional benefits: Admissible Velocity Propagation and robustness to parametric uncertainty can be derived from it in a simple and natural way.

Connected through hyperedge HE-1 (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"
    - "topomap topological mapping and navigation based on visual slam maps"
    - "a convex optimization approach to smooth trajectories for motion planning with car like robots"

Connected through hyperedge HE-2 (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 general fast and robust implementation of the time optimal path parameterization algorithm"

Connected through hyperedge HE-3 (induced by source paper "asymptotic optimality of a time optimal path parametrization algorithm"):
  with members:
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

Connected through hyperedge HE-4 (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"
    - "step timing adjustment a step toward generating robust gaits"
    - "multi contact walking pattern generation based on model preview control of 3d com accelerations"
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

Connected through hyperedge HE-5 (induced by source paper "critically fast pick and place with suction cups"):
  with members:
    - "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"
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

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

Connected through hyperedge HE-7 (induced by source paper "time optimal path tracking online scaling with guarantees"):
  with members:
    - "implementation of nonlinear model predictive path following control for an industrial robot"
    - "nonlinear model predictive control for constrained output path following"
    - "a general fast and robust implementation of the time optimal path parameterization algorithm"

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)