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: "harnessing reinforcement learning for neural motion planning"
  Abstract: Motion planning is an essential component in most of today's robotic applications. In this work, we consider the learning setting, where a set of solved motion planning problems is used to improve the efficiency of motion planning on different, yet similar problems. This setting is important in applications with rapidly changing environments such as in e-commerce, among others. We investigate a general deep learning based approach, where a neural network is trained to map an image of the domain, the current robot state, and a goal robot state to the next robot state in the plan. We focus on the learning algorithm, and compare supervised learning methods with reinforcement learning (RL) algorithms. We first establish that supervised learning approaches are inferior in their accuracy due to insufficient data on the boundary of the obstacles, an issue that RL methods mitigate by actively exploring the domain. We then propose a modification of the popular DDPG RL algorithm that is tailored to motion planning domains, by exploiting the known model in the problem and the set of solved plans in the data. We show that our algorithm, dubbed DDPG-MP, significantly improves the accuracy of the learned motion planning policy. Finally, we show that given enough training data, our method can plan significantly faster on novel domains than off-the-shelf sampling based motion planners. Results of our experiments are shown in this https URL.

Connected through hyperedge HE-1 (induced by source paper "accelerating reinforcement learning for reaching using continuous curriculum learning"):
  with members:
    - "interactive open ended object affordance and grasp learning for robotic manipulation"
    - "accuracy based curriculum learning in deep reinforcement learning"
    - "deep learning using rectified linear units relu"
    - "multi goal reinforcement learning challenging robotics environments and request for research"
    - "benchmarking reinforcement learning algorithms on real world robots"
    - "hindsight experience replay"
    - "overcoming exploration in reinforcement learning with demonstrations"
    - "optlayer practical constrained optimization for deep reinforcement learning in the real world"

Connected through hyperedge HE-2 (induced by source paper "sub goal trees a framework for goal based reinforcement learning"):
  with members:
    - "auto conditioned recurrent mixture density networks for complex trajectory generation"
    - "qt opt scalable deep reinforcement learning for vision based robotic manipulation"
    - "motion planning networks"
    - "floyd warshall reinforcement learning learning from past experiences to reach new goals"
    - "hindsight experience replay"
    - "prediction and control with temporal segment models"
    - "proximal policy optimization algorithms"
    - "deep reinforcement learning for robotic manipulation with asynchronous off policy updates"

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)