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 explorer visualizing local minima using a local minima tree"):
  Abstract: Motion planning problems often have many local minima. Those minima are important to visualize to let a user guide, prevent or predict motions. Towards this goal, we develop the motion planning explorer, an algorithm to let users interactively explore a tree of local-minima. Following ideas from Morse theory, we define local minima as paths invariant under minimization of a cost functional. The local-minima are grouped into a local-minima tree using lower-dimensional projections specified by a user. The user can then interactively explore the local-minima tree, thereby visualizing the problem structure and guide or prevent motions. We show the motion planning explorer to faithfully capture local minima in four realistic scenarios, both for holonomic and certain non-holonomic robots.

Includes members:
  Member "rapidly exploring quotient space trees motion planning using sequential simplifications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "visualizing local minima in multi robot motion planning using morse theory")
  Member "motion planning in irreducible path spaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rapidly exploring quotient space trees motion planning using sequential simplifications")
  Member "quotient space motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "walking posture adaptation for legged robot navigation in confined spaces")
  Member "path homotopy invariants and their application to optimal trajectory planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "visualizing local minima in multi robot motion planning using morse theory")
  Member "asymptotically optimal sampling based kinodynamic planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "experimental comparison of global motion planning algorithms for wheeled mobile robots")
  Member "sampling based algorithms for optimal motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "3d dynamic scene graphs actionable spatial perception with places objects and humans")

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)