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 "alternating minimization based trajectory generation for quadrotor aggressive flight"):
  Abstract: With much research has been conducted into trajectory planning for quadrotors, planning with spatial and temporal optimal trajectories in real-time is still challenging. In this paper, we propose a framework for generating large-scale piecewise polynomial trajectories for aggressive autonomous flights, with highlights on its superior computational efficiency and simultaneous spatial-temporal optimality. Exploiting the implicitly decoupled structure of the planning problem, we conduct alternating minimization between boundary conditions and time durations of trajectory pieces. In each minimization phase, we leverage the algebraic convenience of the sub-problem to escape poor local minima and achieve the lowest time consumption. Theoretical analysis for the global/local convergence rate of our proposed method is provided. Moreover, based on polynomial theory, an extremely fast feasibility check method is designed for various kinds of constraints. By incorporating the method into our alternating structure, a constrained minimization algorithm is constructed to optimize trajectories on the premise of feasibility. Benchmark evaluation shows that our algorithm outperforms state-of-the-art methods regarding efficiency, optimality, and scalability. Aggressive flight experiments in a limited space with dense obstacles are presented to demonstrate the performance of the proposed algorithm. We release our implementation as an open-source ros-package.

Includes members:
  Member "detailed proofs of alternating minimization based trajectory generation for quadrotor aggressive flight":
    also connected through other hyperedges:
      (none)
  Member "teach repeat replan a complete and robust system for aggressive flight in complex environments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to fly via deep model based reinforcement learning")
  Member "fast uav trajectory optimization using bilevel optimization with analytical gradients":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sl1m sparse l1 norm minimization for contact planning on uneven terrain")
  Member "vins mono a robust and versatile monocular visual inertial state estimator":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep drone racing from simulation to reality with domain randomization")
  Member "a hybrid method for online trajectory planning of mobile robots in cluttered environments":
    also connected through other hyperedges:
      (none)
  Member "computing real roots of real polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "sampling based algorithms for optimal motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "3d dynamic scene graphs actionable spatial perception with places objects and humans")
  Member "univariate polynomial real root isolation continued fractions revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "real root refinements for univariate polynomial equations")

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)