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 "revisiting the asymptotic optimality of rrt"):
  Abstract: RRT* is one of the most widely used sampling-based algorithms for asymptotically-optimal motion planning. This algorithm laid the foundations for optimality in motion planning as a whole, and inspired the development of numerous new algorithms in the field, many of which build upon RRT* itself. In this paper, we first identify a logical gap in the optimality proof of RRT*, which was developed in Karaman and Frazzoli (2011). Then, we present an alternative and mathematically-rigorous proof for asymptotic optimality. Our proof suggests that the connection radius used by RRT* should be increased from $\gamma \left(\frac{\log n}{n}\right)^{1/d}$ to $\gamma' \left(\frac{\log n}{n}\right)^{1/(d+1)}$ in order to account for the additional dimension of time that dictates the samples' ordering. Here $\gamma$, $\gamma'$, are constants, and $n$, $d$, are the number of samples and the dimension of the problem, respectively.

Includes members:
  Member "probabilistic completeness of rrt for geometric and kinodynamic planning with forward propagation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "refined analysis of asymptotically optimal kinodynamic planning in the state cost space")
  Member "the critical radius in sampling based motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sample complexity of probabilistic roadmaps via e nets")
  Member "informed rrt optimal sampling based path planning focused via direct sampling of an admissible ellipsoidal heuristic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "posterior sampling for anytime motion planning on graphs with expensive to evaluate edges")
  Member "incremental sampling based algorithm for minimum violation motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "liability ethics and culture aware behavior specification using rulebooks")
  Member "kinodynamic rrt optimal motion planning for systems with linear differential constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "data driven policy transfer with imprecise perception simulation")
  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)