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 "efficient sampling based bottleneck pathfinding over cost maps"):
  Abstract: We introduce a simple yet effective sampling-based planner that is tailored for bottleneck pathfinding: Given an implicitly-defined cost map $\mathcal{M}:\mathbb{R}^d\rightarrow \mathbb{R}$, which assigns to every point in space a real value, we wish to find a path connecting two given points, that minimizes the maximal value with respect to~$\mathcal{M}$. We demonstrate the capabilities of our algorithm, which we call bottleneck tree (BTT), on several challenging instances of the problem involving multiple agents, where it outperforms the state-of-the-art cost-map planning technique T-RRT*. On the theoretical side, we study the asymptotic properties of our method and consider the special setting where the computed trajectories must be monotone in all coordinates. This constraint arises in cases where the problem involves the coordination of multiple agents that are restricted to forward motions along predefined paths.

Includes members:
  Member "an efficient algorithm for computing high quality paths amid polygonal obstacles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometric secluded paths and planar satisfiability")
  Member "new perspective on sampling based motion planning via random geometric graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sample complexity of probabilistic roadmaps via e nets")
  Member "sampling based bottleneck pathfinding with applications to frechet matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "refined analysis of asymptotically optimal kinodynamic planning in the state cost space")
  Member "time optimal coordination of mobile robots along specified paths":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analytically modeling unmanaged intersections with microscopic vehicle interactions")
  Member "on the complexity of an unregulated traffic crossing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time optimal coordination of mobile robots along specified paths")
  Member "motion planning for unlabeled discs with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "on the hardness of unlabeled multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "efficient high quality motion planning by fast all pairs r nearest neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "batch informed trees bit informed asymptotically optimal anytime search")

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)