human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "motion planning networks bridging the gap between learning based and classical motion planners"):
  Abstract: This paper describes Motion Planning Networks (MPNet), a computationally efficient, learning-based neural planner for solving motion planning problems. MPNet uses neural networks to learn general near-optimal heuristics for path planning in seen and unseen environments. It receives environment information as point-clouds, as well as a robot's initial and desired goal configurations and recursively calls itself to bidirectionally generate connectable paths. In addition to finding directly connectable and near-optimal paths in a single pass, we show that worst-case theoretical guarantees can be proven if we merge this neural network strategy with classical sample-based planners in a hybrid approach while still retaining significant computational and optimality improvements. To learn the MPNet models, we present an active continual learning approach that enables MPNet to learn from streaming data and actively ask for expert demonstrations when needed, drastically reducing data for training. We validate MPNet against gold-standard and state-of-the-art planning methods in a variety of problems from 2D to 7D robot configuration spaces in challenging and cluttered environments, with results showing significant and consistently stronger performance metrics, and motivating neural planning in general as a modern strategy for solving motion planning problems efficiently.

Includes members:
  Member "neural path planning fixed time near optimal path generation via oracle imitation":
    also connected through other hyperedges:
      (none)
  Member "composing task agnostic policies with deep reinforcement learning":
    also connected through other hyperedges:
      (none)
  Member "composing ensembles of policies with deep reinforcement learning":
    also connected through other hyperedges:
      (none)
  Member "robot motion planning in learned latent spaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probably approximately correct vision based planning using motion primitives")
  Member "universal planning networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")
  Member "data efficient deep reinforcement learning for dexterous manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning precise 3d manipulation from multiple uncalibrated cameras")
  Member "adversarial imitation via variational inverse reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficiently guiding imitation learning algorithms with human gaze")
  Member "experience replay for continual learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")

Question: Please tell me which class the source paper 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)